弱功能分解的数据挖掘

Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000) Pub Date : 2000-05-23 DOI:10.1109/ISMVL.2000.848603

S. Jaroszewicz, D. Simovici

{"title":"弱功能分解的数据挖掘","authors":"S. Jaroszewicz, D. Simovici","doi":"10.1109/ISMVL.2000.848603","DOIUrl":null,"url":null,"abstract":"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 a priori algorithm that allows a data mining approach to identifying these decompositions.","PeriodicalId":334235,"journal":{"name":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data mining of weak functional decompositions\",\"authors\":\"S. Jaroszewicz, D. Simovici\",\"doi\":\"10.1109/ISMVL.2000.848603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 a priori algorithm that allows a data mining approach to identifying these decompositions.\",\"PeriodicalId\":334235,\"journal\":{\"name\":\"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2000.848603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2000.848603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

不完全指定函数f的弱分解是f的某些补全分解。使用允许这种分解的函数的图论表征，我们提出了一种源自先验算法的技术，该技术允许数据挖掘方法识别这些分解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Data mining of weak functional decompositions

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 a priori algorithm that allows a data mining approach to identifying these decompositions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000)

自引率

0.00%

发文量