Building initial partitions through sampling techniques

DOI10.1016/j.ejor.2005.12.045zbMath1135.90042OpenAlexW2021294513MaRDI QIDQ2643942

Charles Nicholas, Jacob Kogan, V. Eh. Vol'kovich

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.045

zbMATH Keywords

clusteringdata mining

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

A linguistic approach to classification of bacterial genomes ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Interpretation and optimization of the \(k\)-means algorithm.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification EM algorithm for clustering and two stochastic versions
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
• Convergence of Proximal-Like Algorithms
• Finding the Number of Clusters in a Dataset
• 10.1162/153244303322753661
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Concept decompositions for large sparse text data using clustering

This page was built for publication: Building initial partitions through sampling techniques