Sciweavers

573 search results - page 41 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
13 years 9 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
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 8 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 4 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
CIKM
2004
Springer
14 years 1 months ago
Discovering frequently changing structures from historical structural deltas of unordered XML
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
Qiankun Zhao, Sourav S. Bhowmick, Mukesh K. Mohani...
INTELLCOMM
2004
Springer
14 years 1 months ago
A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs
Abstract. Today, event logs contain vast amounts of data that can easily overwhelm a human. Therefore, the mining of frequent patterns from event logs is an important system and ne...
Risto Vaarandi