| 000 -LEADER |
|---|
| fixed length control field |
02330 a2200277 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20181016121331.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
181010b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9783319918389 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
IIT Kanpur |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
658.4032 |
| Item number |
Ex84 |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Extensions of dynamic programming for combinatorial optimization and data mining |
| Statement of responsibility, etc |
Hassan AbouEisha ...[et al.] |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication |
Switzerland |
| Name of publisher |
Springer |
| Year of publication |
2019 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
xvi, 280p |
| 440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Intelligent systems reference library |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
/ edited by Janusz Kacprzyk; v.146 |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Multi stage optimization |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Pareto optimal |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
AbouEisha, Hassan |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Amin, Talha |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Chikalov, Igor |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Hussain, Shahid |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Moshkov, Mikhail |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Books |
