Mathematical Programming for Data Mining: Formulations and Challenges
From MaRDI portal
Publication:4950941
DOI10.1287/ijoc.11.3.217zbMath0973.90096OpenAlexW2115568737MaRDI QIDQ4950941
Usama M. Fayyad, P. S. Bradley, Olvi L. Mangasarian
Publication date: 5 December 2001
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/64378
Applications of mathematical programming (90C90) Database theory (68P15) Artificial intelligence (68T99) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (46)
Comparing different nonsmooth minimization methods and software ⋮ Minimum-support solutions of polyhedral concave programs* ⋮ Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ Comparison study of two kernel-based learning algorithms for predicting the distance range between antibody interface residues and antigen surface ⋮ On Operations Research and Statistics Techniques: Keys to Quantitative Data Mining ⋮ Regularized multiple criteria linear programs for classification ⋮ Data separation via a finite number of discriminant functions: a global optimization approach ⋮ Splitting methods for decision tree induction: An exploration of the relative performance of two entropy-based families ⋮ Supervised classification and mathematical optimization ⋮ Max–min separability ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ Eigen Selection in Spectral Clustering: A Theory-Guided Practice ⋮ Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Cost-sensitive feature selection for support vector machines ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ On the time series support vector machine using dynamic time warping kernel for brain activity classification ⋮ Operations research and data mining ⋮ Supersparse linear integer models for optimized medical scoring systems ⋮ Several multi-criteria programming methods for classification ⋮ Statistical analysis of financial networks ⋮ Accurately learning from few examples with a polyhedral classifier ⋮ A coordinate gradient descent method for nonsmooth separable minimization ⋮ Multi-group support vector machines with measurement costs: A biobjective approach ⋮ Foreword to the special focus on mathematics, data and knowledge ⋮ Foreword: special issue for the 70th birthday of professor Olvi Mangasarian ⋮ A new spectral method for \(l_1\)-regularized minimization ⋮ A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization ⋮ Predicting repayment of the credit card debt ⋮ Tabu search approaches for solving the two-group classification problem ⋮ A tabu search with an oscillation strategy for the discriminant analysis problem ⋮ Synergies of operations research and data mining ⋮ A mixed-integer programming approach to the clustering problem with an application in customer segmentation ⋮ Optimization-based feature selection with adaptive instance sampling ⋮ A data mining-constraint satisfaction optimization problem for cost effective classification ⋮ Mining market data: a network approach ⋮ Nonlinear separation of data via mixed 0-1 integer and linear programming ⋮ Approximating $k$-Median via Pseudo-Approximation ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Separation via polyhedral conic functions ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Analyzing linear systems containing strict inequalities via evenly convex hulls ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Uses Software
This page was built for publication: Mathematical Programming for Data Mining: Formulations and Challenges
