1046 search results - page 134 / 210 » Approximation Algorithms for Domination Search |
108
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
223
click to vote
ICDE
1999
IEEE
16 years 4 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
275
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
210
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
134
click to vote
JMLR
2006
15 years 3 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...