Apriori algorithm for association rule mining in high dimensional data

2016 ◽  
Author(s):  
Sandhya Harikumar ◽  
Divya Usha Dilipkumar
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
High Dimensional Data ◽  
High Dimensional ◽  
Apriori Algorithm ◽  
Rule Mining

The Research of Improved Apriori Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2179-2184 ◽  
Author(s):  
Zhen Yun Liao ◽  
Xiu Fen Fu ◽  
Ya Guang Wang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Frequent Item ◽  
Mining Algorithm ◽  
The Times ◽  
Frequent Item Sets ◽  
Candidate Item ◽  
Improved Algorithm

The first step of the association rule mining algorithm Apriori generate a lot of candidate item sets which are not frequent item sets, and all of these item sets cost a lot of system spending. To solve this problem，this paper presents an improved algorithm based on Apriori algorithm to improve the Apriori pruning step. Using this method, the large number of useless candidate item sets can be reduced effectively and it can also reduce the times of judge whether the item sets are frequent item sets. Experimental results show that the improved algorithm has better efficiency than classic Apriori algorithm.

Support-Less Association Rule Mining Using Tuple Count Cube

2007 ◽  
Vol 06 (04) ◽  
pp. 271-280
Author(s):  
Qin Ding ◽  
William Perrizo
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Data Cube ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
High Confidence ◽  
Support Level ◽  
Vertical Data ◽  
Frequent Item Sets ◽  
High Support

Association rule mining is one of the important tasks in data mining and knowledge discovery (KDD). The traditional task of association rule mining is to find all the rules with high support and high confidence. In some applications, we are interested in finding high confidence rules even though the support may be low. This type of problem differs from the traditional association rule mining problem; hence, it is called support-less association rule mining. Existing algorithms for association rule mining, such as the Apriori algorithm, cannot be used efficiently for support-less association rule mining since those algorithms mostly rely on identifying frequent item-sets with high support. In this paper, we propose a new model to perform support-less association rule mining, i.e., to derive high confidence rules regardless of their support level. A vertical data structure, the Peano Count Tree (P-tree), is used in our model to represent all the information we need. Based on the P-tree structure, we build a special data cube, called the Tuple Count Cube (T-cube), to derive high confidence rules. Data cube operations, such as roll-up, on T-cube, provide efficient ways to calculate the count information needed for support-less association rule mining.

scholarly journals Association Rules Mining for Hospital Readmission: A Case Study

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2706
Author(s):  
Nor Hamizah Miswan ◽  
‘Ismat Mohd Sulaiman ◽  
Chee Seng Chan ◽  
Chong Guan Ng
Keyword(s):  
Association Rule ◽  
Hospital Readmission ◽  
Association Rule Mining ◽  
Demographic Variables ◽  
Apriori Algorithm ◽  
Age Group ◽  
Rule Mining ◽  
Learning Rules ◽  
And Performance

As an indicator of healthcare quality and performance, hospital readmission incurs major costs for healthcare systems worldwide. Understanding the relationships between readmission factors, such as input features and readmission length, is challenging following intricate hospital readmission procedures. This study discovered the significant correlation between potential readmission factors (threshold of various settings for readmission length) and basic demographic variables. Association rule mining (ARM), particularly the Apriori algorithm, was utilised to extract the hidden input variable patterns and relationships among admitted patients by generating supervised learning rules. The mined rules were categorised into two outcomes to comprehend readmission data; (i) the rules associated with various readmission length and (ii) several expert-validated variables related to basic demographics (gender, race, and age group). The extracted rules proved useful to facilitate decision-making and resource preparation to minimise patient readmission.

Association Rule Mining for Customer Segmentation in the SMEs Sector Using the Apriori Algorithm

2019 ◽  
pp. 487-497 ◽  
Author(s):  
Jesús Silva ◽  
Mercedes Gaitan Angulo ◽  
Danelys Cabrera ◽  
Sadhana J. Kamatkar ◽  
Hugo Martínez Caraballo ◽  
...  
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Customer Segmentation ◽  
Apriori Algorithm ◽  
Rule Mining
Sign in / Sign up

Export Citation Format

Share Document