arrow
Return

Progressive partition miner: An efficient algorithm for mining general temporal association rules

delete2003-07-01
delete52
PRE
AI
C
Chang-Hung Lee
C
Chen, MS
DOI:10.1109/TKDE.2003.1209015delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we explore a new problem of mining general temporal association rules in publication databases. In essence, a publication database is a set of transactions where each transaction T is a set of items of which each item contains an individual exhibition period. The current model of association rule mining is not able to handle the publication database due to the following fundamental problems, i.e., 1) lack of consideration of the exhibition period of each individual item and 2) lack of an equitable support counting basis for each item. To remedy this, we propose an innovative algorithm Progressive-Partition-Miner (abbreviated as PPM) to discover general temporal association rules in a publication database. The basic idea of PPM is to first partition the publication database in light of exhibition periods of items and then progressively accumulate the occurrence count of each candidate 2-itemset based on the intrinsic partitioning characteristics. Algorithm PPM is also designed to employ a filtering threshold in each partition to early prune out those cumulatively infrequent 2-itemsets. The feature that the number of candidate 2-itemsets generated by PPM is very close to the number of frequent 2-itemsets allows us to employ the scan reduction technique to effectively reduce the number of database scans. Explicitly, the execution time of PPM is, in orders of magnitude, smaller than those required by other competitive schemes that are directly extended from existing methods. The correctness of PPM is proven and some of its theoretical properties are derived. Sensitivity analysis of various parameters is conducted to provide many insights into Algorithm PPM.
Keywords:
data mining
general temporal association rule
exhibition period
publication database
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.9K
Citations:
3.2W

Organization

No organization information available
Cited Papers

Cited Papers

Predictive Potential of Eyelids and Tear Film in Determining Symptoms in Contact Lens Wearers
err2018-11-01
err0
PREAI
errJaya Sowjanya Siddireddy; Jacqueline Tan; Ajay Kumar Vijay; Mark Willcox
errShare
errSave
errShare
errSave
Causes and Management Outcomes of Acquired Corneal Opacity in a Preschool Age (0–5 Years) Group: A Hospital-Based Study
err2019-04-29
err0
PREAI
errPrafulla K. Maharana; Shah Nawaz; Deepali Singhal; Vishal Jhanji; Tushar Agarwal; Namrata Sharma; Rasik B. Vajpayee
errShare
errSave
Meibomian Gland Morphology: The Influence of Structural Variations on Gland Function and Ocular Surface Parameters
err2019-09-06
err0
errOAAI
errClara Llorens-Quintana; Laura Rico-del-Viejo; Piotr Syga; David Madrid-Costa; D. Robert Iskander
errShare
errSave
Finding interesting associations without support pruning
err2001-01-01
err235
PREAI
errCohen, E; Datar, M; Fujiwara, S; Gionis, A; Indyk, P; Motwani, R; Ullman, JD; Yang, C
errShare
errSave
Occupational contact dermatitis to N‐methylol‐chloracetamide
err2006-04-11
err0
PREAI
errM. Farli; M. Ginanneschi; S. Francalanci; C. Martinelli; A. Sertoli
errShare
errSave
A sixteen year survey of Canadian contact lens prescribing
err2016-12-01
err0
errOAAI
errDeborah Jones; Craig Woods; Lyndon Jones; Nathan Efron; Philip Morgan
errShare
errSave
researcher View more