Fetching the paper…
Reading the bibliography…
Graph is an important data representation which appears in a wide diversity of real-world scenarios.
S. Pan, J. Wu, X. Zhu, C. Zhang, and Y. Wang, “Tri-party deep network representation,” in
1901
Earlier work this paper cites.
M. Nickel, L. Rosasco, and T. Poggio, “Holographic embeddings of knowledge graphs,” in
1961
Earlier work this paper cites.
G. H. Golub and C. Reinsch, “Singular value decomposition and least squares solutions,”
1970
Earlier work this paper cites.
W. N. A. Jr. and T. D. Morley, “Eigenvalues of the laplacian of a graph,”
1985
Earlier work this paper cites.
T. Hofmann and J. M. Buhmann, “Multidimensional scaling and data clustering,” in
1994
Earlier work this paper cites.
L. Vandenberghe and S. Boyd, “Semidefinite programming,”
1996
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,”
1997
Earlier work this paper cites.
D. Haussler, “Convolution kernels on discrete structures,” Technical Report UCS-CRL-99-10, 1999
1999
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear Dimensionality Reduction by Locally Linear Embedding,”
2000
Earlier work this paper cites.
D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent dirichlet allocation,” in
2001
Earlier work this paper cites.
M. Balasubramanian and E. L. Schwartz, “The isomap algorithm and topological stability,”
2002
Earlier work this paper cites.
X. He and P. Niyogi, “Locality preserving projections,” in
2003
Earlier work this paper cites.
K. Q. Weinberger, F. Sha, and L. K. Saul, “Learning a kernel matrix for nonlinear dimensionality reduction,” in
2004
Earlier work this paper cites.
Y.-Y. Lin, T.-L. Liu, and H.-T. Chen, “Semantic manifold learning for image retrieval,” in
2005
Earlier work this paper cites.
K. M. Borgwardt and H. Kriegel, “Shortest-path kernels on graphs,” in
2005
Earlier work this paper cites.
F. M. Suchanek, G. Kasneci, and G. Weikum, “Yago: a core of semantic knowledge,” in
2007
Earlier work this paper cites.
S. Yan, D. Xu, B. Zhang, H. Zhang, Q. Yang, and S. Lin, “Graph embedding and extensions: A general framework for dimensionality reduction,”
2007
Earlier work this paper cites.
D. Cai, X. He, and J. Han, “Spectral regression: a unified subspace learning framework for content-based image retrieval,” in
2007
Earlier work this paper cites.
B. Shaw and T. Jebara, “Minimum volume embedding,” in
2007
Earlier work this paper cites.
C. M. Bishop and J. Lasserre, “Generative or Discrimative? Getting the Best of Both Worlds,” in
2007
Earlier work this paper cites.
J. Demmel, I. Dumitriu, and O. Holtz, “Fast linear algebra is stable,”
2007
Earlier work this paper cites.
K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor, “Freebase: A collaboratively created graph database for structuring human knowledge,” in
2008
Earlier work this paper cites.
L. Sun, S. Ji, and J. Ye, “Hypergraph spectral learning for multi-label classification,” in
2008
Earlier work this paper cites.
C. Bizer, J. Lehmann, G. Kobilarov, S. Auer, C. Becker, R. Cyganiak, and S. Hellmann, “Dbpedia - A crystallization point for the web of data,”
2009
Earlier work this paper cites.
S. Xiang, F. Nie, C. Zhang, and C. Zhang, “Nonlinear dimensionality reduction with local spline embedding,”
2009
Earlier work this paper cites.
B. Shaw and T. Jebara, “Structure preserving embedding,” in
2009
Earlier work this paper cites.
N. Shervashidze, S. V. N. Vishwanathan, T. Petri, K. Mehlhorn, and K. M. Borgwardt, “Efficient graphlet kernels for large graph comparison,” in
2009
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,”
2009
Earlier work this paper cites.
Y. Yang, F. Nie, S. Xiang, Y. Zhuang, and W. Wang, “Local and global regressive mapping for manifold learning with out-of-sample extrapolation,” in
2010
Earlier work this paper cites.
S. V. N. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt, “Graph kernels,”
2010
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. van Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels.”
2011
Earlier work this paper cites.
A. Bordes, J. Weston, R. Collobert, and Y. Bengio, “Learning structured embeddings of knowledge bases,” in
2011
Earlier work this paper cites.
M. Nickel, V. Tresp, and H. peter Kriegel, “A three-way model for collective learning on multi-relational data,” in
2011
Earlier work this paper cites.
Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein, “Distributed graphlab: A framework for machine learning and data mining in the cloud,”
2012
Earlier work this paper cites.
J. A. Bullinaria and J. P. Levy, “Extracting semantic representations from word co-occurrence statistics: stop-lists, stemming, and svd,”
2012
Earlier work this paper cites.
Y. Bengio, A. C. Courville, and P. Vincent, “Representation learning: A review and new perspectives,”
2013
Earlier work this paper cites.
N. S. S and S. Surendran, “Graph embedding and dimensionality reduction-a survey,”
2013
Earlier work this paper cites.
X. Zhao, A. Chang, A. D. Sarma, H. Zheng, and B. Y. Zhao, “On the embeddability of random walk distances,”
2013
Earlier work this paper cites.
A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, and A. J. Smola, “Distributed large-scale natural graph factorization,” in
2013
Earlier work this paper cites.
A. Bordes, N. Usunier, A. García-Durán, J. Weston, and O. Yakhnenko, “Translating embeddings for modeling multi-relational data,” in
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in
2013
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral networks and locally connected networks on graphs,” in
2013
Earlier work this paper cites.
R. Socher, D. Chen, C. D. Manning, and A. Y. Ng, “Reasoning with neural tensor networks for knowledge base completion,” in
2013
Earlier work this paper cites.
J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica, “Graphx: Graph processing in a distributed dataflow framework,” in
2014
Earlier work this paper cites.
N. Satish, N. Sundaram, M. M. A. Patwary, J. Seo, J. Park, M. A. Hassaan, S. Sengupta, Z. Yin, and P. Dubey, “Navigating the maze of graph analytics frameworks using massive graph datasets,” in
2014
Earlier work this paper cites.
Z. Wang, J. Zhang, J. Feng, and Z. Chen, “Knowledge graph embedding by translating on hyperplanes,” in
2014
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in
2014
Earlier work this paper cites.
F. Tian, B. Gao, Q. Cui, E. Chen, and T. Liu, “Learning deep representations for graph clustering,” in
2014
Earlier work this paper cites.
T. M. V. Le and H. W. Lauw, “Probabilistic latent document network embedding,” in
2014
Earlier work this paper cites.
C. Gong, D. Tao, J. Yang, and K. Fu, “Signed laplacian embedding for supervised dimension reduction,” in
2014
Earlier work this paper cites.
A. Bordes, X. Glorot, J. Weston, and Y. Bengio, “A semantic matching energy function for learning with multi-relational data - application to word-sense disambiguation,”
2014
Earlier work this paper cites.
A. Bordes, S. Chopra, and J. Weston, “Question answering with subgraph embeddings,” in
2014
Cited alongside, same era.
2014
Cited alongside, same era.
R. C. Wilson, E. R. Hancock, E. Pekalska, and R. P. W. Duin, “Spherical and hyperbolic embeddings of data,”
2014
Cited alongside, same era.
Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu, “Learning entity and relation embeddings for knowledge graph completion,” in
2015
Cited alongside, same era.
S. Cao, W. Lu, and Q. Xu, “Grarep: Learning graph representations with global structural information,” in
2015
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in
2016
Later among the works it cites.
X. Ren, W. He, M. Qu, C. R. Voss, H. Ji, and J. Han, “Label noise reduction in entity typing by heterogeneous partial-label embedding,” in
2016
Later among the works it cites.
M. Ou, P. Cui, J. Pei, Z. Zhang, and W. Zhu, “Asymmetric transitivity preserving graph embedding,” in
2016
Later among the works it cites.
2016
Later among the works it cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. S. Zemel, “Gated graph sequence neural networks,” in
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in
2015
Cited alongside, same era.
S. Chang, W. Han, J. Tang, G.-J. Qi, C. C. Aggarwal, and T. S. Huang, “Heterogeneous network embedding via deep architectures,” in
2015
Cited alongside, same era.
X. Geng, H. Zhang, J. Bian, and T. Chua, “Learning image and user features for recommendation in social networks,” in
2015
Cited alongside, same era.
F. Wu, J. Song, Y. Yang, X. Li, Z. M. Zhang, and Y. Zhuang, “Structured embedding via pairwise relations and long-range interactions in knowledge base,” in
2015
Cited alongside, same era.
Y. Zhao, Z. Liu, and M. Sun, “Representation learning for measuring entity relatedness with rich information,” in
2015
Cited alongside, same era.
S. Guo, Q. Wang, B. Wang, L. Wang, and L. Guo, “Semantically smooth knowledge graph embedding,” in
2015
Cited alongside, same era.
C. Yang, Z. Liu, D. Zhao, M. Sun, and E. Y. Chang, “Network representation learning with rich text information,” in
2015
Cited alongside, same era.
G. Ji, K. Liu, S. He, and J. Zhao, “Knowledge graph completion with adaptive sparse transfer matrix,” in
2016
Later among the works it cites.
J. Wen, J. Li, Y. Mao, S. Chen, and R. Zhang, “On the representation and embedding of knowledge bases beyond binary relations,” in
2016
Later among the works it cites.
R. Xie, Z. Liu, J. Jia, H. Luan, and M. Sun, “Representation learning of knowledge graphs with entity descriptions,” in
2016
Later among the works it cites.
H. Xiao, M. Huang, and X. Zhu, “From one point to a manifold: Knowledge graph embedding for precise link prediction,” in
2016
Later among the works it cites.
Y. Jia, Y. Wang, H. Lin, X. Jin, and X. Cheng, “Locally adaptive translation for knowledge graph embedding,” in
2016
Later among the works it cites.
H. Xiao, M. Huang, and X. Zhu, “Transg : A generative model for knowledge graph embedding,” in
2016
Later among the works it cites.
F. Zhang, N. J. Yuan, D. Lian, X. Xie, and W. Ma, “Collaborative knowledge base embedding for recommender systems,” in
2016
Later among the works it cites.
Y. Lin, Z. Liu, and M. Sun, “Knowledge representation learning with entities, attributes and relations,” in
2016
Later among the works it cites.
Z. Liu, V. W. Zheng, Z. Zhao, H. Yang, K. C.-C. Chang, M. Wu, and J. Ying, “Subgraph-augmented path embedding for semantic user search on heterogeneous social network,” in
2016
Later among the works it cites.
X. Wang, P. Cui, J. Wang, J. Pei, W. Zhu, and S. Yang, “Community preserving network embedding,” in
2017
Closest in time.
F. Nie, W. Zhu, and X. Li, “Unsupervised large graph embedding,” in
2017
Closest in time.
C. Zhou, Y. Liu, X. Liu, Z. Liu, and J. Gao, “Scalable graph embedding for asymmetric proximity,” in
2017
Closest in time.
X. Wei, L. Xu, B. Cao, and P. S. Yu, “Cross view link prediction by learning noise-resilient representation consensus,” in
2017
Closest in time.
A. Mahmood, M. Small, S. A. Al-Máadeed, and N. M. Rajpoot, “Using geodesic space density gradients for network community detection,”
2017
Closest in time.
P. Goyal and E. Ferrara, “Graph embedding techniques, applications, and performance: A survey,”
2017
Closest in time.
Q. Wang, Z. Mao, B. Wang, and L. Guo, “Knowledge graph embedding: A survey of approaches and applications,”
2017
Closest in time.
T. Pimentel, A. Veloso, and N. Ziviani, “Unsupervised and scalable algorithm for learning node representations,” in
2017
Closest in time.
H. Lu and M. Kong, “Community-based question answering via contextual ranking metric network learning,” in
2017
Closest in time.
Z. Zhao, H. Lu, V. W. Zheng, D. Cai, X. He, and Y. Zhuang, “Community-based question answering via asymmetric multi-faceted ranking network learning,” in
2017
Closest in time.
B. Shi and T. Weninger, “Proje: Embedding projection for knowledge graph completion,” in
2017
Closest in time.
Z. Liu, V. W. Zheng, Z. Zhao, F. Zhu, K. C. Chang, M. Wu, and J. Ying, “Semantic proximity search on heterogeneous graph by proximity embedding,” in
2017
Closest in time.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in
2017
Closest in time.
G. Nikolentzos, P. Meladianos, and M. Vazirgiannis, “Matching node embeddings for graph similarity,” in
2017
Closest in time.
——, “SSE: semantically smooth embedding for knowledge graphs,”
2017
Closest in time.
H. Xiao, M. Huang, L. Meng, and X. Zhu, “SSP: semantic space projection for knowledge graph embedding with text descriptions,” in
2017
Closest in time.
L. Yao, Y. Zhang, B. Wei, Z. Jin, R. Zhang, Y. Zhang, and Q. Chen, “Incorporating knowledge graph embeddings into topic modeling,” in
2017
Closest in time.
C. Li, J. Ma, X. Guo, and Q. Mei, “Deepcas: An end-to-end predictor of information cascades,” in
2017
Closest in time.
J. Wang, V. W. Zheng, Z. Liu, and K. C. Chang, “Topological recurrent neural network for diffusion prediction,” in
2017
Closest in time.
C. Xiong, R. Power, and J. Callan, “Explicit semantic ranking for academic search via knowledge graph embedding,” in
2017
Closest in time.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in
2017
Closest in time.
F. Monti, D. Boscaini, J. Masci, E. Rodolà, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model cnns,” in
2017
Closest in time.
C. Zhang, K. Zhang, Q. Yuan, H. Peng, Y. Zheng, T. Hanratty, S. Wang, and J. Han, “Regions, periods, activities: Uncovering urban dynamics via cross-modal representation learning,” in
2017
Closest in time.
S. Cavallari, V. W. Zheng, H. Cai, K. C. Chang, and E. Cambria, “Learning community embedding with community detection and node embedding on graphs,” in
2017
Closest in time.
S. F. Mousavi, M. Safayani, A. Mirzaei, and H. Bahonar, “Hierarchical graph embedding in vector space by graph pyramid,”
2017
Closest in time.
K. Allab, L. Labiod, and M. Nadif, “A semi-nmf-pca unified framework for data clustering,”
2017
Closest in time.
J. H. Tianji Pang, Feiping Nie, “Flexible orthogonal neighborhood preserving embedding,” in
2017
Closest in time.
D. Zhang, J. Yin, X. Zhu, and C. Zhang, “User profile preserving social network embedding,” in
2017
Closest in time.
R. Khasanova and P. Frossard, “Graph-based isometry invariant representation learning,” in
2017
Closest in time.
M. Chen, Y. Tian, M. Yang, and C. Zaniolo, “Multilingual knowledge graph embeddings for cross-lingual knowledge alignment,” in
2017
Closest in time.
H. Liu, Y. Wu, and Y. Yang, “Analogical inference for multi-relational embeddings,” in
2017
Closest in time.
L. F. Ribeiro, P. H. Saverese, and D. R. Figueiredo, “Struc2vec: Learning node representations from structural identity,” in
2017
Closest in time.
C. Yang, M. Sun, Z. Liu, and C. Tu, “Fast network embedding enhancement via high order proximity approximation,” in
2017
Closest in time.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in
2017
Closest in time.
Z. Liu, V. W. Zheng, Z. Zhao, F. Zhu, K. C.-C. Chang, M. Wu, and J. Ying, “Distance-aware dag embedding for proximity search on heterogeneous graphs,” in
2018
Closest in time.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in
2023
Closest in time.
T. Trouillon, J. Welbl, S. Riedel, E. Gaussier, and G. Bouchard, “Complex embeddings for simple link prediction,” in
2080
Closest in time.