IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-40660-7_184.html
   My bibliography  Save this book chapter

Research on Application of FP-growth Algorithm for Lottery Analysis

In: Liss 2013

Author

Listed:
  • Jianlin Zhang

    (Capital Normal University)

  • Suozhu Wang

    (Capital Normal University)

  • Huiying Lv

    (Capital Normal University)

  • Chaoliang Zhou

    (Capital Normal University)

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.

Suggested Citation

  • Jianlin Zhang & Suozhu Wang & Huiying Lv & Chaoliang Zhou, 2015. "Research on Application of FP-growth Algorithm for Lottery Analysis," Springer Books, in: Runtong Zhang & Zhenji Zhang & Kecheng Liu & Juliang Zhang (ed.), Liss 2013, pages 1227-1231, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-40660-7_184
    DOI: 10.1007/978-3-642-40660-7_184
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-40660-7_184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.