2600 search results - page 60 / 520 » Clustering with or without the Approximation |
148
click to vote
VLDB
1998
ACM
15 years 2 months ago
1998
ACM
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
126
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 2 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
232
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The scope of the well-known k-means algorithm has been
broadly extended with some recent results: first, the k-
means++ initialization method gives some approximation
guarantees...
ISMIS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
102
click to vote
WEBI
2001
Springer
15 years 2 months ago
2001
Springer
: Automated collaborative filtering is a popular technique for reducing information overload. In this paper, we propose a new approach for the collaborative filtering using local...