Author:
Yang Yang,Zhan De-Chuan,Wu Yi-Feng,Jiang Yuan
Publisher
Springer International Publishing
Reference33 articles.
1. Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: WSDM, pp. 635–644 (2011)
2. Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIIMS 2(1), 183–202 (2009)
3. Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: NIPS, pp. 585–591 (2001)
4. Berkhin, P.: A survey on pagerank computing. Internet Math. 2(1), 73–120 (2005)
5. Blum, A., Mitchell, T.: Combining labeled and unlabeled data with co-training. In: COLT, pp. 92–100 (1999)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Towards Efficient Shortest Path Counting on Billion-Scale Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
2. Effective Community Search on Large Attributed Bipartite Graphs;International Journal of Pattern Recognition and Artificial Intelligence;2023-01-28
3. SOIDP: Predicting Interlayer Links in Multiplex Networks;IEEE Transactions on Computational Social Systems;2021
4. Partially Shared Adversarial Learning For Semi-supervised Multi-platform User Identity Linkage;Proceedings of the 28th ACM International Conference on Information and Knowledge Management;2019-11-03