Sciweavers

2190 search results - page 3 / 438
» Learning with the Set Covering Machine
Sort
View
ICML
2006
IEEE
15 years 7 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
63
Voted
DAM
2006
63views more  DAM 2006»
14 years 10 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
78
Voted
FCCM
2002
IEEE
131views VLSI» more  FCCM 2002»
15 years 3 months ago
Custom Computing Machines for the Set Covering Problem
Christian Plessl, Marco Platzner
80
Voted
COMBINATORICA
2010
14 years 7 months ago
Set systems without a simplex or a cluster
Peter Keevash, Dhruv Mubayi
87
Voted
EWCBR
2004
Springer
15 years 3 months ago
Maintaining Case-Based Reasoning Systems: A Machine Learning Approach
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...
Niloofar Arshadi, Igor Jurisica