Computer Science ›› 2023, Vol. 50 ›› Issue (1): 69-75.doi: 10.11896/jsjkx.211100067
• Database & Big Data & Data Science • Previous Articles Next Articles
LIU Kaiwen1, HUANG Zengfeng2
CLC Number:
[1]CHUNG F R,GRAHAM F C.Spectral graph theory[M].American Mathematical Soc.,1997. [2]HOORY S,LINIAL N,WIGDERSON A.Expander graphs and their applications[J].Bulletin of the American Mathematical Society,2006,43(4):439-561. [3]LOVÁSZ L,KANNAN R.Faster mixing via average conductance[C]//Proceedings of the Thirty-first annual ACM Symposium on Theory of Computing.1999:282-287. [4]SPIELMAN D A,TENG S H.Nearly-linear time algorithms for graph partitioning,graph sparsification,and solving linear systems[C]//Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing.2004:81-90. [5]KWOK T C,LAU L C,LEE Y T,et al.Improved Cheeger's inequality:Analysis of spectral partitioning algorithms through higher order spectral gap[C]//Proceedings of the forty-fifth Annual ACM Symposium on Theory of Computing.2013:11-20. [6]MIZUTANI T.Convex programming based spectral clustering[J].Machine Learning,2021,110(5):933-964. [7]SHI J,MALIK J.Normalized cuts and image segmentation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2000,22(8):888-905. [8]HAOCHEN J Z,WEI C,GAIDON A,et al.Provable guarantees for self-supervised deep learning with spectral contrastive loss[C]//Advances in Neural Information Processing Systems.2021. [9]CHUNG F.Laplacians and the Cheeger inequality for directed graphs[J].Annals of Combinatorics,2005,9(1):1-19. [10]LI Y,ZHANG Z L.Digraph laplacian and the degree of asymmetry[J].Internet Mathematics,2012,8(4):381-401. [11]SINGH R,CHAKRABORTY A,MANOJ B.Graph Fouriertrans-form based on directed Laplacian[C]//International Conference on Signal Processing and Communications(SPCOM).2016:1-5. [12]SEIFERT B,PÜSCHEL M.Digraph signal processing with generalized boundary conditions[J].IEEE Transactions on Signal Processing,2021,69:1422-1437. [13]LI H,SUN H,ZANETTI L.Hermitian Laplaciansand a Cheeger inequality for the Max-2-Lin problem[C]//Proceedings of the Twenty-seventh Annual European Symposium on Algorithms.2019:1-14. [14]CUCURINGU M,LI H,SUN H,et al.Hermitian matrices for clustering directed graphs:insights and applications[C]//International Conference on Artificial Intelligence and Statistics.2020:983-992. [15]LAENEN S,SUN H.Higher-Order Spectral Clustering of Directed Graphs[C]//Advances in Neural Information Processing Systems.2020:941-951. [16]TONG Z,LIANG Y,DING H,et al.Directed Graph Contrastive Learning[C]//Advances in Neural Information Processing Systems.2021. [17]BOLLOBÁS B.Modern graph theory[M].Springer Science & Business Media,2013. [18]JI S,PAN S,CAMBRIA E,et al.A survey on knowledgegraphs:Representation,acquisition,and applications[J].IEEE Transactions on Neural Networks and Learning Systems,2021,33(2):494-514. [19]SUN Z,DENG Z H,NIE J Y,et al.Rotate:Knowledge graph embedding by relational rotation in complex space[C]//International Conference on Learning Representations.2019. [20]LI Z,LIU H,ZHANG Z,et al.Learning knowledge graph embedding with heterogeneous relation attention networks[J].IEEE Transactions on Neural Networks and Learning Systems,2022,33(8):3961-3973. [21]VISHNOI N K.Laplacian solvers and their algorithmic applications[J].Theoretical Computer Science,2012,8(1/2):1-141. [22]KYNG R,LEE Y T,PENG R,et al.Sparsified cholesky andmultigrid solvers for connection laplacians[C]//Proceedings of the forty-eighth Annual ACM Symposium on Theory of Computing.2016:842-850. [23]KYNG R,SACHDEVA S.Approximate gaussian elimination for laplacians-fast,sparse,and simple[C]//IEEE fifty-seventh Annual Symposium on Foundations of Computer Science.2016:573-582. |
[1] | QIAO Jing-jing, WANG Li. Modeling User Micro-Behavior via Adaptive Multi-Attention Network for Session-based Recommendation [J]. Computer Science, 2022, 49(11): 117-125. |
[2] | HUANG Xin-quan, LIU Ai-jun, LIANG Xiao-hu, WANG Heng. Matrix Theory Aided Convergence Analysis of Consensus Behavior in FANET with Beacon Loss [J]. Computer Science, 2021, 48(6): 288-295. |
[3] | ZHU Wei-jun, ZHANG Chun-yan, ZHOU Qing-lei, CHEN Yong-hua. DNA Sticker Algorithm for k-vertex Induced Sub-graphs of Directed Graphs [J]. Computer Science, 2019, 46(1): 309-313. |
[4] | CHEN Bing-chuan, CHEN Ai-xiang, WU Xiang-jun and LI Lei. Representation Tool of Data Relations in Database Design Based on Data Source-target Digraph [J]. Computer Science, 2017, 44(Z6): 470-474. |
[5] | ZUO Xiu-feng and SHEN Wan-jie. Improved Algorithm about Muti-shortest Path Problem Based on Floyd Algorithm [J]. Computer Science, 2017, 44(5): 232-234. |
[6] | CHEN Qiu-ru, WEN Zhong-hua, YUAN Run and DAI Liang-wei. Solving Reachability Relationship by Property of Directed Cycle [J]. Computer Science, 2016, 43(4): 202-205. |
[7] | LI Jian-li, WANG Yi-mou, XIE Yue and DING Hong-qian. Automated Trust Negotiation Based on Diverse History Information [J]. Computer Science, 2016, 43(3): 122-126. |
[8] | SHI Hai-zhong and SHI Yue. (V,R)-Languages [J]. Computer Science, 2014, 41(Z6): 33-36. |
[9] | CUI Bin-ge and MENG Ao-xiang. Fast Remote Sensing Image Segmentation Algorithm Based on Nearest Neighbor Direct Graph [J]. Computer Science, 2013, 40(10): 274-278. |
[10] | . Geo-serviceChain Model Expression by Directed Graph and Verification [J]. Computer Science, 2012, 39(10): 240-244. |
[11] | SHI Hai-zhong. Undirected Graph Languages [J]. Computer Science, 2011, 38(6): 259-261. |
[12] | GE Bin,LI Fang-fang,LI Fu,XIAO Wei-dong. Subject Sentence Extraction Based on Undirected Graph Construction [J]. Computer Science, 2011, 38(5): 181-185. |
[13] | XIA Yang LU ,Yu-Liang (Teaching and Research Office of Network Engineering of Electronic Engineering Institute, Hefei 230037). [J]. Computer Science, 2007, 34(10): 74-79. |
|