5046 search results - page 343 / 1010 » Non-redundant data clustering |
198
click to vote
NIPS
2004
15 years 8 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
221
click to vote
IDEAL
2010
Springer
15 years 4 months ago
2010
Springer
World Wide Web (WWW) is a vast source of information, the problem of information overload is more acute than ever. Due to noise in WWW, it is becoming hard to find usable informati...
141
click to vote
VIS
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate...
179
click to vote
EUROSYS
2010
ACM
16 years 3 months ago
2010
ACM
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
176
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...