Accuracy of Metrics for Inferring Trust and Reputation in Semantic Web-Based Social Networks
Lecture notes in computer sciencePublished 1 January 2004
Jennifer Golbeck, James Hendler
Citations193
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An algorithm for generating locally-calculated reputation ratings from a Semantic Web Social Network is described and results that show the effectiveness of this algorithm to accurately infer the reputation of a node are presented.
Abstract
While most research on the topic of trust on the semantic web has focused largely on digital signatures, certificates, and authentication, more social notions of trust which are reputation-based are starting to gain attention. In this paper, we describe an algorithm for generating locally-calculated reputation ratings from a Semantic Web Social Network. We present mathematical and experimental results that show the effectiveness of this algorithm to accurately infer the reputation of a node. We then describe TrustMail, an application that uses the network for rating email.
Keywords
Social SciencesComputer Science
Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine
15,828 Citations1998Sergey Brin, Lawrence M. Page
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal of the ACMAuthoritative sources in a hyperlinked environment
9,060 Citations1999Jon Kleinberg
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.
NatureDiameter of the World-Wide Web
4,285 Citations1999Réka Albert, Hawoong Jeong +1 more
The World-Wide Web becomes a large directed graph whose vertices are documents and whose edges are links that point from one document to another, which determines the web's connectivity and consequently how effectively the authors can locate information on it.
The Eigentrust algorithm for reputation management in P2P networks
3,353 Citations2003Sepandar Kamvar, Mario Schlösser +1 more
An algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads is described.
Computer NetworksGraph structure in the Web
2,760 Citations2000Andrei Broder, Ravi Kumar +6 more
The study of the web as a graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution.
Choice Reviews OnlineSmall worlds: the dynamics of networks between order and randomness
2,393 Citations2000
Lecture notes in computer scienceTrust Management for the Semantic Web
992 Citations2003Matthew Richardson, Rakesh Agrawal +1 more
A web of trust is employed, in which each user maintains trusts in a small number of other users, and these trusts are composed into trust values for all other users.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsEpidemics and percolation in small-world networks
936 Citations2000Cristopher Moore, M. E. J. Newman
The resulting models display epidemic behavior when the infection or transmission probability rises above the threshold for site or bond percolation on the network, and are given exact solutions for the position of this threshold in a variety of cases.
Journal of Statistical PhysicsModels of the Small World
714 Citations2000M. E. J. Newman
A review of the six degrees of separation phenomenon, which is believed that almost any pair of people in the world can be connected to one another by a short chain of intermediate acquaintances, of typical length about six.
ACM SIGIR ForumImproved Algorithms for Topic Distillation in a Hyperlinked Environment
677 Citations2017Krishna Bharat, Monika Henzinger
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic, by augmenting a previous connectivity analysis based algorithm with content analysis.
Improved algorithms for topic distillation in a hyperlinked environment
439 Citations1998Krishna Bharat, Monika Henzinger
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic, by augmenting a previous connectivity analysis based algorithm with content analysis.
Lecture notes in computer scienceTrust Networks on the Semantic Web
436 Citations2003Jennifer Golbeck, Bijan Parsia +1 more
The applicability of social network analysis to the semantic web, particularly discussing the multi-dimensional networks that evolve from ontological trust specifications, is described.
Lecture notes in computer scienceThe Small World Web
400 Citations1999Lada A. Adamic
It is shown that the World Wide Web is a small world, in the sense that sites are highly clustered yet the path length between them is small and the small-worldness of its search results is used to measure the connectedness between communities on the Web.
The Web as a graph
288 Citations2000Ravi Kumar, Prabhakar Raghavan +4 more
A set of algorithms that operate on the Web graph are reviewed, addressing problems from Web search, automatic community discovery, and classification, and a new family of random graph models are proposed.
Attack-resistant trust metrics for public key certification
187 Citations1998Raph Levien, Alex Aiken
An analytical framework for understanding the effectiveness of trust metrics in resisting attacks is presented, including a characterization of the space of possible attacks, and the theoretical best case for a trust metric is established.
Reputation Network Analysis for Email Filtering.
183 Citations2004Jennifer Golbeck, James Hendler
An email scoring mechanism based on a social network augmented with reputation ratings is presented, and an algorithm for inferring reputation ratings between individuals is presented and demonstrated through experiments that it is accurate based on current data.
Computer Networks and ISDN SystemsParaSite: mining structural information on the Web
165 Citations1997Ellen Spertus
The varieties of link information (not just hyperlinks) on the Web, how the Web differs from conventional hypertext, and how the links can be exploited to build useful applications are discussed.
Lecture notes in computer scienceTrusting Information Sources One Citizen at a Time
150 Citations2002Yolanda Gil, Varun Ratnakar
TRELLIS is a system that helps users annotate their analysis of alternative information sources that can be contradictory and incomplete, and exploits the formal representations to derive measures of trust in the content of Web resources and their original source.
Physica A Statistical Mechanics and its ApplicationsMean-field-type equations for spread of epidemics: the ‘small world’ model
87 Citations1999A. Kleczkowski, Bryan T. Grenfell
Visualization of semantic metadata and ontologies
70 Citations2004P. Mutton, Jennifer Golbeck
A tool for generating visualizations of ontologies and metadata by using a modified spring embedder to achieve an automatic layout and shows that interesting information about the data relationships can be extracted through the visualization of the physical graph structure.