Frequent pattern-growth approach for document organization

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 77-82

  Akbar, Monika ^a   Angryk, Rafal A ^b  

^a Virginia Polytechnic Institute and State University   (United States)

^b Idaho National Laboratory   (United States)

Author keywords

Clustering; Document graph; FP growth; Frequent subgraph clustering; Graph mining; WordNet

Indexed keywords

CLUSTERING; DOCUMENT-GRAPH; FP-GROWTH; FREQUENT SUBGRAPH CLUSTERING; GRAPH MINING; WORDNET;

ASSOCIATIVE PROCESSING; INFORMATION SYSTEMS; KNOWLEDGE MANAGEMENT; MINING; MULTI AGENT SYSTEMS; ONTOLOGY; SEMANTIC WEB; SEMANTICS;

SECURITY OF DATA;

EID: 70349434052     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458484.1458496     Document Type: Conference Paper

References (15)

1. Lewis, D., "Naive (Bayes) at Forty: The Independence Assumption in Information Retrieval", 10th European Conference on Machine Learning, Chemnitz, DE: Springer Verlag, Heidelberg, DE, (1998), 4-15.
2. Agrawal, R., and Swami, T. I., "Mining Association Rules between sets of items in large databases", Proc. Of ACM SIGMOD, (1993), 207-216.
3. Han, J., Pei, J., and Yin, Y., "Mining frequent patterns without candidate generation" Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data, Dallas, TX, (2000), 1-12.
4. Han, J., and Kamber, M., "Data Mining: Concepts and Techniques", 2nd edition, ISBN 9781558609013.
5. Agrawal, R. and Srikant, R., "Fast Algorithms for Mining Association Rules", Proc. of the 20th Int'l Conference on Very Large Databases, Santiago, Chile, (September 1994), 487-499.
6. Kuramochi, M., and Karypis, G., "An efficient algorithm for discovering frequent subgraphs", IEEE Trans. on KDE, 16, 9 (2004), 1038-1051.
7. Yan, X., and Han, J., "gSpan, Graph-Based Substructure Pattern Mining", Proc. IEEE Int'l Conf. on Data Mining ICDM, Maebashi City, Japan, (November 2002), 721-723.
8. Cohen, M., and Gudes, E., "Diagonally subgraphs pattern mining", Workshop on Research Issues on Data Mining and Knowledge Discovery proceedings, (2004), 51-58.
9. Ketkar, N., Holder, L., Cook, D., Shah, R., and Coble, J. "Subdue: Compression-based Frequent Pattern Discovery in Graph Data", ACM KDD Workshop on Open-Source Data Mining, (August 2005), 71-76.
10. http://www.wordnet.princeton.edu
11. Hossain , M. S., and Angryk, R. A., "GDClust: A Graph-Based Document Clustering Technique", IEEE ICDM Workshop on Mining Graphs and Complex Structures, USA, (2007), 417-422.
12. Tan , P., Steinbach, M. and Kumar, V., " Introduction to Data Mining", 1st edition, ISBN: 9780321321367, Addison-Wesley, (2005).
13. Salton, G., "Automatic Text Processing", Addison-Wesley Publishing Company, 1988.
14. Kaufman, L. and Rousseeuw, P. J., "Finding Groups in Data: an Introduction to Cluster Analysis", John Wiley & Sons, (1990).
15. http://people.csail.mit.edu/jrennie/20Newsgroups