ACM Computing Surveys (CSUR)
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Applying Knowledge Discovery to Predict Infectious Disease Epidemics
PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science)
Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science)
Hi-index | 0.00 |
Usual clustering algorithms just generate general description of the clusters like which entities are member of each cluster and lacks in generating cluster description in the form of pattern. Pattern is defined as a logical statement describing a cluster structure in terms of relevant attributes. In the proposed approach reduct from rough set theory is employed to generate pattern. Reduct is defined as the set of attributes which distinguishes the entities in a homogenous cluster, therefore these can be clear cut removed from the same. Remaining attributes are ranked for their contribution in the cluster. Cluster description is then formed by conjunction of most contributing attributes. Proposed approach is demonstrated using benchmarking mushroom dataset from UCI repository.