Parallel mining algorithms for generalized association rules with classification hierarchy

1998 ◽  
Author(s):  
Takahiko Shintani ◽  
Masaru Kitsuregawa
Keyword(s):  
Association Rules ◽  
Generalized Association Rules ◽  
Parallel Mining ◽  
Mining Algorithms

An Efficient Graph-Based Method for Parallel Mining Problems

2004 ◽  
Vol 03 (02) ◽  
pp. 143-154
Author(s):  
Chin-Chen Chang ◽  
Chih-Yang Lin ◽  
Pei-Yu Lin
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Load Balance ◽  
Experimental Results ◽  
Memory Usage ◽  
Association Rules Mining ◽  
Parallel Mining ◽  
Mining Algorithms

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.

Parallel mining and application of fuzzy association rules

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

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
Keyword(s):  
Association Rules ◽  
Classification Systems ◽  
Classification Model ◽  
Automated Classification ◽  
Associative Classification ◽  
Classification Problems ◽  
Association Rules Mining ◽  
Parallel Mining ◽  
Transactional Databases ◽  
Unique Decision

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.

Algorithms for Data Mining

2008 ◽  
pp. 1301-1319
Author(s):  
Tadao Takaoka ◽  
Nigel K.L. Pope ◽  
Kevin E. Voges
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Image Data ◽  
Regression Trees ◽  
Clustering Techniques ◽  
Data Mining Algorithms ◽  
Mining Algorithms

In this chapter, we present an overview of some common data mining algorithms. Two techniques are considered in detail. The first is association rules, a fundamental approach that is one of the oldest and most widely used techniques in data mining. It is used, for example, in supermarket basket analysis to identify relationships between purchased items. The second is the maximum sub-array problem, which is an emerging area that is yet to produce a textbook description. This area is becoming important as a new tool for data mining, particularly in the analysis of image data. For both of these techniques, algorithms are presented in pseudo-code to demonstrate the logic of the approaches. We also briefly consider decision and regression trees and clustering techniques.

Sign in / Sign up

Export Citation Format

Share Document