Sciweavers

164 search results - page 2 / 33
» Finding Frequent Patterns in a Large Sparse Graph
Sort
View
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 9 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 11 days ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 5 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
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
14 years 6 days ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
CIVR
2006
Springer
139views Image Analysis» more  CIVR 2006»
13 years 11 months ago
Finding People Frequently Appearing in News
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...
Derya Ozkan, Pinar Duygulu