80 search results - page 7 / 16 » O-Cluster: Scalable Clustering of Large High Dimensional Dat... |
SDM
2003
SIAM
13 years 10 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
CORR
1999
Springer
13 years 8 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...
INFOVIS
2003
IEEE
14 years 1 months ago
2003
IEEE
Large numbers of dimensions not only cause clutter in multidimensional visualizations, but also make it difficult for users to navigate the data space. Effective dimension manage...
OSDI
2004
ACM
14 years 8 months ago
2004
ACM
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...