LIBLINEAR
From MaRDI portal
Software:17033
No author found.
Related Items (only showing first 100 items - show all)
Density Ratio Estimation in Machine Learning ⋮ Embedding Learning ⋮ ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description) ⋮ Markov mean properties for cell death-related protein classification ⋮ Unnamed Item ⋮ A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer ⋮ Machine Learning for Text ⋮ Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization ⋮ Improving P300 speller performance by means of optimization and machine learning ⋮ Linear Algebra and Optimization for Machine Learning ⋮ Unnamed Item ⋮ Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning ⋮ A Study on L2-Loss (Squared Hinge-Loss) Multiclass SVM ⋮ Large-Scale Linear RankSVM ⋮ Subsampled Hessian Newton Methods for Supervised Learning ⋮ Orthogonal canonical correlation analysis and applications ⋮ An efficient augmented Lagrangian method for support vector machine ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hammering Mizar by Learning Clause Guidance (Short Paper). ⋮ Optimization Methods for Large-Scale Machine Learning ⋮ Feature selection combining linear support vector machines and concave optimization ⋮ Unnamed Item ⋮ Unsupervised learning of compositional sparse code for natural image representation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nonlinear optimization and support vector machines ⋮ Nonlinear optimization and support vector machines ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Skills in demand for ICT and statistical occupations: Evidence from web‐based job vacancies ⋮ The mRMR variable selection method: a comparative study for functional data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression ⋮ A Derivative-Free Method for Structured Optimization Problems ⋮ Safe Feature Elimination in Sparse Supervised Learning ⋮ Gap Safe screening rules for sparsity enforcing penalties ⋮ A neighborhood prior constrained collaborative representation for classification ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Language Processing with Perl and Prolog ⋮ A generic coordinate descent solver for non-smooth convex optimisation ⋮ Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization ⋮ Binary vectors for fast distance and similarity estimation ⋮ ENIGMA: efficient learning-based inference guiding machine ⋮ Kernel multilogit algorithm for multiclass classification ⋮ Fast and slow enigmas and parental guidance ⋮ A comparative study on large scale kernelized support vector machines ⋮ Rank-based classifiers for extremely high-dimensional gene expression data ⋮ Nonparametric Bayesian negative binomial factor analysis ⋮ Estimating individualized treatment rules for treatments with hierarchical structure ⋮ Hardwood species classification with DWT based hybrid texture feature extraction techniques ⋮ Prediction of esophageal cancer using demographic, lifestyle, patient history, and basic clinical tests ⋮ Safe sample screening rules for multicategory angle-based support vector machines ⋮ A machine learning framework for predicting synergistic and antagonistic drug combinatorial efficacy ⋮ Classifying readmissions to a cardiac intensive care unit ⋮ Analysis of classifiers' robustness to adversarial perturbations ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization ⋮ Surrogate regret bounds for generalized classification performance metrics ⋮ Maximum margin partial label learning ⋮ Progressive random \(k\)-labelsets for cost-sensitive multi-label classification ⋮ Stream-based extreme learning machine approach for big data problems ⋮ Spatial recurrences for pedestrian classification ⋮ Linear convergence rate for the MDM algorithm for the nearest point problem ⋮ Low-rank decomposition meets kernel learning: a generalized Nyström method ⋮ Joint ranking SVM and binary relevance with robust low-rank learning for multi-label classification ⋮ Feature selection for linear SVM with provable guarantees ⋮ A semismooth Newton method for support vector classification and regression ⋮ An aggregate and iterative disaggregate algorithm with proven optimality in machine learning ⋮ Least squares recursive projection twin support vector machine for classification ⋮ Mining mid-level visual patterns with deep CNN activations ⋮ Growing regression tree forests by classification for continuous object pose estimation ⋮ Complex activity recognition via attribute dynamics ⋮ Large-scale Gaussian process inference with generalized histogram intersection kernels for visual recognition tasks ⋮ Discriminatively learned hierarchical rank pooling networks ⋮ Space-time tree ensemble for action recognition and localization ⋮ Block-wise construction of tree-like relational features with monotone reducibility and redundancy ⋮ Data-independent random projections from the feature-map of the homogeneous polynomial kernel of degree two ⋮ A coordinate descent margin based-twin support vector machine for classification ⋮ Low-rank bilinear classification: efficient convex optimization and extensions ⋮ Insensitive stochastic gradient twin support vector machines for large scale problems ⋮ Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model ⋮ Rotation-invariant HOG descriptors using Fourier analysis in polar and spherical coordinates ⋮ Sequential approaches for learning datum-wise sparse representations ⋮ A sum-over-paths extension of edit distances accounting for all sequence alignments ⋮ Efficient max-margin multi-label classification with applications to zero-shot learning ⋮ Statistical topic models for multi-label document classification
This page was built for software: LIBLINEAR