An efficient mining of transactional data using graph-based technique

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

2 Citations (Scopus)

Abstract

Mining association rules is an essential task for knowledge discovery. Past transaction data can be analyzed to discover customer behaviors such that the quality of business decision can be improved. The approach of mining association rules focuses on discovering large itemsets, which are groups of items that appear together in an adequate number of transactions. In this paper, we propose a graph-based approach (DGARM) to generate Boolean association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Practical evaluations show that the proposed algorithm outperforms other algorithms which need to make multiple passes over the database.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages74-81
Number of pages8
DOIs
Publication statusPublished - 2011
Event2011 3rd Conference on Data Mining and Optimization, DMO 2011 - Putrajaya
Duration: 28 Jun 201129 Jun 2011

Other

Other2011 3rd Conference on Data Mining and Optimization, DMO 2011
CityPutrajaya
Period28/6/1129/6/11

Fingerprint

Association rules
Data mining
Industry

Keywords

  • Apriori
  • clustering
  • graph
  • rule mining

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Alzoubi, W. A., Omar, K., & Abu Bakar, A. (2011). An efficient mining of transactional data using graph-based technique. In Conference on Data Mining and Optimization (pp. 74-81). [5976508] https://doi.org/10.1109/DMO.2011.5976508

An efficient mining of transactional data using graph-based technique. / Alzoubi, Wael Ahmad; Omar, Khairuddin; Abu Bakar, Azuraliza.

Conference on Data Mining and Optimization. 2011. p. 74-81 5976508.

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

Alzoubi, WA, Omar, K & Abu Bakar, A 2011, An efficient mining of transactional data using graph-based technique. in Conference on Data Mining and Optimization., 5976508, pp. 74-81, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976508
Alzoubi, Wael Ahmad ; Omar, Khairuddin ; Abu Bakar, Azuraliza. / An efficient mining of transactional data using graph-based technique. Conference on Data Mining and Optimization. 2011. pp. 74-81
@inproceedings{f424d476b0334b0c9d991e88fc4cd4f4,
title = "An efficient mining of transactional data using graph-based technique",
abstract = "Mining association rules is an essential task for knowledge discovery. Past transaction data can be analyzed to discover customer behaviors such that the quality of business decision can be improved. The approach of mining association rules focuses on discovering large itemsets, which are groups of items that appear together in an adequate number of transactions. In this paper, we propose a graph-based approach (DGARM) to generate Boolean association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Practical evaluations show that the proposed algorithm outperforms other algorithms which need to make multiple passes over the database.",
keywords = "Apriori, clustering, graph, rule mining",
author = "Alzoubi, {Wael Ahmad} and Khairuddin Omar and {Abu Bakar}, Azuraliza",
year = "2011",
doi = "10.1109/DMO.2011.5976508",
language = "English",
isbn = "9781612842127",
pages = "74--81",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - An efficient mining of transactional data using graph-based technique

AU - Alzoubi, Wael Ahmad

AU - Omar, Khairuddin

AU - Abu Bakar, Azuraliza

PY - 2011

Y1 - 2011

N2 - Mining association rules is an essential task for knowledge discovery. Past transaction data can be analyzed to discover customer behaviors such that the quality of business decision can be improved. The approach of mining association rules focuses on discovering large itemsets, which are groups of items that appear together in an adequate number of transactions. In this paper, we propose a graph-based approach (DGARM) to generate Boolean association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Practical evaluations show that the proposed algorithm outperforms other algorithms which need to make multiple passes over the database.

AB - Mining association rules is an essential task for knowledge discovery. Past transaction data can be analyzed to discover customer behaviors such that the quality of business decision can be improved. The approach of mining association rules focuses on discovering large itemsets, which are groups of items that appear together in an adequate number of transactions. In this paper, we propose a graph-based approach (DGARM) to generate Boolean association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Practical evaluations show that the proposed algorithm outperforms other algorithms which need to make multiple passes over the database.

KW - Apriori

KW - clustering

KW - graph

KW - rule mining

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

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

U2 - 10.1109/DMO.2011.5976508

DO - 10.1109/DMO.2011.5976508

M3 - Conference contribution

SN - 9781612842127

SP - 74

EP - 81

BT - Conference on Data Mining and Optimization

ER -