Sciweavers

10 search results - page 2 / 2
» TidFP: Mining Frequent Patterns in Different Databases with ...
Sort
View
14
Voted
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 5 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
BDA
2000
13 years 6 months ago
Incremental Mining of Sequential Patterns in Large Databases
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new a...
Florent Masseglia, Pascal Poncelet, Maguelonne Tei...
ICEIS
2009
IEEE
13 years 2 months ago
Mining Patterns in the Presence of Domain Knowledge
One of the main difficulties of pattern mining is to deal with items of different nature in the same itemset, which can occur in any domain except basket analysis. Indeed, if we co...
Cláudia Antunes
CIKM
2004
Springer
13 years 10 months ago
Scalable sequential pattern mining for biological sequences
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
Ke Wang, Yabo Xu, Jeffrey Xu Yu
SPAA
1997
ACM
13 years 9 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...