arXiv (All)
open access
Characterizing Identifiability in Boolean Factor Models
Boolean factor models, including prominent subfamilies such as Boolean matrix decompositions and cognitive diagnosis models, find broad applications ranging from social sciences to engineering. Despite their flexibility, a key challenge lies in establishing the identifiability of their graphical str
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extended Tetrad Analysis in Factor Modelling: Separability and Uncertainty from Multidimensional Dependence Structures#1328229
- A Dynamic Factor Model for Multivariate Counting Process Data#1249308
- Causal Inference in Possibly Nonlinear Factor Models#1143549
- What you don't see can't hurt you? Panel data analysis and the dynamics of unobservable factors#479894
- The Latent Diagnostic Taxonomy: A Framework for Constructing Classifiers and Diagnosing Their Decisions, Applied to Prompt Injection Detection#1217551
Record · ID 1186996
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive