Ear decomposition for pair comparison data

Authors:
Martin Lages
Affiliations:
University of Glasgow
Venue:
Journal of Mathematical Psychology
Year:
2002

Citing 10
Cited 1

Collapsing binary data for algebraic multidimensional representation

Journal of Mathematical Psychology
Theory of linear and integer programming

Theory of linear and integer programming
On finding the bidimension of a relation

Journal of Mathematical Psychology
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs.

Journal of Combinatorial Theory Series B
The ongoing dialog between empirical science and measurement theory

Journal of Mathematical Psychology
(P,Q)-odd digraphs

Journal of Graph Theory
Well-graded families of relations

Discrete Mathematics
Ear decomposition with bounds on ear length

Information Processing Letters
Ear decomposition for pair comparison data

Journal of Mathematical Psychology
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Ear decomposition for pair comparison data

Journal of Mathematical Psychology

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient graph-theoretical decomposition technique is introduced that treats inconsistencies in behavioral data as systematic adaptations rather than random errors. This technique, which is known as ear decomposition, reduces inconsistencies in any binary data set to a basis of directed cycles. Such a basis characterizes the data set in terms of inconsistencies and its size offers an improved measure of internal consistency. In two examples it is illustrated how different implementations of the ear decomposition technique can help to identify choices that are critical for violations of transitivity.