Sciweavers

146 search results - page 5 / 30
» Mining complex models from arbitrarily large databases in co...
Sort
View
TKDE
2008
218views more  TKDE 2008»
13 years 5 months ago
A General Model for Sequential Pattern Mining with a Progressive Database
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
Jen-Wei Huang, Chi-Yao Tseng, Jian Chih Ou, Ming-S...
CIVR
2006
Springer
172views Image Analysis» more  CIVR 2006»
13 years 9 months ago
Retrieving Shapes Efficiently by a Qualitative Shape Descriptor: The Scope Histogram
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
Arne Schuldt, Björn Gottfried, Otthein Herzog
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 10 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
13 years 11 months ago
Clustering time series from ARMA models with clipped data
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
Anthony J. Bagnall, Gareth J. Janacek
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
13 years 11 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...