Unsupervised and supervised data classification via nonsmooth and global optimization
- 1 June 2003
- journal article
- Published by Springer Nature in TOP
- Vol. 11 (1), 1-75
- https://doi.org/10.1007/bf02578945
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- A Heuristic Algorithm for Feature Selection Based on Optimization TechniquesPublished by IGI Global ,2002
- A Global Optimization Approach to ClassificationOptimization and Engineering, 2002
- Modified Versions of the Cutting Angle MethodPublished by Springer Nature ,2001
- Numerical Methods for Minimizing Quasidifferentiable Functions: A Survey and ComparisonPublished by Springer Nature ,2000
- Global Minimization of Increasing Positively Homogeneous Functions over the Unit SimplexAnnals of Operations Research, 2000
- Cutting angle methods in global optimizationApplied Mathematics Letters, 1999
- Minimization Methods for One Class of Nonsmooth Functions and Calculation of Semi-Equilibrium PricesPublished by Springer Nature ,1999
- Computational experience on four algorithms for the hard clustering problemPattern Recognition Letters, 1996
- A Tabu search approach to the clustering problemPattern Recognition, 1995
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithmPattern Recognition Letters, 1993