2434 search results - page 323 / 487 » Algorithmic Randomness of Closed Sets |
125
Voted
VDA
2010
15 years 6 months ago
2010
The analysis of high-dimensional data is an important, yet inherently difficult problem. Projection techniques such as PCA, MDS, and SOM can be used to map high-dimensional data t...
144
Voted
NIPS
2008
15 years 5 months ago
2008
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
137
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
136
Voted
ISM
2006
IEEE
15 years 3 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
128
click to vote
JMLR
2006
15 years 3 months ago
2006
We study some stability properties of algorithms which minimize (or almost-minimize) empirical error over Donsker classes of functions. We show that, as the number n of samples gr...