20072007 IEEE International Conference on Granular Computing (GRC 2007)Requires access

Concept Mining using Association Rules and Combinatorial Topology

Albert Sutojo

Open publisher page 2 citations

Abstract

The collection of concepts in a document set can be represented by a geometric structure called simplicial complex of combinatorial topology where each keyword is represented as a vertex and the relation between keywords as simplex. A simplex which consists of more than one keyword is a high-frequency keywordset. These keywords occur close to each other within a document which also occur frequently within a set of documents. The high frequent occurrence of these keywords shows relations between keywords. These relations carry concepts. The relations of these keywords can be captured by association rule mining and represented as simplices. The collection of all these simplices, represents the structure of concepts within a document set. Based on this topology, documents are clustered and the collection of simplices can serve as document index.

About this research paper

What this paper is about

The collection of concepts in a document set can be represented by a geometric structure called simplicial complex of combinatorial topology where each keyword is represented as a vertex and the relation between keywords as simplex. A simplex which consists of more than one keyword is a high-frequency keywordset. These keywords occur close to each other within a document which also occur frequently within a set of documents. The high frequent occurrence of these keywords shows relations between keywords. These relations carry concepts. The relations of these keywords can be captured by association rule mining and represented as simplices. The collection of all these simplices, represents the structure of concepts within a document set. Based on this topology, documents are clustered and the collection of simplices can serve as document index.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The collection of concepts in a document set can be represented by a geometric structure called simplicial complex of combinatorial topology where each keyword is represented as a vertex and the relation between keywords as simplex. A simplex which consists of more than one keyword is a high-frequency keywordset. These keywords occur close to each other within a document which also occur frequently within a set of documents. The high frequent occurrence of these keywords shows relations between keywords. These relations carry concepts. The relations of these keywords can be captured by association rule mining and represented as simplices. The collection of all these simplices, represents the structure of concepts within a document set. Based on this topology, documents are clustered and the collection of simplices can serve as document index.

Key concepts: Simplex, Computer science, Relation (database), Vertex (graph theory), Set (abstract data type), Association rule learning, Topology (electrical circuits), Simplicial complex

Related papers

Back to paper searchBrowse research topicsOriginal source
Concept Mining using Association Rules and Combinatorial Topology — Research Paper | ScholarLens