Collapsing binary data for algebraic multidimensional representation

DOI10.1016/0022-2496(86)90012-XzbMath0601.92030OpenAlexW2037994918MaRDI QIDQ1081564

Charles Chubb

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0022-2496(86)90012-x

zbMATH Keywords

NP-hardbinary relationalgebraic representationcollapsing methodsmultidimensional scaling techniquespolynomially efficient procedurepolynomially reducible

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other classical set theory (including functions, relations, and set algebra) (03E20) Mathematical psychology (91E99) Other natural sciences (mathematical treatment) (92F05)

Related Items (4)

Surmise relations between tests -- mathematical considerations. ⋮ On finding the bidimension of a relation ⋮ Ear decomposition for pair comparison data ⋮ A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching relations and the dimensional structure of social choices
• On realizable biorders and the biorder dimension of a relation
• Ferrers digraphs and threshold graphs
• On the Ferrers dimension of a digraph
• Difference measurement and simple scalability with restricted solvability
• A note on an alternative proof of the representation theorem for bi- semiorder
• Axiomatic thermodynamics and extensive measurement
• Composite measurement
• Intransitive indifference with unequal indifference intervals

This page was built for publication: Collapsing binary data for algebraic multidimensional representation