On finding the bidimension of a relation

DOI10.1016/0022-2496(87)90013-7MaRDI QIDQ1099113zbMATH OpenOpenAlexFDO

Authors M. G. M. Koppen

Publication date 1987

Published in Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/17530

zbMATH Keywords

bidimension of binary relationsbidimension of data setschromatic numberconjunctive modelempirical data matrix representationGuttman relationsminimum dimensionalitysubhypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Mathematical psychology (91E99)

Review text

For an arbitrary data matrix, a problem is how to construct a representation according to the conjunctive model. This paper concerns with the problem of finding the minimum dimensionality needed for such a representation. In their fundamental paper, \textit{J. P. Doignon}, \textit{A. DuCamp} and \textit{J. C. Falmagne}, ibid. 28, 73-109 (1984; Zbl 0562.92018), cast the problem in terms of the intersection of a minimal number of biorders, this number being its so-called bidimension. Doignon et al. give a characterization of this bidimension as the chromatic number of a certain hypergraph. This paper describes some principles enabling to reduce a hypergraph of the considered type to a subhypergraph having the same chromatic number. The chromatic number of hypergraph can be recursively determined in terms of the chromatic number of its subhypergraphs. These reductions and recursions can be used to compute the bidimension of data sets. Prospects for integrating these results in an efficient algorithm complete the paper.

Recommendations

• On realizable biorders and the biorder dimension of a relation
• Dimensionality of ordinal structures
• Dimensions of chains of relations
• On a product dimension of bipartite graphs
• Dimensions of hypergraphs

Cites work

• Collapsing binary data for algebraic multidimensional representation
• Composite measurement
• scientific article; zbMATH DE number 3654150 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 736305 (Why is no real title available?)
• scientific article; zbMATH DE number 3345350 (Why is no real title available?)
• Large minimal realizers of a partial order. II
• On realizable biorders and the biorder dimension of a relation
• On the Ferrers dimension of a digraph
• Partially Ordered Sets
• The Complexity of the Partial Order Dimension Problem

Cited in

(10)

• A generic disjunctive/conjunctive decomposition model for n-ary relations
• Dimensionality of ordinal structures
• Ising formulations of some graph-theoretic problems in psychological research: models and methods
• Models for ordinal hierarchical classes analysis
• scientific article; zbMATH DE number 3857255 (Why is no real title available?)
• scientific article; zbMATH DE number 3910212 (Why is no real title available?)
• Removing critical pairs
• Algebraic structures and social processes
• Ear decomposition for pair comparison data
• Plural psychological developmental models: An ordinal generalization of the Guttman scale

This page was built for publication: On finding the bidimension of a relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099113)