DSMK means density-based split-and-merge k-means clustering algorithm, Cazals / Mazauric / Tetley / Watrigant, vol.3, pp.51-71, 2013. ,
k-means++: The advantages of careful seeding, ACM-SODA, page 1035, 2007. ,
Combining mixture components for clustering, Journal of computational and graphical statistics, vol.19, issue.2, pp.332-353, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00321090
Multiscale analysis of structurally conserved motifs ,
URL : https://hal.archives-ouvertes.fr/hal-01968176
Approximation algorithms and hardness results for the clique packing problem, Disc. Appl. Math, vol.157, issue.7, pp.1396-1406, 2009. ,
Persistence-based clustering in riemannian manifolds, J. ACM, vol.60, issue.6, pp.1-38, 2013. ,
URL : https://hal.archives-ouvertes.fr/inria-00389390
Mean shift, mode seeking, and clustering, IEEE PAMI, vol.17, issue.8, pp.790-799, 1995. ,
Elements of Information Theory, 2006. ,
Estimating the number of clusters, Canadian Journal of Statistics, vol.28, issue.2, pp.367-382, 2000. ,
New results on maximum induced matchings in bipartite graphs and beyond, Theoretical Computer Science, vol.478, pp.33-40, 2013. ,
The complexity of multiterminal cuts, SIAM J. Comput, vol.23, issue.4, pp.864-894, 1994. ,
On the approximability of maximum and minimum edge clique partition problems, Int. J. Found. Comput. Sci, vol.18, issue.2, pp.217-226, 2007. ,
Performance criteria for graph clustering and markov cluster experiments, 2000. ,
Cutting up is hard to do: the parameterized complexity of k-cut and related problems, Electr. Notes Theor. Comput. Sci, vol.78, pp.209-222, 2003. ,
Boltzmann samplers for the random generation of combinatorial structures, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.577-625, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00307530
Pattern classification and scene analysis, 1973. ,
Analytic combinatorics, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00072739
Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, vol.34, issue.3, pp.596-615, 1987. ,
Computers and intractability, vol.29, 2002. ,
Many-to-many correspondences between partitions: Introducing a cut-based approach, SIAM International Conference on Data Mining, p.47 ,
A polynomial algorithm for the k-cut problem for fixed k, Mathematics of operations research, vol.19, 1994. ,
Concrete mathematics: a foundation for computer science, 1989. ,
Methods for merging gaussian mixture components, vol.4, pp.3-34, 2010. ,
Maximum bounded 3-dimensional matching is MAX SNP-complete, Inf. Process. Lett, vol.37, issue.1, pp.27-35, 1991. ,
Reducibility among combinatorial problems, In Complexity of Computer Computations, pp.85-103, 1972. ,
Finding groups in data: an introduction to cluster analysis, 1990. ,
The minimum k-way cut of bounded size is fixedparameter tractable, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS, pp.160-169, 2011. ,
Review on determining number of cluster in k-means clustering, International Journal, vol.1, issue.6, pp.90-95, 2013. ,
Fast and effective text mining using linear-time document clustering, ACM SIGKDD, pp.16-22, 1999. ,
Clustering Stability, 2010. ,
Inapproximability of maximum biclique problems, minimum k -cut and densest at-least-k -subgraph from the small set expansion hypothesis, Algorithms, vol.11, issue.1, p.10, 2018. ,
Comparing clusterings, 2002. ,
Automatic cluster number selection using a split and merge k-means approach, Database and Expert Systems Application, 2009. DEXA'09. 20th International Workshop on, pp.363-367, 2009. ,
Clustering with the k-means algorithm, Machine Learning, 2012. ,
Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991. ,
Generalization of clustering agreements and distances for overlapping clusters and network communities. Data mining and knowledge discovery, vol.29, pp.1458-1485, 2015. ,
Clustering by fast search and find of density peaks, Science, vol.344, issue.6191, pp.1492-1496, 2014. ,
Standardized mutual information for clustering comparisons: one step further in adjustment for chance, International Conference on Machine Learning, pp.1143-1151, 2014. ,
,
The earth mover's distance as a metric for image retrieval, International Journal of Computer Vision, vol.40, issue.2, pp.99-121, 2000. ,
Finding k-cuts within twice the optimal, SIAM J. Comp, vol.24, 1995. ,
Cluster ensembles-a knowledge reuse framework for combining multiple partitions, Journal of machine learning research, vol.3, pp.583-617, 2002. ,
Estimating the number of clusters in a data set via the gap statistic, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.63, issue.2, pp.411-423, 2001. ,
A tutorial on spectral clustering, Statistics and Computing, vol.17, issue.4, pp.395-416, 2007. ,
Comparing clusterings: an overview, 2007. ,
A split-merge framework for comparing clusterings, ICML, 2012. ,
Survey of clustering algorithms, IEEE Transactions on neural networks, vol.16, issue.3, pp.645-678, 2005. ,
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts, 1999. ,
A new mallows distance based metric for comparing clusterings, ICML, pp.1028-1035, 2005. ,