On the inference of semi-coherent structures from data
From MaRDI portal
Publication:1781558
DOI10.1016/j.cor.2004.04.019zbMath1071.90521OpenAlexW2054675552WikidataQ105885983 ScholiaQ105885983MaRDI QIDQ1781558
D. H. Judson, Thomas Quint, Sitadri N. Bagchi
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.019
Machine learningClutterVotingSystem reliabilitySimple gameCoherent structureMonotonic boolean functionRecord linkageSperner set
Related Items (1)
Cites Work
- Clutter untypings, correlation inequalities, and bounds for combinatorial reliability.
- Convexity and logical analysis of data
- Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
- Multi-Component Systems and Structures and Their Reliability
- Engineering Reliability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the inference of semi-coherent structures from data