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.
|主出版物標題||Proceedings of SPIE - The International Society for Optical Engineering|
|出版狀態||已發佈 - 2004|
|事件||Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI - Orlando, FL, 美国|
持續時間: 4月 12 2004 → 4月 13 2004
|其他||Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI|
|期間||4/12/04 → 4/13/04|
ASJC Scopus subject areas