Sciweavers

403 search results - page 28 / 81
» Frequent pattern mining with uncertain data
Sort
View
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 9 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
14 years 8 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
INCDM
2010
Springer
486views Data Mining» more  INCDM 2010»
13 years 10 months ago
Finding Temporal Patterns in Noisy Longitudinal Data: A Study in Diabetic Retinopathy
This paper describes an approach to temporal pattern mining using the concept of user de ned temporal prototypes to de ne the nature of the trends of interests. The temporal patt...
Vassiliki Somaraki, Deborah Broadbent, Frans Coene...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 2 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li