Sciweavers

1403 search results - page 218 / 281
» Set cover algorithms for very large datasets
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
MLDM
2007
Springer
15 years 3 months ago
Nonlinear Feature Selection by Relevance Feature Vector Machine
Support vector machine (SVM) has received much attention in feature selection recently because of its ability to incorporate kernels to discover nonlinear dependencies between feat...
Haibin Cheng, Haifeng Chen, Guofei Jiang, Kenji Yo...
AI
1998
Springer
15 years 2 months ago
A Hybrid Convergent Method for Learning Probabilistic Networks
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Jun Liu, Kuo-Chu Chang, Jing Zhou
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 1 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
14 years 11 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards