I2Apriori: An improved apriori algorithm based on infrequent count

Shyam Kumar Singh, Preetham Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper, the proposed method reduces CPU computation time by reducing transaction scan. The Concept infrequent count is based on minimum threshold support and 2-way searching to reduce execution time during scanning of transaction is introduced in proposed method. There exist several data mining algorithms for finding association rules but one of the candidate generation algorithms named Apriori algorithm is considered for the proposed work.

Original languageEnglish
Title of host publicationInternational Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1281-1285
Number of pages5
ISBN (Electronic)9781467399395
DOIs
Publication statusPublished - 22-11-2016
Event2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016 - Palnchur, Chennai, Tamilnadu, India
Duration: 03-03-201605-03-2016

Publication series

NameInternational Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016

Conference

Conference2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016
Country/TerritoryIndia
CityPalnchur, Chennai, Tamilnadu
Period03-03-1605-03-16

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials
  • Control and Optimization

Fingerprint

Dive into the research topics of 'I2Apriori: An improved apriori algorithm based on infrequent count'. Together they form a unique fingerprint.

Cite this