Sebanyak 3 item atau buku ditemukan

Instance Selection and Construction for Data Mining

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.

This volume serves as a comprehensive reference for graduate students, practitioners and researchers in KDD.

Principles of Data Mining and Knowledge Discovery

Second European Symposium, PKDD'98, Nantes, France, September 23-26, 1998, Proceedings

This book constitutes the refereed proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD '98, held in Nantes, France, in September 1998. The volume presents 26 revised papers corresponding to the oral presentations given at the conference; also included are refereed papers corresponding to the 30 poster presentations. These papers were selected from a total of 73 full draft submissions. The papers are organized in topical sections on rule evaluation, visualization, association rules and text mining, KDD process and software, tree construction, sequential and spatial data mining, and attribute selection.

Programmer's Guide to Fortran 90

Written by members of the Fortran 90ISO and ANSI committees, this book is the source of the most important information about the powerful new Fortran 90 programming language. All of the important new features of Fortran 90 are covered with examples, and case studies are used to illustrate the practical use of features.

Written by members of the Fortran 90 ISO and ANSI committees, this book is the source of the most important information about the powerful Fortran 90 programming language.