Sciweavers

4903 search results - page 38 / 981
» The Set Covering Machine
Sort
View
JMLR
2007
104views more  JMLR 2007»
13 years 8 months ago
Comments on the "Core Vector Machines: Fast SVM Training on Very Large Data Sets"
In a recently published paper in JMLR, Tsang et al. (2005) present an algorithm for SVM called Core Vector Machines (CVM) and illustrate its performances through comparisons with ...
Gaëlle Loosli, Stéphane Canu
KAIS
2010
144views more  KAIS 2010»
13 years 7 months ago
Boosting support vector machines for imbalanced data sets
Real world data mining applications must address the issue of learning from imbalanced data sets. The problem occurs when the number of instances in one class greatly outnumbers t...
Benjamin X. Wang, Nathalie Japkowicz
ISAAC
2009
Springer
116views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...
ISM
2008
IEEE
119views Multimedia» more  ISM 2008»
14 years 3 months ago
Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs
Cover song detection is becoming a very hot research topic when plentiful personal music recordings or performance are released on the Internet. A nice cover song recognizer helps...
Yi Yu, J. Stephen Downie, Fabian Mörchen, Lei...
MICS
2010
102views more  MICS 2010»
13 years 7 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan