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 条
  • [21] An Algorithm of Mining Closed Frequent Itemsets
    Li, Haifeng
    PROCEEDINGS OF THE 2015 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND AUTOMATION ENGINEERING, 2016, 42 : 95 - 98
  • [22] An efficient method for mining frequent itemsets with double constraints
    Hai Duong
    Tin Truong
    Bay Vo
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2014, 27 : 148 - 154
  • [23] Mining frequent closed itemsets with the frequent pattern list
    Tseng, FC
    Hsu, CC
    Chen, H
    2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 653 - 654
  • [24] FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining
    Wei, Tianyou
    Wang, Bin
    Zhang, Yuntian
    Hu, Keyong
    Yao, Yinfeng
    Liu, Hao
    IEEE ACCESS, 2020, 8 : 109928 - 109939
  • [25] An Efficient Algorithm for Mining Frequent Closed Itemsets over Data Stream
    Li Guodong
    Xia Kewen
    NEW TRENDS IN MECHATRONICS AND MATERIALS ENGINEERING, 2012, 151 : 570 - 575
  • [26] Efficient incremental mining of top-K frequent closed itemsets
    Pietracaprina, Andrea
    Vandin, Fabio
    DISCOVERY SCIENCE, PROCEEDINGS, 2007, 4755 : 275 - +
  • [27] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Bu, Yingyong
    Yang, Bo
    2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 3, PROCEEDINGS, 2009, : 65 - +
  • [28] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Yu, Shao-jun
    2011 SECOND INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND EDUCATION APPLICATION (ICEA 2011), 2011, : 197 - 201
  • [29] Efficient algorithms of mining top-k frequent closed itemsets
    Lan Yongjie
    Qiu Yong
    ICEMI 2007: PROCEEDINGS OF 2007 8TH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOL II, 2007, : 551 - 554
  • [30] An Efficient Method for Mining Frequent Weighted Closed Itemsets from Weighted Item Transaction Databases
    Bay Vo
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2017, 33 (01) : 199 - 216