Distributed tree kernels

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 1, Issue , 2012, Pages 193-200

  Zanzotto, Fabio Massimo ^a   Dell'Arciprete, Lorenzo ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE SPACE; LINEAR COMPLEXITY ALGORITHM; LOW-DIMENSIONAL SPACES; NATURAL LANGUAGE PROCESSING; SPACE COMPLEXITY; TREE KERNELS;

LEARNING ALGORITHMS; LEARNING SYSTEMS; NATURAL LANGUAGE PROCESSING SYSTEMS; VECTOR SPACES;

FORESTRY;

ALGORITHMS; FORESTRY; LANGUAGES;

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

References (20)

1. Collins, Michael and Duffy, Nigel. Convolution kernels for natural language. In NIPS, pp. 625-632, 2001.
2. Dagan, Ido, Glickman, Oren, and Magnini, Bernardo. The pascal recognising textual entailment challenge. In Quionero-Candela et al.(ed.), LNAI 3944: MLCW 2005, pp. 177-190. Springer-Verlag, 2006.
3. Dasgupta, Sanjoy and Gupta, Anupam. An elementary proof of the Johnson-Linderstrauss lemma. Tech. Rept. TR-99-006, ICSI, Berkeley, California, 1999.
4. Düssel, Patrick, Gehl, Christian, Laskov, Pavel, and Rieck, Konrad. Incorporation of application layer protocol syntax into anomaly detection. In ICISS, 188-202, 2008.
5. Gildea, Daniel and Jurafsky, Daniel. Automatic Labeling of Semantic Roles. Computational Linguistics, 28(3):245-288, 2002.
6. Hashimoto, Kosuke, Takigawa, Ichigaku, Shiga, Motoki, Kanehisa, Minoru, and Mamitsuka, Hiroshi. Mining significant tree patterns in carbohydrate sugar chains. Bioinformatics, 24:167-173, 2008.
7. Haussler, David. Convolution kernels on discrete structures. Tech. Rept., Univ. of California at Santa Cruz, 1999.
8. Hinton, G. E., McClelland, J. L., and Rumelhart, D. E. Distributed representations. In Rumelhart, D. E. and McClelland, J. L. (eds.), Parallel Distributed Processing: Explorations in the Microstructure of Cognition. Volume 1: Foundations. MIT Press, Cambridge, MA., 1986.
9. Johnson, W. and Lindenstrauss, J. Extensions of lipschitz mappings into a hilbert space. Contemp. Math., 26:189-206, 1984.
10. MacCartney, Bill, Grenager, Trond, de Mameffe, Marie-Catherine, Cer, Daniel, and Manning, Christopher D. Learning to recognize features of valid textual entailments. In NAACL, New York, NY, pp. 41-48, 2006.
11. Moschitti, Alessandro. Making tree kernels practical for natural language learning. In EACL, Trento, Italy, 2006.
12. Moschitti, Alessandro and Zanzotto, Fabio Massimo. Fast and effective kernels for relational learning from texts. In ICML, Corvallis, Oregon, 2007.
13. Pighin, Daniele and Moschitti, Alessandro. On reverse feature engineering of syntactic tree kernels. In CoNLL, Uppsala, Sweden, 2010.
14. Plate, T. A. Holographic reduced representations. IEEE Transactions on Neural Networks, 6(3):623-641, 1995.
15. Pradhan, Sameer, Ward, Wayne, Hacioglu, Kadri, Martin, James H., and Jurafsky, Daniel. Semantic role labeling using different syntactic views. In ACL, pp. 581-588. NJ, USA, 2005.
16. Rieck, Konrad, Krueger, Tammo, Brefeld, Ulf, and Müller, Klaus-Robert. Approximate tree kernels. J. Mach. Learn. Res., 11: 555-580, March 2010.
17. Sahlgren, Magnus. An introduction to random indexing. In Workshop of Methods and Applications of Semantic Indexing at TKE, Copenhagen, Denmark, 2005.
18. Shin, Kilho, Cuturi, Marco, and Kuboyama, Tetsuji. Mapping kernels for trees. In ICML, pp. 961-968, NY, 2011.
19. Vert, Jean-Philippe. A tree kernel to analyse phylogenetic profiles. Bioinformatics, 18(suppl 1):S276-S284, 2002.
20. Zanzotto, Fabio Massimo and Dell'Arciprete, Lorenzo. Distributed structures and distributional meaning. In Proceedings of the Workshop on Distributional Semantics and Compositionality, pp. 10-15, Portland, Oregon, USA, 2011.