Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: AbouEisha, Hassan (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut), Amin, Talha (http://id.loc.gov/vocabulary/relators/aut), Chikalov, Igor (http://id.loc.gov/vocabulary/relators/aut), Hussain, Shahid (http://id.loc.gov/vocabulary/relators/aut), Moshkov, Mikhail (http://id.loc.gov/vocabulary/relators/aut)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
Έκδοση:1st ed. 2019.
Σειρά:Intelligent Systems Reference Library, 146
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04315nam a2200529 4500
001 978-3-319-91839-6
003 DE-He213
005 20191220130539.0
007 cr nn 008mamaa
008 180522s2019 gw | s |||| 0|eng d
020 |a 9783319918396  |9 978-3-319-91839-6 
024 7 |a 10.1007/978-3-319-91839-6  |2 doi 
040 |d GrThAP 
050 4 |a Q342 
072 7 |a UYQ  |2 bicssc 
072 7 |a TEC009000  |2 bisacsh 
072 7 |a UYQ  |2 thema 
082 0 4 |a 006.3  |2 23 
100 1 |a AbouEisha, Hassan.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining  |h [electronic resource] /  |c by Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov. 
250 |a 1st ed. 2019. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2019. 
300 |a XVI, 280 p. 72 illus., 3 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Intelligent Systems Reference Library,  |x 1868-4394 ;  |v 146 
505 0 |a Introduction -- Tools for Study of Pareto Optimal Points -- Some Tools for Decision Tables -- Different Kinds of Decision Trees -- Multi-stage Optimization of Decision Trees with Some Applications -- More Applications of Multi-stage Optimizationof Decision Trees -- Bi-Criteria Optimization Problem for Decision Trees: Cost vs Cost -- Bi-Criteria Optimization Problem for Decision Trees: Cost vs Uncertainty -- Different Kinds of Rules and Systems of Rules. 
520 |a 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 0 |a Computational intelligence. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computational Intelligence.  |0 http://scigraph.springernature.com/things/product-market-codes/T11014 
650 2 4 |a Artificial Intelligence.  |0 http://scigraph.springernature.com/things/product-market-codes/I21000 
700 1 |a Amin, Talha.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Chikalov, Igor.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Hussain, Shahid.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Moshkov, Mikhail.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319918389 
776 0 8 |i Printed edition:  |z 9783319918402 
776 0 8 |i Printed edition:  |z 9783030063092 
830 0 |a Intelligent Systems Reference Library,  |x 1868-4394 ;  |v 146 
856 4 0 |u https://doi.org/10.1007/978-3-319-91839-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-INR 
950 |a Intelligent Technologies and Robotics (Springer-42732)