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

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: AbouEisha, Hassan (Yazar), Amin, Talha (Yazar), Chikalov, Igor (Yazar), Hussain, Shahid (Yazar), Moshkov, Mikhail (Yazar)
Müşterek Yazar: SpringerLink (Online service)
Materyal Türü: e-Kitap
Dil:İngilizce
Baskı/Yayın Bilgisi: Cham : Springer International Publishing : Imprint: Springer, 2019.
Edisyon:1st ed. 2019.
Seri Bilgileri:Intelligent Systems Reference Library, 146
Konular:
Computational intelligence.
Artificial intelligence.
Computational Intelligence.
Artificial Intelligence.
Online Erişim:Full-text access
OPAC'ta görüntüle
İçindekiler:
  • 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.

Benzer Materyaller