The week's pick
Random Articles
Reseach Article
A Clustering Algorithm in Complex Social Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 103 - Number 4 |
| Year of Publication: 2014 |
| Authors: Veera Nagaiah Maddikayala, R Chandrasekhar |
10.5120/18063-8996
|
Veera Nagaiah Maddikayala, R Chandrasekhar . A Clustering Algorithm in Complex Social Networks. International Journal of Computer Applications. 103, 4 ( October 2014), 24-28. DOI=10.5120/18063-8996
Abstract
Complex networks are real graphs (networks) with non-trivial topological features. The empirical study of real-world networks like computer networks and social networks gives insights into the structures and properties of such networks. Identification of community structure is one of the important problems in social networks. Tightly knit group of nodes (Cluster) characterized by a relatively high density of ties (links) tend to be greater than the nodes that have average probability of ties randomly established [8][16]. In this paper a novel clustering algorithm is developed in complex social networks to detect the communities with close relations where in, everybody is aware of every other in their group called cluster. Determining such groups is the main concern of this paper. Some of the social networks are online Facebook, LinkedIn, Twitter and day today socializing. Graph Theoretic approach is followed for finding the clusters. Perfect graph structures are investigated in the complex social networks.
References
- Albert-László Barabási and Rèka Albert. Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
- C Berge and P Duchet. Strongly perfect graphs. Annals of Discrete Mathematics, 21:57–61, 1984.
- L da F Costa, Francisco A Rodrigues, Gonzalo Travieso, and P R Villas Boas. Characterization of complex networks: A survey of measurements. Advances in Physics, 56(1):167–242, 2007.
- Bhaskar DasGupta and Devendra Desai. On the complexity of newmans community finding approach for biological and social networks. Journal of Computer and System Sciences, 79(1):50–67, 2013.
- E Knuth Donald. The art of computer programming. Sorting and searching, 3:426–458, 1999.
- Paul Erd?s and Alfréd Rényi. On random graphs. Publicationes Mathematicae Debrecen, 6:290–297, 1959.
- Paul Erd?s and Alfréd Rényi. On the evolution of random graphs. Bull. Inst. Internat. Statist, 38(4):343–347, 1961.
- Paul W Holland and Samuel Leinhardt. Transitivity in structural models of small groups. Comparative Group Studies, 1971.
- Ajaz Hussain, Khalid Latif, Aimal Tariq Rextin, Amir Hayat, and Masoon Alam. Scalable visualization of semantic nets using power-law graphs. Applied Mathematics & Information Sciences, 8(1), 2014.
- Thilo Kielmann, Henri E Bal, and Sergei Gorlatch. Bandwidth-efficient collective communication for clustered wide area systems. In Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International, pages 492–499. IEEE, 2000.
- G Ravindra. Meyniels graphs are strongly perfect, in Topics on perfect graphs (eds. c berge and v. chvtal). Ann. Disc. Math, 21:145–148, 1984.
- G Ravindra and K R Parthasarathy. Perfect product graphs. Discrete Mathematics, 20:177–186, 1977.
- Daniel A Spielman and Shang-Hua Teng. A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM Journal on Computing, 42(1):1–26, 2013.
- Steven H Strogatz. Exploring complex networks. Nature, 410(6825):268–276, 2001.
- Jeffrey Travers and Stanley Milgram. An experimental study of the small world problem. Sociometry, pages 425–443, 1969.
- Duncan J Watts and Steven H Strogatz. Collective dynamics of small-world' networks. nature, 393(6684):440–442, 1998.
- Yourim Yoon and Yong-Hyuk Kim. Vertex ordering, clustering, and their application to graph partitioning. Applied Mathematics & Information Sciences, 8(1), 2014.
Index Terms
Keywords