ACM Home Page
Please provide us with feedback. Feedback
Sparse probabilistic classifiers
Full text PdfPdf (284 KB)
Source ACM International Conference Proceeding Series; Vol. 227 archive
Proceedings of the 24th international conference on Machine learning table of contents
Corvalis, Oregon
Pages: 337 - 344  
Year of Publication: 2007
ISBN:978-1-59593-793-3
Authors
Romain Hérault  Université de Technologie de Compiègne, Compiègne cedex, France
Yves Grandvalet  IDIAP, Martigny, Switzerland
Sponsor
: Machine Learning Journal
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 63,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1273496.1273539
What is a DOI?

ABSTRACT

The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining this practice. Thus, when classification uncertainty has to be assessed, it is safer to resort to classifiers estimating conditional probabilities of class labels. Here, we focus on the ambiguity in the vicinity of the boundary decision. We propose an adaptation of maximum likelihood estimation, instantiated on logistic regression. The model outputs proper conditional probabilities into a user-defined interval and is less precise elsewhere. The model is also sparse, in the sense that few examples contribute to the solution. The computational efficiency is thus improved compared to logistic regression. Furthermore, preliminary experiments show improvements over standard logistic regression and performances similar to support vector machines.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bartlett, P. L., & Tewari, A. (2004). Sparseness vs estimating conditional probabilities: Some asymptotic results. Proceedings of the 17th Annual Conference On Learning Theory (pp. 564--578). Springer.
 
2
 
3
 
4
 
5
Chawla, N. V., Hall, L. O., Bowyer, K. W., & Kegelmeyer, W. P. (2002). Smote: Synthetic minority oversampling technique. Journal Of Artificial Intelligence Research, 16, 321--357.
6
 
7
 
8
Grandvalet, Y., Mariéthoz, J., & Bengio, S. (2006). A probabilistic interpretation of SVMs with an application to unbalanced classification. Advances in Neural Information Processing Systems 18 (pp. 467--474). MIT Press.
 
9
 
10
 
11
 
12
Platt, J. C. (2000). Probabilities for SV machines. Advances in Large Margin Classifiers (pp. 61--74). MIT Press.
 
13
 
14
Roth, V. (2004). The generalized LASSO. IEEE Transactions on Neural Networks, 15, 16--28.
 
15
 
16
Vishwanathan, S. V. N., Smola, A. J., & Murty, M. N. (2003). SimpleSVM. Proceedings of the Twentieth International Conference on Machine Learning (pp. 760--767)
 
17
 
18
Zhu, J., & Hastie, T. (2001). Kernel logistic regression and the import vector machine. Advances in Neural Information Processing Systems 13.
Collaborative Colleagues:
Romain Hérault: colleagues
Yves Grandvalet: colleagues