ACM Home Page
Please provide us with feedback. Feedback
Discriminative k-metrics
Full text PdfPdf (652 KB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages 1009-1016  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Arthur Szlam  UCLA, Los Angeles, CA
Guillermo Sapiro  University of Minnesota, Minneapolis, MN
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 46,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553503
What is a DOI?

ABSTRACT

The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a modification of the k q-flats framework for pattern classification is introduced. The basic idea is to replace the original reconstruction only energy, which is optimized to obtain the k affine spaces, by a new energy that incorporates discriminative terms. This way, the actual classification task is introduced as part of the design and optimization. The presentation of the proposed framework is complemented with experimental results, showing that the method is computationally very efficient and gives excellent results on standard supervised learning benchmarks.


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
Aharon, M., Elad, M., & Bruckstein, A. (2006). KSVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing, 54, 4311--4322.
 
2
Bradley, P. S., & Mangasarian, O. L. (1998). k-plane clustering (Technical Report MP-TR-1998-08). Department of Computer Science, University of Wisconsin.
 
3
 
4
Chapelle, O., Schölkopf, B., & Zien, A. (Eds.). (2006). Semi-supervised learning. Cambridge, MA: MIT Press.
5
 
6
Kambhatla, N., & Leen, T. K. (1993). Fast non-linear dimension reduction. Advances in Neural Information Processing Systems 6 (pp. 152--159).
7
 
8
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2008). Supervised dictionary learning. Advances in Neural Information Processing Systems (pp. 1033--1040). Vancouver, Canada.
 
9
 
10
Tropp, J. (2004). Topics in sparse approximation. Doctoral dissertation, Computational and Applied Mathematics, The University of Texas at Austin.
 
11
 
12
Tuytelaars, T., & Schmid, C. (2007). Vector quantizing feature space with a regular lattice. Proceedings of IEEE International Conference on Computer Vision (pp. 1--8).
 
13
Wakin, M. (2006). The geometry of low-dimensional signal models. Doctoral dissertation, Rice university.
 
14
Weinberger, K., Blitzer, J., & Saul, L. (2006). Distance metric learning for large margin nearest neighbor classification. Advances in Neural Information Processing Systems 18 (pp. 1473--1480). Cambridge, MA: MIT Press.
 
15
Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2003). Distance metric learning with application to clustering with side-information. Advances in Neural Information Processing Systems 15 (pp. 505--512). Cambridge, MA: MIT Press.

Collaborative Colleagues:
Arthur Szlam: colleagues
Guillermo Sapiro: colleagues