•  Retrait gratuit dans votre magasin Club
  •  7.000.000 titres dans notre catalogue
  •  Payer en toute sécurité
  •  Toujours un magasin près de chez vous     
  •  Retrait gratuit dans votre magasin Club
  •  7.000.000 titres dans notre catalogue
  •  Payer en toute sécurité
  •  Toujours un magasin près de chez vous
  1. Accueil
  2. Livres
  3. Savoirs
  4. Informatique
  5. Bases de données
  6. Data mining
  7. Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Hassan Aboueisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov
Livre relié | Anglais | Intelligent Systems Reference Library | n° 146
105,45 €
+ 210 points
Format
Livraison sous 1 à 4 semaines
Passer une commande en un clic
Payer en toute sécurité
Livraison en Belgique: 3,99 €
Livraison en magasin gratuite

Description

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.


Spécifications

Parties prenantes

Auteur(s) :
Editeur:

Contenu

Nombre de pages :
280
Langue:
Anglais
Collection :
Tome:
n° 146

Caractéristiques

EAN:
9783319918389
Date de parution :
31-05-18
Format:
Livre relié
Format numérique:
Genaaid
Dimensions :
156 mm x 234 mm
Poids :
594 g

Les avis