396 search results - page 22 / 80 » Lossy Reduction for Very High Dimensional Data |
106
click to vote
SIGMOD
2000
ACM
15 years 1 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
ICDM
2003
IEEE
15 years 2 months ago
2003
IEEE
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
92
Voted
CIMAGING
2009
14 years 10 months ago
2009
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
170
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
78
Voted
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...