Demand-Driven Associative Classification [recurso electrónico] / by Adriano Veloso, Wagner Meira Jr.

Por: Veloso, Adriano [author.]Colaborador(es): Meira Jr., Wagner [author.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries SpringerBriefs in Computer ScienceEditor: London : Springer London, 2011Descripción: XIII, 112p. 27 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9780857295255Tema(s): Computer science | Data mining | Computer Science | Data Mining and Knowledge Discovery | Probability and Statistics in Computer ScienceFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 006.312 Clasificación LoC:QA76.9.D343Recursos en línea: Libro electrónicoTexto
Contenidos:
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.
En: 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.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos QA76.9 .D343 (Browse shelf(Abre debajo)) 1 No para préstamo 370579-2001

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.

19

Con tecnología Koha