F. Alsolami, Talha Amin, I. Chikalov, M. Moshkov, Beata Zielosko
{"title":"关联规则系统构建的动态规划方法","authors":"F. Alsolami, Talha Amin, I. Chikalov, M. Moshkov, Beata Zielosko","doi":"10.3233/FI-2016-1402","DOIUrl":null,"url":null,"abstract":"In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Dynamic Programming Approach for Construction of Association Rule Systems\",\"authors\":\"F. Alsolami, Talha Amin, I. Chikalov, M. Moshkov, Beata Zielosko\",\"doi\":\"10.3233/FI-2016-1402\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work.\",\"PeriodicalId\":286395,\"journal\":{\"name\":\"International Workshop on Concurrency, Specification and Programming\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Concurrency, Specification and Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/FI-2016-1402\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Concurrency, Specification and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/FI-2016-1402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic Programming Approach for Construction of Association Rule Systems
In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
