• Sign In / Register
  • Help
  • Basket0
Feature Selection for Knowledge Discovery and Data Mining - The Springer International Series in Engineering and Computer Science 454 (Paperback)
  • Feature Selection for Knowledge Discovery and Data Mining - The Springer International Series in Engineering and Computer Science 454 (Paperback)
zoom

Feature Selection for Knowledge Discovery and Data Mining - The Springer International Series in Engineering and Computer Science 454 (Paperback)

(author), (author)
£199.99
Paperback 214 Pages / Published: 27/01/2013
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781461376040
Number of pages: 214
Weight: 379 g
Dimensions: 235 x 155 x 13 mm
Edition: Softcover reprint of the original 1st ed. 199

You may also be interested in...

Understanding Cryptography
Added to basket
Introduction to Algorithms
Added to basket
Algorithmic Problem Solving
Added to basket
Understanding Cryptography
Added to basket
Machine Learning
Added to basket
£39.99
Paperback
Purely Functional Data Structures
Added to basket
Introduction to Algorithms
Added to basket
Algorithms
Added to basket
£66.99
Hardback
Algorithms Unlocked
Added to basket
Concise Guide to Databases
Added to basket
The End of Error
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.