Pages that link to "Item:Q4950941"
From MaRDI portal
The following pages link to Mathematical Programming for Data Mining: Formulations and Challenges (Q4950941):
Displaying 49 items.
- Supervised classification and mathematical optimization (Q339559) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Supersparse linear integer models for optimized medical scoring systems (Q506427) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- Tabu search approaches for solving the two-group classification problem (Q541993) (← links)
- Regularized multiple criteria linear programs for classification (Q848372) (← links)
- Splitting methods for decision tree induction: An exploration of the relative performance of two entropy-based families (Q851794) (← links)
- On the time series support vector machine using dynamic time warping kernel for brain activity classification (Q946725) (← links)
- Several multi-criteria programming methods for classification (Q955617) (← links)
- Statistical analysis of financial networks (Q957122) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A tabu search with an oscillation strategy for the discriminant analysis problem (Q976027) (← links)
- Synergies of operations research and data mining (Q976388) (← links)
- Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
- Cost-sensitive feature selection for support vector machines (Q1734839) (← links)
- Predicting repayment of the credit card debt (Q1762040) (← links)
- Foreword to the special focus on mathematics, data and knowledge (Q2254085) (← links)
- A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
- Operations research and data mining (Q2467295) (← links)
- Accurately learning from few examples with a polyhedral classifier (Q2475608) (← links)
- Multi-group support vector machines with measurement costs: A biobjective approach (Q2478436) (← links)
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation (Q2497271) (← links)
- Optimization-based feature selection with adaptive instance sampling (Q2499140) (← links)
- A data mining-constraint satisfaction optimization problem for cost effective classification (Q2499142) (← links)
- Mining market data: a network approach (Q2499151) (← links)
- Analyzing linear systems containing strict inequalities via evenly convex hulls (Q2572879) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem (Q2672089) (← links)
- Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- On Operations Research and Statistics Techniques: Keys to Quantitative Data Mining (Q2903220) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- Minimum-support solutions of polyhedral concave programs<sup>*</sup> (Q4265521) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- Foreword: special issue for the 70th birthday of professor Olvi Mangasarian (Q4657700) (← links)
- Multiple criteria linear programming approach to data mining: Models, algorithm designs and software development (Q4664048) (← links)
- Comparison study of two kernel-based learning algorithms for predicting the distance range between antibody interface residues and antigen surface (Q5294696) (← links)
- Max–min separability (Q5317750) (← links)
- Separation via polyhedral conic functions (Q5481682) (← links)
- Mathematical tools for data mining. Set theory, partial orders, combinatorics (Q5891450) (← links)
- Eigen Selection in Spectral Clustering: A Theory-Guided Practice (Q6107194) (← links)
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem (Q6551124) (← links)
