Data Mining Of Weak Functional Decompositions

ISMVL '00: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic(2000)

引用 1|浏览7
暂无评分
摘要
A weak decomposition of an incompletely specified function f is a decomposition of some completion of f. Using a graph-theoretical characterization of functions that admit such decompositions, we present a technique derived from the Apriori algorithm that allows a data mining approach to identifying these decompositions.
更多
查看译文
关键词
weak decompositions,completion of a partially defined function,clique
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要