Sciweavers

263 search results - page 27 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
TKDE
1998
111views more  TKDE 1998»
14 years 9 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
15 years 3 months ago
Distribution-Based Synthetic Database Generation Techniques for Itemset Mining
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
Ganesh Ramesh, Mohammed Javeed Zaki, William Mania...
DMIN
2006
138views Data Mining» more  DMIN 2006»
14 years 11 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
70
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
88
Voted
ICCV
2009
IEEE
14 years 7 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden