Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis

被引:19
作者
Manuel Rodriguez-Jimenez, Jose [1 ]
Cordero, Pablo [1 ]
Enciso, Manuel [1 ]
Mora, Angel [1 ]
机构
[1] Univ Malaga, Andalucia Tech, Boulevar Louis Pasteur SN, Malaga, Spain
关键词
knowledge discovery; formal concept analysis; negative attributes; medical issues; CONCEPT LATTICES;
D O I
10.1002/mma.3814
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the design of mathematical methods for a medical problem, one of the kernel issues is the identification of symptoms and measures that could help in the diagnosis. Discovering connections among them constitute a big challenge because it allows to reduce the number of parameters to be considered in the mathematical model. In this work, we focus on formal concept analysis as a very promising technique to address this problem. In previous works, we have studied the use of formal concept analysis to manage attribute implications. In this work, we propose to extend the knowledge that we can extract from every context using positive and negative information, which constitutes an open problem. Based on the main classical algorithms, we propose new methods to generate the lattice concept with positive and negative information to be used as a kind of map of attribute connections. We also compare them in an experiment built with datasets from the UCI repository for machine learning. We finally apply the mining techniques to extract the knowledge contained in a real data set containing information about patients suffering breast cancer. The result obtained have been contrasted with medical scientists to illustrate the benefits of our proposal. Copyright (c) 2016 John Wiley & Sons, Ltd.
引用
收藏
页码:4829 / 4845
页数:17
相关论文
共 38 条
  • [1] A 'Best-of-Breed' approach for designing a fast algorithm for computing fixpoints of Galois Connections
    Andrews, Simon
    [J]. INFORMATION SCIENCES, 2015, 295 : 633 - 649
  • [2] [Anonymous], 1994, P INT C VERY LARGE D
  • [3] [Anonymous], ONCOGUIA HOSP U PUER
  • [4] [Anonymous], APPL CERT PROBL GRAP
  • [5] [Anonymous], 2015, CEUR WORKSHOP P
  • [6] [Anonymous], 2009, IN CLOSE FAST ALGORI
  • [7] [Anonymous], 2010, P 7 INT C CONC LATT
  • [8] [Anonymous], ICCS S
  • [9] [Anonymous], CLA
  • [10] [Anonymous], 1994, KDD