Approximation Theories: Granular Computing vs Rough Sets
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Knowledge Based Search Engine: Granular Computing on the Web
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Unifying Rough Set Theories via Large Scaled Granular Computing
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
The collection of the concepts that are discussed in a document set can be represented by a geometric structure, called simplical complex, of combinatorial topology. A simplex is a high-frequency keywordset that co-occurs closely which, we believe, carries a concept in the document set. The collection of all these simplexes that forms the simplical complex represents the structure of these concepts. Based on the topological structure of this complex, the documents are clustered. Several clustering schemes are presented. Our initial experiments, as expected, do support the theory.