Title Branch-and-bound applications in combinatorial data analysis / Michael J. Brusco, Stephanie Stahl

Published New York : Springer, ©2005

Click on the following:
Springer Mathematics and Statistics eBooks
Springer eBooks

Copies

Description 1 online resource (xii, 221 pages) : illustrations Series Statistics and computing Statistics and computing. Contents 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 Summary "This monograph provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, psuedocode, 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."--Jacket Bibliography Includes bibliographical references (pages 209-217) and index Notes Print version record In Springer e-books Subject Combinatorial analysis. Branch and bound algorithms. MATHEMATICS -- Combinatorics. Combinatorial analysis. Branch and bound algorithms. Análisis combinatorio Branch and bound algorithms Combinatorial analysis Form Electronic book Author Stahl, Stephanie ISBN 9780387288109 0387288104 0387250379 9780387250373 1280313013 9781280313011 6610313016 9786610313013

  Permalink