一种基于onto-Apriori的高品质海产品频繁模式挖掘算法

Sherimon Puliprathu Cherian, Vinu Sherimon
{"title":"一种基于onto-Apriori的高品质海产品频繁模式挖掘算法","authors":"Sherimon Puliprathu Cherian, Vinu Sherimon","doi":"10.1145/3018896.3056786","DOIUrl":null,"url":null,"abstract":"Apriori algorithm is a classic data mining algorithm used to generate association rules. This paper proposes onto-Apriori algorithm to generate rules from the ontology data, which is used to determine frequent patterns of quality seafood. In the proposed algorithm, a vertical data layout is used and the generation of candidate set in every step is avoided. The seafood data is represented in ontology and the algorithm is used to mine the ontological data. The proposed algorithm eliminate the costly candidate generation. The dataset obtained from a seafood organization is used to test our approach. The performance of the proposed onto-Apriori algorithm is compared with the existing Apriori algorithm. The results show that the number of transactions required in generating the support count and the candidate items are less when onto-Apriori algorithm is used. The number of times required to check the data to generate candidate 1 item sets is same for both the approaches. Later in onto-Apriori algorithm frequent 1 item set is used as a reference to generate the subsequent candidate item sets. The association rules and patterns obtained by the proposed algorithm are effectively used to discover unknown relationships among seafood.","PeriodicalId":131464,"journal":{"name":"Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A proposed onto-Apriori algorithm to mine frequent patterns of high quality seafood\",\"authors\":\"Sherimon Puliprathu Cherian, Vinu Sherimon\",\"doi\":\"10.1145/3018896.3056786\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Apriori algorithm is a classic data mining algorithm used to generate association rules. This paper proposes onto-Apriori algorithm to generate rules from the ontology data, which is used to determine frequent patterns of quality seafood. In the proposed algorithm, a vertical data layout is used and the generation of candidate set in every step is avoided. The seafood data is represented in ontology and the algorithm is used to mine the ontological data. The proposed algorithm eliminate the costly candidate generation. The dataset obtained from a seafood organization is used to test our approach. The performance of the proposed onto-Apriori algorithm is compared with the existing Apriori algorithm. The results show that the number of transactions required in generating the support count and the candidate items are less when onto-Apriori algorithm is used. The number of times required to check the data to generate candidate 1 item sets is same for both the approaches. Later in onto-Apriori algorithm frequent 1 item set is used as a reference to generate the subsequent candidate item sets. The association rules and patterns obtained by the proposed algorithm are effectively used to discover unknown relationships among seafood.\",\"PeriodicalId\":131464,\"journal\":{\"name\":\"Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3018896.3056786\",\"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 of the Second International Conference on Internet of things, Data and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3018896.3056786","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

Apriori算法是一种用于生成关联规则的经典数据挖掘算法。本文提出了onto-Apriori算法,从本体数据中生成规则,用于确定优质海鲜的频繁模式。该算法采用垂直数据布局,避免了每一步生成候选集的问题。将海鲜数据用本体表示,并利用该算法对本体数据进行挖掘。该算法消除了昂贵的候选生成。从海鲜组织获得的数据集用于测试我们的方法。将提出的onto-Apriori算法的性能与现有的Apriori算法进行了比较。结果表明,使用onto-Apriori算法生成支持数和候选项所需的事务数更少。对于两种方法,检查数据以生成候选1项集所需的次数是相同的。随后在onto-Apriori算法中,频繁使用1项集作为引用来生成后续候选项集。该算法得到的关联规则和模式可以有效地用于发现海产品之间的未知关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A proposed onto-Apriori algorithm to mine frequent patterns of high quality seafood
Apriori algorithm is a classic data mining algorithm used to generate association rules. This paper proposes onto-Apriori algorithm to generate rules from the ontology data, which is used to determine frequent patterns of quality seafood. In the proposed algorithm, a vertical data layout is used and the generation of candidate set in every step is avoided. The seafood data is represented in ontology and the algorithm is used to mine the ontological data. The proposed algorithm eliminate the costly candidate generation. The dataset obtained from a seafood organization is used to test our approach. The performance of the proposed onto-Apriori algorithm is compared with the existing Apriori algorithm. The results show that the number of transactions required in generating the support count and the candidate items are less when onto-Apriori algorithm is used. The number of times required to check the data to generate candidate 1 item sets is same for both the approaches. Later in onto-Apriori algorithm frequent 1 item set is used as a reference to generate the subsequent candidate item sets. The association rules and patterns obtained by the proposed algorithm are effectively used to discover unknown relationships among seafood.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信