Average transitive trustworthy degrees for trustworthy networks

Yixiang Chen; Min Zhang; Hong Zhu; Tianming Bu

doi:10.1007/978-3-642-02962-2_86

Average transitive trustworthy degrees for trustworthy networks

Yixiang Chen, Min Zhang, Hong Zhu, Tianming Bu

Software Engineering Institute

East China Normal University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

The goal of this paper is to investigate measurement models of transitive trustworthiness for trustworthy networks. The reals in the interval [0,1] are used to define trust degrees in such a way that the larger its trust degree and the more it is trustworthy. A basic contribution is to introduce the average algorithm for the measurement of the transitive trustworthiness along a path in a weighted digraph. Due to the NP-hardness of the average algorithm for finding simple paths with the maximal average transitive trust degree, we propose the modified matrix operation to compute maximal average transitive trustworthy degrees of paths. This computation is polynomial, but might produce non-simple paths. A simple simulation is also given.

Original language	English
Title of host publication	Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings
Pages	682-689
Number of pages	8
DOIs	https://doi.org/10.1007/978-3-642-02962-2_86
State	Published - 2009
Event	4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009 - Gold Coast, QLD, Australia Duration: 14 Jul 2009 → 16 Jul 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5589 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
Country/Territory	Australia
City	Gold Coast, QLD
Period	14/07/09 → 16/07/09

Access to Document

10.1007/978-3-642-02962-2_86

Cite this

Chen, Y., Zhang, M., Zhu, H., & Bu, T. (2009). Average transitive trustworthy degrees for trustworthy networks. In Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings (pp. 682-689). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5589 LNAI). https://doi.org/10.1007/978-3-642-02962-2_86

@inproceedings{32f5f56c387646dd8deaba9251d352f2,

title = "Average transitive trustworthy degrees for trustworthy networks",

abstract = "The goal of this paper is to investigate measurement models of transitive trustworthiness for trustworthy networks. The reals in the interval [0,1] are used to define trust degrees in such a way that the larger its trust degree and the more it is trustworthy. A basic contribution is to introduce the average algorithm for the measurement of the transitive trustworthiness along a path in a weighted digraph. Due to the NP-hardness of the average algorithm for finding simple paths with the maximal average transitive trust degree, we propose the modified matrix operation to compute maximal average transitive trustworthy degrees of paths. This computation is polynomial, but might produce non-simple paths. A simple simulation is also given.",

author = "Yixiang Chen and Min Zhang and Hong Zhu and Tianming Bu",

year = "2009",

doi = "10.1007/978-3-642-02962-2\_86",

language = "英语",

isbn = "3642029612",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "682--689",

booktitle = "Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings",

note = "4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009 ; Conference date: 14-07-2009 Through 16-07-2009",

}

Chen, Y, Zhang, M, Zhu, H & Bu, T 2009, Average transitive trustworthy degrees for trustworthy networks. in Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5589 LNAI, pp. 682-689, 4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009, Gold Coast, QLD, Australia, 14/07/09. https://doi.org/10.1007/978-3-642-02962-2_86

Average transitive trustworthy degrees for trustworthy networks. / Chen, Yixiang; Zhang, Min; Zhu, Hong et al.
Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings. 2009. p. 682-689 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5589 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Average transitive trustworthy degrees for trustworthy networks

AU - Chen, Yixiang

AU - Zhang, Min

AU - Zhu, Hong

AU - Bu, Tianming

PY - 2009

Y1 - 2009

N2 - The goal of this paper is to investigate measurement models of transitive trustworthiness for trustworthy networks. The reals in the interval [0,1] are used to define trust degrees in such a way that the larger its trust degree and the more it is trustworthy. A basic contribution is to introduce the average algorithm for the measurement of the transitive trustworthiness along a path in a weighted digraph. Due to the NP-hardness of the average algorithm for finding simple paths with the maximal average transitive trust degree, we propose the modified matrix operation to compute maximal average transitive trustworthy degrees of paths. This computation is polynomial, but might produce non-simple paths. A simple simulation is also given.

AB - The goal of this paper is to investigate measurement models of transitive trustworthiness for trustworthy networks. The reals in the interval [0,1] are used to define trust degrees in such a way that the larger its trust degree and the more it is trustworthy. A basic contribution is to introduce the average algorithm for the measurement of the transitive trustworthiness along a path in a weighted digraph. Due to the NP-hardness of the average algorithm for finding simple paths with the maximal average transitive trust degree, we propose the modified matrix operation to compute maximal average transitive trustworthy degrees of paths. This computation is polynomial, but might produce non-simple paths. A simple simulation is also given.

UR - https://www.scopus.com/pages/publications/69049083597

U2 - 10.1007/978-3-642-02962-2_86

DO - 10.1007/978-3-642-02962-2_86

M3 - 会议稿件

AN - SCOPUS:69049083597

SN - 3642029612

SN - 9783642029615

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 682

EP - 689

BT - Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings

T2 - 4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009

Y2 - 14 July 2009 through 16 July 2009

ER -

Chen Y, Zhang M, Zhu H, Bu T. Average transitive trustworthy degrees for trustworthy networks. In Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings. 2009. p. 682-689. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-02962-2_86

Average transitive trustworthy degrees for trustworthy networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this