A decomposability index in logical analysis of data

DOI10.1016/j.dam.2004.02.001zbMath1094.68019OpenAlexW2000278446MaRDI QIDQ1878410

Hirotaka Ono, Toshihide Ibaraki, Mutsunori Yagiura

Publication date: 19 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.02.001

zbMATH Keywords

Boolean functionsComputational learning theoryProbabilistic analysisRandom graphLogical analysis of dataDecomposable functions

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Recent advances in the theory and practice of logical analysis of data

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold functions
• Positive and Horn decomposability of partially defined Boolean functions
• Logical analysis of numerical data
• Error-free and best-fit extensions of partially defined Boolean functions
• Logical analysis of data with decomposable structures.
• Decomposability of partially defined Boolean functions
• An Ejection Chain Approach for the Generalized Assignment Problem
• Paths in graphs