Logical analysis of data with decomposable structures.
From MaRDI portal
Recommendations
Cites work
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Boosting first-order learning
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Complexity and approximation. Combinatorial optimization problems and their approximability properties. Incl. 1 CD-ROM
- Decomposability of partially defined Boolean functions
- Error-free and best-fit extensions of partially defined Boolean functions
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- Multiway cuts in directed and node weighted graphs
- Positive and Horn decomposability of partially defined Boolean functions
Cited in
(10)- Structure identification in relational data
- Finding essential attributes from binary data
- Recent advances in the theory and practice of logical analysis of data
- A decomposability index in logical analysis of data
- Spanned patterns for the logical analysis of data
- Logical analysis of data with decomposable structures
- Multi‐level decomposition of probabilistic relations
- scientific article; zbMATH DE number 2080998 (Why is no real title available?)
- Data Mining by Decomposition: Adaptive Search for Hypothesis Generation
- Theory and Applications of Relational Structures as Knowledge Instruments
This page was built for publication: Logical analysis of data with decomposable structures.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853578)