Bitwise dynamic itemset counting algorithm

Preetham Kumar, Preetika Bhatt, Raka Choudhury

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

2 Citations (Scopus)

Abstract

Data mining has gained a lot of importance as well as popularity in today's world. Data mining provides a systematic approach for gathering useful information from huge amounts of data. Many algorithms are being written for this purpose. One of them is Dynamic Itemset Counting Algorithm. Only if all the subsets are frequent, an itemset is considered frequent in this algorithm. As the itemsets are counted, they are grouped together into four separate categories namely, dashed circle, dashed box, solid circle, and solid box. Here, a variation of this existing algorithm is being provided. Bitwise Dynamic Itemset Counting Algorithm aims to modify the existing algorithm such that its time complexity reduces. In today's world, it is very important not only to collect information from raw data but also to do it fast. Time required for running any algorithm on a collection of data directly impacts the usefulness of that algorithm. Hence, reduction of the time complexity of an existing data mining algorithm such as Dynamic Itemset Counting Algorithm shall be useful. In the existing algorithm, all transactions are checked during every pass for detecting the frequency of the different itemsets. The modified algorithm attempts to suggest a more efficient way to achieve the same results. It also aims at reducing the number of comparisons and the required number of scans. Bitwise Dynamic Itemset Counting Algorithm uses bitwise mapping of all transactions corresponding to each distinct item and the possibility check.

Original languageEnglish
Title of host publication2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479978489
DOIs
Publication statusPublished - 17-03-2016
Event6th IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015 - Madurai, India
Duration: 10-12-201512-12-2015

Conference

Conference6th IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015
CountryIndia
CityMadurai
Period10-12-1512-12-15

Fingerprint

Data mining
Set theory

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Artificial Intelligence
  • Computer Science Applications
  • Computer Vision and Pattern Recognition

Cite this

Kumar, P., Bhatt, P., & Choudhury, R. (2016). Bitwise dynamic itemset counting algorithm. In 2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015 [7435752] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCIC.2015.7435752
Kumar, Preetham ; Bhatt, Preetika ; Choudhury, Raka. / Bitwise dynamic itemset counting algorithm. 2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015. Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{646c71b169c04a0c97fa545029c5f20a,
title = "Bitwise dynamic itemset counting algorithm",
abstract = "Data mining has gained a lot of importance as well as popularity in today's world. Data mining provides a systematic approach for gathering useful information from huge amounts of data. Many algorithms are being written for this purpose. One of them is Dynamic Itemset Counting Algorithm. Only if all the subsets are frequent, an itemset is considered frequent in this algorithm. As the itemsets are counted, they are grouped together into four separate categories namely, dashed circle, dashed box, solid circle, and solid box. Here, a variation of this existing algorithm is being provided. Bitwise Dynamic Itemset Counting Algorithm aims to modify the existing algorithm such that its time complexity reduces. In today's world, it is very important not only to collect information from raw data but also to do it fast. Time required for running any algorithm on a collection of data directly impacts the usefulness of that algorithm. Hence, reduction of the time complexity of an existing data mining algorithm such as Dynamic Itemset Counting Algorithm shall be useful. In the existing algorithm, all transactions are checked during every pass for detecting the frequency of the different itemsets. The modified algorithm attempts to suggest a more efficient way to achieve the same results. It also aims at reducing the number of comparisons and the required number of scans. Bitwise Dynamic Itemset Counting Algorithm uses bitwise mapping of all transactions corresponding to each distinct item and the possibility check.",
author = "Preetham Kumar and Preetika Bhatt and Raka Choudhury",
year = "2016",
month = "3",
day = "17",
doi = "10.1109/ICCIC.2015.7435752",
language = "English",
booktitle = "2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Kumar, P, Bhatt, P & Choudhury, R 2016, Bitwise dynamic itemset counting algorithm. in 2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015., 7435752, Institute of Electrical and Electronics Engineers Inc., 6th IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015, Madurai, India, 10-12-15. https://doi.org/10.1109/ICCIC.2015.7435752

Bitwise dynamic itemset counting algorithm. / Kumar, Preetham; Bhatt, Preetika; Choudhury, Raka.

2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015. Institute of Electrical and Electronics Engineers Inc., 2016. 7435752.

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

TY - GEN

T1 - Bitwise dynamic itemset counting algorithm

AU - Kumar, Preetham

AU - Bhatt, Preetika

AU - Choudhury, Raka

PY - 2016/3/17

Y1 - 2016/3/17

N2 - Data mining has gained a lot of importance as well as popularity in today's world. Data mining provides a systematic approach for gathering useful information from huge amounts of data. Many algorithms are being written for this purpose. One of them is Dynamic Itemset Counting Algorithm. Only if all the subsets are frequent, an itemset is considered frequent in this algorithm. As the itemsets are counted, they are grouped together into four separate categories namely, dashed circle, dashed box, solid circle, and solid box. Here, a variation of this existing algorithm is being provided. Bitwise Dynamic Itemset Counting Algorithm aims to modify the existing algorithm such that its time complexity reduces. In today's world, it is very important not only to collect information from raw data but also to do it fast. Time required for running any algorithm on a collection of data directly impacts the usefulness of that algorithm. Hence, reduction of the time complexity of an existing data mining algorithm such as Dynamic Itemset Counting Algorithm shall be useful. In the existing algorithm, all transactions are checked during every pass for detecting the frequency of the different itemsets. The modified algorithm attempts to suggest a more efficient way to achieve the same results. It also aims at reducing the number of comparisons and the required number of scans. Bitwise Dynamic Itemset Counting Algorithm uses bitwise mapping of all transactions corresponding to each distinct item and the possibility check.

AB - Data mining has gained a lot of importance as well as popularity in today's world. Data mining provides a systematic approach for gathering useful information from huge amounts of data. Many algorithms are being written for this purpose. One of them is Dynamic Itemset Counting Algorithm. Only if all the subsets are frequent, an itemset is considered frequent in this algorithm. As the itemsets are counted, they are grouped together into four separate categories namely, dashed circle, dashed box, solid circle, and solid box. Here, a variation of this existing algorithm is being provided. Bitwise Dynamic Itemset Counting Algorithm aims to modify the existing algorithm such that its time complexity reduces. In today's world, it is very important not only to collect information from raw data but also to do it fast. Time required for running any algorithm on a collection of data directly impacts the usefulness of that algorithm. Hence, reduction of the time complexity of an existing data mining algorithm such as Dynamic Itemset Counting Algorithm shall be useful. In the existing algorithm, all transactions are checked during every pass for detecting the frequency of the different itemsets. The modified algorithm attempts to suggest a more efficient way to achieve the same results. It also aims at reducing the number of comparisons and the required number of scans. Bitwise Dynamic Itemset Counting Algorithm uses bitwise mapping of all transactions corresponding to each distinct item and the possibility check.

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

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

U2 - 10.1109/ICCIC.2015.7435752

DO - 10.1109/ICCIC.2015.7435752

M3 - Conference contribution

BT - 2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Kumar P, Bhatt P, Choudhury R. Bitwise dynamic itemset counting algorithm. In 2015 IEEE International Conference on Computational Intelligence and Computing Research, ICCIC 2015. Institute of Electrical and Electronics Engineers Inc. 2016. 7435752 https://doi.org/10.1109/ICCIC.2015.7435752