Asymptotic evaluation of distance measure on high dimensional vector spaces in text mining

Masayuki Goto*, Takashi Ishida, Makoto Suzuki, Shigeichi Hirasawa

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper discusses the document classification problems in text mining from the viewpoint of asymptotic statistical analysis. In the problem of text mining, the several heuristics are applied to practical analysis because of its experimental effectiveness in many case studies. The theoretical explanation about the performance of text mining techniques is required and such thinking will give us very clear idea. In this paper, the performances of distance measures used to classify the documents are analyzed from the new viewpoint of asymptotic analysis. We also discuss the asymptotic performance of IDF measure used in the information retrieval field.

Original languageEnglish
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
Duration: 2008 Dec 72008 Dec 10

Publication series

Name2008 International Symposium on Information Theory and its Applications, ISITA2008

Conference

Conference2008 International Symposium on Information Theory and its Applications, ISITA2008
Country/TerritoryNew Zealand
CityAuckland
Period08/12/708/12/10

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Asymptotic evaluation of distance measure on high dimensional vector spaces in text mining'. Together they form a unique fingerprint.

Cite this