An Efficient Method for Detection of Breast Cancer Based on Closed Frequent Itemsets Mining

被引:3
|
作者
Sutha, M. Jeya [1 ]
Dhanaseelan, F. Ramesh [1 ]
机构
[1] St Xaviers Catholic Coll Engn, Dept Comp Applicat, Chunkankadai 629003, Tamil Nadu, India
关键词
Data Mining; Closed Frequent Itemsets; Breast Cancer; Sliding Window; Stream Mining; ARTIFICIAL NEURAL-NETWORKS; INTELLIGENT SYSTEM; DIAGNOSIS; PREDICTION; PATTERNS; HYBRID;
D O I
10.1166/jmihi.2015.1483
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
This paper investigates the core factors which contribute to breast cancer. An algorithm MCFI-DS (Mining Closed Frequent ltemsets over Data Streams) is applied to identify these factors and the dataset "Wisconsin Breast Cancer Database" is considered to evaluate the proposed system performances. The core attributes belonging to "malignant" and "benign" conditions are identified. It is seen that bare nuclei contributes more to the presence of breast cancer. Mitoses are an ineffective feature for detecting breast cancer. The algorithm MCFI-DS is compared with two other state of the art algorithms TMoment and MFI-TransSW to claim the performance improvements over other algorithms.
引用
收藏
页码:987 / 994
页数:8
相关论文
共 50 条
  • [41] New algorithm of mining frequent closed itemsets
    School of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China
    J. Southeast Univ. Engl. Ed., 2008, 3 (335-338):
  • [42] Efficient frequent itemsets mining by sampling
    Zhao, Yanchang
    Zhang, Chengqi
    Zhang, Shichao
    ADVANCES IN INTELLIGENT IT: ACTIVE MEDIA TECHNOLOGY 2006, 2006, 138 : 112 - +
  • [43] Efficient mining frequent itemsets algorithms
    Marghny H. Mohamed
    Mohammed M. Darwieesh
    International Journal of Machine Learning and Cybernetics, 2014, 5 : 823 - 833
  • [44] Efficient mining frequent itemsets algorithms
    Mohamed, Marghny H.
    Darwieesh, Mohammed M.
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2014, 5 (06) : 823 - 833
  • [45] Efficient algorithms for deriving complete frequent itemsets from frequent closed itemsets
    Cheng-Wei Wu
    JianTao Huang
    Yun-Wei Lin
    Chien-Yu Chuang
    Yu-Chee Tseng
    Applied Intelligence, 2022, 52 : 7002 - 7023
  • [46] Efficient algorithms for deriving complete frequent itemsets from frequent closed itemsets
    Wu, Cheng-Wei
    Huang, JianTao
    Lin, Yun-Wei
    Chuang, Chien-Yu
    Tseng, Yu-Chee
    APPLIED INTELLIGENCE, 2022, 52 (06) : 7002 - 7023
  • [47] Efficient strategies for incremental mining of frequent closed itemsets over data streams
    Liu, Junqiang
    Ye, Zhousheng
    Yang, Xiangcai
    Wang, Xueling
    Shen, Linjie
    Jiang, Xiaoning
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [48] An Efficient Mining Algorithm of Closed Frequent Itemsets on Multi-core Processor
    Phan, Huan
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2019, 2019, 11888 : 107 - 118
  • [49] TFP: An efficient algorithm for mining top-K frequent closed itemsets
    Wang, JY
    Han, JW
    Lu, Y
    Tzvetkov, P
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (05) : 652 - 664
  • [50] A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining
    Dlala, Imen Ouled
    Jabbour, Said
    Raddaoui, Badran
    Sais, Lakhdar
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2018, 11008 : 570 - 587