An efficient real-time frequent pattern mining technique using diff-sets

Authors:
Rajanish Dass;Ambuj Mahanti
Affiliations:
Indian Institute of Management Calcutta;Indian Institute of Management Calcutta
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 3
Cited 0

Fast vertical mining using diffsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Memory issues in frequent itemset mining

Proceedings of the 2004 ACM symposium on Applied computing
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03

Quantified Score

Hi-index	0.01

Visualization

Abstract

Frequent pattern mining in real-time is of increasing thrust in many business applications such as e-commerce, recommender systems, and supply-chain management and group decision support systems, to name a few. A plethora of efficient algorithms have been proposed till date. However, with dense datasets, the performances of these algorithms significantly degrade. Moreover, these algorithms are not suited to respond to the real-time need. In this paper, we describe BDFS(b)-diff-sets, an algorithm to perform real-time frequent pattern mining using diff-sets. Empirical evaluations show that our algorithm can make a fair estimation of the probable frequent patterns and reaches some of the longest frequent patterns much faster than the existing algorithms.