Sciweavers

3422 search results - page 487 / 685
» Random Subset Optimization
Sort
View
118
Voted
NIPS
2007
15 years 4 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
104
Voted
AAAI
2006
15 years 4 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
AAAI
2006
15 years 4 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...
101
Voted
FLAIRS
2003
15 years 4 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
NIPS
2004
15 years 4 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...