Sciweavers

524 search results - page 25 / 105
» On the Performance of Clustering in Hilbert Spaces
Sort
View
WWW
2008
ACM
14 years 10 months ago
A Novelty-based Clustering Method for On-line Documents
In this paper, we describe a document clustering method called noveltybased document clustering. This method clusters documents based on similarity and novelty. The method assigns...
Sophoin Khy, Yoshiharu Ishikawa, Hiroyuki Kitagawa
110
Voted
CVPR
2009
IEEE
16 years 5 months ago
Intrinsic Mean Shift for Clustering on Stiefel and Grassmann Manifolds
The mean shift algorithm, which is a nonparametric density estimator for detecting the modes of a distribution on a Euclidean space, was recently extended to operate on analytic ...
Hasan Ertan Çetingül, René Vida...
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
15 years 7 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
SIGGRAPH
1995
ACM
15 years 1 months ago
Stochastic screening dithering with adaptive clustering
We developa clustereddithering methodthatusesstochasticscreening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendit...
Luiz Velho, Jonas Gomes
WISE
2002
Springer
15 years 3 months ago
A Unified Framework for Clustering Heterogeneous Web Objects
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a un...
Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma