Incremental associative classification on distributed databases

Raghuram Bhukya, J. Gyani
{"title":"Incremental associative classification on distributed databases","authors":"Raghuram Bhukya, J. Gyani","doi":"10.1109/I2CT.2014.7092139","DOIUrl":null,"url":null,"abstract":"Distributed Data Mining (DDM) which is a process of extracting knowledge from distributed data without integrating them in a common database. Due to its vast application in real world application distributed data mining has been a most familiar research interest. As the associative classification technique proved to be most efficient classifier compare to other classifiers we can found certain proposals in literature which can perform associative classification over distributed databases. Even after incremental data mining proved to be most optimized way to upgrade mined rules when new set of transaction added to database, there are lack of proposals which can perform incremental mining over distributed databases. Considering these issues the article presents incremental associative classification model over horizontally distributed databases. Experimental conducted using synthesized datasets has shown encouraging results.","PeriodicalId":384966,"journal":{"name":"International Conference for Convergence for Technology-2014","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference for Convergence for Technology-2014","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I2CT.2014.7092139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Distributed Data Mining (DDM) which is a process of extracting knowledge from distributed data without integrating them in a common database. Due to its vast application in real world application distributed data mining has been a most familiar research interest. As the associative classification technique proved to be most efficient classifier compare to other classifiers we can found certain proposals in literature which can perform associative classification over distributed databases. Even after incremental data mining proved to be most optimized way to upgrade mined rules when new set of transaction added to database, there are lack of proposals which can perform incremental mining over distributed databases. Considering these issues the article presents incremental associative classification model over horizontally distributed databases. Experimental conducted using synthesized datasets has shown encouraging results.
分布式数据库的增量关联分类
分布式数据挖掘(DDM)是一种从分布式数据中提取知识而不将其集成到公共数据库中的过程。由于分布式数据挖掘在现实世界中的广泛应用,它已经成为人们最熟悉的研究领域。与其他分类器相比,关联分类技术被证明是最有效的分类器,我们可以在文献中找到一些可以在分布式数据库上进行关联分类的建议。即使增量数据挖掘被证明是在数据库中添加新事务集时升级挖掘规则的最优方法,但在分布式数据库上执行增量挖掘的建议仍然不足。考虑到这些问题,本文提出了基于水平分布数据库的增量关联分类模型。使用合成数据集进行的实验显示了令人鼓舞的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信