A Novel Clustering Based Mechanism For Community Detection Using Artificial Intelligence

Community detection with the same nodes is being a challenging task for analyzing social networking data and is broadly calculated in the social networking community for fundamental graph structure. This research has proposed a novel mechanism for community detection system based on GA-NN (Genetic algorithm-Neural network). For the execution, the proposed scheme has gone through various stages, such as preprocessing, feature extraction, feature optimization, and classification. Tokenization algorithm is applied to determine the features of the uploaded test data then GA is used that has optimized the data by using appropriate fitness function that helps to identify the densely connected set of nodes with sparse interconnection among the groups. To differentiate the groups, neural network as a classifier is used. For determining the performance of the proposed community detection system, different parameters such as precision, recall, F-measure and accuracy are measured.

[1]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

[2]  George Karypis,et al.  Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.

[3]  Hai Zhuge,et al.  Communities and Emerging Semantics in Semantic Link Network: Discovery and Learning , 2009, IEEE Transactions on Knowledge and Data Engineering.

[4]  Martin Franz,et al.  Unsupervised and supervised clustering for topic tracking , 2001, SIGIR '01.

[5]  Charu C. Aggarwal,et al.  Community Detection with Edge Content in Social Media Networks , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[6]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Joost N. Kok,et al.  A quickstart in frequent structure mining can make a difference , 2004, KDD.

[8]  A. Banerjee,et al.  Social Topic Models for Community Extraction , 2008 .

[9]  Donald H. Kraft,et al.  Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval , 1998, SIGIR 2002.

[10]  Rushed Kanawati,et al.  LICOD: Leaders Identification for Community Detection in Complex Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[11]  Hongyuan Zha,et al.  Probabilistic models for discovering e-communities , 2006, WWW '06.

[12]  Osmar R. Zaïane,et al.  Top Leaders Community Detection Approach in Information Networks , 2010 .

[13]  Stephen Shaoyi Liao,et al.  A graph-based action network framework to identify prestigious members through member's prestige evolution , 2012, Decis. Support Syst..

[14]  Clara Pizzuti,et al.  GA-Net: A Genetic Algorithm for Community Detection in Social Networks , 2008, PPSN.

[15]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[16]  Chris H Wiggins,et al.  Bayesian approach to network modularity. , 2007, Physical review letters.

[17]  Aristides Gionis,et al.  Mining Graph Evolution Rules , 2009, ECML/PKDD.

[18]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[19]  Laks V. S. Lakshmanan,et al.  Discovering leaders from community actions , 2008, CIKM '08.

[20]  Reda Alhajj,et al.  Identifying Social Communities by Frequent Pattern Mining , 2009, 2009 13th International Conference Information Visualisation.

[21]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[22]  Srinivasan Parthasarathy,et al.  Scalable graph clustering using stochastic flows: applications to community discovery , 2009, KDD.