Combinatorial Machine Learning | A Rough Set Approach

Mikhail Moshkov (u. a.)

ISBN 10: 364226901X ISBN 13: 9783642269011
Editorial: Springer, 2013
Nuevos Taschenbuch

Librería: preigu, Osnabrück, Alemania Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Vendedor de AbeBooks desde 5 de agosto de 2024

Este artículo en concreto ya no está disponible.

Descripción

Descripción:

Combinatorial Machine Learning | A Rough Set Approach | Mikhail Moshkov (u. a.) | Taschenbuch | Studies in Computational Intelligence | xiv | Englisch | 2013 | Springer | EAN 9783642269011 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de ref. del artículo 105706070

Denunciar este artículo

Sinopsis:

Decision trees and decision rule systems are widely used in different applications

as algorithms for problem solving, as predictors, and as a way for

knowledge representation. Reducts play key role in the problem of attribute

(feature) selection. The aims of this book are (i) the consideration of the sets

of decision trees, rules and reducts; (ii) study of relationships among these

objects; (iii) design of algorithms for construction of trees, rules and reducts;

and (iv) obtaining bounds on their complexity. Applications for supervised

machine learning, discrete optimization, analysis of acyclic programs, fault

diagnosis, and pattern recognition are considered also. This is a mixture of

research monograph and lecture notes. It contains many unpublished results.

However, proofs are carefully selected to be understandable for students.

The results considered in this book can be useful for researchers in machine

learning, data mining and knowledge discovery, especially for those who are

working in rough set theory, test theory and logical analysis of data. The book

can be used in the creation of courses for graduate students.

De la contraportada:

Decision trees and decision rule systems are widely used in different applications

as algorithms for problem solving, as predictors, and as a way for

knowledge representation. Reducts play key role in the problem of attribute

(feature) selection. The aims of this book are (i) the consideration of the sets

of decision trees, rules and reducts; (ii) study of relationships among these

objects; (iii) design of algorithms for construction of trees, rules and reducts;

and (iv) obtaining bounds on their complexity. Applications for supervised

machine learning, discrete optimization, analysis of acyclic programs, fault

diagnosis, and pattern recognition are considered also. This is a mixture of

research monograph and lecture notes. It contains many unpublished results.

However, proofs are carefully selected to be understandable for students.

The results considered in this book can be useful for researchers in machine

learning, data mining and knowledge discovery, especially for those who are

working in rough set theory, test theory and logical analysis of data. The book

can be used in the creation of courses for graduate students.

"Sobre este título" puede pertenecer a otra edición de este libro.

Detalles bibliográficos

Título: Combinatorial Machine Learning | A Rough Set...
Editorial: Springer
Año de publicación: 2013
Encuadernación: Taschenbuch
Condición: Neu

Los mejores resultados en AbeBooks

Existen otras 1 copia(s) de este libro

Ver todos los resultados de su búsqueda