4560 search results - page 360 / 912 » Finding Data in the Neighborhood |
165
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
In the paper we show that diagnostic classes in cancer gene expression data sets, which most often include thousands of features (genes), may be effectively separated with simple ...
178
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
192
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The geometric median is a classic robust estimator of centrality for data in Euclidean spaces. In this paper we formulate the geometric median of data on a Riemannian manifold as ...
389
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
157
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...