Automatic document clustering of concept hypergraph decompositions

Tsau Young Lin, I-Jen Chiang

研究成果: 書貢獻/報告類型會議貢獻

3 引文 斯高帕斯(Scopus)

摘要

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
編輯B.V. Dasarathy
頁面168-177
頁數10
5433
DOIs
出版狀態已發佈 - 2004
事件Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI - Orlando, FL, 美国
持續時間: 四月 12 2004四月 13 2004

其他

其他Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI
國家美国
城市Orlando, FL
期間4/12/044/13/04

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

指紋 深入研究「Automatic document clustering of concept hypergraph decompositions」主題。共同形成了獨特的指紋。

引用此