Combinatorial Data Analysis

Combinatorial Data Analysis

Author: Lawrence Hubert

Publisher: SIAM

Published: 2001-01-01

Total Pages: 174

ISBN-13: 9780898718553

DOWNLOAD EBOOK

Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. The focus of this monograph is on the identification of arrangements, which are then further restricted to where the combinatorial search is carried out by a recursive optimization process based on the general principles of dynamic programming (DP).


Branch-and-Bound Applications in Combinatorial Data Analysis

Branch-and-Bound Applications in Combinatorial Data Analysis

Author: Michael J. Brusco

Publisher: Springer Science & Business Media

Published: 2005-11-30

Total Pages: 222

ISBN-13: 0387288104

DOWNLOAD EBOOK

This book provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, 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 an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America.


Analytic Combinatorics

Analytic Combinatorics

Author: Philippe Flajolet

Publisher: Cambridge University Press

Published: 2009-01-15

Total Pages: 825

ISBN-13: 1139477161

DOWNLOAD EBOOK

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.


Combinatorial Machine Learning

Combinatorial Machine Learning

Author: Mikhail Moshkov

Publisher: Springer

Published: 2011-06-29

Total Pages: 186

ISBN-13: 3642209955

DOWNLOAD EBOOK

Decision trees and decision rule systems are widely used in different applications as algorithms for problem solving, as predictors, and as a way for knowledge representation. Reducts play key role in the problem of attribute (feature) selection. The aims of this book are (i) the consideration of the sets of decision trees, rules and reducts; (ii) study of relationships among these objects; (iii) design of algorithms for construction of trees, rules and reducts; and (iv) obtaining bounds on their complexity. Applications for supervised machine learning, discrete optimization, analysis of acyclic programs, fault diagnosis, and pattern recognition are considered also. This is a mixture of research monograph and lecture notes. It contains many unpublished results. However, proofs are carefully selected to be understandable for students. The results considered in this book can be useful for researchers in machine learning, data mining and knowledge discovery, especially for those who are working in rough set theory, test theory and logical analysis of data. The book can be used in the creation of courses for graduate students.


Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Author: Hassan AbouEisha

Publisher: Springer

Published: 2018-05-22

Total Pages: 277

ISBN-13: 3319918397

DOWNLOAD EBOOK

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.


A Logical Approach to Discrete Math

A Logical Approach to Discrete Math

Author: David Gries

Publisher: Springer Science & Business Media

Published: 2013-03-14

Total Pages: 517

ISBN-13: 1475738374

DOWNLOAD EBOOK

Here, the authors strive to change the way logic and discrete math are taught in computer science and mathematics: while many books treat logic simply as another topic of study, this one is unique in its willingness to go one step further. The book traets logic as a basic tool which may be applied in essentially every other area.


Advanced Data Mining Technologies in Bioinformatics

Advanced Data Mining Technologies in Bioinformatics

Author: Hui-Huang Hsu

Publisher: IGI Global

Published: 2006-01-01

Total Pages: 343

ISBN-13: 1591408636

DOWNLOAD EBOOK

"This book covers research topics of data mining on bioinformatics presenting the basics and problems of bioinformatics and applications of data mining technologies pertaining to the field"--Provided by publisher.


Seriation in Combinatorial and Statistical Data Analysis

Seriation in Combinatorial and Statistical Data Analysis

Author: Israël César Lerman

Publisher: Springer Nature

Published: 2022-03-04

Total Pages: 287

ISBN-13: 303092694X

DOWNLOAD EBOOK

This monograph offers an original broad and very diverse exploration of the seriation domain in data analysis, together with building a specific relation to clustering. Relative to a data table crossing a set of objects and a set of descriptive attributes, the search for orders which correspond respectively to these two sets is formalized mathematically and statistically. State-of-the-art methods are created and compared with classical methods and a thorough understanding of the mutual relationships between these methods is clearly expressed. The authors distinguish two families of methods: Geometric representation methods Algorithmic and Combinatorial methods Original and accurate methods are provided in the framework for both families. Their basis and comparison is made on both theoretical and experimental levels. The experimental analysis is very varied and very comprehensive. Seriation in Combinatorial and Statistical Data Analysis has a unique character in the literature falling within the fields of Data Analysis, Data Mining and Knowledge Discovery. It will be a valuable resource for students and researchers in the latter fields.


Geometric Data Analysis

Geometric Data Analysis

Author: Brigitte Le Roux

Publisher: Springer Science & Business Media

Published: 2004-06-29

Total Pages: 496

ISBN-13: 9781402022357

DOWNLOAD EBOOK

Geometric Data Analysis (GDA) is the name suggested by P. Suppes (Stanford University) to designate the approach to Multivariate Statistics initiated by Benzécri as Correspondence Analysis, an approach that has become more and more used and appreciated over the years. This book presents the full formalization of GDA in terms of linear algebra - the most original and far-reaching consequential feature of the approach - and shows also how to integrate the standard statistical tools such as Analysis of Variance, including Bayesian methods. Chapter 9, Research Case Studies, is nearly a book in itself; it presents the methodology in action on three extensive applications, one for medicine, one from political science, and one from education (data borrowed from the Stanford computer-based Educational Program for Gifted Youth ). Thus the readership of the book concerns both mathematicians interested in the applications of mathematics, and researchers willing to master an exceptionally powerful approach of statistical data analysis.


Combinatorial Designs

Combinatorial Designs

Author: Douglas Stinson

Publisher: Springer Science & Business Media

Published: 2007-05-08

Total Pages: 306

ISBN-13: 0387217371

DOWNLOAD EBOOK

Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applied mathematics, combinatorics, and applied statistics will find the book an essential resource.