Discovering important nodes through graph entropy the case of enron email database

3rd International Workshop on Link Discovery, LinkKDD 2005 - in conjunction with 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 74-81

  Shetty, Jitesh ^a   Adibi, Jafar ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Entropy; Link Discovery

Indexed keywords

ELECTRONIC MAIL; ENTROPY; GRAPH THEORY; INFORMATION THEORY; NATURAL LANGUAGE PROCESSING SYSTEMS;

ENTROPY MODEL; GRAPH ENTROPY; LINK DISCOVERY; NATURAL LANGUAGE PROCESSING; ORGANIZATIONAL STRUCTURES; STATISTICAL TECHNIQUES; TEXT MINING; THEORETIC MODEL;

DATA MINING;

EID: 84958155918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1134271.1134282     Document Type: Conference Paper

References (20)

1. L. Adamic and B. Huberman. Information dynamics in a networked world. Lecture Notes in Physics. Springer, 2003.
2. S. Borgatti and R. Chase. Net Draw. http://www.analytictech.com/, 2004.
3. S. Borgatti. Identifying sets of key players in a network. In Computational, Mathematical and Organizational Theory., 2005.
4. H. Buhrman, M. Li, J. Tromp, and P. Vitnyi. Kolmogorov random graphs and the incompressibility method. SIAM Journal on Computing, 29(2):590-599, 2000.
5. C. Faloutsos, K. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In Proceedings of the tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2004.
6. J. D. Farley. Breaking al qaeda cells: A mathematical analysis of counterterrorism operations (a guide for risk assessment and decision making). Studies in Conflict & Terrorism, 26:399411, 2003.
7. L. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1:215-239, 1979.
8. L. Getoor, E. Segal, B. Taskar, and D. Koller. Probabilistic models of text and link structure for hypertext classification. In IJCAI01 Workshop on Text Learning: Beyond Supervision, Seattle, Washington, 2001.
9. B. Huberman and W. Fang. Discovering communities in linear time: a physics approach. In KDD. ACM, 2004.
10. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence in a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
11. J. Kieffer and E. Yang. Ergodic behavior of graph entropy. ERA American Mathematical Society, 3(1):11-16, 1997.
12. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of ACM, 46, number =, 1999.
13. J. Korner. Bounds and information theory. SIAM Journal on Algorithms and Discrete Mathematics, (7):560-570, 1986.
14. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer Verlag, 1997.
15. M. Newman. Who is the best connected scientist? a study of scientific coauthorship networks. In E. Ben-Naim, H. Frauenfelder, and Z. Toroczkai, editors, Complex Networks, pages 337-370. Springer, 2004.
16. C. Nobel and D. J. Cook. Graph-based anomaly detection. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
17. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: bringing order to the web. Technical report, Stanford, 1998.
18. T. Senator. Evidence extraction and link discovery. 2002.
19. J. Shetty and J. Adibi. Enron email dataset. Technical report, USC Information Sciences Institute, http://www.isi.edu/adibi/Enron/Enron.htm, 2004.
20. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In ACM SIGKDD international conference on Knowledge discovery and data mining, pages 266-275, 2003.