Sciweavers

227 search results - page 17 / 46
» How Good Is a Kernel When Used as a Similarity Measure
Sort
View
SDM
2008
SIAM
135views Data Mining» more  SDM 2008»
13 years 8 months ago
Preemptive Measures against Malicious Party in Privacy-Preserving Data Mining
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
Shuguo Han, Wee Keong Ng
WSDM
2012
ACM
262views Data Mining» more  WSDM 2012»
12 years 2 months ago
Effects of user similarity in social media
There are many settings in which users of a social media application provide evaluations of one another. In a variety of domains, mechanisms for evaluation allow one user to say w...
Ashton Anderson, Daniel P. Huttenlocher, Jon M. Kl...
ICML
2002
IEEE
14 years 8 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
13 years 12 months ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera
ACL
2009
13 years 5 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty