33 search results - page 3 / 7 » Bayesian instance selection for the nearest neighbor rule |
FLAIRS
2001
14 years 11 months ago
2001
Theoretically well-founded, Support Vector Machines (SVM)are well-knownto be suited for efficiently solving classification problems. Althoughimprovedgeneralization is the maingoal...
PR
2006
14 years 9 months ago
2006
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
ICML
1994
IEEE
15 years 1 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
BMCBI
2010
14 years 10 months ago
2010
Background: In many protein-protein interaction (PPI) networks, densely connected hub proteins are more likely to be essential proteins. This is referred to as the "centralit...
AUSDM
2008
Springer
14 years 12 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...