An efficient compression technique for vertical mining methods

Mafruz Zaman Ashrafi, David Taniar, Kate Smith

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Researchpeer-review

Abstract

Association rule mining is one of the most widely used data mining techniques. To achieve a better performance, many efficient algorithms have been proposed. Despite these efforts, many of these algorithms require a large amount of main memory to enumerate all frequent itemsets, especially when the dataset is large or the user-specified support is low. Thus, it becomes apparent that we need to have an efficient main memory handling technique, which allows association rule mining algorithms to handle larger datasets in the main memory. To achieve this goal, in this chapter we propose an algorithm for vertical association rule mining that compresses a vertical dataset in an efficient manner, using bit vectors. Our performance evaluations show that the compression ratio attained by our proposed technique is better than those of the other well-known techniques.

Original languageEnglish
Title of host publicationResearch and Trends in Data Mining Technologies and Applications
PublisherIGI Global
Pages143-173
Number of pages31
ISBN (Print)9781599042718
DOIs
Publication statusPublished - 2007

Cite this

Ashrafi, M. Z., Taniar, D., & Smith, K. (2007). An efficient compression technique for vertical mining methods. In Research and Trends in Data Mining Technologies and Applications (pp. 143-173). IGI Global. https://doi.org/10.4018/978-1-59904-271-8.ch006
Ashrafi, Mafruz Zaman ; Taniar, David ; Smith, Kate. / An efficient compression technique for vertical mining methods. Research and Trends in Data Mining Technologies and Applications. IGI Global, 2007. pp. 143-173
@inbook{36ebb860100d41b18b7dedf5c86f25d2,
title = "An efficient compression technique for vertical mining methods",
abstract = "Association rule mining is one of the most widely used data mining techniques. To achieve a better performance, many efficient algorithms have been proposed. Despite these efforts, many of these algorithms require a large amount of main memory to enumerate all frequent itemsets, especially when the dataset is large or the user-specified support is low. Thus, it becomes apparent that we need to have an efficient main memory handling technique, which allows association rule mining algorithms to handle larger datasets in the main memory. To achieve this goal, in this chapter we propose an algorithm for vertical association rule mining that compresses a vertical dataset in an efficient manner, using bit vectors. Our performance evaluations show that the compression ratio attained by our proposed technique is better than those of the other well-known techniques.",
author = "Ashrafi, {Mafruz Zaman} and David Taniar and Kate Smith",
year = "2007",
doi = "10.4018/978-1-59904-271-8.ch006",
language = "English",
isbn = "9781599042718",
pages = "143--173",
booktitle = "Research and Trends in Data Mining Technologies and Applications",
publisher = "IGI Global",
address = "United States of America",

}

Ashrafi, MZ, Taniar, D & Smith, K 2007, An efficient compression technique for vertical mining methods. in Research and Trends in Data Mining Technologies and Applications. IGI Global, pp. 143-173. https://doi.org/10.4018/978-1-59904-271-8.ch006

An efficient compression technique for vertical mining methods. / Ashrafi, Mafruz Zaman; Taniar, David; Smith, Kate.

Research and Trends in Data Mining Technologies and Applications. IGI Global, 2007. p. 143-173.

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Researchpeer-review

TY - CHAP

T1 - An efficient compression technique for vertical mining methods

AU - Ashrafi, Mafruz Zaman

AU - Taniar, David

AU - Smith, Kate

PY - 2007

Y1 - 2007

N2 - Association rule mining is one of the most widely used data mining techniques. To achieve a better performance, many efficient algorithms have been proposed. Despite these efforts, many of these algorithms require a large amount of main memory to enumerate all frequent itemsets, especially when the dataset is large or the user-specified support is low. Thus, it becomes apparent that we need to have an efficient main memory handling technique, which allows association rule mining algorithms to handle larger datasets in the main memory. To achieve this goal, in this chapter we propose an algorithm for vertical association rule mining that compresses a vertical dataset in an efficient manner, using bit vectors. Our performance evaluations show that the compression ratio attained by our proposed technique is better than those of the other well-known techniques.

AB - Association rule mining is one of the most widely used data mining techniques. To achieve a better performance, many efficient algorithms have been proposed. Despite these efforts, many of these algorithms require a large amount of main memory to enumerate all frequent itemsets, especially when the dataset is large or the user-specified support is low. Thus, it becomes apparent that we need to have an efficient main memory handling technique, which allows association rule mining algorithms to handle larger datasets in the main memory. To achieve this goal, in this chapter we propose an algorithm for vertical association rule mining that compresses a vertical dataset in an efficient manner, using bit vectors. Our performance evaluations show that the compression ratio attained by our proposed technique is better than those of the other well-known techniques.

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

U2 - 10.4018/978-1-59904-271-8.ch006

DO - 10.4018/978-1-59904-271-8.ch006

M3 - Chapter (Book)

AN - SCOPUS:84899167573

SN - 9781599042718

SP - 143

EP - 173

BT - Research and Trends in Data Mining Technologies and Applications

PB - IGI Global

ER -

Ashrafi MZ, Taniar D, Smith K. An efficient compression technique for vertical mining methods. In Research and Trends in Data Mining Technologies and Applications. IGI Global. 2007. p. 143-173 https://doi.org/10.4018/978-1-59904-271-8.ch006