Sciweavers

179 search results - page 19 / 36
» Parallel k h-Means Clustering for Large Data Sets
Sort
View
COMAD
2009
13 years 12 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
WWW
2011
ACM
13 years 5 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
SAC
2006
ACM
14 years 4 months ago
A scalable algorithm for high-quality clustering of web snippets
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
14 years 4 months ago
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
CIKM
2009
Springer
14 years 3 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...