LIBLINEAR: A Library for Large Linear Classification
Published 1 June 2008
Rong-En Fan, Kai‐Wei Chang, Cho‐Jui Hsieh, Wang Xiang-rui, Chih‐Jen Lin
Citations6,625
SJR quartileQ1
SJR score2.02
SNIP3.07
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
LIBLINEAR is an open source library for large-scale linear classification. It supports logistic regres-sion and linear support vector machines. We provide easy-to-use command-line tools and library calls for users and developers. Comprehensive documents are available for both beginners and advanced users. Experiments demonstrate that LIBLINEAR is very efficient on large sparse data sets.
Keywords
Computer Science
ACM Transactions on Intelligent Systems and TechnologyLIBSVM
41,340 Citations2011Chih-Chung Chang, Chih‐Jen Lin
Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
PubMedRegularization Paths for Generalized Linear Models via Coordinate Descent.
13,977 Citations2010Jerome H. Friedman, Trevor Hastie +1 more
A training algorithm for optimal margin classifiers
11,594 Citations1992Bernhard E. Boser, Isabelle Guyon +1 more
A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
A Practical Guide to Support Vector Classication
5,069 Citations2008Chih‐Wei Hsu, Chih-Chung Chang +1 more
A simple procedure is proposed, which usually gives reasonable results and is suitable for beginners who are not familiar with SVM.
Journal of Machine Learning ResearchRCV1: A New Benchmark Collection for Text Categorization Research
2,600 Citations2004David Lewis, Yiming Yang +2 more
This work describes the coding policy and quality control procedures used in producing the RCV1 data, the intended semantics of the hierarchical category taxonomies, and the corrections necessary to remove errorful data.
Training linear SVMs in linear time
1,947 Citations2006Thorsten Joachims
A Cutting Plane Algorithm for training linear SVMs that provably has training time 0(s,n) for classification problems and o(sn log (n)) for ordinal regression problems and several orders of magnitude faster than decomposition methods like svm light for large datasets.
Neural ComputationAsymptotic Behaviors of Support Vector Machines with Gaussian Kernel
1,616 Citations2003S. Sathiya Keerthi, Chih‐Jen Lin
The behavior of the SVM classifier when these hyper parameters take very small or very large values is analyzed, which helps in understanding thehyperparameter space that leads to an efficient heuristic method of searching for hyperparameter values with small generalization errors.
Pegasos
982 Citations2007Shai Shalev‐Shwartz, Yoram Singer +1 more
A simple and effective stochastic sub-gradient descent algorithm for solving the optimization problem cast by Support Vector Machines, which is particularly well suited for large text classification problems, and demonstrates an order-of-magnitude speedup over previous SVM learning methods.
A dual coordinate descent method for large-scale linear SVM
906 Citations2008Cho‐Jui Hsieh, Kai‐Wei Chang +3 more
A novel dual coordinate descent method for linear SVM with L1-and L2-loss functions that reaches an ε-accurate solution in O(log(1/ε)) iterations is presented.
Mathematical ProgrammingA coordinate gradient descent method for nonsmooth separable minimization
784 Citations2007Paul Tseng, Sangwoon Yun
A (block) coordinate gradient descent method for solving this class of nonsmooth separable problems and establishes global convergence and, under a local Lipschitzian error bound assumption, linear convergence for this method.
Machine LearningOn the Learnability and Design of Output Codes for Multiclass Problems
660 Citations2002Koby Crammer, Yoram Singer
This paper discusses for the first time the problem of designing output codes for multiclass problems, and gives a time and space efficient algorithm for solving the quadratic program.
Journal of DocumentationON THE SPECIFICATION OF TERM VALUES IN AUTOMATIC INDEXING
577 Citations1973G. Salton, Chul‐Su Yang
It is shown that the standard theories for the specification of term values (or weights) are not adequate, and new techniques are introduced for the assignment of weights to index terms, based on the characteristics of individual document collections.
Trust region Newton methods for large-scale logistic regression
287 Citations2007Chih‐Jen Lin, Ruby C. Weng +1 more
This paper applies a trust region Newton method to maximize the log-likelihood of the logistic regression model, which uses only approximate Newton steps in the beginning, but achieves fast convergence in the end.
Journal of Machine Learning ResearchTrust Region Newton Method for Logistic Regression
287 Citations2008Chih‐Jen Lin, Ruby C. Weng +1 more
This paper applies a trust region Newton method to maximize the log-likelihood of the logistic regression model, and extends the proposed method to large-scale L2-loss linear support vector machines (SVM).
A sequential dual method for large scale multi-class linear svms
152 Citations2008S. Sathiya Keerthi, S. Sundararajan +3 more
Experiments indicate that the main idea is to sequentially traverse through the training set and optimize the dual variables associated with one example at a time, much faster than state of the art solvers such as bundle, cutting plane and exponentiated gradient methods.
Journal of Machine Learning ResearchGeneralized Bradley-Terry Models and Multi-Class Probability Estimates
151 Citations2006Tzu-Kuo Huang, Ruby C. Weng +1 more
This paper introduces a generalized Bradley-Terry model in which paired individual comparisons are extended to paired team comparisons, and proposes a simple algorithm with convergence proofs to solve the model and obtain individual skill.