Hassan AbouEisha; Talha Amin; Igor Chikalov; Shahi Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining 9783030063092

Варианты приобретения

Цена: 130430.00T
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: 219 шт.
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Hassan AbouEisha; Talha Amin; Igor Chikalov; Shahi
Название: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
ISBN: 9783030063092
Издательство: Springer
Классификация:

Искусственный интеллект

ISBN-10: 3030063097
Обложка/Формат: Soft cover
Страницы: 280
Вес: 0.46 кг.
Дата издания: 2019
Серия: Intelligent Systems Reference Library
Язык: English
Издание: Softcover reprint of
Иллюстрации: 100 tables, color; 3 illustrations, color; 69 illustrations, black and white; xvi, 280 p. 72 illus., 3 illus. in color.
Размер: 234 x 156 x 16
Читательская аудитория: General (us: trade)
Основная тема: Engineering
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: 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.
Дополнительное описание: 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 Tre

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining, Hassan AbouEisha; Talha Amin; Igor Chikalov; Shahi