Kernel slicing: Scalable online training with conjunctive features

Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 2, Issue , 2010, Pages 1245-1253

  Yoshinaga, Naoki ^a   Kitsuregawa, Masaru ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY PARSING; FEATURE VECTORS; ONLINE LEARNING; ONLINE METHODS; ONLINE TRAINING; ORDERS OF MAGNITUDE; POLYNOMIAL KERNELS; SPACE EFFICIENCIES;

COMPUTATIONAL LINGUISTICS;

E-LEARNING;

EID: 80053417271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Ando, Rie Kubota and Tong Zhang. 2005. A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research, 6:1817-1853.
2. Aoe, Jun'ichi. 1989. An efficient digital search algorithm by using a double-array structure. IEEE Transactions on Software Engineering, 15(9):1066- 1077.
3. Bellare, Kedar, Partha Pratim Talukdar, Giridhar Kumaran, Fernando Pereira, Mark Liberman, Andrew McCallum, and Mark Dredze. 2007. Lightlysupervised attribute extraction. In Proc. NIPS 2007 Workshop on Machine Learning for Web Search.
4. Cavallanti, Giovanni, Nicolò Cesa-Bianchi, and Claudio Gentile. 2007. Tracking the best hyperplane with a simple budget perceptron. Machine Learning, 69(2-3):143-167. (Pubitemid 47574313)
5. Chang, Yin-Wen, Cho-Jui Hsieh, Kai-Wei Chang, Michael Ringgaard, and Chih-Jen Lin. 2010. Training and testing low-degree polynomial data mappings via linear SVM. Journal of Machine Learning Research, 11:1471-1490.
6. Crammer, Koby, Ofer Dekel, Joseph Keshet, Shai Shalev-Shwartz, and Yoram Singer. 2006. Online passive-aggressive algorithms. Journal of Machine Learning Research, 7:551-585. (Pubitemid 43668115)
7. Daumé III, Hal. 2006. Practical Structured Learning Techniques for Natural Language Processing. Ph.D. thesis, University of Southern California.
8. Dauḿe III, Hal. 2008. Cross-task knowledgeconstrained self training. In Proc. EMNLP 2008, pages 680-688.
9. Dekel, Ofer, Shai Shalev-Shwartz, and Yoram Singer. 2008. The forgetron: A kernel-based perceptron on a budget. SIAM Journal on Computing, 37(5):1342-1372.
10. Freund, Yoav and Robert E. Schapire. 1999. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296. (Pubitemid 32210619)
11. Goldberg, Yoav and Michael Elhadad. 2008. splitSVM: fast, space-efficient, non-heuristic, polynomial kernel computation for NLP applications. In Proc. ACL-08: HLT, Short Papers, pages 237-240.
12. Isozaki, Hideki and Hideto Kazawa. 2002. Efficient support vector classifiers for named entity recognition. In Proc. COLING 2002, pages 1-7.
13. Iwakura, Tomoya and Seishi Okamoto. 2008. A fast boosting-based learner for feature-rich tagging and chunking. In Proc. CoNLL 2008, pages 17-24.
14. Kudo, Taku and Yuji Matsumoto. 2003. Fast methods for kernel-based text analysis. In Proc. ACL 2003, pages 24-31.
15. Liang, Percy, Hal Daumé III, and Dan Klein. 2008. Structure compilation: trading structure for features. In Proc. ICML 2008, pages 592-599.
16. Okanohara, Daisuke and Jun'ichi Tsujii. 2007. A discriminative language model with pseudo-negative samples. In Proc. ACL 2007, pages 73-80.
17. Okanohara, Daisuke and Jun'ichi Tsujii. 2009. Learning combination features with L1 regularization. In Proc. NAACL HLT 2009, Short Papers, pages 97- 100.
18. Orabona, Francesco, Joseph Keshet, and Barbara Caputo. 2009. Bounded kernel-based online learning. Journal of Machine Learning Research, 10:2643- 2666.
19. Perkins, Simon, Kevin Lacker, and James Theiler. 2003. Grafting: fast, incremental feature selection by gradient descent in function space. Journal of Machine Learning Research, 3:1333-1356.
20. Sassano, Manabu. 2004. Linear-time dependency analysis for Japanese. In Proc. COLING 2004, pages 8-14.
21. Sumida, Asuka, Naoki Yoshinaga, and Kentaro Torisawa. 2008. Boosting precision and recall of hyponymy relation acquisition from hierarchical layouts in Wikipedia. In Proc. LREC 2008, pages 2462-2469.
22. Tsuruoka, Yoshimasa, Jun'ichi Tsujii, and Sophia Ananiadou. 2009. Stochastic gradient descent training for L1-regularized log-linear models with cumulative penalty. In Proc. ACL-IJCNLP 2009, pages 477-485.
23. Williams, Hugh E. and Justin Zobel. 1999. Compressing integers for fast file access. The Computer Journal, 42(3):193-201.
24. Wu, Yu-Chieh, Jie-Chi Yang, and Yue-Shi Lee. 2007. An approximate approach for training polynomial kernel SVMs in linear time. In Proc. ACL 2007, Interactive Poster and Demonstration Sessions, pages 65-68.
25. Yata, Susumu, Masahiro Tamura, Kazuhiro Morita, Masao Fuketa, and Jun'ichi Aoe. 2009. Sequential insertions and performance evaluations for doublearrays. In Proc. the 71st National Convention of IPSJ, pages 1263-1264. (In Japanese).
26. Yoshinaga, Naoki and Masaru Kitsuregawa. 2009. Polynomial to linear: efficient classification with conjunctive features. In Proc. EMNLP 2009, pages 1542-1551.