No label defined (Q4373474)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1107546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1107546 |
Statements
17 February 1998
0 references
survey
0 references
bibliography
0 references
combinatorial data analysis
0 references
combinatorial optimization
0 references
0.7268823981285095
0 references
0.7246586084365845
0 references
0.7068561911582947
0 references
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].
0 references