Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

Combinatorial Machine Learning: A Rough Set Approach - Hardcover

$178.18 USD
$178.18 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
Combinatorial Machine Learning: A Rough Set Approach - Hardcover
Combinatorial Machine Learning: A Rough Set Approach - Hardcover
Combinatorial Machine Learning: A Rough Set Approach - Hardcover
$178.18/ea
$0.00
$178.18/ea $0.00

Product Description

by Mikhail Moshkov (Author), Beata Zielosko (Author)

This book explores decision trees and decision rule systems, rules and reducts, examines relationships among these objects and reviews the design of algorithms for construction of trees, rules and reducts. Includes carefully selected illustrative proofs.

Back Jacket

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.

Number of Pages: 182
Dimensions: 0.5 x 9.21 x 6.14 IN
Publication Date: June 29, 2011
you might like