Graph building as a mining activity: Finding links in the small

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 17-24

  Badia, Antonio ^a   Kantardzic, Mehmed ^a  

^a University of Louisville   (United States)

Author keywords

Graph algorithms; Link analysis; Network

Indexed keywords

DATA MINING; NETWORKS (CIRCUITS);

ANALYSIS OF DATA; BUILDING PROCESS; DATA SET; GRAPH ALGORITHMS; LINK ANALYSIS; MINING ACTIVITIES;

GRAPH THEORY;

EID: 42549128022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1134271.1134274     Document Type: Conference Paper

References (23)

1. Enron data set. available at http://www-2.cs.cmu.edu/Enron/.
2. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
3. R. Belew. Finding Out About. Cambridge University Press, 2000.
4. A. Borgida. Knowledge representation, semantic modeling: Similarities and differences. In Proceedings of the 9th International Conference on Entity-Relationship Approach, 1990. Keynote address.
5. S. Chakrabarty and C. Faloutsos. Graph structures in data mining. Tutorial in the SIGKDD 2004 Conference.
6. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding interesting associations without support pruning. In Proceedings of the 16th International Conference on Data Engineering (ICDE). IEEE Computer Society, 2000.
7. D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32-41, 2000.
8. P. Domingos. Multi-relational record linkage. In Proceedings of the KDD-2004 Workshop on Multi-Relational Data Mining. ACM Press, 2004.
9. G. Hue and et al. Implicit link analysis for small web search. In Proceedings of SIGIR-03, 2003.
10. F. Hussain, H. Liu, E. Suzuki, and H. Lu. Exception rule mining and with relative interestingness measure. In Proceedings of the Knowledge Discovery and Data Mining, Current Issues and New Applications, 4th Pacific-Asia Conference (PADKK), number 1805 in Lecture Notes in Computer Science. Springer, 2000.
11. S. Imberman, B. Domanski, and H. W. Thompson. Using dependency/association rules to find indications of computarized tomography in a head trauma dataset. Artificial Intelligence in Medicine, 26(1-2), September-October 2002. Elsevier.
12. S. Jaroszewicz and D. Simovici. A general measure of rule interestingness. In Proceedings of Principles of Data Mining and Knowledge Discovery, 5th European Conference (PKDD), number 2168 in Lecture Notes in Computer Science. Springer, 2001.
13. S. Jaroszewicz and D. Simovici. Interestingness of frequent itemsets using bayesian networks as background knowledge. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, 2004.
14. T. Johnson and T. Dasu. Data quality and data cleaning: An overview. Tutorial in the 2003 ACM SIGMOD Conference.
15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
16. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. Technical report, Department of Computer Science, University of Minnesota, 2002.
17. S. Lin and H. Chalupsky. Unsupervised link discovery in multi-relational data via rarity analysis. In Proceedings of ICDM, 2003.
18. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1999.
19. D. B. Skillicorn. Detecting related message traffic. In Workshop on Link Analysis, Counterterrorism, and Privacy, SIAM ICDM, 2004.
20. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proceedings of the Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (SIGKDD). ACM Press, 2002.
21. B. Thalheim. Entity-Relationship Modeling. Springer-Verlag, 2000.
22. A. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.
23. S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.