Fetching the paper…
Reading the bibliography…
Heterogeneous graphs, which contain nodes and edges of multiple types, are prevalent in various domains, including bibliographic networks, social media, and knowledge graphs.
P. L. Duren, Theory of H p Spaces . Academic press, 1970
1970
Earlier work this paper cites.
M. Levandowsky and D. Winter, “Distance between sets,” Nature , vol. 234, no. 5323, pp. 34–35, 1971
1971
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural networks , vol. 2, no. 5, pp. 359–366, 1989
1989
Earlier work this paper cites.
A. Singhal et al. , “Modern information retrieval: A brief overview,” IEEE Data Eng. Bull. , vol. 24, no. 4, pp. 35–43, 2001
2001
Earlier work this paper cites.
G. Jeh and J. Widom, “Simrank: a measure of structural-context similarity,” in KDD , 2002, pp. 538–543
2002
Earlier work this paper cites.
G. Jeh and J. Widom, “Scaling personalized web search,” in WWW , 2003, pp. 271–279
2003
Earlier work this paper cites.
P. Zhao, J. Han, and Y. Sun, “P-rank: a comprehensive structural similarity measure over information networks,” in CIKM , 2009, pp. 553–562
2009
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” Trans. Neur. Netw. , vol. 20, no. 1, pp. 61–80, 2009
2009
Earlier work this paper cites.
J. Gao, F. Liang, W. Fan, Y. Sun, and J. Han, “Graph-based consensus maximization among multiple supervised and unsupervised models,” in NIPS , 2009, pp. 585–593
2009
Earlier work this paper cites.
Q. Ye et al. , “Distance distribution and average shortest path length estimation in real-world networks,” in ADMA , 2010, pp. 322–333
2010
Earlier work this paper cites.
Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu, “Pathsim: Meta path-based top-k similarity search in heterogeneous information networks,” PVLDP , vol. 4, no. 11, pp. 992–1003, 2011
2011
Earlier work this paper cites.
M. S. Pera and Y.-K. Ng, “A group recommender for movies based on content similarity and popularity,” Information Processing & Management , vol. 49, no. 3, pp. 673–687, 2013
2013
Earlier work this paper cites.
C. Shi, X. Kong, Y. Huang, S. Y. Philip, and B. Wu, “Hetesim: A general framework for relevance measure in heterogeneous networks,” TKDE , vol. 26, no. 10, pp. 2479–2492, 2014
2014
Earlier work this paper cites.
S. Rothe and H. Schütze, “Cosimrank: A flexible & efficient graph-theoretic similarity measure,” in Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , 2014, pp. 1392–1402
2014
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in KDD , 2014, pp. 701–710
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in WWW , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
C. Wang, Y. Sun, Y. Song, J. Han, Y. Song, L. Wang, and M. Zhang, “Relsim: relation similarity search in schema-rich heterogeneous information networks,” in Proceedings of the 2016 SIAM International Conference on Data Mining . SIAM, 2016, pp. 621–629
2016
Earlier work this paper cites.
D. Xiao, X. Meng, Y. Li, C. Shi, and B. Wu, “Avgsim: Relevance measurement on massive data in heterogeneous networks.” Journal of Theoretical & Applied Information Technology , vol. 84, no. 1, 2016
2016
Cited alongside, same era.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in SIGKDD , 2016, pp. 855–864
2016
Cited alongside, same era.
2016
Cited alongside, same era.
C.-Y. Wu, A. Beutel, A. Ahmed, and A. J. Smola, “Explaining reviews and ratings with paco: Poisson additive co-clustering,” in WWW , 2016, pp. 127–128
2016
Cited alongside, same era.
Z. Chen, L. Li, and J. Bruna, “Supervised community detection with line graph neural networks,” in ICLR , 2019
2019
Later among the works it cites.
Z. Hu, Y. Dong, K. Wang, and Y. Sun, “Heterogeneous graph transformer,” in WWW , 2020, pp. 2704–2710
2020
Later among the works it cites.
L. Luo, K. Liu, D. Peng, Y. Ying, and X. Zhang, “A motif-based graph neural network to reciprocal recommendation for online dating,” in ICONIP . Springer, 2020, pp. 102–114
2020
Later among the works it cites.
S. Zhou, J. Bu, Z. Zhang, C. Wang, L. Ma, and J. Zhang, “Cross multi-type objects clustering in attributed heterogeneous information network,” Knowledge-Based Systems , vol. 194, p. 105458, 2020
2020
Later among the works it cites.
Y. Wang, Z. Wang, Z. Zhao, Z. Li, X. Jian, H. Xin, L. Chen, J. Song, Z. Chen, and M. Zhao, “Effective similarity search on heterogeneous networks: A meta-path free approach,” TKDE , 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NIPS , 2017, pp. 1024–1034
2017
Cited alongside, same era.
X. Li, Y. Wu, M. Ester, B. Kao, X. Wang, and Y. Zheng, “Semi-supervised clustering in attributed heterogeneous information networks,” in WWW , 2017, pp. 1621–1629
2017
Cited alongside, same era.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in KDD , 2017, pp. 135–144
2017
Cited alongside, same era.
2017
Cited alongside, same era.
T.-y. Fu, W.-C. Lee, and Z. Lei, “Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning,” in CIKM , 2017, pp. 1797–1806
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2020
Later among the works it cites.
X. Fu, J. Zhang, Z. Meng, and I. King, “Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,” in WWW , 2020, pp. 2331–2341
2020
Later among the works it cites.
D. Chen, Y. Lin, W. Li, P. Li, J. Zhou, and X. Sun, “Measuring and relieving the over-smoothing problem for graph neural networks from the topological view,” in AAAI , vol. 34, no. 04, 2020, pp. 3438–3445
2020
Later among the works it cites.
P. Khosla, P. Teterwak, C. Wang, A. Sarna, Y. Tian, P. Isola, A. Maschinot, C. Liu, and D. Krishnan, “Supervised contrastive learning,” NIPS , vol. 33, pp. 18 661–18 673, 2020
2020
Later among the works it cites.
Y. Yang, Z. Guan, J. Li, W. Zhao, J. Cui, and Q. Wang, “Interpretable and efficient heterogeneous graph convolutional network,” TKDE , 2021
2021
Later among the works it cites.
J. You et al. , “Identity-aware graph neural networks,” in AAAI , 2021
2021
Later among the works it cites.
Y. Liu, Z. Li, S. Pan, C. Gong, C. Zhou, and G. Karypis, “Anomaly detection on attributed networks via contrastive self-supervised learning,” TNNLS , vol. 33, no. 6, pp. 2378–2392, 2021
2021
Later among the works it cites.
D. Jiang, Z. Wu, C.-Y. Hsieh, G. Chen, B. Liao, Z. Wang, C. Shen, D. Cao, J. Wu, and T. Hou, “Could graph neural networks learn better molecular representation for drug discovery? a comparison study of descriptor-based and graph-based models,” Journal of cheminformatics , vol. 13, no. 1, pp. 1–23, 2021
2021
Later among the works it cites.
L. Luo, Y. Fang, X. Cao, X. Zhang, and W. Zhang, “Detecting communities from heterogeneous graphs: A context path-based graph neural network model,” in CIKM , 2021, pp. 1170–1180
2021
Later among the works it cites.
X. Song, J. Li, Q. Lei, W. Zhao, Y. Chen, and A. Mian, “Bi-clkt: Bi-graph contrastive learning based knowledge tracing,” Knowledge-Based Systems , vol. 241, p. 108274, 2022
2022
Closest in time.
D. Li, Z. Gu, Y. Wang, C. Ren, and F. C. Lau, “One model packs thousands of items with recurrent conditional query learning,” Knowledge-Based Systems , vol. 235, p. 107683, 2022
2022
Closest in time.
C. Xu, W. Zhao, J. Zhao, Z. Guan, X. Song, and J. Li, “Uncertainty-aware multi-view deep learning for internet of things applications,” IEEE Transactions on Industrial Informatics , 2022
2022
Closest in time.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in WWW , 2019, pp. 2022–2032
2032
Closest in time.
L. Yang, L. Luo, X. Zhang, F. Li, X. Zhang, Z. Jiang, and S. Tang, “Why do semantically unrelated categories appear in the same session? a demand-aware method,” in SIGIR , 2022, pp. 2065–2069
2069
Closest in time.