11211 search results - page 320 / 2243 » Rank-Sensitive Data Structures |
184
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: With the current technological advances in high-throughput biology, the necessity to develop tools that help to analyse the massive amount of data being generated is e...
204
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Traditionally, research in identifying structured entities in documents has proceeded independently of document categorization research. In this paper, we observe that these two t...
232
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
182
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: When conducting multiple hypothesis tests, it is important to control the number of false positives, or the False Discovery Rate (FDR). However, there is a tradeoff be...
160
click to vote
DATAMINE
1999
15 years 6 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...