ACM Home Page
Please provide us with feedback. Feedback
The support vector decomposition machine
Full text PdfPdf (243 KB)
Source ACM International Conference Proceeding Series; Vol. 148 archive
Proceedings of the 23rd international conference on Machine learning table of contents
Pittsburgh, Pennsylvania
Pages: 689 - 696  
Year of Publication: 2006
ISBN:1-59593-383-2
Authors
Francisco Pereira  Carnegie Mellon University
Geoffrey Gordon  Carnegie Mellon University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   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/1143844.1143931
What is a DOI?

ABSTRACT

In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learning performance. In previous work, many researchers have treated the learning problem in two separate phases: first use an algorithm such as singular value decomposition to reduce the dimensionality of the data set, and then use a classification algorithm such as naïve Bayes or support vector machines to learn a classifier. We demonstrate that it is possible to combine the two goals of dimensionality reduction and classification into a single learning objective, and present a novel and efficient algorithm which optimizes this objective directly. We present experimental results in fMRI analysis which show that we can achieve better learning performance and lower-dimensional representations than two-phase approaches can.


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
 
2
 
3
Chang, C.-C., & Lin, C.-J. (2001). LIBSVM: a library for support vector machines. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
 
4
Globerson, A., & Roweis, S. (2005). Metric learning by collapsing classes. Advances in Neural Information Processing Systems.
 
5
 
6
Hanson, S. J., Matsuka, T., & Haxby, J. V. (2004). Combinatorial codes in ventral temporal lobe for object recognition: Haxby(2001) revisited: is there a 'face' area? Neuroimage, 23.
 
7
Hastie, T., Tibshirani, R., & Friedman, J. H. (2001). The elements of statistical learning: data mining, inference and prediction. Springer-Verlag.
 
8
Kanwisher, N. (2003). The ventral visual object pathway in humans: Evidence from fmri. In L. Chalupa and J. Werner (Eds.), The visual neurosciences. MIT Press.
 
9
 
10
Pereira, F., Mitchell, T., Mason, R., Just, M., & Kriegeskorte, N. (2006). "spatial searchlights for feature selection and classification of functional mri data". to appear in the proceedings of the 12th Conference on Human Brain Mapping.
 
11
 
12
Weinberger, K. Q., Blitzer, J., & Saul, L. K. (2005). Distance metric learning for large margin nearest neighbour classification. Advances in Neural Information Processing Systems.
 
13
Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2002). Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems.

Collaborative Colleagues:
Francisco Pereira: colleagues
Geoffrey Gordon: colleagues