1940 search results - page 206 / 388 » Optimizing search engines using clickthrough data |
145
click to vote
ICDM
2007
IEEE
16 years 24 days ago
2007
IEEE
We present a new generative model for relational data in which relations between objects can have either a binding or a separating effect. For example, in a group of students sep...
153
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
164
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
176
click to vote
NIPS
2004
15 years 7 months ago
2004
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
153
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In online advertising, pervasive in commercial search engines, advertisers typically bid on few terms, and the scarcity of data makes ad matching difficult. Suggesting additional ...