Branch-and-Bound Applications in Combinatorial Data Analysis

There are a variety of combinatorial optimization problems that are relevant to the examination of statistical data. Combinatorial problems arise in the clustering of a collection of objects, the seriation (sequencing or ordering) of objects, and the selection of variables for subsequent multivariat...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Brusco, Michael J. (Autor), Stahl, Stephanie (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Statistics and Computing,
Temas:
Discrete mathematics.
Mathematical statistics-Data processing.
Operations research.
Management science.
Social sciences-Statistical methods.
Discrete Mathematics.
Statistics and Computing.
Operations Research and Decision Theory.
Operations Research, Management Science .
Statistics in Social Sciences, Humanities, Law, Education, Behavorial Sciences, Public Policy.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Cluster Analysis-Partitioning
  • 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
  • Seriation
  • to the Branch-and-Bound Paradigm for Seriation
  • Seriation-Maximization of a Dominance Index
  • Seriation-Maximization of Gradient Indices
  • Seriation-Unidimensional Scaling
  • Seriation-Multiobjective Seriation
  • Variable Selection
  • to Branch-and-Bound Methods for Variable Selection
  • Variable Selection for Cluster Analysis
  • Variable Selection for Regression Analysis.

Ejemplares similares