192 search results - page 17 / 39 » Sequential Hierarchical Pattern Clustering |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
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...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
ICAPR
2001
Springer
14 years 8 days ago
2001
Springer
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
ICRA
2009
IEEE
13 years 5 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...