Multilevel refinement based on neighborhood similarity

ACM International Conference Proceeding Series

Volumn , Issue , 2014, Pages 67-76

  Valejo, Alan ^a   Valverde Rebaza, Jorge ^a   Drury, Brett ^a   De Andrade Lopes, Alneu ^a  

^a Heart Institute   (Brazil)

Author keywords

Complex networks; Graph clustering; Multilevel partitioning; Refinement; Social networks

Indexed keywords

COMPLEX NETWORKS; DATABASE SYSTEMS; SOCIAL NETWORKING (ONLINE);

CLUSTERING COEFFICIENT; GRAPH CLUSTERING; MULTI-LEVEL PARTITIONING; MULTILEVEL GRAPH PARTITIONING; MULTILEVEL REFINEMENT; PARTITIONING ALGORITHMS; REFINEMENT; REFINEMENT ALGORITHMS;

ALGORITHMS;

EID: 84906812213     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2628194.262822/     Document Type: Conference Paper

References (37)

1. L. J. Almeida and A. A. Lopes. An ultra-fast modularity-based graph clustering algorithm. Proceedings 14th Portuguese Conference on Artificial Intelligence (EPIA) - Web and Network Intelligence Track, pages 1-9, 2009.
2. D. R. Amancio, O. N. Oliveira Jr., and L. d. F. Costa. Topological-collaborative approach for disambiguating authors' names in collaborative networks. CoRR, abs/1311.1266, 2013.
3. V. Batagelj and A. Mrvar. Pajek datasets, 2006. visited on 2014-02-30.
4. C.-E. Bichot. A Partitioning Requiring Rapidity and Quality: The Multilevel Method and Partitions Refinement Algorithms, pages 27-63. John Wiley & Sons, Inc., 2013.
5. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
6. J. Demšar. Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res., 7:1-30, 2006.
7. T. Fawcett and F. Provost. Activity monitoring: Noticing interesting changes in behavior. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '99, pages 53-62, New York, NY, USA, 1999.
8. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the 19th Design Automation Conference, DAC '82, pages 175-181, Piscataway, NJ, USA, 1982.
9. S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
10. M. R. G arey, D. S. Johnson, and L. J. Stockmeyer. Some simplified np-complete graph problems. Theor. Comput. Sci, l(3):237-267, 1976.
11. H. Han, L. Giles, H. Zha, C. Li, and K. Tsioutsiouliklis. Two supervised learning approaches for name disambiguation in author citations. In Proceedings of the th ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL '04, pages 296-305, New York, NY, USA, 2004.
12. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, Supercomputing '95, New York, NY, USA, 1995.
13. G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), Supercomputing '95, New York, NY, USA, 1995.
14. G. Karypis and V. Kumar. Multilevel graph partitioning schemes. In ICPP (3), pages 113-122, 1995.
15. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and, Distributed Computing, 48:96-129, 1998.
16. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307, 1970.
17. B. Krishnamurthy and J. Wang. On network-aware clustering of web clients. In Proceedings of the Conference on Applications, Technologies, Architectures, and, Protocols for Computer Communication, SIGCOMM '00, pages 97-110, New York, NY, USA, 2000.
18. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proceedings of the Twelfth International Conference on Information and Knowledge Management, CIKM '03, pages 556-559, New York, NY, USA, 2003.
19. R. N. Lichtenwalter and N. V. Chawla. Lpmade: Link prediction made easy. J. Mach. Learn. Res., 12:2489-2492, Nov. 2011.
20. L. Lü and T. Zhou. Link prediction in complex networks: A survey. Physica A, 390(6):1150-1170,2011.
21. J. Neville, D. Jensen, L. Friedland, and M. Hay. Learning relational probability trees. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, pages 625-630, New York, NY, USA, 2003.
22. M. E. J. Newman. Assortative mixing in networks. Phys. Rev. Lett., 89:208701, 2002.
23. M. E. J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577-8582, 2006.
24. M. E. J. Newman, Dataset 2013. Available at http ://www-personal.umich. edu/[[amp]]tilde;mejn/netdata/; accessed 2013-30-03.
25. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, 2004.
26. A. Noack and R. Rotta. Multi-level algorithms for modularity clustering. In Proceedings of the 8th International Symposium on Experimental Algorithms, SEA '09, pages 257-268, Berlin, Heidelberg, 2009.
27. R. Rotta and A. Noack. Multilevel local search algorithms for modularity clustering. J. Exp. Algorithmics, 16:2.3:2.1-2.3:2.27, 2011.
28. L. A. Sanchis. Multiple-way network partitioning. IEEE Trans. Comput., 38(1):62-81, 1989.
29. L. A. Sanchis. Multiple-way network partitioning with different cost functions. IEEE Trans. Comput., (12): 1500-1504, 1993.
30. P. Schuetz and A. Caflisch. Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E, 77:046112, 2008.
31. N. Spring, R. Mahajan, and D. Wetherall. Measuring isp topologies with rocketfuel. SIGCOMM Comput. Commun. Rev., 32(4):133-145, 2002.
32. J. Valverde-Rebaza and A. A. Lopes. Link prediction in complex networks based on cluster information. In Advances in Artificial Intelligence - SBIA 2012, volume 7589, pages 92-101. Curitiba, PR, Brazil, 2012.
33. J. Valverde-Rebaza and A. A. Lopes. Exploiting behaviors of communities of twitter users for link prediction. Social Network Analysis and, Mining, 3(4):1063-1074, 2013.
34. J. C. Valverde-Rebaza and A. de Andrade Lopes. Structural fink prediction using community information on twitter. In CASoN, pages 132-137. IEEE, 2012.
35. Z. Ye, S. Hu, and J. Yu. Adaptive clustering algorithm for community detection in complex networks. Phys. Rev. E, 78:046115, 2008.
36. Z. Yin, M. Gupta, T. Weninger, and J. Han. A unified framework for link recommendation using random walks. In Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining, ASONAM '10, pages 152-159, Washington, DC, USA, 2010.
37. T. Zhou, L. Lü, and Y.-C. Zhang. Predicting missing links via local information. The European Physical Journal B, 71(4):623-630, 2009.