Branch-and-Bound Applications in Combinatorial Data Analysis

Branch-and-Bound Applications in Combinatorial Data Analysis
Author :
Publisher : Springer Science & Business Media
Total Pages : 248
Release :
ISBN-10 : 0387250379
ISBN-13 : 9780387250373
Rating : 4/5 (79 Downloads)

Book Synopsis Branch-and-Bound Applications in Combinatorial Data Analysis by : Michael J. Brusco

Download or read book Branch-and-Bound Applications in Combinatorial Data Analysis written by Michael J. Brusco and published by Springer Science & Business Media. This book was released on 2005-07-22 with total page 248 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Branch-and-Bound Applications in Combinatorial Data Analysis Related Books

Branch-and-Bound Applications in Combinatorial Data Analysis
Language: en
Pages: 248
Authors: Michael J. Brusco
Categories: Business & Economics
Type: BOOK - Published: 2005-07-22 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

There are a variety of combinatorial optimization problems that are relevant to the examination of statistical data. Combinatorial problems arise in the cluster
Handbook of Discrete and Combinatorial Mathematics
Language: en
Pages: 1612
Authors: Kenneth H. Rosen
Categories: Mathematics
Type: BOOK - Published: 2017-10-19 - Publisher: CRC Press

DOWNLOAD EBOOK

Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as stud
Software for Data Analysis
Language: en
Pages: 515
Authors: John Chambers
Categories: Computers
Type: BOOK - Published: 2008-06-14 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

John Chambers turns his attention to R, the enormously successful open-source system based on the S language. His book guides the reader through programming wit
Data Correcting Approaches in Combinatorial Optimization
Language: en
Pages: 124
Authors: Boris Goldengorin
Categories: Computers
Type: BOOK - Published: 2012-10-11 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

​​​​​​​​​​​​​​​​​Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well know
Combinatorial Data Analysis
Language: en
Pages: 172
Authors: Lawrence Hubert
Categories: Science
Type: BOOK - Published: 2001-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

Combinatorial data analysis refers to methods for the study of data sets where the arrangement of objects is central.