Clustering validity checking methods: part II
ACM SIGMOD Record
A Knowledge-Oriented Clustering Technique Based on Rough Sets
COMPSAC '01 Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development
A Method of Web Search Result Clustering Based on Rough Sets
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Some refinements of rough k-means clustering
Pattern Recognition
Rough set Based Ensemble Classifier forWeb Page Classification
Fundamenta Informaticae
Hierarchical Adaptive Clustering
Informatica
Rough Cluster Quality Index Based on Decision Theory
IEEE Transactions on Knowledge and Data Engineering
A Novel Possibilistic Fuzzy Leader Clustering Algorithm
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Decision-theoretic rough set models
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Attribute reduction in decision-theoretic rough set model: a further investigation
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Cost-Sensitive classification based on decision-theoretic rough set model
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
A Multiple-category Classification Approach with Decision-theoretic Rough Sets
Fundamenta Informaticae - Rough Sets and Knowledge Technology (RSKT 2010)
Hi-index | 0.00 |
This paper processes an autonomous knowledge-oriented clustering method based on the decision-theoretic rough set theory model. In order to get the initial clustering of knowledge-oriented clusterings, the threshold values are produced autonomously in view of physics theory in this paper rather than are subjected by human intervention. Furthermore, this paper proposes a cluster validity index based on the decision-theoretic rough set theory model by considering various loss functions. Experiments with synthetic and standard data show that the novel method is not only helpful to select a termination point of the clustering algorithm, but also is useful to cluster the overlapped boundaries which is common in many data mining applications.