Adriano Veloso Wagner Meira Jr. Veloso Demand-Driven Associative Classification

Demand-Driven Associative Classification

von Adriano Veloso Wagner Meira Jr.

Preis unbekannt

Buch in deiner Nähe kaufen


...oder deine aktuelle Postleitzahl eingeben:
oder

Beschreibung

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.


First book only devoted to associative classification, which is an emerging classification strategy The work puts associative classification algorithms into the existing machine learning theory The work lists several successful application scenarios for associative classification

Autor*in

Adriano Veloso

Themen in »Demand-Driven Associative Classification«

Associative Classification Associative Rules Calibrated Classification Learning to Rank Multi-Label Classification

Stimmen zu »Demand-Driven Associative Classification«

Details

ISBN: 9780857295248
Verlag: Springer London
Erscheinung: 19.05.2011

Link teilen


Über buchnah.de | Die Buchhandlungen | Die Verlage | Impressum & Kontakt | Datenschutz | Presse


Auf dieser Seite kannst Du Buchhandlungen in der Nähe finden