Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
From MaRDI portal
Publication:1433467
DOI10.1007/BF02578945zbMath1048.65059WikidataQ56594451 ScholiaQ56594451MaRDI QIDQ1433467
Publication date: 18 June 2004
Published in: Top (Search for Journal in Brave)
classificationglobal optimizationnonsmooth optimizationclusteringnumerical experimentscutting angle methodcluster functiondiscrete Gradient methods
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items (28)
Global optimization issues in deep network regression: an overview ⋮ Supervised classification and mathematical optimization ⋮ Approximate functions in a problem of sets separation ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Fast modified global \(k\)-means algorithm for incremental cluster construction ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ Qualitative properties of the minimum sum-of-squares clustering problem ⋮ Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Multi-group support vector machines with measurement costs: A biobjective approach ⋮ An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization ⋮ Poisson mixture regression models for heart disease prediction ⋮ Computational methods and models in circulatory and reproductive systems ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ Model combination in neural-based forecasting ⋮ Classes and clusters in data analysis ⋮ Facility location via continuous optimization with discontinuous objective functions ⋮ Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization ⋮ Internet security applications of the Munn rings ⋮ A formula for multiple classifiers in data mining based on Brandt semigroups ⋮ Comments on: Optimization and data mining in medicine ⋮ Separation via polyhedral conic functions ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
Uses Software
Cites Work
- Self-organization and associative memory
- A comparison of two dual-based procedures for solving the p-median problem
- Continuous subdifferential approximation and its construction
- Misclassification minimization
- Cluster analysis and mathematical programming
- A method of approximating a subdifferential
- Cutting angle methods in global optimization
- Fast algorithm for the cutting angle method of global optimization
- A global optimization approach to classification
- A method of approximating a quasidifferential
- Hybrid misclassification minimization
- Mathematical classification and clustering
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- A Branch and Bound Clustering Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
- Cluster analysis by simulated annealing
- Mathematical Programming for Data Mining: Formulations and Challenges
- Massive data discrimination via linear support vector machines
- Evaluation of a Branch and Bound Algorithm for Clustering
- A Dynamic Programming Algorithm for Cluster Analysis
- Global minimization of increasing positively homogeneous functions over the unit simplex
- Abstract convexity and global optimization
- Training invariant support vector machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
