We consider a new problem of detecting members of a rare class of data, the needles, which have been hidden in a set of records, the haystack. The only information regarding the characterization of the rare class is a single instance of a needle. It is assumed that members of the needle class are similar to each other according to an unknown needle characterization. The goal is to find the needle records hidden in the haystack. This paper describes an algorithm for that task and applies it to several example cases. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Moreland, K., & Truemper, K. (2009). The needles-in-haystack problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5632 LNAI, pp. 516–524). https://doi.org/10.1007/978-3-642-03070-3_39
Mendeley helps you to discover research relevant for your work.