A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering

Tsau Young Lin, I. Jen Chiang

Research output: Contribution to journalArticlepeer-review

37 Citations (Scopus)

Abstract

This paper presents a novel approach to document clustering based on some geometric structure in Combinatorial Topology. Given a set of documents, the set of associations among frequently co-occurring terms in documents forms naturally a simplicial complex. Our general thesis is each connected component of this simplicial complex represents a concept in the collection. Based on these concepts, documents can be clustered into meaningful classes. However, in this paper, we attack a softer notion, instead of connected components, we use maximal simplexes of highest dimension as representative of connected components, the concept so defined is called maximal primitive concepts. Experiments with three different data sets from Web pages and medical literature have shown that the proposed unsupervised clustering approach performs significantly better than traditional clustering algorithms, such as k-means, AutoClass and Hierarchical Clustering (HAG). This abstract geometric model seems have captured the latent semantic structure of documents.

Original languageEnglish
Pages (from-to)55-80
Number of pages26
JournalInternational Journal of Approximate Reasoning
Volume40
Issue number1-2
DOIs
Publication statusPublished - Jul 2005

Keywords

  • Association rules
  • Document clustering
  • Hierarchical clustering
  • Simplicial complex
  • Topology

ASJC Scopus subject areas

  • Statistics and Probability
  • Electrical and Electronic Engineering
  • Statistics, Probability and Uncertainty
  • Information Systems and Management
  • Information Systems
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering'. Together they form a unique fingerprint.

Cite this