Trending Bestseller

Combinatorial Machine Learning

A Rough Set Approach

No reviews yet Write a Review
Paperback / softback
03 August 2013
$226.80
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

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.

You Can Find This Title In

    Product Details
    ISBN-13
    9783642269011
    Author
    Mikhail Moshkov
    Publisher
    Springer Nature B.V.
    Published
    03 August 2013
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $226.80
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Combinatorial Machine Learning

    $226.80

    Description

    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.

    You Can Find This Title In

      This Title Is Categorised As