Kniha Demand-Driven Associative Classification Adriano Veloso

Demand-Driven Associative Classification

Jazyk: Angličtina
Vazba: Brožovaná
Vydavatel: Springer London Ltd
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
1 147
The ultimate goal of machines is to help humans to solve problems.§Such problems range between two e...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2011
Stránek
112
EAN
9780857295248
ISBN
0857295241
Enbook ID
01400004
Hmotnost
209
Rozměry
155 x 235 x 8

Kompletní popis

The ultimate goal of machines is to help humans to solve problems.§Such problems range between two extremes: structured problems for which the solution is totally defined (and thus are easily programmed by humans), and random problems for which the solution is completely undefined (and thus cannot be programmed). Problems in the vast middle ground have solutions that cannot be well defined and are, thus, inherently hard to program. Machine Learning is the way to handle this vast middle ground, so that many tedious and difficult hand-coding tasks would be replaced by automatic learning methods. There are several machine learning tasks, and this work is focused on a major one, which is known as classification. Some classification problems are hard to solve, but we show that they can be decomposed into much simpler sub-problems. We also show that independently solving these sub-problems by taking into account their particular demands, often leads to improved classification performance.

Mohlo by vás zajímat

208
765
344
324
566

Anxious People

Fredrik Backman
575
209

Secular, Scarred and Sacred

Jerome Teelucksingh
1 973

Mind Clutter

Celeste Roam
229
347

Enemies Within

Richard Davenport-Hines
650
3 426
3 937

Zákaznicí kteří koupili tuto knihu koupili také

331

Accident de la Route

Agnes F. Vandome
2 671

L'Assommoir

Emilie Zola
809

Láska srdce

Hanka Fabijenna Goldová
203
113
212
537
396

Parvus Nicolaus

René Goscinny
415

Abgabensatzungen

Hans-Joachim Driehaus
999

2011

Monika Estermann
3 312