Discovering an Effective Measure in Data Mining

View Sample PDF

Author(s): Takao Ito (Ube National College of Technology, Japan)
Copyright: 2009
Pages: 9
Source title: Encyclopedia of Data Warehousing and Mining, Second Edition
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-60566-010-3.ch102

Purchase

View Discovering an Effective Measure in Data Mining on the publisher's website for pricing and purchasing information.

Abstract

One of the most important issues in data mining is to discover an implicit relationship between words in a large corpus and labels in a large database. The relationship between words and labels often is expressed as a function of distance measures. An effective measure would be useful not only for getting the high precision of data mining, but also for time saving of the operation in data mining. In previous research, many measures for calculating the one-to-many relationship have been proposed, such as the complementary similarity measure, the mutual information, and the phi coefficient. Some research showed that the complementary similarity measure is the most effective. The author reviewed previous research related to the measures in one-to-many relationships and proposed a new idea to get an effective one, based on the heuristic approach in this article.

The IRMA Community

Research IRM

Discovering an Effective Measure in Data Mining

Purchase

Abstract

Related Content

IRMA Sponsors