A conjunctive parallelogram model for Pick any/\(n\) data

DOI10.1007/BF02295643zbMath1306.62464OpenAlexW1969889746WikidataQ99733891 ScholiaQ99733891MaRDI QIDQ2259997

Iven van Mechelen, Iwin Leenen

Publication date: 5 March 2015

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02295643

zbMATH Keywords

binary datachoice data analysisnoncompensatory combination ruleparallelogram analysis

Mathematics Subject Classification ID

Applications of statistics to psychology (62P15)

Related Items (4)

Inducing a blockmodel structure of two-mode binary data using seriation procedures ⋮ A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices ⋮ Bridges between deterministic and probabilistic models for binary data ⋮ Models for ordinal hierarchical classes analysis

Cites Work

• Bridges between deterministic and probabilistic models for binary data
• Was Euclid an unnecessarily sophisticated psychologist?
• Correspondence analysis and optimal structural representations
• Testing for DIF in a model with single peaked item characteristic curves: The parella model
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations
• Modern multidimensional scaling: theory and applications
• An evaluation of two algorithms for hierarchical classes analysis.
• Incidence matrices and interval graphs
• Models for ordinal hierarchical classes analysis
• Incidence matrices, interval graphs and seriation in archeology
• A structure theorem for the consecutive 1's property
• Latent class models for nonmonotone dichotomous items
• File organization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A conjunctive parallelogram model for Pick any/\(n\) data