[3] Amir Beck and Marc Teboulle. A fast dual proximal gradient algorithm for convex minimization and applications. Operations Research Letters, 42(1):1-6, 2014.
[4] Mikhail Belkin, Irina Matveeva, and Partha Niyogi. Tikhonov regularization and semi-supervised learning on large graphs. In ICASSP (3), pages 1000-1003. IEEE, 2004.
[5] Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res., 7:2399-2434, 2006.
[6] Lilian Berton and Alneu de Andrade Lopes. Graph construction based on labeled instances for semi-supervised learning. In ICPR, pages 2477-2482. IEEE Computer Society, 2014.
[7] Lilian Berton, Thiago de Paulo Faleiros, Alan Valejo, Jorge Carlos Valverde-Rebaza, and Alneu de Andrade Lopes. RGCLI: robust graph that considers labeled instances for semi-supervised learning. Neurocomputing, 226:238-248, 2017.
[8] Stephen P. Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn., 3(1):1-122, 2011.
[9] Jeff Calder, Brendan Cook, Matthew Thorpe, and Dejan Slepcev. Poisson learning: Graph based semi-supervised learning at very low label rates. In ICML, volume 119 of Proceedings of Machine Learning Research, pages 1306-1316. PMLR, 2020.
[10] Hongxu Chen, Hongzhi Yin, Tong Chen, Quoc Viet Hung Nguyen, Wen-Chih Peng, and Xue Li. Exploiting centrality information with graph convolutions for network representation learning. In ICDE, pages 590-601. IEEE, 2019.
[11] Yankai Chen, Yixiang Fang, Yifei Zhang, and Irwin King. Bipartite graph convolutional hashing for effective and efficient top-n search in hamming space. arXiv preprint arXiv:2304.00241, 2023.
[12] Yankai Chen, Yifei Zhang, Menglin Yang, Zixing Song, Chen Ma, and Irwin King. WSFE: Wasserstein sub-graph feature encoder for effective user segmentation in collaborative filtering. CoRR, abs/2305.04410, 2023.
[13] Yankai Chen, Yifei Zhang, Menglin Yang, Zixing Song, Chen Ma, and Irwin King. WSFE: Wasserstein sub-graph feature encoder for effective user segmentation in collaborative filtering. In SIGIR, pages 2521-2525. ACM, 2023.
[14] Zhijie Chen, Hongtai Cao, and Kevin Chen-Chuan Chang. Graphebm: Energy-based graph construction for semi-supervised learning. In ICDM, pages 62-71. IEEE, 2020.
[15] Inae Choi and Hyunjung Shin. Semi-supervised learning with ensemble learning and graph sharpening. In IDEAL, volume 5326 of Lecture Notes in Computer Science, pages 172-179. Springer, 2008.
[16] Celso André R. de Sousa, Solange O. Rezende, and Gustavo E. A. P. A. Batista. Influence of graph construction on semi-supervised learning. In ECML/PKDD (3), volume 8190 of Lecture Notes in Computer Science, pages 160-175. Springer, 2013.
[17] Cheng-Hao Deng and Wan-Lei Zhao. Fast k-means based on k-nn graph. In ICDE, pages 1220–1223. IEEE Computer Society, 2018.
[18] Xiaowen Dong, Dorina Thanou, Pascal Frossard, and Pierre Vandergheynst. Laplacian matrix learning for smooth graph signal representation. In ICASSP, pages 3736-3740. IEEE, 2015.
[19] Xiaowen Dong, Dorina Thanou, Michael G. Rabbat, and Pascal Frossard. Learning graphs from data: A signal representation perspective. IEEE Signal Process. Mag., 36(3):44-63, 2019.
[20] Yifan Gao, Jingjing Li, Michael R Lyu, and Irwin King. Open-retrieval conversational machine reading. arXiv preprint arXiv:2102.08633, 2021.