LIBLINEAR

swMATH4880MaRDI QIDQ17033FDOQ17033

Author name not available (Why is that?)

Described by source

• Unnamed Publication

Cited In (only showing first 100 items - show all)

• Cost-sensitive support vector machine using randomized dual coordinate descent method for big class-imbalanced data classification
• A machine learning framework for predicting synergistic and antagonistic drug combinatorial efficacy
• Title not available (Why is that?)
• Tree neural networks in HOL4
• Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
• How can lenders prosper? Comparing machine learning approaches to identify profitable peer-to-peer loan investments
• Predicting the state of cysteines based on sequence information
• Preference disaggregation within the regularization framework for sorting problems with multiple potentially non-monotonic criteria
• Optimized cutting plane algorithm for large-scale risk minimization
• Boosting ant colony optimization via solution prediction and machine learning
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
• Imbalanced classification in sparse and large behaviour datasets
• A reduced proximal-point homotopy method for large-scale non-convex BQP
• Progressive random \(k\)-labelsets for cost-sensitive multi-label classification
• High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
• Node classification over bipartite graphs through projection
• Attributed network embedding via subspace discovery
• Stochastic gradient descent with Barzilai-Borwein update step for SVM
• Dictionary learning for fast classification based on soft-thresholding
• Physics-informed machine learning models for predicting the progress of reactive-mixing
• Unsupervised learning of compositional sparse code for natural image representation
• Safe sample screening rules for multicategory angle-based support vector machines
• Data-independent random projections from the feature-map of the homogeneous polynomial kernel of degree two
• Linear Algebra and Optimization for Machine Learning
• \textsc{gat2vec}: representation learning for attributed graphs
• Efficient set-valued prediction in multi-class classification
• Extending greedy feature selection algorithms to multiple solutions
• Sparse randomized shortest paths routing with Tsallis divergence regularization
• Title not available (Why is that?)
• Ensemble learning techniques for transmission quality classification in a pay\&require multi-layer network
• An effective procedure for feature subset selection in logistic regression based on information criteria
• Distance metric learning for graph structured data
• An efficient augmented Lagrangian method for support vector machine
• Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
• HNS: hierarchical negative sampling for network representation learning
• Hierarchical community structure preserving approach for network embedding
• Linear convergence rate for the MDM algorithm for the nearest point problem
• Large-scale linear nonparallel SVMs
• Low-rank decomposition meets kernel learning: a generalized Nyström method
• Bonsai: diverse and shallow trees for extreme multi-label classification
• Orthogonal canonical correlation analysis and applications
• Collaborative linear coding for robust image classification
• Logistic regression with weight grouping priors
• Data scarcity, robustness and extreme multi-label classification
• Sequential approaches for learning datum-wise sparse representations
• Isolation kernel: the X factor in efficient and effective large scale online kernel learning
• An aggregate and iterative disaggregate algorithm with proven optimality in machine learning
• Large-scale Gaussian process inference with generalized histogram intersection kernels for visual recognition tasks
• Proximal gradient method for huberized support vector machine
• Complex activity recognition via attribute dynamics
• Growing regression tree forests by classification for continuous object pose estimation
• Mining mid-level visual patterns with deep CNN activations
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
• Subsampled Hessian Newton Methods for Supervised Learning
• Large-Scale Linear RankSVM
• Insensitive stochastic gradient twin support vector machines for large scale problems
• One-trial correction of legacy AI systems and stochastic separation theorems
• A deep learning framework for hybrid heterogeneous transfer learning
• Toward any-language zero-shot topic classification of textual documents
• Nonlinear optimization and support vector machines
• Grafting for combinatorial binary model using frequent itemset mining
• Skills in demand for ICT and statistical occupations: Evidence from web‐based job vacancies
• Surrogate regret bounds for generalized classification performance metrics
• Learning modulo theories for constructive preference elicitation
• A clustering-based feature selection method for automatically generated relational attributes
• A neighborhood prior constrained collaborative representation for classification
• Learning semantic representations of objects and their parts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improving P300 speller performance by means of optimization and machine learning
• Maximum margin partial label learning
• Title not available (Why is that?)
• Machine Learning for Text
• Title not available (Why is that?)
• The mRMR variable selection method: a comparative study for functional data
• Discriminatively learned hierarchical rank pooling networks
• Space-time tree ensemble for action recognition and localization
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
• Language Processing with Perl and Prolog
• Title not available (Why is that?)
• A semismooth Newton method for support vector classification and regression
• Hammering Mizar by Learning Clause Guidance (Short Paper).
• Adaptively weighted large-margin angle-based classifiers
• Nonlinear optimization and support vector machines
• Fast and slow enigmas and parental guidance
• Sparse regression: scalable algorithms and empirical performance
• Least squares recursive projection twin support vector machine for classification
• A generic coordinate descent solver for non-smooth convex optimisation
• Feature selection combining linear support vector machines and concave optimization
• A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
• Hybrid MPI/OpenMP parallel linear support vector machine training
• Training and testing low-degree polynomial data mappings via linear SVM
• Block-wise construction of tree-like relational features with monotone reducibility and redundancy
• Kernel multilogit algorithm for multiclass classification
• A Derivative-Free Method for Structured Optimization Problems
• 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
• Binary vectors for fast distance and similarity estimation

This page was built for software: LIBLINEAR