A comparative study of the leading machine learning techniques and two new optimization algorithms
type: Item
instance of: scholarly article
title: A comparative study of the leading machine learning techniques and two new optimization algorithms
zbMATH Open document ID: 1403.90560
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
full work available at URL: 1-s2.0-S0377221718306143-main.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 6968114
zbMATH Keywords: data mining
zbMATH Keywords: supervised machine learning
zbMATH Keywords: binary classification
zbMATH Keywords: comparative study
zbMATH Keywords: supervised normalized cut
cites work: PRMLT
cites work: Q5405117
cites work: Q5483032
cites work: Bagging predictors
cites work: Q3327527
cites work: Supervised classification and mathematical optimization
cites work: Support-vector networks
cites work: Approximation by superpositions of a sigmoidal function
cites work: A new hybrid classification algorithm for customer churn prediction based on logistic regression and decision trees
cites work: Learning Rule Ensembles for Ordinal Classification with Monotonicity Constraints
cites work: Q3093335
cites work: Optimization approaches to supervised classification
cites work: Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
cites work: Q3096211
cites work: Lagrangian relaxation for SVM feature selection
cites work: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
cites work: The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
cites work: A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant
cites work: Evaluating performance of image segmentation criteria and techniques
cites work: A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
cites work: 10.1162/153244304322972694
cites work: Learning representations by back-propagating errors
cites work: Q4864293
describes a project that uses: PRMLT
describes a project that uses: LIBSVM
describes a project that uses: UCI-ml
describes a project that uses: AdaBoost.MH
describes a project that uses: HNCcorr
MaRDI profile type: Publication
OpenAlex ID: W2883966112
Wikidata QID: Q129412359
DOI: 10.1016/J.EJOR.2018.07.009
description: scientific article; zbMATH DE number 6968114