Sciweavers

41 search results - page 5 / 9
» Finding frequent items in probabilistic data
Sort
View
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
14 years 7 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
CORR
2010
Springer
219views Education» more  CORR 2010»
14 years 9 months ago
Finding Sequential Patterns from Large Sequence Data
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
Mahdi Esmaeili, Fazekas Gabor
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 9 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
15 years 3 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
15 years 10 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy