Renan de Padua, Dario Brito Calçada, Verônica Oliveira de Carvalho, Solange Oliveira Rezende
{"title":"利用扩展关联规则网络探索数据","authors":"Renan de Padua, Dario Brito Calçada, Verônica Oliveira de Carvalho, Solange Oliveira Rezende","doi":"10.1109/bracis.2018.00064","DOIUrl":null,"url":null,"abstract":"In this paper, we presented the Extended Association Rule Network (ExARN) to structure, prune and analyze a set of association rules, aiming to build hypothesis candidates. The ExARN extends the ARN, proposed by [2], allowing a more complete exploration. We validate the ExARN using two databases: contact lenses and hayes-roth, both available online for download. The results were validated by comparing the ExARN to the conventional ARN and also by comparing the results with a decision tree algorithms. The approach presented promising results, showing its capability to explain a set of objective items, aiding the user on the hypothesis building.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"34 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Exploring the Data Using Extended Association Rule Network\",\"authors\":\"Renan de Padua, Dario Brito Calçada, Verônica Oliveira de Carvalho, Solange Oliveira Rezende\",\"doi\":\"10.1109/bracis.2018.00064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we presented the Extended Association Rule Network (ExARN) to structure, prune and analyze a set of association rules, aiming to build hypothesis candidates. The ExARN extends the ARN, proposed by [2], allowing a more complete exploration. We validate the ExARN using two databases: contact lenses and hayes-roth, both available online for download. The results were validated by comparing the ExARN to the conventional ARN and also by comparing the results with a decision tree algorithms. The approach presented promising results, showing its capability to explain a set of objective items, aiding the user on the hypothesis building.\",\"PeriodicalId\":405190,\"journal\":{\"name\":\"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)\",\"volume\":\"34 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/bracis.2018.00064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/bracis.2018.00064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Exploring the Data Using Extended Association Rule Network
In this paper, we presented the Extended Association Rule Network (ExARN) to structure, prune and analyze a set of association rules, aiming to build hypothesis candidates. The ExARN extends the ARN, proposed by [2], allowing a more complete exploration. We validate the ExARN using two databases: contact lenses and hayes-roth, both available online for download. The results were validated by comparing the ExARN to the conventional ARN and also by comparing the results with a decision tree algorithms. The approach presented promising results, showing its capability to explain a set of objective items, aiding the user on the hypothesis building.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
