Intelligent Systems Reference Library

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Authors: AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M.

Free Preview
  • Presents different dynamic programming applications in the areas of (i) optimization of decision trees, (ii) optimization of decision rules and systems of decision rules, (iii) optimization of element partition trees, which are used in finite element methods for solving partial differential equations (PDEs), and (iv) study of combinatorial optimization problems
  • Studies optimal element partition trees for rectangular meshes
  • Creates a multi-stage optimization approach for classic combinatorial optimization problems such as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths
see more benefits

Buy this book

eBook 118,99 €
price for India (gross)
  • ISBN 978-3-319-91839-6
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 139,99 €
price for India (gross)
  • ISBN 978-3-319-91838-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover 139,99 €
price for India (gross)
  • ISBN 978-3-030-06309-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

 


Table of contents (19 chapters)

Table of contents (19 chapters)
  • Introduction

    Pages 1-12

    AbouEisha, Hassan (et al.)

  • Tools for Study of Pareto Optimal Points

    Pages 15-21

    AbouEisha, Hassan (et al.)

  • Some Tools for Decision Tables

    Pages 23-31

    AbouEisha, Hassan (et al.)

  • Different Kinds of Decision Trees

    Pages 35-48

    AbouEisha, Hassan (et al.)

  • Multi-stage Optimization of Decision Trees with Some Applications

    Pages 49-71

    AbouEisha, Hassan (et al.)

Buy this book

eBook 118,99 €
price for India (gross)
  • ISBN 978-3-319-91839-6
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 139,99 €
price for India (gross)
  • ISBN 978-3-319-91838-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover 139,99 €
price for India (gross)
  • ISBN 978-3-030-06309-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Authors
Series Title
Intelligent Systems Reference Library
Series Volume
146
Copyright
2019
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing AG, part of Springer Nature
eBook ISBN
978-3-319-91839-6
DOI
10.1007/978-3-319-91839-6
Hardcover ISBN
978-3-319-91838-9
Softcover ISBN
978-3-030-06309-2
Series ISSN
1868-4394
Edition Number
1
Number of Pages
XVI, 280
Number of Illustrations
69 b/w illustrations, 3 illustrations in colour
Topics