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.
Reihe
Auflage
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 241 mm
Breite: 160 mm
Dicke: 29 mm
Gewicht
ISBN-13
978-0-7923-7209-7 (9780792372097)
DOI
10.1007/978-1-4757-3359-4
Schweitzer Klassifikation
1 Data Reduction via Instance Selection.- 2 Sampling: Knowing Whole from Its Part.- 3 A Unifying View on Instance Selection.- 4 Competence Guided Instance Selection for Case-Based Reasoning.- 5 Identifying Competence-Critical Instances for Instance-Based Learners.- 6 Genetic-Algorithm-Based Instance and Feature Selection.- 7 The Landmark Model: An Instance Selection Method for Time Series Data.- 8 Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms.- 9 Progressive Sampling.- 10 Sampling Strategy for Building Decision Trees from Very Large Databases Comprising Many Continuous Attributes.- 11 Incremental Classification Using Tree-Based Sampling for Large Data.- 12 Instance Construction via Likelihood-Based Data Squashing.- 13 Learning via Prototype Generation and Filtering.- 14 Instance Selection Based on Hypertuples.- 15 KBIS: Using Domain Knowledge to Guide Instance Selection.- 16 Instance Sampling for Boosted and Standalone Nearest Neighbor Classifiers.- 17 Prototype Selection Using Boosted Nearest-Neighbors.- 18 DAGGER: Instance Selection for Combining Multiple Models Learnt from Disjoint Subsets.- 19 Using Genetic Algorithms for Training Data Selection in RBF Networks.- 20 An Active Learning Formulation for Instance Selection with Applications to Object Detection.- 21 Filtering Noisy Instances and Outliers.- 22 Instance Selection Based on Support Vector Machine.- Appendix: Meningoencepalitis Data Set.
