Sciweavers

242 search results - page 19 / 49
» Closest Pairs Data Selection for Support Vector Machines
Sort
View
ESANN
2008
13 years 10 months ago
Survival SVM: a practical scalable algorithm
This work advances the Support Vector Machine (SVM) based approach for predictive modelling of failure time data as proposed in [1]. The main results concern a drastic reduction in...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
CIKM
2006
Springer
14 years 21 days ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
BMCBI
2010
97views more  BMCBI 2010»
13 years 9 months ago
Kinome-wide interaction modelling using alignment-based and alignment-independent approaches for kinase description and linear a
Background: Protein kinases play crucial roles in cell growth, differentiation, and apoptosis. Abnormal function of protein kinases can lead to many serious diseases, such as canc...
Maris Lapinsh, Jarl E. S. Wikberg
COMPGEOM
2009
ACM
14 years 3 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
TKDE
2011
168views more  TKDE 2011»
13 years 3 months ago
On Computing Farthest Dominated Locations
—In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p , ...
Hua Lu, Man Lung Yiu