ACO-based clustering for Ego Network analysis

作者: Antonio Gonzalez-Pardo , Jason J. Jung , David Camacho

DOI: 10.1016/J.FUTURE.2016.06.033

关键词: Social networkMachine learningNode (networking)Dynamics (music)Big dataVolume (computing)Ant colony optimization algorithmsArtificial intelligenceCluster analysisTopology (electrical circuits)Computer scienceVariety (cybernetics)

摘要: Abstract The unstoppable growth of Social Networks (SNs), and the huge number connected users, have become these networks as one most popular successful domains for a large research areas. different possibilities, volume variety that SNs offer, has them an essential tool every-day working social relationships. One basic features any SN provides is to allow users group, organize classify their connections into groups, or “circles”. These circles can be defined using characteristics roommates, workmates, hobbies, professional skills, etc. problem finding taking account variety, dynamics important challenge wide Computer Science areas, Big Data, Data Mining Machine Learning among others. Problems related pre-processing, fusion knowledge discovering information from sources are still open question. This paper presents new Bio-inspired method, based on Ant Colony Optimization (ACO) algorithms, been designed find analyze circles. Given user in network, method able automatically determine compose his/her groups interest, so network will clustered components profiles dynamics. algorithm applied Ego where node centering (called “Ego”) represents being studied. In this work two ACO differ source used perform community tasks, designed. first uses extracted topology whereas second profile provided by users. proposed algorithms detect three Networks: Facebook, Twitter Google+. Finally, several databases previous SNs, experimental evaluation our methods carried out show how currently working.

参考文章(82)
Matteo Borrotti, Irene Poli, Naïve Bayes Ant Colony Optimization for Experimental Design soft methods in probability and statistics. ,vol. 190, pp. 489- 497 ,(2013) , 10.1007/978-3-642-33042-1_52
Stephan Günnemann, Brigitte Boden, Ines Färber, Thomas Seidl, Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors pacific-asia conference on knowledge discovery and data mining. pp. 261- 275 ,(2013) , 10.1007/978-3-642-37453-1_22
Peter Rousseeuw, L Kaufman, Clustering by means of medoids Proc. Statistical Data Analysis Based on the L1 Norm Conference, Neuchatel, 1987. pp. 405- 416 ,(1987)
Andreas P. Streich, Joachim M. Buhmann, Mario Frank, David Basin, Multi-assignment clustering for boolean data Journal of Machine Learning Research. ,vol. 13, pp. 459- 489 ,(2012) , 10.5555/2188385.2188400
Hiroshi Okamoto, Local Detection of Communities by Neural-Network Dynamics international conference on artificial neural networks. pp. 50- 57 ,(2013) , 10.1007/978-3-642-40728-4_7
M. Dorigo, Optimization, Learning and Natural Algorithms Ph.D. Thesis, Politecnico di Milano, Italy. ,(1992)
Andries P. Engelbrecht, Computational Intelligence: An Introduction ,(2018)
Haijun Zhou, Reinhard Lipowsky, Network Brownian Motion: A New Method to Measure Vertex-Vertex Proximity and to Identify Communities and Subcommunities international conference on computational science. pp. 1062- 1069 ,(2004) , 10.1007/978-3-540-24688-6_137
Douglas A. Reynolds, Gaussian Mixture Models. Encyclopedia of Biometrics. pp. 659- 663 ,(2009)
David B. Fogel, Zbigniew Michalewicz, Thomas Back, Handbook of Evolutionary Computation ,(1997)