从不确定文本数据中挖掘频繁词集的卡诺映射方法

D. Rajput, R. S. Thakur, G. Thakur
{"title":"从不确定文本数据中挖掘频繁词集的卡诺映射方法","authors":"D. Rajput, R. S. Thakur, G. Thakur","doi":"10.9734/BJMCS/2014/6023","DOIUrl":null,"url":null,"abstract":"In recent years, uncertain textual data has become ubiquitous because of latest technologies of data collect. As the existing technologies can only collect data in an imprecise way. So in the given paper, we propose frequent pattern mining technique for mining termsets from uncertain textual data. in the said technique, we have conducted a study on uncertain textual data with Karnaugh Map concept. In fact the contribution of given paper is three manifolds. Firstly, we review existing method of finding frequent termset form document data. Secondly a new method UTDKM (Uncertain Textual Data using Karnaugh Map) is proposed for finding frequent termset from uncertain textual data, and lastly, we carried experiments to evaluate the performance of proposed method. The experimental results demonstrate that UTDKM method is better for mining frequent termset in comparison to existing methods.","PeriodicalId":90853,"journal":{"name":"International journal of advanced computer science","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Karnaugh Map Approach for Mining Frequent Termset from Uncertain Textual Data\",\"authors\":\"D. Rajput, R. S. Thakur, G. Thakur\",\"doi\":\"10.9734/BJMCS/2014/6023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, uncertain textual data has become ubiquitous because of latest technologies of data collect. As the existing technologies can only collect data in an imprecise way. So in the given paper, we propose frequent pattern mining technique for mining termsets from uncertain textual data. in the said technique, we have conducted a study on uncertain textual data with Karnaugh Map concept. In fact the contribution of given paper is three manifolds. Firstly, we review existing method of finding frequent termset form document data. Secondly a new method UTDKM (Uncertain Textual Data using Karnaugh Map) is proposed for finding frequent termset from uncertain textual data, and lastly, we carried experiments to evaluate the performance of proposed method. The experimental results demonstrate that UTDKM method is better for mining frequent termset in comparison to existing methods.\",\"PeriodicalId\":90853,\"journal\":{\"name\":\"International journal of advanced computer science\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of advanced computer science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/BJMCS/2014/6023\",\"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 journal of advanced computer science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/BJMCS/2014/6023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

近年来,由于最新的数据采集技术的发展,不确定文本数据变得无处不在。由于现有技术只能以不精确的方式收集数据。在本文中,我们提出了从不确定文本数据中挖掘术语集的频繁模式挖掘技术。在上述技术中,我们利用卡诺图的概念对不确定文本数据进行了研究。事实上,给定论文的贡献是三个流形。首先,回顾了现有的查找频繁词集表单文档数据的方法。其次,提出了一种从不确定文本数据中寻找频繁项集的新方法UTDKM(不确定文本数据利用卡诺图),最后通过实验对该方法进行了性能评价。实验结果表明,与现有方法相比,UTDKM方法能够更好地挖掘频繁词集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Karnaugh Map Approach for Mining Frequent Termset from Uncertain Textual Data
In recent years, uncertain textual data has become ubiquitous because of latest technologies of data collect. As the existing technologies can only collect data in an imprecise way. So in the given paper, we propose frequent pattern mining technique for mining termsets from uncertain textual data. in the said technique, we have conducted a study on uncertain textual data with Karnaugh Map concept. In fact the contribution of given paper is three manifolds. Firstly, we review existing method of finding frequent termset form document data. Secondly a new method UTDKM (Uncertain Textual Data using Karnaugh Map) is proposed for finding frequent termset from uncertain textual data, and lastly, we carried experiments to evaluate the performance of proposed method. The experimental results demonstrate that UTDKM method is better for mining frequent termset in comparison to existing methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison of Back Propagation, Long Short-Term Memory (LSTM), Attention-Based LSTM Neural Networks Application in Futures Market of China using R Programming Analysis of Different Methods for Measuring the Performance of Database on Cloud Environment A Study of Scheduling Algorithms to Maintain Small Overflow Probability in Cellular Networks with a Single Cell Karnaugh Map Approach for Mining Frequent Termset from Uncertain Textual Data Software Debugging By Developing and Comparing Very Close Successful Inputs with Failure Inducing Unsuccessful Inputs
×
引用
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