ACM Home Page
Please provide us with feedback. Feedback
Feature shaping for linear SVM classifiers
Full text MovMov (15:06),  PdfPdf (496 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Research track papers table of contents
Pages 299-308  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
George Forman  Hewlett-Packard Labs, Palo Alto, CA, USA
Martin Scholz  Hewlett-Packard Labs, Palo Alto, CA, USA
Shyamsundar Rajaram  Hewlett-Packard Labs, Palo Alto, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Linear classifiers have been shown to be effective for many discrimination tasks. Irrespective of the learning algorithm itself, the final classifier has a weight to multiply by each feature. This suggests that ideally each input feature should be linearly correlated with the target variable (or anti-correlated), whereas raw features may be highly non-linear. In this paper, we attempt to re-shape each input feature so that it is appropriate to use with a linear weight and to scale the different features in proportion to their predictive value. We demonstrate that this pre-processing is beneficial for linear SVM classifiers on a large benchmark of text classification tasks as well as UCI datasets.


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
C. Cortes, A. Gretton, G. Lackriet, M. Mohri, and A. Rostamizadeh, editors. NIPS Kernel Learning Workshop. 2008. http://www.cs.nyu.edu/learning_kernels/
3
 
4
5
6
 
7
 
8
 
9
 
10
 
11
A. Knobbe, B. Cremilleux, J. Furnkranz, and M. Scholz. From local patterns to global models: The LeGo approach to data mining. In: Proc. of ECML/PKDD-08 Workshop: From Local Patterns to Global Models (LeGo'08), 2008. http://www.ke.informatik.tu-darmstadt.de/events/LeGo-08/
 
12
M. Lan, C. L. Tan, J. Su, and Y. Lu. Supervised and traditional term weighting methods for automatic text categorization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 99(2), 2008.
 
13
 
14
C. S. Ong and A. J. Smola. Machine learning with hyperkernels. In: Proc. of International Conference on Machine Learning (ICML'03), pages 568--575, 2003.
 
15
J. Platt. Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. In: Advances in Large Margin Classifiers, pages 61--74. MIT Press, 1999.
16
 
17

Collaborative Colleagues:
George Forman: colleagues
Martin Scholz: colleagues
Shyamsundar Rajaram: colleagues