The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Dual coordinate descent methods for logistic regression and maximum entropy models
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
A comparison of methods for multiclass support vector machines
Hsu, C.-W., & Lin, C.-J. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.991427 · Cited by 6,838
Self-citationAdvances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Jurafsky, D. S., & Martin, J. (2000) · Cited by 4,132
Optimization—Theory and Applications
Cesari, L. (1983) · Springer eBooks · doi:10.1007/978-1-4613-8165-5 · Cited by 2,559
What every computer scientist should know about floating-point arithmetic
Goldberg, D. (1991) · ACM Computing Surveys · doi:10.1145/103162.103163 · Cited by 1,750
Working Set Selection Using Second Order Information for Training Support Vector Machines
Fan, R.-E., Chen, P.-H., & Lin, C. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1194907 · Cited by 1,710
Self-citationImprovements to Platt's SMO Algorithm for SVM Classifier Design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2001) · Neural Computation · doi:10.1162/089976601300014493 · Cited by 1,318
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
A dual coordinate descent method for large-scale linear SVM
Hsieh, C.-J., Chang, K.-W., Lin, C.-J., Keerthi, S. S., & Sundararajan, S. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390208 · Cited by 872
Self-citationA comparison of algorithms for maximum entropy parameter estimation
Malouf, R. (2002) · proceeding of the 6th conference on Natural language learning - COLING-02 · doi:10.3115/1118853.1118871 · Cited by 655
On the Learnability and Design of Output Codes for Multiclass Problems
Crammer, K., & Singer, Y. (2002) · Machine Learning · doi:10.1023/a:1013637720281 · Cited by 650
On the convergence of the coordinate descent method for convex differentiable minimization
Luo, Z. Q., & Tseng, P. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939948 · Cited by 502
Maximum entropy models for natural language ambiguity resolution
Ratnaparkhi, A., & Marcus, M. P. (1998) · Scholarly Commons (University of Pennsylvania) · Cited by 422
Trust region Newton methods for large-scale logistic regression
Lin, C.-J., Weng, R. C., & Keerthi, S. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273567 · Cited by 284
Self-citationSutton, C., Rohanimanesh, K., & McCallum, A. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015422 · Cited by 284
A comparison of numerical optimizers for logistic regression
Minka, T. P. (2004) · Cited by 235
Coordinate Descent Method for Large-scale L2-loss Linear Support Vector Machines
Chang, K., Hsieh, C., & Lin, C. (2008) · Cited by 219
Self-citationProbabilistic Kernel Regression Models
Jaakkola, T., & Haussler, D. H. (1999) · Cited by 208
Boosting and Maximum Likelihood for Exponential Models
Lebanon, G., & Lafferty, J. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0062 · Cited by 163
A sequential dual method for large scale multi-class linear svms
Keerthi, S. S., Sundararajan, S., Chang, K., Hsieh, C., & Lin, C. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401942 · Cited by 153
Self-citationA Fast Dual Algorithm for Kernel Logistic Regression
Keerthi, S. S., Duan, K., Shevade, S., & POO, A. N. (2005) · Machine Learning · doi:10.1007/s10994-005-0768-5 · Cited by 151
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Collins, M., Globerson, A., Koo, T., Carreras, X., & Bartlett, P. L. (2008) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · doi:10.5555/1390681.1442791 · Cited by 139
On the Learnability and Design of Output Codes for Multiclass Problems
Boros, E. (2002) · Machine Learning · Cited by 125
Markov models for language-independent named entity recognition
Malouf, R. (2002) · Conference on Computational Natural Language Learning · doi:10.3115/1118853.1118872 · Cited by 80
On the Dual Formulation of Regularized Linear Systems with Convex Risks
Zhang, T. (2002) · Machine Learning · doi:10.1023/a:1012498226479 · Cited by 59
Iterative scaling and coordinate descent methods for maximum entropy
Huang, F.-L., Hsieh, C., Chang, K., & Lin, C. (2009) · Joint Conference of the Annual Meeting of the Association for Computational Linguistics and the International Joint Conference on Natural Language Processing (ACL-IJCNLP) · doi:10.3115/1667583.1667671 · Cited by 15
Self-citation
Cited by
Mukhamediev, R. I., Popova, Y., Kuchin, Y., Zaitseva, E., Kalimoldayev, A., Symagulov, A., Levashenko, V., Abdoldina, F., Gopejenko, V., Yakunin, K., et al. (2022) · Mathematics · doi:10.3390/math10152552 · Cited by 292
Recent Advances of Large-Scale Linear Classification
Yuan, G.-X., Ho, C.-H., & Lin, C.-J. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2188013 · Cited by 266
Self-citationScalable Coordinate Descent Approaches to Parallel Matrix Factorization for Recommender Systems
Yu, H.-F., Hsieh, C.-J., Si, S., & Dhillon, I. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.168 · Cited by 253
Self-citationModeling generalization in machine learning: a methodological and computational study
Barbiero, P., Squillero, G., & Tonda, A. (2020) · arXiv · doi:10.48550/arxiv.2006.15680 · Cited by 39
“For this purpose, we selected a Logistic Regression (LR) [52] classifier, a Support Vector Machines classifier with radial basis function kernel (SVC) [53], and a Random Forest classifier with 100 decision tree estimators (RF) [54] as representative classifiers for the following experiments, taking…”
Method
Metadata
- Authors
- Yu, H.-F., Huang, F.-L., & Lin, C.-J.
- Venue
- Machine Learning
- Published
- 2010-11-11
- Volume
- 85
- Issue
- 1-2
- Pages
- 41-75
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2108712612
- Cited by
- 387
- References
- 31
- FWCI
- 4.08
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.