An ACO inspired weighting approach for the spectral partitioning of co-authorship networks

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Krömer, Pavel ^a   Snášel, Václav ^a   Platoš, Jan ^a   Kudělka, Miloš ^a   Horák, Zdeněk ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

algebraic connectivity; ant colony optimization; co authorship; DBLP; spectral partitioning; weighting

Indexed keywords

ALGEBRAIC CONNECTIVITY; ANT COLONY OPTIMIZATION (ACO); COAUTHORSHIP; DBLP; SPECTRAL PARTITIONING; WEIGHTING;

ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 84866878452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6252863     Document Type: Conference Paper

References (18)

1. M. Fiedler, "A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory," Czechoslovak Mathematical Journal, vol. 25, 1975.
2. D. A. Spielman and S.-H. Teng, "Spectral partitioning works: Planar graphs and finite element meshes," Linear Algebra and its Applications, vol. 421, no. 23, pp. 284-305, 2007. [Online]. Available: http://www. sciencedirect.com/science/article/pii/S0024379506003454
3. L. Grady and J. R. Polimeni, Discrete Calculus - Applied Analysis on Graphs for Computational Science. Springer, 2010.
4. J. Shi and J. Malik, "Normalized cuts and image segmentation," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 22, no. 8, pp. 888-905, aug 2000.
5. X. Shen, X. Papademetris, and R. T. Constable, "Graph-theory based parcellation of functional subunits in the brain from resting-state fmri data." NeuroImage, vol. 50, no. 3, pp. 1027-35, 2010. [Online]. Available: http://www.ncbi.nlm.nih.gov/pubmed/20377452
6. S. Sarkar and P. Soundararajan, "Supervised learning of large perceptual organization: graph spectral partitioning and learning automata," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 22, no. 5, pp. 504-525, may 2000.
7. C. Ding, X. He, H. Zha, M. Gu, and H. Simon, "A min-max cut algorithm for graph partitioning and data clustering," in Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on, 2001, pp. 107-114.
8. F. R. Bach and M. I. Jordan, "Learning spectral clustering," in NIPS, S. Thrun, L. K. Saul, and B. Schölkopf, Eds. MIT Press, 2003.
9. A. Ghosh and S. Boyd, "Growing well-connected graphs," in Decision and Control, 2006 45th IEEE Conference on. IEEE, 2006, pp. 6605-6611.
10. J. Ruan and W. Zhang, "An efficient spectral algorithm for network community discovery and its applications to biological and social networks," in Proceedings of the 2007 Seventh IEEE International Conference on Data Mining. Washington, DC, USA: IEEE Computer Society, 2007, pp. 643-648. [Online]. Available: http://dl.acm.org/citation.cfm?id=1441428.1442132
11. N. Mishra, R. Schreiber, I. Stanton, and R. E. Tarjan, "Clustering social networks," in WAW, ser. Lecture Notes in Computer Science, A. Bonato and F. R. K. Chung, Eds., vol. 4863. Springer, 2007, pp. 56-67.
12. M. Kurucz, A. Benczur, K. Csalogany, and L. Lukacs, "Spectral clustering in telephone call graphs," in Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, ser. WebKDD/SNA-KDD '07. New York, NY, USA: ACM, 2007, pp. 82-91. [Online]. Available: http://doi.acm.org/10.1145/1348549.1348559
13. M. Kurucz, A. A. Benczúr, K. Csalogány, and L. Lukács, "Advances in web mining and web usage analysis," H. Zhang, M. Spiliopoulou, B. Mobasher, C. L. Giles, A. Mccallum, O. Nasraoui, J. Srivastava, and J. Yen, Eds. Berlin, Heidelberg: Springer-Verlag, 2009, ch. Spectral Clustering in Social Networks, pp. 1-20. [Online]. Available: http://dx.doi.org/10.1007/978-3-642-00528-2 1
14. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, "Statistical properties of community structure in large social and information networks," in Proceedings of the 17th international conference on World Wide Web, ser. WWW '08. New York, NY, USA: ACM, 2008, pp. 695-704. [Online]. Available: http://doi.acm.org/10.1145/1367497.1367591
15. K. S. Xu, M. Kliger, Y. Chen, P. J. Woolf, and A. O. Hero, III., "Revealing social networks of spammers through spectral clustering," in Proceedings of the 2009 IEEE international conference on Communications, ser. ICC'09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 735-740. [Online]. Available: http://dl.acm.org/citation.cfm? id=1817271.1817409
16. T. Bühler and M. Hein, "Spectral clustering based on the graph p-laplacian," in ICML, ser. ACM International Conference Proceeding Series, A. P. Danyluk, L. Bottou, and M. L. Littman, Eds., vol. 382. ACM, 2009, p. 11.
17. M. Dorigo and T. Stützle, Ant Colony Optimization. Cambridge, MA: MIT Press, 2004.
18. M. Kudělka, Z. Horák, V. Snášel, P. Krömer, J. Platoš, and A. Abraham, "Social and swarm aspects of co-authorship network," Logic Journal of IGPL, vol. Special issue: HAIS 2010, 2011, iSSN 1367-0751(print), ISSN 1368-9894 (online), IF: 0.326 (2008 JCR Science Edition). [Online]. Available: http://jigpal.oxfordjournals.org/content/ early/2011/02/08/jigpal.jzr002.abstract