17 search results - page 4 / 4 » Locally computable approximations for spectral clustering an... |
SDM
2009
SIAM
14 years 1 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
KAIS
2011
12 years 11 months 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...