0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Artificial intelligence

Buy Now

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Paperback, Softcover reprint of the original 1st ed. 2019) Loot Price: R2,789
Discovery Miles 27 890
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Paperback, Softcover reprint of the original...

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Paperback, Softcover reprint of the original 1st ed. 2019)

Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Series: Intelligent Systems Reference Library, 146

 (sign in to rate)
Loot Price R2,789 Discovery Miles 27 890 | Repayment Terms: R261 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.

General

Imprint: Springer Nature Switzerland AG
Country of origin: Switzerland
Series: Intelligent Systems Reference Library, 146
Release date: 2019
First published: 2019
Authors: Hassan AbouEisha • Talha Amin • Igor Chikalov • Shahid Hussain • Mikhail Moshkov
Dimensions: 235 x 155 x 16mm (L x W x T)
Format: Paperback
Pages: 280
Edition: Softcover reprint of the original 1st ed. 2019
ISBN-13: 978-3-03-006309-2
Categories: Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN: 3-03-006309-7
Barcode: 9783030063092

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners