Global optimization in clustering using hyperbolic cross points
From MaRDI portal
Publication:877116
DOI10.1016/j.patcog.2006.11.005zbMath1111.68109OpenAlexW2084429251MaRDI QIDQ877116
Publication date: 19 April 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2006.11.005
global optimizationclusteringgenetic algorithmsfuzzy \(c\)-meanshard \(c\)-meanshyperbolic cross points
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (1)
Cites Work
- Optimization by Simulated Annealing
- Experiments in projection and clustering by simulated annealing
- Optimality tests for fixed points of the fuzzy c-means algorithm
- Deterministic and stochastic error bounds in numerical analysis
- A deterministic algorithm for global optimization
- Scalable visual assessment of cluster tendency for large data sets
- APPROXIMATE RECOVERY OF PERIODIC FUNCTIONS OF SEVERAL VARIABLES
- A Physical Interpretation of Fuzzy ISODATA
- Equation of State Calculations by Fast Computing Machines
- Cluster Validity with Fuzzy Sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global optimization in clustering using hyperbolic cross points