skip to main content
10.1145/1458484.1458496acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Frequent pattern-growth approach for document organization

Published: 30 October 2008 Publication History

Abstract

In this paper, we propose a document clustering mechanism that depends on the appearance of frequent senses in the documents rather than on the co-occurrence of frequent keywords. Instead of representing each document as a collection of keywords, we use a document-graph which reflects a conceptual hierarchy of keywords related to that document. We incorporate a graph mining approach with one of the well-known association rule mining procedures, FP-growth, to discover the frequent subgraphs among the document-graphs. The similarity of the documents is measured in terms of the number of frequent subgraphs appearing in the corresponding document-graphs. We believe that our novel approach allows us to cluster the documents based more on their senses rather than the actual keywords.

References

[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

Cited By

View all

Index Terms

  1. Frequent pattern-growth approach for document organization

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ONISW '08: Proceedings of the 2nd international workshop on Ontologies and information systems for the semantic web
    October 2008
    124 pages
    ISBN:9781605582559
    DOI:10.1145/1458484
    • General Chair:
    • Ramez Elmasri,
    • Program Chairs:
    • Martin Doerr,
    • Mathias Brochhausen,
    • Hyoil Han
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 October 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. FP-growth
    2. WordNet
    3. clustering
    4. document-graph
    5. frequent subgraph clustering
    6. graph mining

    Qualifiers

    • Research-article

    Conference

    CIKM08
    CIKM08: Conference on Information and Knowledge Management
    October 30, 2008
    California, Napa Valley, USA

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Association AnalysisData Science10.1016/B978-0-12-814761-0.00006-X(199-220)Online publication date: 2019
    • (2015)Association AnalysisPredictive Analytics and Data Mining10.1016/B978-0-12-801460-8.00006-9(195-216)Online publication date: 2015
    • (2013)Abstracting for Dimensionality Reduction in Text ClassificationInternational Journal of Intelligent Systems10.1002/int.2154328:2(115-138)Online publication date: 1-Feb-2013
    • (2010)Diagnosing memory leaks using graph mining on heap dumpsProceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/1835804.1835822(115-124)Online publication date: 25-Jul-2010

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media