9780792372097-0792372093-Instance Selection and Construction for Data Mining (The Springer International Series in Engineering and Computer Science, 608)

Instance Selection and Construction for Data Mining (The Springer International Series in Engineering and Computer Science, 608)

ISBN-13: 9780792372097
ISBN-10: 0792372093
Edition: 2001
Author: Huan Liu, Hiroshi Motoda
Publication date: 2001
Publisher: Springer
Format: Hardcover 441 pages
FREE US shipping
Buy

From $47.70

Book details

ISBN-13: 9780792372097
ISBN-10: 0792372093
Edition: 2001
Author: Huan Liu, Hiroshi Motoda
Publication date: 2001
Publisher: Springer
Format: Hardcover 441 pages

Summary

Instance Selection and Construction for Data Mining (The Springer International Series in Engineering and Computer Science, 608) (ISBN-13: 9780792372097 and ISBN-10: 0792372093), written by authors Huan Liu, Hiroshi Motoda, was published by Springer in 2001. With an overall rating of 3.9 stars, it's a notable title among other AI & Machine Learning (Information Theory, Computer Science, Databases & Big Data, Engineering) books. You can easily purchase or rent Instance Selection and Construction for Data Mining (The Springer International Series in Engineering and Computer Science, 608) (Hardcover) from BooksRun, along with many other new and used AI & Machine Learning books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book