332 search results - page 12 / 67 » Ranking and selecting clustering algorithms using a meta-lea... |
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
NIPS
2003
13 years 9 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
IDA
2002
Springer
13 years 8 months ago
2002
Springer
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
WWW
2011
ACM
13 years 3 months ago
2011
ACM
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. ...
WEBI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...