GDClust: A Graph-Based Document Clustering technique

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 417-422

  Hossain, M Shahriar ^a   Angryk, Rafal A ^a  

^a Montana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; CHLORINE COMPOUNDS; DATA MINING; DECISION SUPPORT SYSTEMS; FLOW OF SOLIDS; GRAPH THEORY; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; KNOWLEDGE MANAGEMENT; MINING; MINING ENGINEERING; ONTOLOGY; SEARCH ENGINES;

A-PRIORI; AUTOMATED SYSTEMS; DOCUMENT CLUSTERING; ENGLISH LANGUAGES; FREQUENT SUBGRAPHS; GAUSSIAN; GRAPH-BASED; HIERARCHICAL DOCUMENT; HUMAN INTERACTIONS; INTERNATIONAL CONFERENCES; MINIMUM SUPPORT; SUB GRAPHS; TEXT DOCUMENTS; TEXT MINING TECHNIQUES;

CLUSTER ANALYSIS;

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

References (27)

1. Miller G.A. and Charles W.G., "Contextual Correlates of Semantic Similarity", Language and Cognitive Processes, vol. 6(1), 1991, pp. 1-28.
2. F. Sebastiani, "Machine learning in automated text categorization", ACM Comp. Surveys, vol. 34(1), 2002, pp. 1-47.
3. C. D. Manning and H. Schutze, "Foundations of Natural Language Processing", MIT Press, 1999.
4. C. Cleverdon, "Optimizing convenient online access to bibliographic databases", Inf. Survey and Use, vol. 4(1), 1984, pp. 37-47.
5. S. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman, "Indexing by latent semantic analysis", Journal of the Society for Inf. Science, vol. 41(6), 1990, pp. 391-407.
6. M. Kuramochi and G. Karypis, "An efficient algorithm for discovering frequent subgraphs", IEEE Trans. on KDE, vol. 16(9), 2004, pp.1038-1051.
7. R. N. Chittimoori, L. B. Holder, and D. J. Cook, "Applying the SUBDUE substructure discovery system to the chemical toxicity domain", Proc. of the 12th Intl. FLAIRS Conf., 1999, pp. 90-94.
8. D. A. L. Piriyakumar, and P. Levi, "An efficient A* based algorithm for optimal graph matching applied to computer vision", GRWSIA-98, Munich, 1998.
9. D. Dupplaw and P. H. Lewis, "Content-based image retrieval with scale-spaced object trees", Proc. of SPIE: Storage and Retrieval for Media Databases, vol. 3972, 2000, pp. 253-261.
10. M. E. J. Newman, "The structure and function of complex networks", SIAM Review, vol. 45(2), 2003, pp. 167-256.
11. K. Yoshida and H. Motoda, "CLIP: Concept learning from inference patterns", Artificial Intelligence, vol. 75(1), 1995, pp. 63-92.
12. X. Yan and J. Han, "gSpan: graph-based substructure pattern mining", Proc. of IEEE ICDM, 2002, pp. 721-724.
13. C. Moti and G. Ehud, "Diagonally Subgraphs Pattern Mining", Proc. of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, 2004, pp. 51-58.
14. N. Ketkar, L. Holder, D. Cook, R. Shah and J. Coble, "Subdue: Compression-based Frequent Pattern Discovery in Graph Data", Proc. of the ACM KDD Workshop on Open-Source Data Mining, August 2005, pp. 71-76.
15. J. Tomita, and G. Kikui, "Interactive Web search by graphical query refinement", Proc. of the 10th Intl. WWW Conf, 2001, pp. 190-191.
16. A. McCallum, "Bow: A Toolkit for Statistical Language Modeling, Text Retrieval, Classification and Clustering", http://www.cs.cmu.edu/ ∼mccallum/bow/
17. nd Edition, Morgan Kaufmann Pub., 2006, pp. 234-242.
18. R. Agrawal, and R. Srikant, "Fast Algorithms for Mining Association Rules", Proc. of Intl. Conf. on VLDB, Santiago, Chile, 1994, pp. 487-499.
19. R. Agrawal, M. Mehta, J. Shafer, R. Srikant, A. Arning, and T. Bollinger, "The Quest Data Mining System", Proc. of KDD'96, USA, 1996, pp. 244-249.
20. H. Mannila, H. Toivonen, and I. Verkamo, "Efficient Algorithms for Discovering Association Rules", Proc. of AAAI Workshop on Knowledge Discovery in Databases, Seattle, Washington, USA, 1994, pp. 181-192.
21. J. S. Park, M. S. Chen, P. S. Yu, "An effective hash-based algorithm for mining association rules", Proc. of the ACM SIGMOD'95, San Jose, CA, USA, 1995, pp. 175-186.
22. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An Efficient Data Clustering Method for Very Large Databases", Proc. of ACM SIGMOD'96, Quebec, Canada, 1996, pp. 103-114.
23. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang, "Finding interesting associations without support pruning", IEEE Trans. on KDE, vol. 13(1), 2001, pp. 64-78.
24. F. Lin, C. M. Hsueh, "Knowledge map creation and maintenance for virtual communities of practice", Intl. Journal of Inf. Processing and Management, ACM, vol. 42(2), 2006, pp. 551-568.
25. P. N. Tan, M. Steinbachm, V. Kumar, Introduction to data mining, Addison-Wesley, 2005, pp. 539-547.
26. th Intl. Conf. on VLDB, Switzerland, 1995. pp. 420-431.
27. "20 News Groups Dataset", http://people.csail.mit.edu/jrennie/ 20Newsgroups/