Finding K optimal social trust paths for the selection of trustworthy service providers in complex social networks

Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011

Volumn , Issue , 2011, Pages 41-48

  Liu, Guanfeng ^a   Wang, Yan ^a   Orgun, Mehmet A ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

K paths selection; Service provider selection; Social networks; Trust

Indexed keywords

COMPLEX NETWORKS; HEURISTIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

COMPLEX SOCIAL NETWORKS; K PATH SELECTION; K-PATHS; PATH SELECTION; SERVICE CONSUMERS; SERVICE PROVIDER; SERVICE PROVIDER SELECTIONS; SOCIAL NETWORK; SOCIAL TRUST PATHS; TRUST;

SOCIAL NETWORKING (ONLINE);

EID: 80053167056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2011.81     Document Type: Conference Paper

References (32)

1. P. S. Adler. Market, hierarchy, and trust: The knowledge economy and the future of capitalism. Organization Science, 12(12):215-234, 2001. (Pubitemid 33673754)
2. S. Baase and A. Gelder. Computer Algorithms Introduction to Design and Analysis. Addision Wesley, 2000.
3. B. Christianson and W. S. Harbison. Why isn't trust transitivie? In International Workshop on Security Protocols, pages 171-176, 1996.
4. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, pages 269-271, 1959.
5. D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652-673, 1999.
6. B. FoX. K-th shortest paths and applications to the probabilistic networks. Joint National Meeting of ORSA/TIMS, 23, 1975.
7. L. Franken. Quality of service management: A model-based approach. PhD Thesis, University of Twente, Netherlands, 1996.
8. J. Golbeck and J. Hendler. Inferring trust relationships in web-based social networks. ACM Transactions on Internet Technology, 6(4):497-529, 2006. (Pubitemid 44893437)
9. R. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In WWW'04, pages 403-412, 2004. (Pubitemid 40752775)
10. C. Hang, Y. Wang, and M. Singh. Operators for propagating trust and their evaluation in social networks. In AAMAS'09, pages 1025-1032, 2009.
11. M. Jamali and M. Ester. Trustwalker: A random walk model for combinging trust-based and item-based recommendation. In KDD'09, pages 29-42, 2009.
12. T. Korkmaz and M. Krunz. Multi-constrained optimal path selection. In INFOCOM'01, pages 834-843, 2001. (Pubitemid 32478413)
13. R. F. Korte. Biases in decision making and implications for human resource development. Advances in Developing Human Resources, 5(4):440-457, 2003.
14. J. Kunegis, A. Lommatzsch, and C. Bauckhang. The slashdot zoo: Mining a social network with negative edges. In WWW'09, pages 741-750, 2009.
15. G. Levinger. Development and change. Close Relationships, pages 315-359, 1983.
16. L. Li, Y. Wang, and E. Lim. Trust-oriented composite services selection and discovery. In ICSOC'09, pages 50-67, 2009.
17. C. Lin, N. Cao, S. Liu, S. Papadimitriou, J. Sun, and X. Yan. Small-blue: Social network analysis for expertise search and collective intelligence. In ICDE'09, pages 1483-1486, 2009.
18. G. Liu, Y. Wang, and M. Orgun. Quality of trust for social trust path selection in complex social networks. In AAMAS'10, 2010.
19. G. Liu, Y. Wang, and M. A. Orgun. Optimal social trust path selection in complex social networks. In AAAI'10, pages 1397-1398, aaai.
20. G. Liu, Y. Wang, M. A. Orgun, and E. p. Lim. A heuristic algorithm for service provider selection in complex social networks. In SCC'10, pages 130-137, 2010.
21. E. Martins, M. Pascoal, and J. Santos. Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science, 10(3):247-261, 1999.
22. A. Mccallum, X. Wang, and A. Corrada-Emmanuel. Topic and role discovery in social networks with experiments on enron and academic email. Journal of Artificial Intelligence Research, 30(1):249-272, 2007.
23. K. Merton. The role set problems in sociological theory. British Journal of Sociology, 8(2):110-113, 1957.
24. S. Miaou and S. Chin. Computing k-shortest path for nuclear spent fuel highway transportation. European Journal of Operational Research, 53:64-80, 1975.
25. S. Milgram. The small world problem. Psychology Today, 1967.
26. R. Miller, D. Perlman, and S. Brehm. Intimate Relationships. McGraw-Hill College, 4th edition, 2007.
27. A. Mislove, M. Marcon, K. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In ACM IMC'07, pages 29-42, 2007.
28. J. Tang, J. Zhang, L. Yan, J. Li, L. Zhang, and Z. Su. Arnetminer: Extraction and mining of academic social networks. In KDD'08, pages 990-998, 2008.
29. F. Walter, S. Battiston, and F. Schweitzer. A model of a trust-based recommendation system on a social network. Autonomous Agent Multi-Agent System Journal, 16(1):57-74, February 2008.
30. Y. Wang and V. Varadharajan. Role-based recommendation and trust evaluation. In IEEE EEE'07, pages 278-295, 2007.
31. J. Yen. Shortest path network problems. Mathematical Systems in Economics, 1975.
32. S. Yoo, Y. Yang, F. Lin, and I. Moon. Mining social networks for personalized email prioritization. In KDD'09, pages 967-976, 2009.