Using the mutual k-nearest neighbor graphs for semi-supervised classification of natural language data

CoNLL 2011 - Fifteenth Conference on Computational Natural Language Learning, Proceedings of the Conference

Volumn , Issue , 2011, Pages 154-162

  Ozaki, Kohei ^a   Shimbo, Masashi ^a   Komachi, Mamoru ^a   Matsumoto, Yuji ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

B-MATCHING; DE FACTO STANDARD; DOCUMENT CLASSIFICATION; GRAPH CONSTRUCTION; GRAPH-BASED; HIGH-DIMENSIONAL; INPUT DATAS; K-NEAREST NEIGHBOR GRAPHS; MAXIMUM SPANNING TREE; NATURAL LANGUAGES; SEMI-SUPERVISED CLASSIFICATION; SEMI-SUPERVISED CLASSIFICATION METHOD; TWO-GRAPHS; WORD SENSE DISAMBIGUATION;

INFORMATION RETRIEVAL SYSTEMS; SUPERVISED LEARNING;

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (28)

1. Andrei Alexandrescu and Katrin Kirchhoff. 2007. Datadriven graph construction for semi-supervised graphbased learning in NLP. In Proc. of HLT-NAACL.
2. Andrei Alexandrescu and Katrin Kirchhoff. 2009. Graph-based learning for statistical machine translation. In Proc. of NAACL-HLT.
3. Alina Beygelzimer, Sham Kakade, and John Langford. 2006. Cover trees for nearest neighbor. In Proc. Of ICML.
4. Rebecca Bruce and Janyce Wiebe. 1994. Word-sense disambiguation using decomposable models. In Proc. of ACL.
5. Jérôme Callut, Kevin Françoisse, Marco Saerens, and Pierre Dupont. 2008. Semi-supervised classification from discriminative random walks. In Proc. of ECMLPKDD.
6. Nicolo Cesa-Bianchi, Claudio Gentile, Fabio Vitale, and Giovanni Zappella. 2010. Random spanning trees and the prediction of weighted graphs. In Proc. of ICML.
7. Jie Chen, Haw-ren Fang, and Yousef Saad. 2009. Fast approximate kNN graph construction for high dimensional data via recursive lanczos bisection. Journal of Machine Learning Research, 10.
8. Koby Crammer, Mark Dredze, and Alex Kulesza. 2009. Multi-class confidence weighted algorithms. In Proc. of EMNLP.
9. Michael L. Fredman and Robert Endre Tarjan. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, July.
10. Andrew B. Goldberg and Xiaojin Zhu. 2006. Seeing stars when there aren't many stars: graph-based semisupervised learning for sentiment categorization. In Proc. of Text Graphs Workshop on HLT-NAACL.
11. Bert Huang and Tony Jebara. 2007. Loopy belief propagation for bipartite maximum weight b-matching. In Proc. of AISTATS.
12. Tony Jebara, Jun Wang, and Shih-Fu Chang. 2009. Graph construction and b-matching for semisupervised learning. In Proc. of ICML.
13. Ken Lang. 1995. Newsweeder: Learning to filter netnews. In Proc. of ICML.
14. Claudia Leacock, Geoffrey Towell, and Ellen Voorhees. 1993. Corpus-based statistical sense resolution. In Proc. of ARPA Workshop on HLT.
15. Yoong Keok Lee and Hwee Tou Ng. 2002. An empirical evaluation of knowledge sources and learning algorithms for word sense disambiguation. In Proc. Of EMNLP.
16. David D. Lewis, Yiming Yang, Tony G. Rose, Fan Li, G. Dietterich, and Fan Li. 2004. RCV1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 5.
17. Markus Maier, Matthias Hein, and Ulrike von Luxburg. 2009. Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters. Journal of Theoretical Computer Science, 410.
18. Zheng-Yu Niu, Dong-Hong Ji, and Chew Lim Tan. 2005. Word sense disambiguation using label propagation based semi-supervised learning. In Proc. of ACL.
19. Miloš Radovanović, Alexandros Nanopoulos, and Mirjana Ivanović. 2010. Hub in space: popular nearest neighbors in high-dimensional data. Journal of Machine Learning Research, 11.
20. Parikshit Ram, Dongryeol Lee, William March, and Alexander Gray. 2010. Linear-time algorithms for pairwise statistical problems. In Proc. of NIPS.
21. Jason D. M. Rennie. 2001. Improving multi-class text classification with naive bayes. Master's thesis, Massachusetts Institute of Technology. AITR-2001-004.
22. Martin Szummer and Tommi Jaakkola. 2002. Partially labeled classification with markov random walks. In Proc. of NIPS.
23. Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, and Koji Tsuda. 2010. Single versus multiple sorting in all pairs similarity search. In Proc. of ACML.
24. Jun Wang, Tony Jebara, and Shih-Fu Chang. 2008. Graph transduction via alternating minimization. In Proc. of ICML.
25. Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Schölkopf. 2004. Learning with local and global consistency. In Proc. Of NIPS.
26. Xiaojin Zhu, Zoubin Ghahramani, and John D. Lafferty. 2003. Semi-supervised learning using gaussian fields and harmonic functions. In Proc. of ICML.
27. Xiaojin Zhu. 2005. Semi-Supervised Learning with Graphs. Ph.D. thesis, Carnegie Mellon University. CMU-LTI-05-192.
28. Xiaojin Zhu. 2008. Semi-supervised learning literature survey. Technical Report 1530, Computer Sciences, University of Wisconsin-Madison.