Automatic document clustering of concept hypergraph decompositions

Tsau Young Lin, I-Jen Chiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsB.V. Dasarathy
Pages168-177
Number of pages10
Volume5433
DOIs
Publication statusPublished - 2004
EventData Mining and Knowledge Discovery: Theory, Tools, and Technology VI - Orlando, FL, United States
Duration: Apr 12 2004Apr 13 2004

Other

OtherData Mining and Knowledge Discovery: Theory, Tools, and Technology VI
CountryUnited States
CityOrlando, FL
Period4/12/044/13/04

Fingerprint

Association rules
Clustering algorithms
Decomposition
decomposition

Keywords

  • Association rules
  • Document clustering
  • Hypergraph partition

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Lin, T. Y., & Chiang, I-J. (2004). Automatic document clustering of concept hypergraph decompositions. In B. V. Dasarathy (Ed.), Proceedings of SPIE - The International Society for Optical Engineering (Vol. 5433, pp. 168-177) https://doi.org/10.1117/12.543817

Automatic document clustering of concept hypergraph decompositions. / Lin, Tsau Young; Chiang, I-Jen.

Proceedings of SPIE - The International Society for Optical Engineering. ed. / B.V. Dasarathy. Vol. 5433 2004. p. 168-177.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, TY & Chiang, I-J 2004, Automatic document clustering of concept hypergraph decompositions. in BV Dasarathy (ed.), Proceedings of SPIE - The International Society for Optical Engineering. vol. 5433, pp. 168-177, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI, Orlando, FL, United States, 4/12/04. https://doi.org/10.1117/12.543817
Lin TY, Chiang I-J. Automatic document clustering of concept hypergraph decompositions. In Dasarathy BV, editor, Proceedings of SPIE - The International Society for Optical Engineering. Vol. 5433. 2004. p. 168-177 https://doi.org/10.1117/12.543817
Lin, Tsau Young ; Chiang, I-Jen. / Automatic document clustering of concept hypergraph decompositions. Proceedings of SPIE - The International Society for Optical Engineering. editor / B.V. Dasarathy. Vol. 5433 2004. pp. 168-177
@inproceedings{62b9129602fb4767803776be8ed5b68e,
title = "Automatic document clustering of concept hypergraph decompositions",
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.",
keywords = "Association rules, Document clustering, Hypergraph partition",
author = "Lin, {Tsau Young} and I-Jen Chiang",
year = "2004",
doi = "10.1117/12.543817",
language = "English",
volume = "5433",
pages = "168--177",
editor = "B.V. Dasarathy",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - Automatic document clustering of concept hypergraph decompositions

AU - Lin, Tsau Young

AU - Chiang, I-Jen

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Association rules

KW - Document clustering

KW - Hypergraph partition

UR - http://www.scopus.com/inward/record.url?scp=3543147684&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3543147684&partnerID=8YFLogxK

U2 - 10.1117/12.543817

DO - 10.1117/12.543817

M3 - Conference contribution

AN - SCOPUS:3543147684

VL - 5433

SP - 168

EP - 177

BT - Proceedings of SPIE - The International Society for Optical Engineering

A2 - Dasarathy, B.V.

ER -