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.

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.

Cross Sellingusing Association Rule Mining

2014 ◽  
Vol 687-691 ◽  
pp. 1337-1341
Author(s):  
Ran Bo Yao ◽  
An Ping Song ◽  
Xue Hai Ding ◽  
Ming Bo Li
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
New Method ◽  
Experimental Result ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Frequent Item ◽  
Direct Benefits ◽  
Frequent Item Sets

In the retail enterprises, it is an important problem to choose goods group through their sales record.We should consider not only the direct benefits of product, but also the benefits bring by the cross selling. On the base of the mutual promotion in cross selling, in this paper we propose a new method to generate the optimal selected model. Firstly we use Apriori algorithm to obtain the frequent item sets and analyses the association rules sets between products.And then we analyses the above results to generate the optimal products mixes and recommend relationship in cross selling. The experimental result shows the proposed method has some practical value to the decisions of cross selling.

scholarly journals Privacy Preserving Data Mining using Secure Multiparty Computation Based on Apriori and Fp-Tree Structure of Fp-Growth Algorithm

2020 ◽  
Vol 9 (3) ◽  
pp. 353-359
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Secure Multiparty Computation ◽  
Tree Structure ◽  
Multiparty Computation ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Frequent Item ◽  
Tree Optimization ◽  
Frequent Item Sets

In this work, a method is proposed to deal with secure multiparty computation (SMC) based problems. The computation is done on the grocery dataset collected from three various grocery shops. The privacy is maintained by generating the rules based on FP-Tree algorithm under Association Rule Mining (ARM). Privacy and correctness are the important requirements of SMC. In privacy requirement, the things apart from necessary are not learned. This implies that only output will be learned by the parties. Each party must receive correct output to ensure the correctness. In this work, secure auction is done using SMC and frequent item sets are computed to perform the association rule mining. The most familiar FP-growth schemes have the short fallings like former space complexity and latter time complexity. The performance of the algorithms has been enhanced by using APFT algorithm which is a combined version of FP-tree structure of FP-growth algorithm and Apriori algorithm. The conditional and sub conditional patterns are not generated continuously in APFT. The speed of the APFT is high when compared to Apriori algorithm and FP-growth.The correlated items are included by modifying APFT and noncorrelated item sets are shaped by using APFT. This modification is used for FP-tree optimization. From the frequent item set, the loosely associated items are removed by using this modification. The system implemented is clearly described and its performance is evaluated. The results confirmed that the proposed scheme is extremely effective.

Ordering Policy Using Multi-Level Association Rule Mining

2018 ◽  
Vol 11 (4) ◽  
pp. 84-101 ◽  
Author(s):  
Reshu Agarwal ◽  
Sarla Pareek ◽  
Biswajit Sarkar ◽  
Mandeep Mittal
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Order Quantity ◽  
Rule Mining ◽  
Ordering Policy ◽  
Optimum Order ◽  
Frequent Items ◽  
Multi Level ◽  
Real Scenario ◽  
Frequent Item Sets

In this article, an inventory model for a retailer's ordering policy is studied. Multi-level association rule mining is used to find frequent item-sets at each level by applying different threshold at different levels. During order quantity estimation, category, content, and brand of the items are considered, which leads to the discovery of more specific and concrete knowledge of the required order quantity. At each level, optimum order quantity of frequent items is determined. This assists inventory manager to order optimal quantity of items as per the actual requirement of the item with respect to their category, content and brand. An example is devised to explain the new approach. Further, to understand the effect of above approach in the real scenario, experiments are conducted on the exiting dataset.

Efficient Mining of Frequent Itemsets and a Measure of Interest for Association Rule Mining

2004 ◽  
Vol 03 (03) ◽  
pp. 245-257 ◽  
Author(s):  
Kwang-Il Ahn ◽  
Jae-Yearn Kim
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Frequent Itemsets ◽  
Second Step ◽  
Rule Mining ◽  
Good Decision ◽  
Data Format ◽  
Vertical Data ◽  
Important Research Topic ◽  
Mining Association Rule

Association rule mining is an important research topic in data mining. Association rule mining consists of two steps: finding frequent itemsets and then extracting interesting rules from the frequent itemsets. In the first step, efficiency is important since discovering frequent itemsets is computationally time consuming. In the second step, unbiased assessment is important for good decision making. In this paper, we deal with both the efficiency of the mining algorithm and the measure of interest of the resulting rules. First, we present an algorithm for finding frequent itemsets that uses a vertical database. We also introduce a modified vertical data format to reduce the size of the database and an itemset reordering strategy to reduce the size of the intermediate tidsets. Second, we present a new measure to evaluate the interest of the resulting association rules. Our performance analysis shows that our proposed algorithm reduces the size of the intermediate tidsets that are generated during the mining process. The smaller tidsets make intersection operations faster. Using our interest-measuring test helps to avoid the discovery of misleading rules.

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.

Sign in / Sign up

Export Citation Format

Share Document