Discovering patterns of NED-breast cancer based on association rules using apriori and FP-growth

Tresna Maulana Fahrudin, I. Syarif, Ali Ridho Barakbah
{"title":"Discovering patterns of NED-breast cancer based on association rules using apriori and FP-growth","authors":"Tresna Maulana Fahrudin, I. Syarif, Ali Ridho Barakbah","doi":"10.1109/KCIC.2017.8228576","DOIUrl":null,"url":null,"abstract":"No Evidence of Disease (NED) is breast cancer patient condition status which it indicates that they can life, no find the cancer by tested, and without any symptoms of cancer in period of times, after they received primary treatment. NED is a critical status, because it involves the treatment type and patient cancer condition factors. This paper examines about breast cancer problem in data mining technical side, especially to discover the patterns of NED-breast cancer patient using cancer registry data from Oncology Hospital. Its patterns are discovered through the relationship of among features begin from 1dimensional, 2-dimensional, 3-dimensional, and n-dimensional. We applied association rules mining using Apriori and FP-Growth algorithm, which both have the advantage and drawback. Apriori algorithm involves all generation of candidate item sets and multiple database scans, but it makes highconsuming iteration. While FP-Growth algorithm extracts the frequent item sets directly from FP-Tree, it make the advantage of FP-Growth that is faster process needs only scan the database once. This paper experiment shown that the association result of Apriori and FP-Growth is almost similar, 10-highest confidence value represented 100% confidence of association rule on breast cancer dataset with support value up to 50%.","PeriodicalId":117148,"journal":{"name":"2017 International Electronics Symposium on Knowledge Creation and Intelligent Computing (IES-KCIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Electronics Symposium on Knowledge Creation and Intelligent Computing (IES-KCIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KCIC.2017.8228576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

No Evidence of Disease (NED) is breast cancer patient condition status which it indicates that they can life, no find the cancer by tested, and without any symptoms of cancer in period of times, after they received primary treatment. NED is a critical status, because it involves the treatment type and patient cancer condition factors. This paper examines about breast cancer problem in data mining technical side, especially to discover the patterns of NED-breast cancer patient using cancer registry data from Oncology Hospital. Its patterns are discovered through the relationship of among features begin from 1dimensional, 2-dimensional, 3-dimensional, and n-dimensional. We applied association rules mining using Apriori and FP-Growth algorithm, which both have the advantage and drawback. Apriori algorithm involves all generation of candidate item sets and multiple database scans, but it makes highconsuming iteration. While FP-Growth algorithm extracts the frequent item sets directly from FP-Tree, it make the advantage of FP-Growth that is faster process needs only scan the database once. This paper experiment shown that the association result of Apriori and FP-Growth is almost similar, 10-highest confidence value represented 100% confidence of association rule on breast cancer dataset with support value up to 50%.
基于先验和fp生长的关联规则发现ned -乳腺癌的模式
无疾病证据(NED)是指乳腺癌患者在接受初级治疗后,在一段时间内能够生存,经检查未发现癌症,且没有任何癌症症状的状态。NED是一个关键的状态,因为它涉及到治疗类型和患者的癌症状况因素。本文探讨了数据挖掘技术方面的乳腺癌问题,特别是利用肿瘤医院的癌症登记数据发现ned -乳腺癌患者的模式。它的模式是通过从一维、二维、三维和n维开始的特征之间的关系来发现的。我们使用Apriori和FP-Growth算法进行关联规则挖掘,这两种算法各有优缺点。Apriori算法涉及所有候选项集的生成和多次数据库扫描,但迭代消耗很大。而FP-Growth算法直接从FP-Tree中提取频繁项集,使FP-Growth算法只需扫描一次数据库即可实现更快的处理速度。本文的实验表明,Apriori和FP-Growth的关联结果几乎相似,10个最高的置信度代表了乳腺癌数据集上关联规则的100%置信度,支持值高达50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信