Investigation of the role of similarity measure and ranking algorithm in mining social networks

Abstract

Social networks have attracted much attention recently. Different studies have been conducted to automatically extract social networks among various kinds of entities from the web. Social network analysis finds its application in many current business areas. In this paper we demonstrate how the choice of the similarity measure affects ranking results of entities in a social network extracted from the web. We use different similarity measures in order to build different social networks. By applying formulas described below for each of the networks we derive a new network which is different from the original one by edge weights. Subsequently, in the derived networks we rank entities again. Finally we compare the results.

Keywords

social network on the web similarity measure PageRank resistance distance entity ranking

Get full access to this article

View all access options for this article.

References

B. Poliqean , H. Tanev , and M. Atkinson , Extracting and learning social networks out of multilingual news, In: Proceedings of the Social Networks and Application Tools Workshop, Skalica, Slovakia, 2008 , pp.13-16.

A. Culotta , R. Bekkerman , and A. McCallum , Extracting social networks and contact information from email and the web , In: Proceedings of the First Conference on Email and Anti-Spam, Mountain View, USA, 2004 , pp.1-8.

R. Rome , G. Creamer , S. Hershkop and S. Stolfo , Automated social hierarchy detection through email network analysis, In: Proceedings of the 9th WebKDD and First SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, San Jose, USA, 2007, pp.109-117.

P. Nasirifard , V. Peristeras , C. Hayes and S. Decker , Extracting and utilizing social networks from log files of shared workspaces, In: Proceedings of the 10th IFIP WG 5.5 Working Conference on Virtual Enterprises, Thessaloniki, Greece, 2009, pp.643-650.

G.J. Mori , T. Tsujishita , Y. Matsuo and M. Ishizuka , Extracting relations in social networks from the web using similarity between collective contexts, In: Proceedings of the 5th International Semantic Web Conference, Athens, USA, 2006, pp.487-500.

Y. Jin , Y. Matsuo and M. Ishizuka , Ranking entities on the web using social network mining and ranking learning , In: Proceedings of the WWW2008 Workshop on Social Web Search and Mining, Beijing, China, 2008, pp.1349-1352.

A. Agarwal , S. Chakrabarti and S. Aggarwal , Learning to rank networked entities, In: Proceedings of the 12th ACM SIGKDD InterConference on Knowledge Discovery and Data Mining , Philadelphia, USA, 2006, pp.14-23.

R. Cilibrasi and P. Vitanyi , The Google similarity distance, IEEE Transaction on Knowledge and Data Engineering 19(3) (2007) 370-383.

A.T. Balaban and D.J. Klein , Co-authorship, rational Erdos numbers, and resistance distance in graphs, Scientometrics 55(1) (2002) 55-70.

10.

R.M. Aliguliyev , Document summarization by sentence ranking, Information Technologies 10 (2009 ) 39-44 (in Russian).

11.

P. Ingongngam and A. Rungsawang , Topic-centric algorithm: a novel approach to web link analysis, In: Proceedings of the 18th International Conference on Advanced Information Networking and Applications , Fukuoka, Japan, 2004, Vol. 2, pp.299-301.