Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

Feature Selection for Knowledge Discovery and Data Mining

Name: Feature Selection for Knowledge Discovery and Data Mining
Brand: Springer, Berlin
SKU: 05257852
Price: 371.69 EUR
Availability: InStock
Author: uan Liu
ISBN: 9781461376040

uan Liu

Hiroshi Motoda

Idioma

Inglés

Libro Tapa blanda

Código Libristo: 05257852

Editores Springer, Berlin, noviembre 2012

As computer power grows and data collection technologies advance, a plethora of data is generated in... Descripción completa

Código Libristo: 05257852

910 b

371.69 €

Almacenamiento externo Envío en 5-8 días

Política de devolución de 30 días

Clientes que también han comprado

Destructio Cabale, seu Cabalistice perfidie ab Ioanne Reuchlin Capnione iampridem in lucem edite Carl von Reifitz

Tapa blanda

52.49 €

Cementerio hebreo de Santiago de Cuba Zaylen Clavería Centurión

Tapa blanda

20.09 €

Esther Parmentier, sorcière stagiaire - Tome 2, Trafic sanglant, vampires sur les dents Maëlle Desard

Tapa blanda

12.99 €

Nem um centavo a mais nem a menos Archer

MP3

10.09 €

Bonne fête Maman ! Karine-Marie Amiot

Tapa blanda

9.09 €

Der Hof Von Ferrara (1921) Casimir Von Chledowski

Tapa blanda

47.49 €

Catalogue d'Estampes Japonaises. Exposition, Musee Des Arts Decoratifs, Janvier 1912 Charles Vignier

Tapa blanda

25.09 €

TAZA ARIES.(HOROSCOPO NEGRO)

Tapa blanda

11.39 €

Estatutos de la Conferencia Episcopal Española

Tapa blanda

11.59 €

Tentando ver a Luz Darren Cox

Adobe ePub DRM

2.99 €

Türkiye Nereye Gidiyor Metin Aydogan

Tapa blanda

13.29 €

Kompetenzen in DaF / DaZ Christina Maria Ersch

Tapa blanda

41.29 €

Entre Tu I Jo Maria Plana Nova

Tapa blanda

12.19 €

LA NECESIDAD SOCIOJURÍDICA DE LA MEDIACIÓN MARIA JOSE RUIZ GARCIA

Tapa dura

48.99 €

Catalogue General de la Librairie Francaise. Periode 1891-1899, A-H -Tome 14 JORDELL-D

Tapa blanda

58.29 €

Něco pro radost Klára Trnková

Libro

6.09 €

Krolewna Lenka rozrabia Aneta Krella-Moch

Tapa dura

6.89 €

Resum de literatura llatina : Antologia de textos a cura d'Eusebi Ayensa Carles Riba

Tapa blanda

27.69 €

Cómo construir su repertorio de aperturas en ajedrez Steve Giddins

Tapa blanda

15.50 €

Psicología budista : reflexiones sobre el abhidharma Chögyam Trungpa

Tapa blanda

19.39 €

Quand j'avais cinq ans je m'ai tue d'Howard Buten (Fiche de lecture) Grégory Jaucot

Tapa blanda

14.99 €

Stelle Sono Squarci Nel Cielo Marco Placido Stissi

Tapa blanda

15.39 €

Umsetzung des Gemeinsamen/ Integrativen Unterrichts an Thuringer Grundschulen Andrea Heidelberger

Tapa blanda

27.69 €

Alitajuntamme demonit F. Weill

Tapa blanda

7.59 €

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.