Concept Mining using Association Rules and Combinatorial Topology

@inproceedings{citeulike:2427671, abstract = {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 occurence 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.}, author = {Sutojo, Albert }, booktitle = {Granular Computing, 2007. GRC 2007. IEEE International Conference on}, citeulike-article-id = {2427671}, doi = {10.1109/GRC.2007.4403129}, journal = {Granular Computing, 2007. GRC 2007. IEEE International Conference on}, keywords = {concept, mining}, pages = {387}, posted-at = {2008-02-26 00:49:02}, priority = {2}, title = {Concept Mining using Association Rules and Combinatorial Topology}, url = {http://dx.doi.org/10.1109/GRC.2007.4403129}, year = {2007} }

TY - CONF ID - citeulike:2427671 L3 - citeulike-article-id:2427671 TI - Concept Mining using Association Rules and Combinatorial Topology T2 - Granular Computing, 2007. GRC 2007. IEEE International Conference on JF - Granular Computing, 2007. GRC 2007. IEEE International Conference on SP - 387 EP - 387 N2 - 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 occurence 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. KW - concept KW - mining AU - Sutojo, Albert PY - 2007/// UR - http://dx.doi.org/10.1109/GRC.2007.4403129 ER -