Sciweavers

337 search results - page 62 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
BMCBI
2010
182views more  BMCBI 2010»
13 years 7 months ago
L2-norm multiple kernel learning and its application to biomedical data fusion
Background: This paper introduces the notion of optimizing different norms in the dual problem of support vector machines with multiple kernels. The selection of norms yields diff...
Shi Yu, Tillmann Falck, Anneleen Daemen, Lé...
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 7 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 7 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
SIGIR
2010
ACM
13 years 7 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano