|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3229410 |
| 003 |
MWH |
| 005 |
20191022101430.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s1998 xxu| s |||| 0|eng d |
| 020 |
|
|
|a 9781461556893
|
| 024 |
7 |
|
|a 10.1007/978-1-4615-5689-3
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-1-4615-5689-3
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 072 |
|
7 |
|a GPF
|2 thema
|
| 100 |
1 |
|
|a Huan Liu.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
0 |
|a Feature Selection for Knowledge Discovery and Data Mining
|h [electronic resource] /
|c by Huan Liu, Hiroshi Motoda.
|
| 250 |
|
|
|a 1st ed. 1998.
|
| 264 |
|
1 |
|a New York, NY :
|b Springer US :
|b Imprint: Springer,
|c 1998.
|
| 300 |
|
|
|a XXIII, 214 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a The Springer International Series in Engineering and Computer Science,
|x 0893-3405 ;
|v 454
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a 1. Data Processing and KDD -- 1.1 Inductive Learning from Observation -- 1.2 Knowledge Discovery and Data Mining -- 1.3 Feature Selection and Its Roles in KDD -- 1.4 Summary -- References -- 2. Perspectives of Feature Selection -- 2.1 Feature Selection for Classification -- 2.2 A Search Problem -- 2.3 Selection Criteria -- 2.4 Univariate vs. Multivariate Feature Selection -- 2.5 Filter vs. Wrapper Models -- 2.6 A Unified View -- 2.7 Conclusion -- References -- 3. Aspects of Feature Selection -- 3.1 Overview -- 3.2 Basic Feature Generation Schemes -- 3.3 Search Strategies -- 3.4 Evaluation Measures With Examples -- 3.5 Conclusion -- References -- 4. Feature Selection Methods -- 4.1 Representative Feature Selection Algorithms -- 4.2 Employing Feature Selection Methods -- 4.3 Conclusion -- References -- 5. Evaluation and Application -- 5.1 Performance Assessment -- 5.2 Evaluation Methods for Classification -- 5.3 Evaluation of Selected Features -- 5.4 Evaluation: Some Examples -- 5.5 Balance between Different Performance Criteria -- 5.6 Applying Feature Selection Methods -- 5.7 Conclusions -- References -- 6. Feature Transformation and Dimensionality Reduction -- 6.1 Feature Extraction -- 6.2 Feature Construction -- 6.3 Feature Discretization -- 6.4 Beyond the Classification Model -- 6.5 Conclusions -- References -- 7. Less is More -- 7.1 A Look Back -- 7.2 A Glance Ahead -- References -- Appendices -- A-Data Mining and Knowledge Discovery Sources -- A.1 Web Site Links -- A.2 Electronic Newsletters, Pages and Journals -- A.3 Some Publically Available Tools -- B-Data Sets and Software Used in This Book -- B.1 Data Sets -- B.2 Software -- References.
|
| 520 |
|
|
|a 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.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Motoda, Hiroshi.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a The Springer International Series in Engineering and Computer Science,
|x 0893-3405 ;
|v 454
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-1-4615-5689-3
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32294104
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g xxu
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-ENG
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Engineering (Springer-11647)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21425759
|z 02-26-20
|
| 999 |
f |
f |
|i edf09217-a6d7-52dd-9168-3414cee1e3dc
|s d6fd2d83-59d8-5381-9af5-2e55e0c034fa
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|