Title : 
Research and Improvement of Apriori Algorithm for Association Rules
         
        
            Author : 
Chengyu ; Xiong Ying
         
        
            Author_Institution : 
Sch. of Comput. Dept, Hubei Univ. of Technol., Wuhan, China
         
        
        
        
        
        
            Abstract : 
With the development and the wide application of DBMS, large-scale database system is popularized in daily life. Data mining is a process of fetching valuable or important information from magnanimous database. Association rules mining is one important research topic of data mining area. Above all most important of all is research on increment association rules mining. In order to renew association rules effectively, the paper introduces the idea of Apriori algorithm; meanwhile it has already analyzed the classic association rule algorithm FUP and IUA, it pointing out its advantages and disadvantages. Finally, it also gives narrative to another improved NIUP and NFUP algorithm. NFUP algorithm joins strong large itemsets into small quantitative of candidate itemsets based on strong large itemsets concept, and adopts early pruning strategy to cut down the times of scanning database.
         
        
            Keywords : 
data mining; very large databases; DBMS; IUA association rule algorithm; NFUP algorithm; NIUP algorithm; apriori algorithm; classic association rule algorithm FUP; data mining; database scanning; early pruning strategy; fast update algorithm; frequent item sets; increment association rule mining; large-scale database system; magnanimous database; Algorithm design and analysis; Application software; Association rules; Data mining; Database systems; Itemsets; Joining processes; Large-scale systems; Transaction databases;
         
        
        
        
            Conference_Titel : 
Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on
         
        
            Conference_Location : 
Wuhan
         
        
            Print_ISBN : 
978-1-4244-5872-1
         
        
            Electronic_ISBN : 
978-1-4244-5874-5
         
        
        
            DOI : 
10.1109/IWISA.2010.5473473