Learning an optimal distance metric in a linguistic vector space

Systems and Computers in Japan

Volumn 37, Issue 9, 2006, Pages 12-21

  Mochihashi, Daichi ^a,b   Kikui, Genichiro ^a   Kita, Kenji ^a,c  

^a ADVANCED TELECOMMUNICATIONS RESEARCH INSTITUTE INTERNATIONAL   (Japan)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

Cosine distance; Feature space; Kernel methods; Metric distance; tf.idf

Indexed keywords

COMPUTATIONAL LINGUISTICS; FEATURE EXTRACTION; NATURAL POLYMERS; OPTIMIZATION; VECTORS;

EUCLIDEAN DISTANCE; FEATURE SPACE; KERNEL METHODS; METRIC DISTANCE;

LEARNING SYSTEMS;

EID: 33746111259     PISSN: 08821666     EISSN: 1520684X     Source Type: Journal    
DOI: 10.1002/scj.20533     Document Type: Article

References (22)

1. Hearst M. Multi-paragraph segmentation of expository text. 32nd Annual Meeting of the Association for Computational Linguistics, p 9-16, 1994.
2. Choi FYY. Advances in domain independent linear text segmentation. Proceedings of NAACL-00.
3. Collins M, Duffy N. Convolution kernels for natural language. NIPS 2001.
4. Suzuki J, Hirao T, Sasaki Y, Maeda E. Hierarchical directed acyclic graph kernel: Methods for structured natural language data. 41st Annual Meeting of Association for Computational Linguistics, p 32-39, 2003.
5. Manning CD, Schütze H. Foundations of statistical natural language processing. MIT Press; 1999.
6. Baeza-Yates RA, Ribeiro-Neto BA. Modern information retrieval. ACM Press/Addison-Wesley; 1999.
7. Salton G, Yang CS. On the specification of term values in automatic indexing. J Documentation 1973;29:351-372.
8. Müller KR, Mika S, Ratsch G, Tsuda K. An introduction to kernel-based learning algorithms. IEEE Neural Networks 2001;12:181-201.
9. Xing EP, Ng AY, Jordan MI, Russell S. Distance metric learning, with application to clustering with side-information. NIPS 2002.
10. Bach FR, Jordan MI. Learning spectral clustering. NIPS 2003.
11. Schultz M, Joachims T. Learning a distance metric from relative comparisons. NIPS 2003.
12. Jaakkola TS, Haussler D. Exploiting generative models in discriminative classifiers. Proc 1998 Conference on Advances in Neural Information Processing Systems, p 487-493.
13. Jiang EP, Berry MW. Information filtering using the Riemannian SVD (R-SVD). Proc IRREGULAR '98, p 386-395.
14. De Moor B. Structured total least squares and L2 approximation problems. Systems & Control, Special Issue of Linear Algebra and its Applications on Numerical Linear Algebra 1993; 188-189:163-207.
15. Duda RO, Hart PE, Stork DG. Pattern classification, 2nd edition. John Wiley & Sons; 2000.
16. Ishikawa Y, Subramanya R, Faloutsos C. Mind-Reader: Querying databases through multiple examples. Proc 24th Int Conf Very Large Data Bases, p 218-227, 1998.
17. Sugaya F, Takezawa T, Kikui G, Yamamoto S. Proposal for a very-large-corpus acquisition method by cell-formed registration. Proc LREC-2002, Vol. I, p 326-328.
18. Deerwester S, Dumais ST, Furnas GW. Indexing by latent semantic analysis. J Am Soc Inform Sci 1990:41:391-407.
19. Joachims T. Text categorization with support vector machines: learning with many relevant features. Proc ECML-98, No. 1398, p 137-142.
20. Lang K. Newsweeder: Learning to filter netnews. Proc 12th International Conference on Machine Learning, p 331-339, 1995.
21. Dhillon IS, Modha DS. Concept decompositions for large sparse text data using clustering. Machine Learning 2001;42:143-175.
22. Blake CL, Merz CJ. UCI Repository of machine learning databases. 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html.