Discovery of weighted association rules mining

Preetham Kumar, V. S. Ananthanarayana

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

5 Citations (Scopus)

Abstract

Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai's Algorithm.

Original languageEnglish
Title of host publication2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010
Pages718-722
Number of pages5
Volume5
DOIs
Publication statusPublished - 28-05-2010
Externally publishedYes
Event2nd International Conference on Computer and Automation Engineering, ICCAE 2010 - Singapore, Singapore
Duration: 26-02-201028-02-2010

Conference

Conference2nd International Conference on Computer and Automation Engineering, ICCAE 2010
CountrySingapore
CitySingapore
Period26-02-1028-02-10

Fingerprint

Association rules
Data structures

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Control and Systems Engineering

Cite this

Kumar, P., & Ananthanarayana, V. S. (2010). Discovery of weighted association rules mining. In 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010 (Vol. 5, pp. 718-722). [5451339] https://doi.org/10.1109/ICCAE.2010.5451339
Kumar, Preetham ; Ananthanarayana, V. S. / Discovery of weighted association rules mining. 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. Vol. 5 2010. pp. 718-722
@inproceedings{d68812b5562443909c0476ed1e9f08f1,
title = "Discovery of weighted association rules mining",
abstract = "Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai's Algorithm.",
author = "Preetham Kumar and Ananthanarayana, {V. S.}",
year = "2010",
month = "5",
day = "28",
doi = "10.1109/ICCAE.2010.5451339",
language = "English",
isbn = "9781424455850",
volume = "5",
pages = "718--722",
booktitle = "2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010",

}

Kumar, P & Ananthanarayana, VS 2010, Discovery of weighted association rules mining. in 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. vol. 5, 5451339, pp. 718-722, 2nd International Conference on Computer and Automation Engineering, ICCAE 2010, Singapore, Singapore, 26-02-10. https://doi.org/10.1109/ICCAE.2010.5451339

Discovery of weighted association rules mining. / Kumar, Preetham; Ananthanarayana, V. S.

2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. Vol. 5 2010. p. 718-722 5451339.

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

TY - GEN

T1 - Discovery of weighted association rules mining

AU - Kumar, Preetham

AU - Ananthanarayana, V. S.

PY - 2010/5/28

Y1 - 2010/5/28

N2 - Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai's Algorithm.

AB - Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai's Algorithm.

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

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

U2 - 10.1109/ICCAE.2010.5451339

DO - 10.1109/ICCAE.2010.5451339

M3 - Conference contribution

SN - 9781424455850

VL - 5

SP - 718

EP - 722

BT - 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010

ER -

Kumar P, Ananthanarayana VS. Discovery of weighted association rules mining. In 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. Vol. 5. 2010. p. 718-722. 5451339 https://doi.org/10.1109/ICCAE.2010.5451339