Clustering by analytic functions

Authors:
Mikko I. Malinen;Pasi FräNti
Affiliations:
Speech and Image Processing Unit, School of Computing, University of Eastern Finland, P.O. Box 111, FIN-80101 Joensuu, Finland;Speech and Image Processing Unit, School of Computing, University of Eastern Finland, P.O. Box 111, FIN-80101 Joensuu, Finland
Venue:
Information Sciences: an International Journal
Year:
2012

Citing 15
Cited 2

Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An empirical comparison of four initialization methods for the K-Means algorithm

Pattern Recognition Letters
The Cluster Dissection and Analysis Theory FORTRAN Programs Examples

The Cluster Dissection and Analysis Theory FORTRAN Programs Examples
X-means: Extending K-means with Efficient Estimation of the Number of Clusters

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
How slow is the k-means method?

Proceedings of the twenty-second annual symposium on Computational geometry
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph

IEEE Transactions on Pattern Analysis and Machine Intelligence
Iterative shrinking method for clustering problems

Pattern Recognition
Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques

Journal of Classification
k-means++: the advantages of careful seeding

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
NP-hardness of Euclidean sum-of-squares clustering

Machine Learning
Random swap EM algorithm for finite mixture models in image segmentation

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Minimum spanning tree based split-and-merge: A hierarchical clustering method

Information Sciences: an International Journal
A novel ant-based clustering algorithm using the kernel method

Information Sciences: an International Journal
Model order selection for multiple cooperative swarms clustering using stability analysis

Information Sciences: an International Journal

Clustering local frequency items in multiple databases

Information Sciences: an International Journal
CoBAn: A context based model for data leakage prevention

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Data clustering is a combinatorial optimization problem. This article shows that clustering is also an optimization problem for an analytic function. The mean squared error, or in this case, the squared error can expressed as an analytic function. With an analytic function we benefit from the existence of standard optimization methods: the gradient of this function is calculated and the descent method is used to minimize the function.