The Research and Application of Association Rules Algorithm

2013 ◽  
Vol 325-326 ◽  
pp. 1623-1627
Author(s):  
Shu Juan Zhang ◽  
Qing Min Wang
Keyword(s):  
Association Rules ◽  
Frequent Itemsets ◽  
Apriori Algorithm ◽  
Storage Space ◽  
Mining Technology ◽  
Association Rules Mining ◽  
Transaction Data ◽  
The Matrix ◽  
Improved Algorithm

Through the research of the association rules mining technology and Apriori algorithm, the defects are found in Apriori algorithm. In view of the deficiencies, an improved algorithm is proposed. The algorithm scans database only once, and efficiently reduces the I/O time. The matrix of frequent itemsets is used to store and reduce the transaction data, which saves the storage space. By comparison of Apriori algorithm and improved algorithm, the results of experiments show that the efficiency of the improved algorithm is increased. Finally, an application example of the association rules is given. The improved algorithm is introduced to book lending deal. The rules among the book-borrowed are discovered and analyzed.

Research of Personalized Information Service Based on Association Rules

2013 ◽  
Vol 760-762 ◽  
pp. 1800-1803 ◽  
Author(s):  
Qing Song Zhang ◽  
Xin Yu Wang
Keyword(s):  
Data Processing ◽  
Association Rules ◽  
Information Service ◽  
Processing Technology ◽  
Demand Model ◽  
Library Service ◽  
Mining Technology ◽  
Association Rules Mining ◽  
Transaction Data ◽  
Information Demand

Association rules mining technology is a new data processing technology. Its algorithm and application play a very important role in the library. Obtaining personalized information of readers effectively and automatically is the key to carry out individualized service of university library. By using association rules technology, the library mine transaction data generated in the process of library service. And it also can have an access to various types of readers' information demand model, thus can provide accurate service for readers.

An Efficient Weighted Association Rules Mining Algorithm

2013 ◽  
Vol 333-335 ◽  
pp. 1247-1250 ◽  
Author(s):  
Na Xin Peng
Keyword(s):  
Association Rules ◽  
Frequent Itemsets ◽  
Experimental Results ◽  
Apriori Algorithm ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Weighted Association Rules ◽  
Mining Algorithm ◽  
Pruning Strategy

Aiming at the problem that most of weighted association rules algorithm have not the anti-monotonicity, this paper presents a weighted support-confidence framework which supports anti-monotonicity. On this basis, Boolean weighted association rules algorithm and weighted fuzzy association rules algorithm are presented, which use pruning strategy of Apriori algorithm so as to improve the efficiency of frequent itemsets generated. Experimental results show that both algorithms have good performance.

Weighted Association Rules Mining Algorithm Research

2012 ◽  
Vol 241-244 ◽  
pp. 1598-1601
Author(s):  
Jun Tan
Keyword(s):  
Association Rules ◽  
Frequent Itemsets ◽  
Experimental Results ◽  
Apriori Algorithm ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Weighted Association Rules ◽  
Mining Algorithm ◽  
Pruning Strategy ◽  
Mining Algorithms

Aiming at the problem that most of weighted association rules mining algorithms have not the anti-monotonicity, this paper presents a weighted support-confidence framework which supports anti-monotonicity. On this basis, weighted boolean association rules mining algorithm and weighted fuzzy association rules mining algorithm are presented, which use pruning strategy of Apriori algorithm so that improve the efficiency of frequent itemsets generated. Experimental results show that both algorithms have good performance.

scholarly journals Determination of Temporal Association Rules Pattern Using Apriori Algorithm

2020 ◽  
Vol 14 (2) ◽  
pp. 159
Author(s):  
Shona Chayy Bilqisth ◽  
Khabib Mustofa
Keyword(s):  
Association Rules ◽  
Business Plan ◽  
Frequent Itemsets ◽  
Frequent Itemset ◽  
Temporal Association ◽  
Apriori Algorithm ◽  
Time Intervals ◽  
Transaction Data ◽  
Support Count

A supermarket must have  good business plan in order to meet customer desires. One way that can be done to meet customer desires is to find out the pattern of shopping purchases resulting from processing sales transaction data. Data processing produces information related to the function of the association between items of goods temporarily. Association rules  functions in data mining.Association rule is one of the data mining techniques used to find patterns in combination of transaction data. Apriori algorithm can be used to find association rules. Apriori algorithm is used to find frequent itemset candidates who meet the support count. Frequent itemset that meets the support count is then processed using the temporal association rules method. The function of temporal association rules is as a time limitation in displaying the results of frequent itemsets and association rules. This study aims to produce rules from transaction data, apriori algorithm is used to form temporal association rules. The final results of this research are strong rules, they are rules that always appear in 3 years at certain time intervals with limitation on support and confidence, so that the rules can be used for business plan layout recommendations in Maharani Supermarket Demak.

Improved Apriori Algorithm in the Power System Fault

2014 ◽  
Vol 556-562 ◽  
pp. 1510-1514
Author(s):  
Li Qiang Lin ◽  
Hong Wen Yan
Keyword(s):  
Power System ◽  
Association Rules ◽  
Fault Analysis ◽  
The Other ◽  
Apriori Algorithm ◽  
Extreme Climate ◽  
Time Space ◽  
Low Efficiency ◽  
Candidate Item ◽  
Improved Algorithm

For the low efficiency in generating candidate item sets of apriori algorithm, this paper presents a method based on property division to improve generating candidate item sets. Comparing the improved apriori algorithm with the other algorithm and the improved algorithm is applied to the power system accident cases in extreme climate. The experiment results show that the improved algorithm significantly improves the time efficiency of generating candidate item sets. And it can find the association rules among time, space, disasters and fault facilities in the power system accident cases in extreme climate. That is very useful in power system fault analysis.

scholarly journals IMPLEMENTASI ALGORITMA APRIORI TERHADAP DATA PENJUALAN PADA PERUSAHAAN RETAIL

2019 ◽  
Vol 15 (1) ◽  
pp. 85-90 ◽  
Author(s):  
Jordy Lasmana Putra ◽  
Mugi Raharjo ◽  
Tommi Alfian Armawan Sandi ◽  
Ridwan Ridwan ◽  
Rizal Prasetyo
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
A Priori ◽  
Apriori Algorithm ◽  
Business World ◽  
Transaction Data ◽  
Retail Company ◽  
Special Strategy

The development of the business world is increasingly rapid, so it needs a special strategy to increase the turnover of the company, in this case the retail company. In increasing the company's turnover can be done using the Data Mining process, one of which is using apriori algorithm. With a priori algorithm can be found association rules which can later be used as patterns of purchasing goods by consumers, this study uses a repository of 209 records consisting of 23 transactions and 164 attributes. From the results of this study, the goods with the name CREAM CUPID HEART COAT HANGER are the products most often purchased by consumers. By knowing the pattern of purchasing goods by consumers, the company management can increase the company's turnover by referring to the results of processing sales transaction data using a priori algorithm

A Novel and Improved Apriori Algorithm

2014 ◽  
Vol 721 ◽  
pp. 543-546 ◽  
Author(s):  
Dong Juan Gu ◽  
Lei Xia
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Inner Product ◽  
Apriori Algorithm ◽  
Product Operation ◽  
Classical Algorithm ◽  
Transaction Database ◽  
The Given ◽  
To Receive ◽  
Improved Algorithm

Apriori algorithm is the classical algorithm in data mining association rules. Because the Apriori algorithm needs scan database for many times, it runs too slowly. In order to improve the running efficiency, this paper improves the Apriori algorithm based on the Apriori analysis. The improved idea is that it transforms the transaction database into corresponding 0-1 matrix. Whose each vector and subsequent vector does inner product operation to receive support. And comparing with the given minsupport, the rows and columns will be deleted if vector are less than the minsupport, so as to reduce the size of the rating matrix, improve the running speeding. Because the improved algorithm only needs to scan the database once when running, therefore the running speeding is more quickly. The experiment also shows that this improved algorithm is efficient and feasible.

Research of Association Rules Algorithm Based on Matrix under Cloud Computing

2014 ◽  
Vol 568-570 ◽  
pp. 798-801
Author(s):  
Ye Qing Xiong ◽  
Shu Dong Zhang
Keyword(s):  
Data Mining ◽  
Cloud Computing ◽  
Big Data ◽  
Association Rules ◽  
Apriori Algorithm ◽  
Computing Technology ◽  
Binary Matrix ◽  
Transaction Data ◽  
Big Data Mining ◽  
Parallel Mining

It occurs time and space performance bottlenecks when traditional association rules algorithms are used to big data mining. This paper proposes a parallel algorithm based on matrix under cloud computing to improve Apriori algorithm. The algorithm uses binary matrix to store transaction data, uses matrix "and" operation to replace the connection between itemsets and combines cloud computing technology to implement the parallel mining for frequent itemsets. Under different conditions, the simulation shows it improves the efficiency, solves the performance bottleneck problem and can be widely used in big data mining with strong scalability and stability.

Sign in / Sign up

Export Citation Format

Share Document