Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner

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

1 Citation (Scopus)

Abstract

Mining frequent itemsets in databases is an important and widely studied problem in data mining research. The problem of mining frequent itemsets is usually solved by constructing candidates of itemsets, and identifying those itemsets that meet the requirement of frequent itemsets. This paper proposes a novel algorithm based on BitTable (or bitmap) representation of the data. Data-related to frequent itemsets-are stored in spare matrices. Simple matrix and vector multiplications are used to calculate the support of the potential n+1 itemsets. The main benefit of this approach is that only bitmaps of the frequent itemsets are generated. The concept is simple and easily interpretable and it supports a compact and effective implementation (in MATLAB). An application example related to the BMS-WebView-1 benchmark data is presented to illustrate the applicability of the proposed algorithm.

Original languageEnglish
Title of host publication10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009
Pages469-479
Number of pages11
Publication statusPublished - 2009
Event10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 - Budapest, Hungary
Duration: Nov 12 2009Nov 14 2009

Other

Other10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009
CountryHungary
CityBudapest
Period11/12/0911/14/09

Fingerprint

Miners
MATLAB
Data mining

Keywords

  • BitTable
  • Frequent itemsets

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Abonyi, J. (2009). Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner. In 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 (pp. 469-479)

Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner. / Abonyi, J.

10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009. p. 469-479.

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

Abonyi, J 2009, Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner. in 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. pp. 469-479, 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009, Budapest, Hungary, 11/12/09.
Abonyi J. Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner. In 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009. p. 469-479
Abonyi, J. / Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner. 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009. pp. 469-479
@inproceedings{758710efa5504a4f9bd6e33c65691b31,
title = "Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner",
abstract = "Mining frequent itemsets in databases is an important and widely studied problem in data mining research. The problem of mining frequent itemsets is usually solved by constructing candidates of itemsets, and identifying those itemsets that meet the requirement of frequent itemsets. This paper proposes a novel algorithm based on BitTable (or bitmap) representation of the data. Data-related to frequent itemsets-are stored in spare matrices. Simple matrix and vector multiplications are used to calculate the support of the potential n+1 itemsets. The main benefit of this approach is that only bitmaps of the frequent itemsets are generated. The concept is simple and easily interpretable and it supports a compact and effective implementation (in MATLAB). An application example related to the BMS-WebView-1 benchmark data is presented to illustrate the applicability of the proposed algorithm.",
keywords = "BitTable, Frequent itemsets",
author = "J. Abonyi",
year = "2009",
language = "English",
pages = "469--479",
booktitle = "10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009",

}

TY - GEN

T1 - Generating (Fuzzy) frequent itemsets by a bitmap-based algorithm-The word's most compact frequent itemset miner

AU - Abonyi, J.

PY - 2009

Y1 - 2009

N2 - Mining frequent itemsets in databases is an important and widely studied problem in data mining research. The problem of mining frequent itemsets is usually solved by constructing candidates of itemsets, and identifying those itemsets that meet the requirement of frequent itemsets. This paper proposes a novel algorithm based on BitTable (or bitmap) representation of the data. Data-related to frequent itemsets-are stored in spare matrices. Simple matrix and vector multiplications are used to calculate the support of the potential n+1 itemsets. The main benefit of this approach is that only bitmaps of the frequent itemsets are generated. The concept is simple and easily interpretable and it supports a compact and effective implementation (in MATLAB). An application example related to the BMS-WebView-1 benchmark data is presented to illustrate the applicability of the proposed algorithm.

AB - Mining frequent itemsets in databases is an important and widely studied problem in data mining research. The problem of mining frequent itemsets is usually solved by constructing candidates of itemsets, and identifying those itemsets that meet the requirement of frequent itemsets. This paper proposes a novel algorithm based on BitTable (or bitmap) representation of the data. Data-related to frequent itemsets-are stored in spare matrices. Simple matrix and vector multiplications are used to calculate the support of the potential n+1 itemsets. The main benefit of this approach is that only bitmaps of the frequent itemsets are generated. The concept is simple and easily interpretable and it supports a compact and effective implementation (in MATLAB). An application example related to the BMS-WebView-1 benchmark data is presented to illustrate the applicability of the proposed algorithm.

KW - BitTable

KW - Frequent itemsets

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

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

M3 - Conference contribution

AN - SCOPUS:84883120253

SP - 469

EP - 479

BT - 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009

ER -