466 search results - page 30 / 94 » RAIN: data clustering using randomized interactions between ... |
148
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
115
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
KDD
2006
ACM
16 years 2 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
101
click to vote
SOCIALCOM
2010
14 years 11 months ago
2010
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
139
click to vote
RSS
2007
15 years 3 months ago
2007
— Matching laser range scans observed at different points in time is a crucial component of many robotics tasks, including mobile robot localization and mapping. While existing t...