Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Data Clustering Algorithms for Information Systems
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
| Hi-index | 0.00 |
Refinement properties that means each cluster of a method is included in another cluster of another method in agglomerative clustering which was proposed by Miyamoto are further studied. Although we have simple conditions so that a method generates refinements of clusters of the single linkage method, whether or not generalizations hold when the single linkage is not used is unknown. Here three conditions for refinement properties for the single linkage are shown, while three counterexamples are shown for the average linkage and the complete linkage, which show the theory of refinements is far from trivial and future works are needed.