Sciweavers

104 search results - page 2 / 21
» TRIPS and TIDES: new algorithms for tree mining
Sort
View
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 4 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
ACMSE
2008
ACM
15 years 1 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 2 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
TKDE
2008
94views more  TKDE 2008»
14 years 11 months ago
DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
Alexandre Termier, Marie-Christine Rousset, Mich&e...
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
15 years 4 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu