Dimesionality Reduction using Association Rule Mining

Sajal Kumar Das, B. Nath
{"title":"Dimesionality Reduction using Association Rule Mining","authors":"Sajal Kumar Das, B. Nath","doi":"10.1109/ICIINFS.2008.4798351","DOIUrl":null,"url":null,"abstract":"When data objects that are the subject of analysis using machine learning techniques are described by a large number of feature (i.e. the data is high dimension) it is often beneficial to reduce the dimension of the data. dimensionality reduction (DR) can be beneficial not only reasons of computational efficiency but also because it can improve the accuracy of the analysis. Now we have tried to introduce a novel transform to achieve dimensionality reduction. This paper summarizes survey on feature selection and extraction from high-dimensionality data sets using genetic algorithm. The feature selection process can be considered a problem of global combinatorial optimization in machine learning, which reduces the number of features, removes irrelevant, noisy and redundant data, to obtain the accuracy and saves the computation time and simplifies the result. We are trying to develop GA-based approach utilizing a feedback linkage between feature evaluation and association rule. That is we carry out feature selection simultaneously with association rule mining, through \"genetic learning and evolution.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"15 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIINFS.2008.4798351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

When data objects that are the subject of analysis using machine learning techniques are described by a large number of feature (i.e. the data is high dimension) it is often beneficial to reduce the dimension of the data. dimensionality reduction (DR) can be beneficial not only reasons of computational efficiency but also because it can improve the accuracy of the analysis. Now we have tried to introduce a novel transform to achieve dimensionality reduction. This paper summarizes survey on feature selection and extraction from high-dimensionality data sets using genetic algorithm. The feature selection process can be considered a problem of global combinatorial optimization in machine learning, which reduces the number of features, removes irrelevant, noisy and redundant data, to obtain the accuracy and saves the computation time and simplifies the result. We are trying to develop GA-based approach utilizing a feedback linkage between feature evaluation and association rule. That is we carry out feature selection simultaneously with association rule mining, through "genetic learning and evolution.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于关联规则挖掘的降维方法
当使用机器学习技术进行分析的数据对象由大量特征(即数据是高维的)描述时,降低数据的维数通常是有益的。降维不仅可以提高计算效率,而且可以提高分析的准确性。现在我们尝试引入一种新的变换来实现降维。本文综述了利用遗传算法对高维数据集进行特征选择和提取的研究概况。特征选择过程可以看作是机器学习中的全局组合优化问题,通过减少特征数量,去除不相关、噪声和冗余数据,获得精度,节省计算时间,简化结果。我们正在尝试开发基于遗传算法的方法,利用特征评估和关联规则之间的反馈联系。也就是说,我们通过“遗传学习和进化”,将特征选择与关联规则挖掘同时进行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Mega Programmable Interactive Robotic Surface (AMPIRS) State Estimation using Shifted Legendre Polynomials Fault diagnosis of rolling element bearing using time-domain features and neural networks New Method of Image Compression Using Multiwavelets and Set Partitioning Algorithm A Bandwidth Aware Topology Generation Mechanism for Peer-to-Peer based Publish-Subscribe Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1