Sciweavers

164 search results - page 2 / 33
» Parallel Tree Projection Algorithm for Sequence Mining
Sort
View
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
13 years 10 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
IPPS
1998
IEEE
13 years 9 months ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar
GCB
2009
Springer
180views Biometrics» more  GCB 2009»
14 years 3 days ago
2D Projections of RNA Folding Landscapes
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...
Ronny Lorenz, Christoph Flamm, Ivo L. Hofacker
IPPS
2006
IEEE
13 years 11 months ago
Tree partition based parallel frequent pattern mining on shared memory systems
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
Dehao Chen, Chunrong Lai, Wei Hu, Wenguang Chen, Y...
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 9 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse