Parallel method for discovering frequent itemsets using weighted tree approach

Preetham Kumar, V. S. Ananthanarayana

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

1 Citation (Scopus)

Abstract

Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support.

Original languageEnglish
Title of host publicationProceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009
Pages124-128
Number of pages5
Volume1
DOIs
Publication statusPublished - 01-06-2009
Externally publishedYes
Event2009 International Conference on Computer Engineering and Technology, ICCET 2009 - Singapore, Singapore
Duration: 22-01-200924-01-2009

Conference

Conference2009 International Conference on Computer Engineering and Technology, ICCET 2009
CountrySingapore
CitySingapore
Period22-01-0924-01-09

Fingerprint

Association rules
Parallel algorithms
Data structures
Costs
Profitability
Scanning

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Cite this

Kumar, P., & Ananthanarayana, V. S. (2009). Parallel method for discovering frequent itemsets using weighted tree approach. In Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009 (Vol. 1, pp. 124-128). [4769439] https://doi.org/10.1109/ICCET.2009.194
Kumar, Preetham ; Ananthanarayana, V. S. / Parallel method for discovering frequent itemsets using weighted tree approach. Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. Vol. 1 2009. pp. 124-128
@inproceedings{f1e82477c3bd40e9be82422a6f784119,
title = "Parallel method for discovering frequent itemsets using weighted tree approach",
abstract = "Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support.",
author = "Preetham Kumar and Ananthanarayana, {V. S.}",
year = "2009",
month = "6",
day = "1",
doi = "10.1109/ICCET.2009.194",
language = "English",
isbn = "9780769535210",
volume = "1",
pages = "124--128",
booktitle = "Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009",

}

Kumar, P & Ananthanarayana, VS 2009, Parallel method for discovering frequent itemsets using weighted tree approach. in Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. vol. 1, 4769439, pp. 124-128, 2009 International Conference on Computer Engineering and Technology, ICCET 2009, Singapore, Singapore, 22-01-09. https://doi.org/10.1109/ICCET.2009.194

Parallel method for discovering frequent itemsets using weighted tree approach. / Kumar, Preetham; Ananthanarayana, V. S.

Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. Vol. 1 2009. p. 124-128 4769439.

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

TY - GEN

T1 - Parallel method for discovering frequent itemsets using weighted tree approach

AU - Kumar, Preetham

AU - Ananthanarayana, V. S.

PY - 2009/6/1

Y1 - 2009/6/1

N2 - Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support.

AB - Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support.

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

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

U2 - 10.1109/ICCET.2009.194

DO - 10.1109/ICCET.2009.194

M3 - Conference contribution

SN - 9780769535210

VL - 1

SP - 124

EP - 128

BT - Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009

ER -

Kumar P, Ananthanarayana VS. Parallel method for discovering frequent itemsets using weighted tree approach. In Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. Vol. 1. 2009. p. 124-128. 4769439 https://doi.org/10.1109/ICCET.2009.194