Branch-and-Bound Applications in Combinatorial Data Analysis

• Κύριοι συγγραφείς: Brusco, Michael J. (Συγγραφέας), Stahl, Stephanie (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2005.
• Σειρά: Statistics and Computing,
• Θέματα: Mathematics.; Operations research.; Decision making.; Management science.; Discrete mathematics.; Statistics.; Discrete Mathematics.; Statistics and Computing/Statistics Programs.; Operation Research/Decision Theory.; Operations Research, Management Science.; Statistics for Social Science, Behavorial Science, Education, Public Policy, and Law.

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

Πίνακας περιεχομένων:

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