Sciweavers

263 search results - page 16 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
79
Voted
APPINF
2003
14 years 11 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
84
Voted
JISE
2008
108views more  JISE 2008»
14 years 9 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
14 years 11 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
WISE
2006
Springer
15 years 3 months ago
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu
ICDM
2002
IEEE
114views Data Mining» more  ICDM 2002»
15 years 2 months ago
Online Algorithms for Mining Semi-structured Data Stream
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...
Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Ka...