An efficient search strategy for service provider selection in complex social networks

Proceedings - 2012 IEEE 9th International Conference on Services Computing, SCC 2012

Volumn , Issue , 2012, Pages 130-137

  Xu, Yu ^a   Liu, Jianxun ^a   Tang, Mingdong ^a   Cao, Buqing ^a   Liu, Xiaoqing ^b  

^a HUNAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b Architectural and Environmental Engineering   (United States)

Author keywords

path search; service provider selection; social networks; trustworthiness

Indexed keywords

APPROXIMATE SOLUTION; CONSTANT TIME COMPLEXITY; EXCELLENT PERFORMANCE; NP COMPLETE; PATH SEARCH; SEARCH STRATEGIES; SEARCHING TIME; SERVICE PROVIDER; SOCIAL NETWORKS; TIME COMPLEXITY; TRUST FACTOR; TRUST PATH; TRUST VALUES; TRUSTWORTHINESS;

DATA STRUCTURES; HEURISTIC ALGORITHMS; OPTIMIZATION;

SOCIAL NETWORKING (ONLINE);

EID: 84867361431     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCC.2012.31     Document Type: Conference Paper

References (24)

1. J. Golbeck, and J. Hendler, "Inferring trust relationships in web-based social networks," ACM Transactions on Internet Technology, Vol. 6, No. 4, pp. 497-529, 2006.
2. C. Hang, Y. Wang, and M. Singh, "Operators for propagating trust and their evaluation in social networks," In AAMAS'09, pp. 1025-1032.
3. J. Kunegis, A. Lommatzsch, and C. Bauckhang, "The Slashdot zoo: Mining a social network with negative edges," In WWW'09, pp. 741-750.
4. R. Albert, and A.-L. Barabási, "Statistical mechanics of complex networks," Rev. Mod. Phys. 74, pp. 47-97, 2002.
5. R. Miller, D. Perlman, and S. Brehm, Intimate Relationships, McGraw-Hill College, 4th edition, 2007.
6. 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, Vol. 30, No. 1, pp.249-272, 2007.
7. G. Liu, Y. Wang, and M. A. Orgun, "Optimal social trust path selection in complex social networks," In AAAI'10, pp. 1397-1398.
8. 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, pp. 130-137.
9. T. Yu, Y. Zhang, and K. Lin, "Efficient algorithms for web services selection with end-to-end QoS constraints," ACM Transactions on the Web, Vol. 1, No. 1, 2007.
10. L. Zeng, B. Benatallah, M. Dumas, J. Kalagnanam, and Q. Sheng, "Quality driven web services composition," In WWW'03, pp. 411-421.
11. L. Zeng, B. Benatallah, A. Ngu, M. Dumas, J. Kalagnanam, and H. Chang, "Qos-aware middleware for web service composition," IEEE Transactions on Software Engineering, Vol. 30, No. 5, pp. 311-327, 2004.
12. L. Li, Y. Wang, and E. Lim, "Trust-oriented composite services selection and discovery," In ICSOC'09, pp. 50-67.
13. 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, Vol. 16, No. 1, pp. 57-74, February 2008.
14. G. Liu, Y. Wang, M. A. Orgun, "Finding K Optimal Social Trust Paths for the Selection of Trustworthy Service Providers in Complex Social Networks," In ICWS'11, pp. 41-48, 2011
15. G. Levinger, "Development and change," Close Relationships, pp. 315-359, 1983.
16. T. Korkmaz, and M. Krunz, "Multi-constrained optimal path selection," In INFOCOM'01, pp. 834-843.
17. E. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, pp. 269-271, 1959.
18. L. Franken, "Quality of service management: A model-based approach," PhD Thesis, Centre for Telematics and Information Technology, 1996.
19. M. E. J. Newman, "The structure and function of complex networks," SIAM Review 45, pp.167-256, 2003.
20. A.-L. Barabasi, and E. Bonabeau, "Scale-free networks," Sci. Am. 288, pp. 60-69, 2003.
21. A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science 286, pp. 509-512, 1999.
22. S. H. Strogatz, "Exploring complex networks," Nature 410, pp. 268-276, 2001.
23. E. Cohen, U. Zwick, "All-Pairs small stretch paths," Journal of Algorithms, Vol. 38, No. 2, pp. 335-353, 2001.
24. M. Thorup, U. Zwick, "Approximate distance oracle," Journal of the ACM, Vol. 52, No. 1, pp. 1-2, 2005.