Sciweavers

2190 search results - page 3 / 438
» Learning with the Set Covering Machine
Sort
View
ICML
2006
IEEE
14 years 1 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
DAM
2006
63views more  DAM 2006»
13 years 5 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
FCCM
2002
IEEE
131views VLSI» more  FCCM 2002»
13 years 10 months ago
Custom Computing Machines for the Set Covering Problem
Christian Plessl, Marco Platzner
COMBINATORICA
2010
13 years 2 months ago
Set systems without a simplex or a cluster
Peter Keevash, Dhruv Mubayi
EWCBR
2004
Springer
13 years 10 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