scientific article; zbMATH DE number 1107546
Combinatorial data analysis (CDA), as the name suggests, is concerned with the arrangement of objects for which relevant data have been obtained. Stated more explicitly, CDA is involved with either (a) the location of arrangements that are optimal for the representation of a given data set and is usually operationalized using a specific loss-function that guides the combinatorial search defined by some set of constraints imposed by the particular representation chosen, or alternatively, (b) evaluating in a confirmatory manner whether some specific object arrangement given a priori reflects the observed data. What CDA does not do is to postulate strong stochastic models based on specific unknown parametric structures as underlying a given data set. Although CDA might use or empirically construct various types of weighting functions, the weights so obtained are not intended to be interpreted as parameter estimates in some presumed stochastic model viewed in turn as responsible for generating the data. In CDA, manifest data are emphasized, and the traditional concern with an assumed relationship between the data and a restrictively parameterized stochastic population model is essentially ignored. Methods of CDA are generally organized around (a) the types of combinatorial structures we might use to represent a given data set and (b) the actual classes of combinatorial optimization methods used in solving problems of actually locating optimal arrangements rather than the (confirmatory) evaluation of a given one. For the entire collection see [Zbl 0836.00014].
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Ensemble clustering for efficient robust optimization of naturally fractured reservoirs
- An experimental comparison of seriation methods for one-mode two-way data
- Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors
- The k-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- Seriation in combinatorial and statistical data analysis
- Lossy compression approach to subspace clustering
- Taxicab correspondence analysis
- Using an iterative reallocation partitioning algorithm to verify test multidimensionality
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting
- An interactive multiobjective programming approach to combinatorial data analysis
- A variable-selection heuristic for K-means clustering
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Fuzzy Clustering-Based Filter
- scientific article; zbMATH DE number 4022343 (Why is no real title available?)
- scientific article; zbMATH DE number 4045115 (Why is no real title available?)
- Seriation and matrix reordering methods: An historical overview
- Review of statistical network analysis: models, algorithms, and software
- The orbiter ecosystem for combinatorial data
- A class of rational cardinality-based similarity measures
- A review of multiobjective programming and its application in quantitative psychology
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373474)