Efficient structural node similarity computation on billion-scale graphs

[1]  Lu Qin,et al.  StructSim: Querying Structural Node Similarity at Billion Scale , 2020, 2020 IEEE 36th International Conference on Data Engineering (ICDE).

[2]  Jian Pei,et al.  SimRank*: effective and scalable pairwise similarity search based on graph topology , 2019, The VLDB Journal.

[3]  Roberto Grossi,et al.  Node Similarity with q -Grams for Real-World Labeled Networks , 2018, KDD.

[4]  Yue Wang,et al.  Efficient SimRank Tracking in Dynamic Graphs , 2018, 2018 IEEE 34th International Conference on Data Engineering (ICDE).

[5]  Yuan Zhang,et al.  Enhancing the Network Embedding Quality with Structural Similarity , 2017, CIKM.

[6]  Jure Leskovec,et al.  Learning Structural Node Embeddings via Diffusion Wavelets , 2017, KDD.

[7]  Jure Leskovec,et al.  Representation Learning on Graphs: Methods and Applications , 2017, IEEE Data Eng. Bull..

[8]  Yu Liu,et al.  ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs , 2017, Proc. VLDB Endow..

[9]  Marc Peter Deisenroth,et al.  Neural Embeddings of Graphs in Hyperbolic Space , 2017, ArXiv.

[10]  Daniel R. Figueiredo,et al.  struc2vec: Learning Node Representations from Structural Identity , 2017, KDD.

[11]  Jian Pei,et al.  Asymmetric Transitivity Preserving Graph Embedding , 2016, KDD.

[12]  Wenwu Zhu,et al.  Structural Deep Network Embedding , 2016, KDD.

[13]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[14]  Steven Skiena,et al.  Walklets: Multiscale Graph Embeddings for Interpretable Network Classification , 2016, ArXiv.

[15]  Xiaokui Xiao,et al.  SLING: A Near-Optimal Index Structure for SimRank , 2016, SIGMOD Conference.

[16]  Wei Lu,et al.  Deep Neural Networks for Learning Graph Representations , 2016, AAAI.

[17]  George Kollios,et al.  NED: An Inter-Graph Node Metric Based On Edit Distance , 2016, Proc. VLDB Endow..

[18]  Qiongkai Xu,et al.  GraRep: Learning Graph Representations with Global Structural Information , 2015, CIKM.

[19]  Julie A. McCann,et al.  High Quality Graph-Based Similarity Search , 2015, SIGIR.

[20]  Mingzhe Wang,et al.  LINE: Large-scale Information Network Embedding , 2015, WWW.

[21]  Natasa Przulj,et al.  Topology-function conservation in protein–protein interaction networks , 2015, Bioinform..

[22]  Ken-ichi Kawarabayashi,et al.  Scalable similarity search for SimRank , 2014, SIGMOD Conference.

[23]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[24]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[25]  Ruoming Jin,et al.  Scalable and axiomatic ranking of network role similarity , 2014, ACM Trans. Knowl. Discov. Data.

[26]  Jian Pei,et al.  More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks , 2013, Proc. VLDB Endow..

[27]  Alexander J. Smola,et al.  Distributed large-scale natural graph factorization , 2013, WWW.

[28]  Lei Zou,et al.  Efficient SimRank-based Similarity Join Over Large Graphs , 2013, Proc. VLDB Endow..

[29]  Xuemin Lin,et al.  Towards efficient SimRank computation on large networks , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[30]  Yasuhiro Fujiwara,et al.  Efficient search algorithm for SimRank , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[31]  Ryan A. Rossi,et al.  Modeling dynamic behavior in large evolving graphs , 2013, WSDM.

[32]  Danai Koutra,et al.  RolX: structural role extraction & mining in large graphs , 2012, KDD.

[33]  Christos Faloutsos,et al.  It's who you know: graph mining using recursive structural features , 2011, KDD.

[34]  Ruoming Jin,et al.  Axiomatic ranking of network role similarity , 2011, KDD.

[35]  Huan Liu,et al.  Discovering Overlapping Groups in Social Media , 2010, 2010 IEEE International Conference on Data Mining.

[36]  Yizhou Sun,et al.  Fast computation of SimRank for static and dynamic information networks , 2010, EDBT '10.

[37]  Yizhou Sun,et al.  P-Rank: a comprehensive structural similarity measure over information networks , 2009, CIKM.

[38]  Michael R. Lyu,et al.  MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching , 2009, CIKM.

[39]  Ioannis Antonellis,et al.  Simrank++: query rewriting through link analysis of the clickgraph (poster) , 2007, Proc. VLDB Endow..

[40]  Julia Hirschberg,et al.  V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure , 2007, EMNLP.

[41]  Xuemin Lin,et al.  Selecting Stars: The k Most Representative Skyline Operator , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[42]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  Dániel Fogaras,et al.  Scaling link-based similarity search , 2005, WWW '05.

[44]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[45]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[46]  Jennifer Widom,et al.  SimRank: a measure of structural-context similarity , 2002, KDD.

[47]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[48]  M. KleinbergJon.  Authoritative sources in a hyperlinked environment , 1999 .

[49]  H. Baxter Williams,et al.  A Survey , 1992 .

[50]  Kaizhong Zhang,et al.  On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[51]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[52]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[53]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.

[54]  Jie Huang,et al.  Recommendation With Social Roles , 2018, IEEE Access.

[55]  Julie A. McCann,et al.  Efficient Partial-Pairs SimRank Search for Large Networks , 2015, Proc. VLDB Endow..

[56]  Tie-Yan Liu,et al.  A Theoretical Analysis of Normalized Discounted Cumulative Gain (NDCG) Ranking Measures , 2013 .

[57]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .