538 search results - page 42 / 108 » Efficient and Effective Clustering Methods for Spatial Data ... |
KDD
2008
ACM
16 years 29 days ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
105
click to vote
BMCBI
2004
15 years 12 days ago
2004
Background: Microarray data must be normalized because they suffer from multiple biases. We have identified a source of spatial experimental variability that significantly affects...
124
click to vote
PAISI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
125
Voted
SIGMOD
2001
ACM
16 years 21 days ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
97
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
Word meaning ambiguity has always been an important problem in information retrieval and extraction, as well as, text mining (documents clustering and classification). Knowledge di...