Title: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library, 146)
Publisher: Springer
Publication Date: 2019
Language: English
ISBN 10: 3030063097
ISBN 13: 9783030063092
Binding: Soft cover
Condition: New

About this title

Synopsis

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.

From the Back Cover

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 methodsfor 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.

"About this title" may belong to another edition of this title.

Store Description

Quality books, speedy shipping, and great customer service! Please note that used items may not include access codes or cards, CD's or other accessories, regardless of what is stated in item title. If you need to guarantee that these items are included, please purchase a brand new copy.

Visit Seller's Storefront

Seller's business information

J2B Holdings, LLC
13770 NOEL RD, #803600, Dallas, TX, 75240, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.

All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...

More Information

Shipping Terms

Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.