172 search results - page 4 / 35 » Graph-Based Data Clustering with Overlaps |
ICDM
2009
IEEE
14 years 5 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...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
The field of pairwise clustering is currently dominated by the idea of dividing a set of objects into disjoints classes, thereby giving rise to (hard) partitions of the input dat...
PKDD
2007
Springer
14 years 5 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
CVPR
2007
IEEE
14 years 5 months ago
2007
IEEE
Although it is usually assumed in many pattern recognition problems that different patterns are distinguishable, some patterns may have inseparable overlap. For example, some faci...
TC
2010
13 years 9 months ago
2010
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...