Abstract
Though research on the Semantic Web has progressed at a steady pace, its promise has yet to be realized. One major difficulty is that, by its very nature, the Semantic Web is a large, uncensored system to which anyone may contribute. This raises the question of how much credence to give each source. We cannot expect each user to know the trustworthiness of each source, nor would we want to assign top-down or global credibility values due to the subjective nature of trust. We tackle this problem by employing a web of trust, in which each user maintains trusts in a small number of other users. We then compose these trusts into trust values for all other users. The result of our computation is not an agglomerate “trustworthiness" of each user. Instead, each user receives a personalized set of trusts, which may vary widely from person to person. We define properties for combination functions which merge such trusts, and define a class of functions for which merging may be done locally while maintaining these properties. We give examples of specific functions and apply them to data from Epinions and our BibServ bibliography server. Experiments confirm that the methods are robust to noise, and do not put unreasonable expectations on users. We hope that these methods will help move the Semantic Web closer to fulfilling its promise.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abdul-Rahman, A., Hailes, S.: A distributed trust model. In: Proceedings of New Security Paradigms Workshop, pp. 48–60 (1997)
Agrawal, R., Jagadish, H.V.: Multiprocessor transitive closure algorithms. In: Proceedings of the International Symposium on Databases in Parallel and Distributed Systems, Austin, TX, pp. 56–66 (1988)
Agrawal, R., Dar, S., Jagadish, H.V.: Direct transitive closure algorithms: Design and performance evaluation. ACM Transactions on Database Systems 15, 427–458 (1990)
Agresti, A.: Categorical data analysis. Wiley, New York (1990)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)
Ankolekar, A., Burstein, M.H., Hobbs, J.R., Lassila, O., Martin, D., McDermott, V., McIlraith, S.A., Narayanan, S., Paolucci, M., Payne, T.R., Sycara, K.P.: Daml-s: Web service description for the Semantic Web. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 348–363. Springer, Heidelberg (2002)
Bancilhon, F.: Naive evaluation of recursively defined relations. In: On Knowledge Base Management Systems (Islamorada), pp. 165–178 (1985)
Bellman, R., Giertz, M.: On the analytic formalism of the theory of fuzzy sets. Information Sciences 5, 149–156 (1973)
Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American (May 2001)
Blaze, M., Feigenbaum, J., Lacy, J.: Decentralized trust management. In: Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, CA, pp. 164–173 (1996)
Carre, B.: Graphs and networks. Claredon Press, Oxford (1978)
Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J., Raghavan, P., Rajagopalan, S.: Automatic resource compilation by analyzing hyperlink structure and associated text. In: Proceedings of the Seventh International World Wide Web Conference, pp. 65–74. Elsevier, Brisbane (1998)
Chickering, D.M., Heckerman, D.: Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning 29, 181–212 (1997)
Doan, A., Madhavan, J., Domingos, P., Halevy, A.Y.: Learning to Map between Ontologies on the Semantic Web. In: Proceedings of the Eleventh International World Wide Web Conference, pp. 662–673 (2002)
Doan, A., Domingos, P., Halevy, A.: Reconciling schemas of disparate data sources: A machine-learning approach. In: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, pp. 509–520. ACM Press, Santa Barbara (2001)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM Press, San Francisco (2001)
French, S.: Group consensus probability distributions: A critical survey. In: Bernardo, J.M., DeGroot, M.H., Lindley, D.V., Smith, A.F.M. (eds.) Bayesian statistics 2, pp. 183–202. Elsevier, Amsterdam (1985)
Genest, C., Zidek, J.V.: Combining probability distributions: A critique and an annotated bibliography. Statistical Science 1, 114–148 (1986)
Gil, Y., Ratnakar, V.: Trusting information sources one citizen at a time. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 162–176. Springer, Heidelberg (2002)
Joachims, T.: A probabilistic analysis of the Rocchio algorithm with TFIDF for text categorization. In: Proceedings of the Fourteenth International Conference on Machine Learning (ICML 1997), pp. 143–151. Morgan Kaufmann, San Francisco (1997)
Kamvar, S., Schlosser, M., Garcia-Molina, H.: The EigenTrust algorithm for reputation management in P2P networks. In: Proceedings of the Twelfth International World Wide Web Conference (2003)
Kautz, H., Selman, B., Shah, M.: ReferralWeb: Combining social networks and collaborative filtering. Communications of the ACM 40, 63–66 (1997)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 668–677. ACM Press, Baltimore (1998)
Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)
Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171, 147–177 (1997)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web (Technical Report). Stanford University, Stanford, CA (1998)
Patel-Schneider, P., Simeon, J.: Building the Semantic Web on XML. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 147–161. Springer, Heidelberg (2002)
Pearl, J.: Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Francisco (1988)
Pennock, D.M., Nielsen, F.A., Giles, C.L.: Extracting collective probabilistic forecasts from Web games. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 174–183. ACM Press, San Francisco (2001)
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., Riedl, J.: GroupLens: An open architecture for collaborative filtering of netnews. In: Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, pp. 175–186. ACM Press, New York (1994)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61–70. ACM Press, Edmonton (2002)
Richardson, M., Domingos, P.: The intelligent surfer: Probabilistic combination of link and content information in PageRank. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems 14, pp. 1441–1448. MIT Press, Cambridge (2002)
Warshall, S.: A theorem on boolean matrices. Journal of the ACM 9, 11–12 (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Richardson, M., Agrawal, R., Domingos, P. (2003). Trust Management for the Semantic Web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds) The Semantic Web - ISWC 2003. ISWC 2003. Lecture Notes in Computer Science, vol 2870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39718-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-39718-2_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20362-9
Online ISBN: 978-3-540-39718-2
eBook Packages: Springer Book Archive