EconPapers    
Economics at your fingertips  
 

Research on Application of FP-growth Algorithm for Lottery Analysis

Jianlin Zhang (), Suozhu Wang (), Huiying Lv () and Chaoliang Zhou ()
Additional contact information
Jianlin Zhang: Capital Normal University
Suozhu Wang: Capital Normal University
Huiying Lv: Capital Normal University
Chaoliang Zhou: Capital Normal University

A chapter in LISS 2013, 2015, pp 1227-1231 from Springer

Abstract: Abstract As mining association rules can find interesting links between item sets, FP-growth algorithm in association-rule mining and its application in analysis of lottery were researched. Firstly every number in lottery was regarded as an item, and this algorithm was applied to explore association rules between all numbers and the rules were estimated. Then the numbers were participated before they were used in the algorithm for mining, the mined rules have a larger range. Finally historical data was introduced, the missing values of the numbers were used to mine for association rules by FP-growth algorithm and the result rules were analyzed. Experimental results showed that mining using FP-growth algorithm for lottery can get a lot of interesting rules; it has a good influence on lottery analysis and prediction.

Keywords: Data mining; Association rule; FP-growth algorithm; Lottery analysis (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-40660-7_184

Ordering information: This item can be ordered from
http://www.springer.com/9783642406607

DOI: 10.1007/978-3-642-40660-7_184

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-02
Handle: RePEc:spr:sprchp:978-3-642-40660-7_184