2260 search results - page 215 / 452 » A new algorithm for clustering search results |
178
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
168
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Web search engines discover indexable documents by recursively ‘crawling’ from a seed URL. Their rankings take into account link popularity. While this works well, it introduc...
183
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
153
click to vote
ADC
2006
Springer
16 years 16 days ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
172
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
Identification of those genes that might anticipate the clinical behavior of different types of cancers is challenging due to availability of a smaller number of patient samples...