[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/igg/jiit00/v10y2014i1p42-56.html
   My bibliography  Save this article

A Scalable Algorithm for Constructing Frequent Pattern Tree

Author

Listed:
  • Zailani Abdullah

    (Department of Computer Science, Universiti Malaysia, Terengganu, Malaysia)

  • Tutut Herawan

    (Department of Mathematics Education, Universitas Ahmad Dahlan, Yogyakarta, Indonesia)

  • A. Noraziah

    (Computer System and Software Engineering, Universiti Malaysia, Kuantan, Malaysia)

  • Mustafa Mat Deris

    (Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, Johor, Malaysia)

Abstract
Frequent Pattern Tree (FP-Tree) is a compact data structure of representing frequent itemsets. The construction of FP-Tree is very important prior to frequent patterns mining. However, there have been too limited efforts specifically focused on constructing FP-Tree data structure beyond from its original database. In typical FP-Tree construction, besides the prior knowledge on support threshold, it also requires two database scans; first to build and sort the frequent patterns and second to build its prefix paths. Thus, twice database scanning is a key and major limitation in completing the construction of FP-Tree. Therefore, this paper suggests scalable Trie Transformation Technique Algorithm (T3A) to convert our predefined tree data structure, Disorder Support Trie Itemset (DOSTrieIT) into FP-Tree. Experiment results through two UCI benchmark datasets show that the proposed T3A generates FP-Tree up to 3 magnitudes faster than that the benchmarked FP-Growth.

Suggested Citation

  • Zailani Abdullah & Tutut Herawan & A. Noraziah & Mustafa Mat Deris, 2014. "A Scalable Algorithm for Constructing Frequent Pattern Tree," International Journal of Intelligent Information Technologies (IJIIT), IGI Global, vol. 10(1), pages 42-56, January.
    • Handle: RePEc:igg:jiit00:v:10:y:2014:i:1:p:42-56
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijiit.2014010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jiit00:v:10:y:2014:i:1:p:42-56. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.