| Feature Selection for Knowledge Discovery and Data Mining 1998 Edition Contributor(s): Huan Liu (Author), Motoda, Hiroshi (Author) |
|
 |
ISBN: 079238198X ISBN-13: 9780792381983 Publisher: Springer OUR PRICE: $360.99 Product Type: Hardcover - Other Formats Published: July 1998 Annotation: With advanced computer technologies and their omnipresent usage, data accumulates in a speed unmatchable by the human's capacity to process data. To meet this growing challenge, the research community of knowledge discovery from databases emerged. The key issue studied by this community is, in layman's terms, to make advantageous use of large stores of data. In order to make raw data useful, it is necessary to represent, process, and extract knowledge for various applications. Feature Selection for Knowledge Discovery and Data Mining offers an overview of the methods developed since the 1970s and provides a general framework in order to examine these methods and categorize them. This book employs simple examples to show the essence of representative feature selection methods and compares them using data sets with combinations of intrinsic properties according to the objective of feature selection. In addition, the book suggests guidelines on how to use different methods under various circumstances and points out new challenges in this exciting area of research. Feature Selection for Knowledge Discovery and Data Mining is intended to be used by researchers in machine learning, data mining, knowledge discovery and databases as a toolbox of relevant tools that help in solving large real-world problems. This book is also intended to serve as a reference book or secondary text for courses on machine learning, data mining, and databases. |
| Additional Information |
| BISAC Categories: - Computers | Intelligence (ai) & Semantics - Computers | Information Theory - Computers | System Administration - Storage & Retrieval |
| Dewey: 005.74 |
| LCCN: 98-25204 |
| Series: The Springer International Engineering and Computer Science |
| Physical Information: 0.75" H x 6.42" W x 9.58" (1.02 lbs) 214 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: As computer power grows and data collection technologies advance, a plethora of data is generated in almost every field where computers are used. The com- puter generated data should be analyzed by computers; without the aid of computing technologies, it is certain that huge amounts of data collected will not ever be examined, let alone be used to our advantages. Even with today's advanced computer technologies (e. g., machine learning and data mining sys- tems), discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Taking its simplest form, raw data are represented in feature-values. The size of a dataset can be measUJ-ed in two dimensions, number of features (N) and number of instances (P). Both Nand P can be enormously large. This enormity may cause serious problems to many data mining systems. Feature selection is one of the long existing methods that deal with these problems. Its objective is to select a minimal subset of features according to some reasonable criteria so that the original task can be achieved equally well, if not better. By choosing a minimal subset offeatures, irrelevant and redundant features are removed according to the criterion. When N is reduced, the data space shrinks and in a sense, the data set is now a better representative of the whole data population. If necessary, the reduction of N can also give rise to the reduction of P by eliminating duplicates. |