538 search results - page 60 / 108 » Dimension induced clustering |
115
click to vote
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
139
click to vote
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ICDE
2007
IEEE
15 years 4 months ago
2007
IEEE
The wide availability of large scale databases requires more efficient and scalable tools for data understanding and knowledge discovery. In this paper, we present a method to ...
CICLING
2005
Springer
15 years 3 months ago
2005
Springer
It is relatively common for different people or organizations to share the same name. Given the increasing amount of information available online, this results in the ever growing...
BIOINFORMATICS
2007
14 years 10 months ago
2007
Motivation: High-throughput expression profiling allows researchers to study gene activities globally. Genes with similar expression profiles are likely to encode proteins that ma...