Cluster ranking with an application to mining mailbox networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 63-74

  Bar Yossef, Ziv ^a   Guy, Ido ^b   Lempel, Ronny ^c   Maaren, Yoëlle S ^a   Soroka, Vladimir ^c  

^a Google Inc   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY WEIGHTED NETWORKS; CLUSTER RANKING ALGORITHM; EGOCENTRIC SOCIAL NETWORK; EMPIRICAL ANALYSIS; MAILBOX NETWORKS; MESSAGE HEADERS;

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA MINING;

CLUSTER ANALYSIS;

EID: 77956224601     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.35     Document Type: Conference Paper

References (35)

1. E. Amir, R. Krauthgamer, and S. Rao. Constant factor approximation of vertex-cuts in planar graphs. In Proc. 35th STOC, pages 90-99, 2003.
2. A. Banerjee, C. Krumpelman, J. Ghosh, S. Basu, and R. J. Mooney. Model-based overlapping clustering. In Proc. 11th KDD, pages 532-537, 2005.
3. J. D. Banfield and A. E. Raftery. Model-based guassian and non-gaussian clustering. Biometrics, 49:803-821, 1993.
4. J. Baumes, M. K. Goldberg, and M. Magdon-Ismail. Efficient identification of overlapping communities. In Proc. ISI, pages 27-36, 2005.
5. P. O. Boykin and V. Roychowdhury. Personal email networks: An effective anti-spam tool. IEEE Comp., 38:61-68, 2005.
6. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters, 42:153-159, 1992.
7. G. Cleuziou, L. Martin, and C. Vrain. PoBOC: An overlapping clustering algorithm, application to rule-based classification and textual data. In 16th ECAI, pages 440-444, 2004.
8. D. Fasulo. An analysis of recent work on clustering algorithms. Technical Report 01-03-02, Department of Computer Science and Engineering, University of Washington, 1999.
9. U. Feige, M. Hajiaghayi, and J. R. Lee. Improved approximation algorithms for minimum-weight vertex separators. In Proc. 37th STOC, pages 563-572, 2005.
10. D. Fisher. Using egocentric networks to understand communication. IEEE Internet Computing, 9(5):20-28, 2005.
11. D. Fisher and P. Dourish. Social and temporal structures in everyday collaboration. In Proc. CHI, pages 551-558, 2004.
12. G. W. Flake, S. Lawrence, and C L. Giles. Efficient identification of Web communities. In Proc. 6th SIGKDD, pages 150-160, 2000.
13. G. W. Flake, S. Lawrence, C L. Giles, and F. Coetzee. Self-organization and identification of web communities. IEEE Computer, 35(3):66-71, 2002.
14. L. C. Freeman. The Development of Social Network Analysis: A study in the Sociology of Science. Empirical Press, 2004.
15. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99:7821-7826, 2002.
16. F. Höppner, F. Klawonn, R. Kruse, and T. Runkler. Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition. Wiley & Sons, 1999.
17. H. Ino, M. Kudo, and A. Nakamura. Partitioning of Web graphs by community topology. In Proc. 14th WWW, pages 661-669, 2005.
18. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1988.
19. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. JACM, 51(3):497-515, 2004.
20. J. M. Kleinberg. An impossibility theorem for clustering. In Proc. 15th NIPS, pages 446-453, 2002.
21. B. Klimt and Y. Yang. The enron corpus: A new dataset for email classification research. In Proc. ECML, pages 217-226, 2004.
22. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. In Proc. 8th WWW, pages 1481-1493, 1999.
23. T. Leighton and S. Rao. Multicommodity max-flow mincut theorems and their use in designing approximation algorithms. JACM, 46(6):787-832, 1999.
24. A. McCallum, A. Corrada-Emmanuel, and X. Wang. Topic and role discovery in social networks. In Proc. 19th IJCAI, pages 786-791, 2005.
25. M. E. J. Newman. Analysis of weighted networks. Phyical Review E, 70(056131), 2004.
26. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phyical Review E, 69(026113), 2004.
27. G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814-818, 2005.
28. F. C. N. Pereira, N. Tishby, and L. Lee. Distributional clustering of english words. In 31st ACL, pages 183-190, 1993.
29. J. Scott. Social Network Analysis: A Handbook. Sage, 1991.
30. E. Segal, A. Battle, and D. Koller. Decomposing gene expression into cellular processes. In Proc. 8th PSB, pages 89-100, 2003.
31. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
32. N. Slonim. The Information Bottleneck: Theory and Applications. PhD thesis, Hebrew University, 2002.
33. J. Tyler, D. Wilkinson, and B. A. Huberman. Email as spectroscopy: Automated discovery of community structure within organizations. In Proc. 1st C&T, pages 81-96, 2003.
34. S. M. van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.
35. B. Wellman. An egocentric network tale. Social Networks, 15:423-436, 1993.