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, and data smoothing. This title 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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Foreword; R.S. Michalski. Preface. Acknowledgments. Contributing Authors. Part I: Background and Foundation. 1. Data Reduction via Instance Selection; H. Liu, H. Motoda. 2. Sampling: Knowing Whole from its Part; B. Gu, et al. 3. A Unifying View on Instance Selection; T. Reinartz. Part II: Instance Selection Methods. 4. Competence Guided Instance Selection for Case-Based Reasoning; B. Smyth, E. McKenna. 5. Identifying Competence-Critical Instances for Instance-Based Learners; H. Brighton, C. Mellish. 6. Genetic-Algorithm-Based Instance and Feature Selection; H. Ishibuchi, et al. 7. The Landmark Model: An Instance Selection Method for Time Series Data; C.-S. Perng, et al. Part III: Use of Sampling Methods. 8. Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms; C. Domingo, et al. 9. Progressive Sampling; F. Provost, et al. 10. Sampling Strategy for Building Decision Trees from Very Large Databases Comprising Many Continuous Attributes; J.-H. Chauchat, R. Rakotomalala. 11. Incremental Classification Using Tree-Based Sampling for Large Data; H. Yoon, et al. Part IV: Unconventional Methods. 12. Instance Construction via Likelihood-Based Data Squashing; D. Madigan, et al. 13. Learning via Prototype Generation and Filtering; W. Lam, et al. 14. Instance Selection Based on Hypertuples; >H. Wang. 15. KBIS: Using Domain Knowledge to Guide Instance Selection; P. Wright, J. Hodges. Part V: Instance Selection in Model Combination. 16.Instance Sampling for Boosted and Standalone Nearest Neighbor Classifiers; D.B. Skalak. 17. Prototype Selection Using Boosted Nearest-Neighbors; R. Nock, M. Sebban. 18. DAGGER: Instance Selection for Combining Multiple Models Learnt from Disjoint Subsets; W. Davies, P. Edwards. Part VI: Applications of Instance Selection. 19. Using Genetic Algorithms for Training Data Selection in RBF Networks; C.R. Reeves, D.R. Bush. 20. An Active Learning Formulation for Instance Selection with Applications to Object Detection; K.-K. Sung, P. Niyogi. 21. Filtering Noisy Instances and Outliers; D. Gamberger, N. Lavrač. 22. Instance Selection Based on Support Vector Machine; S. Sugaya, et al. Index.
Book by None
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780792372097_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 1707930-n
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 452 pp. Englisch. Codice articolo 9780792372097
Quantità: 2 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 1707930
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 1707930-n
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . Codice articolo 5969995
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 1707930
Quantità: Più di 20 disponibili
Da: preigu, Osnabrück, Germania
Buch. Condizione: Neu. Instance Selection and Construction for Data Mining | Huan Liu (u. a.) | Buch | xxv | Englisch | 2001 | Springer | EAN 9780792372097 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Codice articolo 102405415
Quantità: 5 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 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 as an emerging field. This volume brings researchers and practitioners together to report developments and focuses on the development of instance selection. Editor(s): Liu, Huan; Motoda, H. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 416 pages, biography. BIC Classification: UN; UYQ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 25. Weight in Grams: 807. . 2001. Hardback. . . . . Codice articolo V9780792372097
Quantità: 15 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 452 pp. Englisch. Codice articolo 9780792372097
Quantità: 1 disponibili