1403 search results - page 115 / 281 » Set cover algorithms for very large datasets |
153
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
145
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
126
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we propose a new approach to automatically compose data providing Web services. Our approach exploits existing mature works done in data integration systems. Specif...
154
click to vote
ADMA
2009
Springer
15 years 11 months ago
2009
Springer
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
151
click to vote
DATAMINE
1999
15 years 4 months ago
1999
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...