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

Полное описание

Сохранить в:
Библиографические подробности
Главные авторы: Brusco, Michael J., 19..-, Stahl, Stephanie, 19..- (Автор), Stahl, Stephanie (Автор)
Формат: Livre numérique
Язык:Anglais
Опубликовано: New York, NY : Springer New York [20..].
Cham : Springer Nature
Редактирование:1st ed. 2005.
Серии:Statistics and Computing
Online-ссылка:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Примечание: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Branch-and-bound applications in combinatorial data analysis, Michael J. Brusco, Stephanie Stahl, 2005, New York, Springer, 1 vol. (XII-221 p.), Statistics and computing, 0-387-25037-9
• Branch-and-Bound Applications in Combinatorial Data Analysis, Texte imprimé, 9781441920393
• Inverse Schrödinger scattering in three dimensions, R.G. Newton, Berlin, Springer, 1989, 1 vol. (X-170 p.), Texts and monographs in physics, 0-387-50563-6
LEADER 04874nam a22003737a 4500
001 947808
008 080409q2000 xx ||| |||| 00| 0 eng d
009 PPN123072379
020 |a 9780387288109 
041 0 |a eng 
082 |a 519.5 
100 1 |a Brusco, Michael J.,  |d 19..- 
245 1 0 |a Branch-and-Bound Applications in Combinatorial Data Analysis   |c by Michael J. Brusco, Stephanie Stahl. 
250 |a 1st ed. 2005. 
260 |a New York, NY :  |b Springer New York. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Statistics and Computing  |x 2197-1706 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 1 |a 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 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 multivariate statistical analysis such as regression. The options for choosing a solution strategy in combinatorial data analysis can be overwhelming. Because some problems are too large or intractable for an optimal solution strategy, many researchers develop an over-reliance on heuristic methods to solve all combinatorial problems. However, with increasingly accessible computer power and ever-improving methodologies, optimal solution strategies have gained popularity for their ability to reduce unnecessary uncertainty. In this monograph, optimality is attained for nontrivially sized problems via the branch-and-bound paradigm. For many combinatorial problems, branch-and-bound approaches have been proposed and/or developed. However, until now, there has not been a single resource in statistical data analysis to summarize and illustrate available methods for applying the branch-and-bound process. 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. Dr. Brusco is a Professor of Marketing and Operations Research at Florida State University, an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America. Stephanie Stahl is an author and researcher with years of experience in writing, editing, and quantitative psychology research 
700 1 |a Stahl, Stephanie,  |d 19..-  |4 aut 
700 1 |a Stahl, Stephanie.  |4 aut 
776 0 |0 091533112  |t Branch-and-bound applications in combinatorial data analysis  |f Michael J. Brusco, Stephanie Stahl  |d 2005  |c New York  |n Springer  |p 1 vol. (XII-221 p.)  |s Statistics and computing  |z 0-387-25037-9 
776 0 |t Branch-and-Bound Applications in Combinatorial Data Analysis  |b Texte imprimé  |z 9781441920393 
776 0 |0 009064303  |t Inverse Schrödinger scattering in three dimensions  |f R.G. Newton  |c Berlin  |n Springer  |d 1989  |p 1 vol. (X-170 p.)  |s Texts and monographs in physics  |z 0-387-50563-6 
856 4 |q PDF  |u https://doi.org/10.1007/0-387-28810-4  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-VQFZPVHL-K  |z Accès sur la plateforme Istex 
856 4 |5 452349901:748048766  |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/0-387-28810-4  |z Accès Université d'Orléans 
856 4 |5 180339901:751499951  |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/0-387-28810-4  |z Accès INSA CVL 
997 |0 947808  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/