Sciweavers

248 search results - page 4 / 50
» Perturbation based Large Margin Approach for Ranking
Sort
View
NIPS
2001
13 years 8 months ago
A kernel method for multi-labelled classification
This article presents a Support Vector Machine (SVM) like learning system to handle multi-label problems. Such problems are usually decomposed into many two-class problems but the...
André Elisseeff, Jason Weston
IBPRIA
2009
Springer
14 years 2 days ago
Large Scale Online Learning of Image Similarity through Ranking
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
Gal Chechik, Varun Sharma, Uri Shalit, Samy Bengio
SIAMNUM
2011
102views more  SIAMNUM 2011»
12 years 10 months ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich
ESANN
2004
13 years 8 months ago
An informational energy LVQ approach for feature ranking
Input feature ranking and selection represent a necessary preprocessing stage in classification, especially when one is required to manage large quantities of data. We introduce a ...
Razvan Andonie, Angel Cataron
HICSS
2009
IEEE
144views Biometrics» more  HICSS 2009»
14 years 2 months ago
Privacy Preserving Decision Tree Mining from Perturbed Data
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
Li Liu, Murat Kantarcioglu, Bhavani M. Thuraisingh...