ASSOCIATIVE CLASSIFICATION OF MAMMOGRAMS BASED ON PARALLEL MINING OF IMAGE BLOCKS

2012 ◽  
Vol 24 (06) ◽  
pp. 513-524
Author(s):  
Mohsen Alavash Shooshtari ◽  
Keivan Maghooli ◽  
Kambiz Badie

One of the main objectives of data mining as a promising multidisciplinary field in computer science is to provide a classification model to be used for decision support purposes. In the medical imaging domain, mammograms classification is a difficult diagnostic task which calls for development of automated classification systems. Associative classification, as a special case of association rules mining, has been adopted in classification problems for years. In this paper, an associative classification framework based on parallel mining of image blocks is proposed to be used for mammograms discrimination. Indeed, association rules mining is applied to a commonly used mammography image database to classify digital mammograms into three categories, namely normal, benign and malign. In order to do so, first images are preprocessed and then features are extracted from non-overlapping image blocks and discretized for rule discovery. Association rules are then discovered through parallel mining of transactional databases which correspond to the image blocks, and finally are used within a unique decision-making scheme to predict the class of unknown samples. Finally, experiments are conducted to assess the effectiveness of the proposed framework. Results show that the proposed framework proved successful in terms of accuracy, precision, and recall, and suggest that the framework could be used as the core of any future associative classifier to support mammograms discrimination.

2004 ◽  
Vol 03 (02) ◽  
pp. 143-154
Author(s):  
Chin-Chen Chang ◽  
Chih-Yang Lin ◽  
Pei-Yu Lin

Parallel association rules mining is a noticeable problem in data mining. However, little work has been proposed to deal with three important issues: (1) less memory usage; (2) less communication, among the involved computers, over the network; and (3) load balance among computers. In this paper, we present a graph-based scheme to solve the parallel mining problem by applying independent groups (clusters of maximal cliques). To bring the three issues to a close, the purpose of the independent groups aims at dividing a database into several independent sub-databases, so each sub-database can be employed independently to perform mining algorithms. To emphasis the effectiveness of the graph-based scheme, we adopt the independent groups not only for maximal large itemsets mining but also for general large itemsets mining. The experimental results show that our scheme can improve the efficiency for parallel mining when the independent groups are well-organized and designed.


2021 ◽  
Vol 8 (3) ◽  
pp. 65-70
Author(s):  
Mohamad Mohamad Shamie ◽  
Muhammad Mazen Almustafa

Data mining is a process of knowledge discovery to extract the interesting, previously unknown, potentially useful, and nontrivial patterns from large data sets. Currently, there is an increasing interest in data mining in traffic accidents, which makes it a growing new research community. A large number of traffic accidents in recent years have generated large amounts of traffic accident data. The mining algorithms had a great role in determining the causes of these accidents, especially the association rule algorithms. One challenging problem in data mining is effective association rules mining with the huge transactional databases, many efforts have been made to propose and improve association rules mining methods. In the paper, we use the RapidMiner application to design a process that can generate association rules based on clustering algorithms.


Appetite ◽  
2021 ◽  
pp. 105236
Author(s):  
Alaina L. Pearce ◽  
Timothy R. Brick ◽  
Travis Masterson ◽  
Shana Adise ◽  
S. Nicole Fearnbach ◽  
...  

2006 ◽  
Vol 1 (2) ◽  
pp. 177-182
Author(s):  
Jian-jiang Lu ◽  
Bao-wen Xu ◽  
Xiao-feng Zou ◽  
Da-zhou Kang ◽  
Yan-hui Li ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document