5 search results - page 1 / 1 » Unifying Unknown Nodes in the Internet Graph Using Semisuper... |
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
KAIS
2011
13 years 6 days ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...