On the Complexity of Data Mining for Binary Decision Diagram Rules
Osamu Maruyama, Takayoshi Shoudai, Satoru Miyano · Kyoto University Research Information Repository (Kyoto University) · 1998
We discuss the problem of data mining for binary decision diagram rules (BDDRs).We show that the problem is, in general, $\mathrm{N}\mathrm{P}$ -complete, and report some results of a preliminary experiment on biological databases with devising a heuristic algorithm of mining BDDRs.