Incremental eigenpair computation for graph Laplacian matrices: theory and applications-Reference-Cited by-同舟云学术

Incremental eigenpair computation for graph Laplacian matrices: theory and applications

Published:2017-12-21 Issue:1 Volume:8 Page:
ISSN:1869-5450
Container-title:Social Network Analysis and Mining
language:en
Short-container-title:Soc. Netw. Anal. Min.

Author:

Chen Pin-Yu,Zhang Baichuan^ORCID,Hasan Mohammad Al

Funder

NSF

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications,Human-Computer Interaction,Media Technology,Communication,Information Systems

Link

http://link.springer.com/article/10.1007/s13278-017-0481-y/fulltext.html

Reference40 articles.

1. Basu S, Banerjee A, Mooney RJ (2004) Active semi-supervision for pairwise constrained clustering. SDM 4:333–344

2. Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373–1396

3. Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 10:P10008

4. Calvetti D, Reichel L, Sorensen DC (1994) An implicitly restarted lanczos method for large symmetric eigenvalue problems. Electr Trans Numer Anal 2(1):21

5. Chen P-Y, Hero A (2015) Deep community detection. IEEE Trans Signal Process 63(21):5706–5719

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

1. Graph Laplacian-based spectral multi-fidelity modeling;Scientific Reports;2023-10-03

2. Network community partition based on intelligent clustering algorithm;Computer Optics;2020-12

3. Directed random geometric graphs;Journal of Complex Networks;2019-04-08

4. hpGAT: High-Order Proximity Informed Graph Attention Network;IEEE Access;2019

5. Optimizing Generalized Linear Models with Billions of Variables;Proceedings of the 27th ACM International Conference on Information and Knowledge Management;2018-10-17