Mining frequent closed patterns in pointset databases

Authors:
Anthony J. T. Lee;Wen-Kwang Tsao;Po-Yin Chen;Ming-Chih Lin;Shih-Hui Yang
Affiliations:
Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC;Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC;Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC;Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC;Department of Information Management, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei 106, Taiwan, ROC
Venue:
Information Systems
Year:
2010

Citing 23
Cited 1

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth

Proceedings of the 17th International Conference on Data Engineering
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Mining of Spatiotemporal Patterns

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Temporal Pattern Mining of Moving Objects for Location-Based Service

DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
CLOSET+: searching for the best strategies for mining frequent closed itemsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast vertical mining using diffsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure

IEEE Transactions on Knowledge and Data Engineering
Discovering frequent topological structures from graph datasets

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Discovering Frequent Graph Patterns Using Disjoint Paths

IEEE Transactions on Knowledge and Data Engineering
An efficient algorithm for mining frequent inter-transaction patterns

Information Sciences: an International Journal
Trajectory pattern mining

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering frequent geometric subgraphs

Information Systems
An efficient algorithm for mining closed inter-transaction itemsets

Data & Knowledge Engineering
Mining closed patterns in multi-sequence time-series databases

Data & Knowledge Engineering
Time and space efficient discovery of maximal geometric graphs

DS'07 Proceedings of the 10th international conference on Discovery science
Discovery of spatiotemporal patterns in mobile environment

APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Mining mobile group patterns: a trajectory-based approach

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

Single-pass incremental and interactive mining for weighted frequent patterns

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we proposed an efficient algorithm, called PCP-Miner (Pointset Closed Pattern Miner), for mining frequent closed patterns from a pointset database, where a pointset contains a set of points. Our proposed algorithm consists of two phases. First, we find all frequent patterns of length two in the database. Second, for each pattern found in the first phase, we recursively generate frequent closed patterns by a frequent pattern tree in a depth-first search manner. Since the PCP-Miner does not generate unnecessary candidates, it is more efficient and scalable than the modified Apriori, SASMiner and MaxGeo. The experimental results show that the PCP-Miner algorithm outperforms the comparing algorithms by more than one order of magnitude.