Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.99 € Zbirna točka DPD 3.49 € Kurirska služba GLS 5.99 € Kurir DPD 3.99 € Kurirska služba Express One 3.99 € Zbirno mesto Express One 3.99 € Zbirno mesto Pošte Slovenije 3.99 € Dostava preko Pošte Slovenije 3.99 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Analytical and Statistical Data Mining: Classification Trees

Name: Analytical and Statistical Data Mining: Classification Trees
Brand: LAP LAMBERT Academic Publishing
SKU: 36733997
Price: 33.43 EUR
Availability: InStock
Author: Rohit Sachdeva
ISBN: 9786203854022

Rohit Sachdeva

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 36733997

Založba LAP LAMBERT Academic Publishing, julij 2021

In this book two methods are explored that are used for classification tree to handle large amount o... Celoten opis

Koda Libristo: 36733997

81 b

33.43 €

Na zalogi pri dobavitelju Odposlali bomo v 5-8 dneh

Do 30 dni za vračilo

Drugi so kupili tudi

Das Grundgesetz Alles Neuro-Psychischen Lebens (1900) Julius Pikler

Mehka

28.90 €

Le Guide de l'huile de coco Daniel Sincholle

Mehka

12.28 €

Découvertes 1. Ausgabe Bayern, Cahier d'activités mit MP3-CD und Video-DVD. Bd.1

Mehka

14.80 €

Der Verein Michael Röcken

Mehka

13.79 €

CATALOGO MANUSCRITOS POETICOS CASTELLANOS S.XVI Y XVII TOMO II BIBLIOTECA NACIONAL (MADRID)

Knjiga

12.48 €

Cinese. Dizionario compatto cinese-italiano, italiano-cinese e conversazioni Franco Gatti

Mehka

36.05 €

Réussir sa communication orale Floriane Zagar

Adobe ePub DRM

6.34 €

Frauen und Fernsehen in der Bundesrepublik Deutschland zwischen 1959 und 1969 Sabine Wimmer

Mehka

15.20 €

Güvercinlerle Gezen Adam Ali Zengin

Mehka

15.21 €

In this book two methods are explored that are used for classification tree to handle large amount of data. In the first method to mine large data sets, a single training data set is be broken into n subsets. A classification tree will be learned from each of these n subsets in parallel. Rules are then be generated from the classification trees. These rules are combined into one rule set. Then the final set of rules are used to classify future unseen data. In the second method, post process the mined information from classification tree in order to extract actions to change the status of classified groups (e.g. customers) from an undesired status (such as attritors) to a desired one (such as loyal).