Imagen de Google Jackets

Demand-Driven Associative Classification [electronic resource] / by Adriano Veloso, Wagner Meira Jr.

Por: Colaborador(es): Tipo de material: TextoTextoSeries SpringerBriefs in Computer Science | SpringerBriefs in Computer ScienceEditor: London : Springer London, 2011Descripción: XIII, 112p. 27 illus. online resourceTipo de contenido:
  • text
Tipo de medio:
  • computer
Tipo de soporte:
  • online resource
ISBN:
  • 9780857295255
Trabajos contenidos:
  • SpringerLink (Online service)
Tema(s): Formatos físicos adicionales: Sin títuloClasificación CDD:
  • 006.312 23
Clasificación LoC:
  • QA76.9.D343
Recursos en línea:
Contenidos:
Springer eBooksResumen: 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.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Introduction and Preliminaries -- Introduction -- The Classification Problem -- Associative Classification -- Demand-Driven Associative Classification -- Extensions to Associative Classification -- Multi-Label Associative Classification -- Competence-Conscious Associative Classification -- Calibrated Associative Classification -- Self-Training Associative Classification -- Ordinal Regression and Ranking -- Conclusions and FutureWork.

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.

ZDB-2-SCS

No hay comentarios en este titulo.

para colocar un comentario.