Trust management for the Semantic Web

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

Volumn 2870, Issue , 2003, Pages 351-368

  Richardson, Matthew ^a,b   Agrawal, Rakesh ^b   Domingos, Pedro ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SOCIAL NETWORKING (ONLINE); WORLD WIDE WEB;

TOPDOWN; TRUST MANAGEMENT; TRUST VALUES; WEB OF TRUST;

SEMANTIC WEB;

EID: 0242308058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39718-2_23     Document Type: Article

References (33)

1. Abdul-Rahman, A., & Hailes, S. (1997). A distributed trust model. Proceedings of New Security Paradigms Workshop (pp. 48-60).
2. Agrawal, R., & Jagadish, H. V. (1988). Multiprocessor transitive closure algorithms. Proceedings of the International Symposium on Databases in Parallel and Distributed Systems (pp. 56-66). Austin, TX.
3. Agrawal, R., Dar, S., & Jagadish, H. V. (1990). Direct transitive closure algorithms: Design and performance evaluation. ACM Transactions on Database Systems, 15, 427-458.
4. Agresti, A. (1990). Categorical data analysis. New York, NY: Wiley.
5. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1974). The design and analysis of computer algorithms. Reading, MA: Addison-Wesley.
6. 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. (2002). Daml-s: Web service description for the Semantic Web. International Semantic Web Conference (pp. 348-363).
7. Bancilhon, F. (1985). Naive evaluation of recursively defined relations. On Knowledge Base Management Systems (Islamorada) (pp. 165-178).
8. Bellman, R., & Giertz, M. (1973). On the analytic formalism of the theory of fuzzy sets. Information Sciences, 5, 149-156.
9. Berners-Lee, T., Hendler, J., & Lassila, O. (May 2001). The Semantic Web. Scientific American.
10. Blaze, M., Feigenbaum, J., & Lacy, J. (1996). Decentralized trust management. Proceedings of, the 1996 IEEE Symposium on Security and Privacy (pp. 164-173). Oakland, CA.
11. Carre, B. (1978). Graphs and networks. Oxford: Claredon Press.
12. Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J., Raghavan, P., & Rajagopalan, S. (1998). Automatic resource compilation by analyzing hyperlink structure and associated text. Proceedings of the Seventh International World Wide Web Conference (pp. 65-74). Brisbane, Australia: Elsevier.
13. Chickering, D. M., & Heckerman, D. (1997). Effluent approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29, 181-212.
14. Doan, A., Madhavan, J., Domingos, P., & Halevy, A. Y. (2002). Learning to Map between Ontologies on the Semantic Web. Proceedings of the Eleventh International World Wide Web Conference (pp. 662-673).
15. Doan, A., Domingos, P., & Halevy, A. (2001). Reconciling schemas of disparate data sources: A machine-learning approach. Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data (pp. 509-520). Santa Barbara, CA: ACM Press.
16. Domingos, P., & Richardson, M. (2001). Mining the network value of customers. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 57-66). San Francisco, CA: ACM Press.
17. French, S. (1985). Group consensus probability distributions: A critical survey. In J. M. Bemardo, M. H. DeGroot, D. V. Lindley and A. F. M. Smith (Eds.), Bayesian statistics 2, 183-202. Amsterdam, Netherlands: Elsevier.
18. Genest, C., & Zidek, J. V. (1986). Combining probability distributions: A critique and an annotated bibliography. Statistical Science, 1, 114-148.
19. Gil, Y., & Ratnakar, V. (2002). Trusting information sources one citizen at a time. International Semantic Web Conference (pp. 162-176). Sardinia,Italy.
20. Joachims, T. (1997). A probabilistic analysis of the Rocchio algorithm with TFIDF for text categorization. Proceedings of the Fourteenth International Conference on Machine Learning (ICML-97) (pp. 143-151). San Francisco, CA: Morgan Kaufmann.
21. Kamvar, S., Schlosser, M., & Garcia-Molina, H. (2003). The EigenTrust algorithm for reputation management in P2P networks. Proceedings of the Twelfth International World Wide Web Conference.
22. Kautz, H., Selman, B., & Shah, M. (1997). ReferralWeb: Combining social networks and collaborative filtering. Communications of the ACM, 40, 63-66.
23. Kleinberg, J. M. (1998). Authoritative sources in a hyperlinked environment. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 668-677). Baltimore, MD: ACM Press.
24. Motwani95 Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge University Press.
25. Ngo, L., & Haddawy, P. (1997). Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171, 147-177.
26. Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank citation ranting: Bringing order to the web (Technical Report). Stanford University, Stanford, CA.
27. Patel-Schneider, P., & Simeon, J. (2002). Building the Semantic Web on XML. International Semantic Web Conference (pp. 147-161).
28. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Francisco, CA: Morgan Kaufmann.
29. Pennock, D. M., Nielsen, F. A., & Giles, C. L. (2001). Extracting collective probabilistic forecasts from Web games. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 174-183). San Francisco, CA: ACM Press.
30. Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994). GroupLens: An open architecture for collaborative filtering of netnews. Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work (pp. 175-186). New York, NY: ACM Press.
31. Richardson, M., & Domingos, P. (2002). Mining knowledge-sharing sites for viral marketing. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 61-70). Edmonton, Canada: ACM Press.
32. Richardson, M., & Domingos, P. (2002). The intelligent surfer: Probabilistic combination of link and content information in PageRank. In T. G. Dietterich, S. Becker and Z. Ghahramani (Eds.), Advances in Neural Information Processing Systems 14, 1441-1448. Cambridge, MA: MIT Press.
33. Warshall, S. (1962). A theorem on boolean matrices. Journal of the ACM, 9, 11-12.