Bimonthly    Since 1986
ISSN 1004-9037
Publication Details
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
 
   
      09 May 2023, Volume 38 Issue 3
    Article

    SEQUENTIAL PATTERN MINING USING APRIORI AND FP GROWTH ALGORITHM
    Sujit R Wakchaure, Dr. Rajeev G Vishwakarma
    Journal of Data Acquisition and Processing, 2023, 38 (3): 1451-1462 . 

    Abstract

    In order to use Apriori, generation of candidate item sets is required. If the itemset in the dataset is particularly vast, the number of instances of these item sets could be rather high. Apriori must perform repeated checks of the database in order to determine whether or not each newly formed itemset is supported, which results in increased expenses. Due to this, it is ineffective when utilised with a significant amount of datasets. For instance, the case in which there is a frequent-one itemset that has 104 elements from the set. The Apriori algorithm must generate more than 107 candidates with a two-length, whose will be assessed and accumulated as a result of their participation in the process. The use of the Apriori technique would be the generation of 2100 probable sets of items with the objective to identify a frequent sequence with size 100 (including v1, v2, v3, v4..., v100). The result would be an illustration of how the process works.

    Keyword

    #


    PDF Download (click here)

SCImago Journal & Country Rank

ISSN 1004-9037

         

Home
Editorial Board
Author Guidelines
Subscription
Journal of Data Acquisition and Processing
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: info@sjcjycl.cn
 
  Copyright ©2015 JCST, All Rights Reserved