I2Apriori: An improved apriori algorithm based on infrequent count

Shyam Kumar Singh; Preetham Kumar

doi:10.1109/ICEEOT.2016.7754889

I2Apriori: An improved apriori algorithm based on infrequent count

Shyam Kumar Singh, Preetham Kumar

Department of Information and Communication Technology, Manipal Institute of Technology, Manipal

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1281-1285
Number of pages	5
ISBN (Electronic)	9781467399395
DOIs	https://doi.org/10.1109/ICEEOT.2016.7754889
Publication status	Published - 22-11-2016
Event	2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016 - Palnchur, Chennai, Tamilnadu, India Duration: 03-03-2016 → 05-03-2016

Conference

Conference	2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016
Country/Territory	India
City	Palnchur, Chennai, Tamilnadu
Period	03-03-16 → 05-03-16

All Science Journal Classification (ASJC) codes

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

Access to Document

10.1109/ICEEOT.2016.7754889

Cite this

@inproceedings{f69d50e13ef64acba238c60f26cf6fce,

title = "I2Apriori: An improved apriori algorithm based on infrequent count",

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.",

author = "Singh, {Shyam Kumar} and Preetham Kumar",

year = "2016",

month = nov,

day = "22",

doi = "10.1109/ICEEOT.2016.7754889",

language = "English",

pages = "1281--1285",

booktitle = "International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016 ; Conference date: 03-03-2016 Through 05-03-2016",

}

Singh, SK & Kumar, P 2016, I2Apriori: An improved apriori algorithm based on infrequent count. in International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016., 7754889, Institute of Electrical and Electronics Engineers Inc., pp. 1281-1285, 2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016, Palnchur, Chennai, Tamilnadu, India, 03-03-16. https://doi.org/10.1109/ICEEOT.2016.7754889

I2Apriori: An improved apriori algorithm based on infrequent count. / Singh, Shyam Kumar; Kumar, Preetham.
International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1281-1285 7754889.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - I2Apriori

T2 - 2016 International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016

AU - Singh, Shyam Kumar

AU - Kumar, Preetham

PY - 2016/11/22

Y1 - 2016/11/22

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85006717890&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006717890&partnerID=8YFLogxK

U2 - 10.1109/ICEEOT.2016.7754889

DO - 10.1109/ICEEOT.2016.7754889

M3 - Conference contribution

AN - SCOPUS:85006717890

SP - 1281

EP - 1285

BT - International Conference on Electrical, Electronics, and Optimization Techniques, ICEEOT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 3 March 2016 through 5 March 2016

ER -

I2Apriori: An improved apriori algorithm based on infrequent count

Abstract

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this