2007 IEEE International Conference on Granular Computing (GRC 2007) Concept Mining Using Association Rule and Combinatorial Topology San Jose, California November 02-November 04 ISBN: 0-7695-3032-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GrC.2007.135
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.
Citation:
Albert Sutojo, "Concept Mining Using Association Rule and Combinatorial Topology," grc, pp.341, 2007 IEEE International Conference on Granular Computing (GRC 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||