912 search results - page 61 / 183 » Inductive Databases as Ranking |
193
click to vote
SIGMOD
2008
ACM
16 years 25 days ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
188
Voted
SIGMOD
2008
ACM
16 years 25 days ago
2008
ACM
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
170
click to vote
SIGMOD
2009
ACM
16 years 27 days ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
85
Voted
DASFAA
2005
IEEE
15 years 6 months ago
2005
IEEE
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
90
Voted
SIGMOD
2005
ACM
15 years 6 months ago
2005
ACM
In a number of recent studies [4, 8] researchers have found that because search engines repeatedly return currently popular pages at the top of search results, popular pages tend ...