Stochastic Local Clustering for Massive Graphs-Reference-Cited by-同舟云学术

Stochastic Local Clustering for Massive Graphs

Published:2005 Issue: Volume: Page:354-360
ISSN:0302-9743
Container-title:Advances in Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Schaeffer Satu Elisa

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11430919_42.pdf

Reference14 articles.

1. Lecture Notes in Computer Science;U. Brandes,2003

2. Guha, S., et al.: Clustering data streams. In: Proc. of FOCS, pp. 359–366. IEEE Comp. Soc. Press, Los Alamitos (2000)

3. Kannan, R., Vempala, S., Vetta, A.: On clusterings — good, bad and spectral. In: Proc. of FOCS, pp. 367–377. IEEE Comp. Soc. Press, Los Alamitos (2000)

4. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

5. Kleinberg, J., Lawrence, S.: The structure of the web. Science 294(5548), 1849–1850 (2001)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decoy Processes With Optimal Performance Fingerprints;IEEE Access;2023

2. Detecting Data Exfiltration Using Seeds Based Graph Clustering;2022 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE);2022-12-18

3. Local Community Detection in Multiple Networks;Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining;2020-07-06

4. Off-Policy Evaluation of Probabilistic Identity Data in Lookalike Modeling;Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining;2019-01-30

5. Local Graph Clustering by Multi-network Random Walk with Restart;Advances in Knowledge Discovery and Data Mining;2018