Instance Selection and Construction for Data Mining
Our rough guess is there are 104,000 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 56 minutes to read. With a half hour per day, this will take 14 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Motoda, Hiroshi - Contributor
Publication
2001 - Springer US, Boston, MA, Massachusetts
Language
English
Word Count
104,000 words, Guess
Page Count
416 pages
Physical Format
Electronic resource
Identifiers
- Internet Archiveinstanceselectio00liuh
- ISBN-101441948619
- ISBN-101475733593
- ISBN-139781441948618
- ISBN-139781475733594
and 4 more
- OCLC Control Number851820170
- Better World Books9781441948618
- Better World Books9781475733594
- Open LibraryOL27045835M
Classifications
- DDC005.74
- LCCQA76.9.D35
- LCCQA76.9.D35Q334-342QA
Description
The ability to analyze and understand massive data sets lags far behind the ability to gather and store the data. To meet this challenge, knowledge discovery and data mining (KDD) is growing rapidly as an emerging field. However, no matter how powerful computers are now or will be in the future, KDD researchers and practitioners must consider how to manage ever-growing data which is, ironically, due to the extensive use of computers and ease of data collection with computers. Many different approaches have been used to address the data explosion issue, such as algorithm scale-up and data reduction. Instance, example, or tuple selection pertains to methods or algorithms that select or search for a representative portion of data that can fulfill a KDD task as if the whole data is used. Instance selection is directly related to data reduction and becomes increasingly important in many KDD applications due to the need for processing efficiency and/or storage efficiency. One of the major means of instance selection is sampling whereby a sample is selected for testing and analysis, and randomness is a key element in the process. Instance selection also covers methods that require search. Examples can be found in density estimation (finding the representative instances - data points - for a cluster); boundary hunting (finding the critical instances to form boundaries to differentiate data points of different classes); and data squashing (producing weighted new data with equivalent sufficient statistics). Other important issues related to instance selection extend to unwanted precision, focusing, concept drifts, noise/outlier removal, data smoothing, etc. Instance Selection and Construction for Data Mining brings researchers and practitioners together to report new developments and applications, to share hard-learned experiences in order to avoid similar pitfalls, and to shed light on the future development of instance selection. This volume serves as a comprehensive reference for graduate students, practitioners and researchers in KDD.
Subjects
Series Statement
- The Springer International Series in Engineering and Computer Science -- 608
- International series in engineering and computer science -- 608.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!