Combinatorial Machine Learning [recurso electrónico] : A Rough Set Approach / by Mikhail Moshkov, Beata Zielosko.
Tipo de material:
TextoSeries Studies in Computational Intelligence ; 360Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: XIV, 182 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642209956Tema(s): Engineering | Artificial intelligence | Engineering | Computational Intelligence | Artificial Intelligence (incl. Robotics)Formatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 006.3 Clasificación LoC:Q342Recursos en línea: Libro electrónico
En: Springer eBooksResumen: 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.
| 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 | Q342 (Browse shelf(Abre debajo)) | 1 | No para préstamo | 376177-2001 |
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.
19
