Automatic document clustering of concept hypergraph decompositions

Tsau Young Lin; I-Jen Chiang

doi:10.1117/12.543817

12 April 2004 Automatic document clustering of concept hypergraph decompositions

Tsau Young Lin, I-Jen Chiang

Proceedings Volume 5433, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI; (2004) https://doi.org/10.1117/12.543817
Event: Defense and Security, 2004, Orlando, Florida, United States

Abstract

This paper presents an approach to classify/cluster the web documents by decompositions of hypergraphs. The various levels of co-occurring frequent terms, called association rules (undirected rules), of documents form a hypergraph. Clustering methods is then applied to analyze such hypergraphs; a simple and fast clustering algorithm is used to decomposing hypergraph into connected components. Each connected component represents a primitive concept within the given documents. The documents will then be classified/clustered by such primitive concepts.

Citation Download Citation

Tsau Young Lin and I-Jen Chiang "Automatic document clustering of concept hypergraph decompositions", Proc. SPIE 5433, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI, (12 April 2004); https://doi.org/10.1117/12.543817

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available