2009 Second International Conference on Computer and Electrical Engineering 2009
DOI: 10.1109/iccee.2009.241
|View full text |Cite
|
Sign up to set email alerts
|

Trust Management for Semantic Web

Abstract: The contemporary Web is heading towards its next stage of evolution. From a clump of unorganized information spaces, the Web is becoming more focused on the meaning of information that is a Semantic Web. Trust is an integral component in semantic web, allowing people to act under uncertainty and with the risk of negative consequences. In this paper we discussed trust management and its connection to the semantic web. We first discussed aspects of semantic web and trust management including defining trust and d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…In the EMAIL network nodes represent Enron email addresses and two addresses are connected if there has been at least one email exchanged between them [22] (36,692 nodes and 183,831 edges). In the TRUST network nodes represent epinions.com members and two members are connected if one trusts the other [41] (75,879 nodes and 405,740 edges). In the SDOT network nodes represent slashdot.org members and two members are connected if they are friends or foes [28] (82,168 nodes and 504, 230 edges).…”
Section: Preferential Attachment Networkmentioning
confidence: 99%
“…In the EMAIL network nodes represent Enron email addresses and two addresses are connected if there has been at least one email exchanged between them [22] (36,692 nodes and 183,831 edges). In the TRUST network nodes represent epinions.com members and two members are connected if one trusts the other [41] (75,879 nodes and 405,740 edges). In the SDOT network nodes represent slashdot.org members and two members are connected if they are friends or foes [28] (82,168 nodes and 504, 230 edges).…”
Section: Preferential Attachment Networkmentioning
confidence: 99%
“…Therefore, the similarity function θ defined above, can be extended to deal with propagation, following a natural interpretation that, as trust, similarity is transitive at least by some extent [23], [25]. This allows to yield an overall tag scoring scheme that depends on the entire network instead of only the user's vicinity.…”
Section: Preliminariesmentioning
confidence: 98%
“…This allows to yield an overall tag scoring scheme that depends on the entire network instead of only the user's vicinity. We infer the similarity value between two users u 1 and u n , connected through a path p = (u 1 , ..., u n ), by multiplying the similarity values observed at each step [25], [23]. In the following, we denote this extended similarity by θ + .…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Fuzzy logic works for degrees of members of different intervals of values. These fuzzy values are combined to reach a single trust value[38]. Fuzzy is categorized into three steps, fuzzification, fuzzy rules, and defuzzification.…”
mentioning
confidence: 99%