Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Interval Set Clustering of Web Users with Rough K-Means
Journal of Intelligent Information Systems
Invariances in kernel methods: From samples to objects
Pattern Recognition Letters
Kernel methods and the exponential family
Neurocomputing
Rough cluster algorithm based on kernel function
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Survey of clustering algorithms
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Through analyzing kernel clustering algorithm and rough set theory, a novel clustering algorithm, Rough kernel k-means clustering algorithm with adaptive parameters, is proposed for clustering analysis in this paper. By using Mercer kernel functions, we can map the data in the original space to a highdimensional feature space, in which we can use rough k-means with adaptive parameters to perform clustering in feature space. Efficiently.The results of simulation experiments show the feasibility and effectiveness of the kernel clustering algorithm.