Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Interval Set Clustering of Web Users with Rough K-Means
Journal of Intelligent Information Systems
Introduction to Semi-Supervised Learning
Introduction to Semi-Supervised Learning
Algorithms for Fuzzy Clustering: Methods in c-Means Clustering with Applications
Algorithms for Fuzzy Clustering: Methods in c-Means Clustering with Applications
Semi-Supervised Learning
Hi-index | 0.00 |
The aim of this paper is to study the concept of inductive clustering and two approximations in nearest neighbor clustering induced thereby. The concept of inductive clustering means that natural classification rules are derived as the results of clustering, a typical example of which is the Voronoi regions in K-means clustering. When the rule of nearest prototype allocation in K-means is replaced by nearest neighbor classification, we have inductive clustering related to the single linkage in agglomerative hierarchical clustering. The latter method naturally derives two approximations that can be compared to lower and upper approximations for rough sets. We thus have a method of inductive clustering with twofold approximations related to nearest neighbor classification. Illustrative examples show implications and significances of this concept.