Branch-and-Bound Applications in Combinatorial Data Analysis
Información General
- Autores: Michael J. Brusco, Stephanie Stahl
- Editores: New York : Springer, 2005
- Año de publicación: 2005
- País: Estados Unidos
- Idioma: inglés
- ISBN: 978-0-387-25037-3, 978-0-387-28810-9
- Texto completo no disponible (Saber más ...)
Resumen
This book provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, and well-developed examples for applications of the branch-and-bound paradigm to important problems in combinatorial data analysis.
Supplementary material, such as computer programs, are provided on the world wide web.
Dr. Brusco is an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America.
Otros catálogos
Índice
Introduction.- An Introduction to Branch-and-Bound Methods for Partitioning.- Minimum-Diameter Partitioning.- Minimum Within-Cluster Sums of Dissimilarities Partitioning.- Minimum Within-Cluster Sums of Squares Partitioning.- Multiobjective Partitioning.- Introduction to the Branch-and-Bound Paradigm for Seriation.- Maximization of a Dominance Index.- Seriation--Maximization of Gradient Indices.- Seriation--Unidimensional Scaling.- Seriation--Multiobjective Seriation.- An Introduction to Branch-and-Bound Methods for Variable Selection.- Variable Selection for Cluster Analysis.- Variable Selection for Regression Analysis.
