A Diffusion of Innovation-based closeness measure for network associations

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 381-388

  Khorasgani, Reihaneh Rabbany ^a   Zaïane, Osmar R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Closeness measure; Community mining; Social network analysis

Indexed keywords

BIBLIOMETRICS; CALL GRAPHS; CELL PHONE; CLOSENESS MEASURE; COAUTHORSHIP; COMMUNITY DETECTION; COMMUNITY MINING; DIFFUSION OF INNOVATIONS; INFORMATION NETWORKS; NETWORK NODE; SOCIAL NETWORK ANALYSIS;

HUMAN COMPUTER INTERACTION; INFORMATION SERVICES; SOCIAL NETWORKING (ONLINE);

DATA MINING;

EID: 84857170245     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2011.12     Document Type: Conference Paper

References (31)

1. S. Gregory, "An algorithm to find overlapping community structure in networks," in Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), 2007, pp. 91-102.
2. X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger, "Scan: a structural clustering algorithm for networks," in ACM SIGKDD, 2007, pp. 824-833.
3. A. K. Jain, M. N. Murty, and P. J. Flynn, "Data clustering: a review," ACM Computing Surveys, vol. 31, no. 3, pp. 264- 323, September 1999.
4. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group formation in large social networks: membership, growth, and evolution," in ACM SIGKDD, 2006.
5. R. Rabbany Khorasgani, J. Chen, and O. R. Zaiane, "Top leaders community detection approach in information networks," in 4th SNA-KDD Workshop on Social Network Mining and Analysis, 2010.
6. M. E. J. Newman, "Detecting community structure in networks," Eur. Phys. J.B, vol. 38, pp. 321-330, 2004.
7. -, "Modularity and community structure in networks," Proceedings of the National Academy of Sciences, vol. 103, 2006.
8. A. Ng, M. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in NIPS, 2001, pp. 849-856.
9. P. Chan, M. D. F. Schlag, and J. Y. Zien, "Spectral k-way ratio-cut partitioning and clustering," in Proceedings of the 30th International Conference on Design Automation, 1993, pp. 749-754.
10. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE. Trans. on Pattern Analysis and Machine Intelligence, 2000.
11. C. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, "A minmax cut algorithm for graph partitioning and data clustering," in ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining, 2001, pp. 107-114.
12. J. Scott, "Social network analysis: A handbook," Sage, London 2nd edition(2000).
13. J. Chen, O. R. Zaïane, and R. Goebel, "Detecting communities in social networks using max-min modularity," in SIAM Data Mining Conference, 2009.
14. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Phys. Rev. E, vol. 70, p. 066111, 2004.
15. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks," Proceedings of the National Academy of Sciences of the USA, 2002.
16. R. Guimera, M. Sales-pardo, and L. A. N. Amaral, "Modularity from fluctuations in random graphs and complex networks," Phys. Rev. E, vol. 70, p. 025101, 2004.
17. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, 2004.
18. V. Nicosia, G. Mangioni, V. Carchiolo, and M. Malgeri, "Extending modularity definition for directed graphs with overlapping communities," 2008. [Online]. Available: http: //arxiv.org/abs/0801.1647
19. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas, "Comparing community structure identification," J. Stat. Mech, p. P09008, 2005.
20. D. Strang and S. Sarah A, "Diffusion in organizations and social movements: From hybrid corn to poison pills," Annual Review of Sociology, vol. 24, no. 1, pp. 265-290, 1998.
21. P. Sarkar and A. Moore, "Dynamic social network analysis using latent space models," ACM SIGKDD Explorations: Special Edition on Link Mining, vol. 7, no. 2, pp. 31-40, 2005.
22. L. Getoor and C. P. Diehl, "Link mining: a survey," ACM SIGKDD Explorations, 2005.
23. S. Milgram, "The small world problem," Psychology Today, vol. 1, no. 1, pp. 60-67, 1967.
24. J. M. Santos and M. Embrechts, "On the use of the adjusted rand index as a metric for evaluating supervised classification," in ICANN (2), 2009, pp. 175-184.
25. A. Lancichinetti and S. Fortunato, "Community detection algorithms: A comparative analysis," Phys. Rev. E, vol. 80, no. 5, p. 056117, Nov 2009.
26. W. W. Zachary, "An information flow model for conflict and fission in small groups," Journal of Anthropological Research, vol. 33, pp. 452-473, 1977.
27. Pajek, "http://vlado.fmf.uni-lj.si/pub/networks/pajek/."
28. V. Krebs, "Books about us politics," http://www.orgnet.com/.
29. A. Lancichinetti, S. Fortunato, and F. Radicchi, "Benchmark graphs for testing community detection algorithms," Physical Review E, vol. 78, p. 046110, 2008.
30. S. Fortunato, "Community detection in graphs," Physics Reports, vol. 486, no. 3-5, 2010.
31. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, pp. 814-818, 2005.