Fetching the paper…
Reading the bibliography…
With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks.
S. Pan, J. Wu, X. Zhu, C. Zhang, and Y. Wang, “Tri-party deep network representation,” in Proceedings of the 25th International Joint Conference on Artificial Intelligence , 2016, pp. 1895–1901
1901
Earlier work this paper cites.
J. Chen, Q. Zhang, and X. Huang, “Incorporate group information to enhance network embedding,” in Proceedings of the 25th ACM International Conference on Information and Knowledge Management , 2016, pp. 1901–1904
1904
Earlier work this paper cites.
L. Katz, “A new status index derived from sociometric analysis,” Psychometrika , vol. 18, no. 1, pp. 39–43, 1953
1953
Earlier work this paper cites.
J. B. Tenenbaum, V. De Silva, and J. C. Langford, “A global geometric framework for nonlinear dimensionality reduction,” Science , vol. 290, no. 5500, pp. 2319–2323, 2000
2000
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” Science , vol. 290, no. 5500, pp. 2323–2326, 2000
2000
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 22, no. 8, pp. 888–905, 2000
2000
Earlier work this paper cites.
I. Herman, G. Melançon, and M. S. Marshall, “Graph visualization and navigation in information visualization: A survey,” IEEE Transactions on Visualization and Computer Graphics , vol. 6, no. 1, pp. 24–43, 2000
2000
Earlier work this paper cites.
C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, “A min-max cut algorithm for graph partitioning and data clustering,” in Proceedings of the 2001 IEEE International Conference on Data Mining , 2001, pp. 107–114
2001
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps and spectral techniques for embedding and clustering,” in Advances in Neural Information Processing Systems , 2002, pp. 585–591
2002
Earlier work this paper cites.
M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences , vol. 99, no. 12, pp. 7821–7826, 2002
2002
Earlier work this paper cites.
A. Strehl and J. Ghosh, “Cluster ensembles – a knowledge reuse framework for combining multiple partitions,” Journal of Machine Learning Research , vol. 3, pp. 583–617, 2003
2003
Earlier work this paper cites.
N. M. E. J. and M. Girvan, “Finding and evaluating community structure in networks,” Physics Review , vol. 69, no. 026113, 2004
2004
Earlier work this paper cites.
L. A. Adamic and N. Glance, “The political blogosphere and the 2004 US election: divided they blog,” in Proceedings of the 3rd International Workshop on Link Discovery , 2005, pp. 36–43
2005
Earlier work this paper cites.
F. Morin and Y. Bengio, “Hierarchical probabilistic neural network language model,” in Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics , vol. 5, 2005, pp. 246–252
2005
Earlier work this paper cites.
M. E. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical review E , vol. 74, no. 3, p. 036104, 2006
2006
Earlier work this paper cites.
G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science , vol. 313, no. 5786, pp. 504–507, 2006
2006
Earlier work this paper cites.
M. E. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences , vol. 103, no. 23, pp. 8577–8582, 2006
2006
Earlier work this paper cites.
S. Zhu, K. Yu, Y. Chi, and Y. Gong, “Combining content and link for classification using matrix factorization,” in Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2007, pp. 487–494
2007
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American Society for Information Science and Technology , vol. 58, no. 7, pp. 1019–1031, 2007
2007
Earlier work this paper cites.
X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger, “SCAN: A structural clustering algorithm for networks,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2007, pp. 824–833
2007
Earlier work this paper cites.
J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: densification and shrinking diameters,” ACM Transactions on Knowledge Discovery from Data (TKDD) , vol. 1, no. 1, p. 2, 2007
2007
Earlier work this paper cites.
A. Rahimi and B. Recht, “Random features for large-scale kernel machines,” in Advances in neural information processing systems , 2008, pp. 1177–1184
2008
Earlier work this paper cites.
R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin, “LIBLINEAR: A library for large linear classification,” Journal of Machine Learning Research , vol. 9, no. Aug, pp. 1871–1874, 2008
2008
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine , vol. 29, no. 3, p. 93, 2008
2008
Earlier work this paper cites.
L. v. d. Maaten and G. Hinton, “Visualizing data using t-SNE,” Journal of Machine Learning Research , vol. 9, no. Nov, pp. 2579–2605, 2008
2008
Earlier work this paper cites.
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, “Arnetminer: extraction and mining of academic social networks,” in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2008, pp. 990–998
2008
Earlier work this paper cites.
B.-J. Breitkreutz, C. Stark, T. Reguly, L. Boucher, A. Breitkreutz, M. Livstone, R. Oughtred, D. H. Lackner, J. Bähler, V. Wood et al. , “The BioGRID interaction database: 2008 update,” Nucleic Acids Research , vol. 36, pp. D637–D640, 2008
2008
Earlier work this paper cites.
L. Tang and H. Liu, “Relational learning via latent social dimensions,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2009, pp. 817–826
2009
Earlier work this paper cites.
——, “Scalable learning of collective behavior based on sparse social dimensions,” in Proceedings of the 18th ACM International Conference on Information and Knowledge Management , 2009, pp. 1107–1116
2009
Earlier work this paper cites.
R. Salakhutdinov and G. Hinton, “Semantic hashing,” International Journal of Approximate Reasoning , vol. 50, no. 7, pp. 969–978, 2009
2009
Earlier work this paper cites.
H. H. Song, T. W. Cho, V. Dave, Y. Zhang, and L. Qiu, “Scalable proximity estimation and link prediction in online social networks,” in Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement Conference , 2009, pp. 322–335
2009
Earlier work this paper cites.
J. Mairal, J. Ponce, G. Sapiro, A. Zisserman, and F. R. Bach, “Supervised dictionary learning,” in Advances in Neural Information Processing Systems , 2009, pp. 1033–1040
2009
Earlier work this paper cites.
Y. Zheng, L. Zhang, X. Xie, and W.-Y. Ma, “Mining interesting locations and travel sequences from GPS trajectories,” in Proceedings of the World Wide Web International Conference , 2009, pp. 791–800
2009
Earlier work this paper cites.
A. Mnih and G. E. Hinton, “A scalable hierarchical distributed language model,” in Advances in Neural Information Processing Systems , 2009, pp. 1081–1088
2009
Earlier work this paper cites.
M. Hochstenbach, “A Jacobi–Davidson type method for the generalized singular value problem,” Linear Algebra and its Applications , vol. 431, no. 3-4, pp. 471–487, 2009
2009
Earlier work this paper cites.
P. Vincent, H. Larochelle, I. Lajoie, Y. Bengio, and P.-A. Manzagol, “Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion,” Journal of Machine Learning Research , vol. 11, no. Dec, pp. 3371–3408, 2010
2010
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,” Physics Reports , vol. 486, no. 3–5, pp. 75–174, 2010
2010
Earlier work this paper cites.
S. Bhagat, G. Cormode, and S. Muthukrishnan, “Node classification in social networks,” Social Network Data Analytics , pp. 115–148, 2011
2011
Earlier work this paper cites.
L. Lü and T. Zhou, “Link prediction in complex networks: A survey,” Physica A: Statistical Mechanics and its Applications , vol. 390, no. 6, pp. 1150–1170, 2011
2011
Earlier work this paper cites.
S. Gao, L. Denoyer, and P. Gallinari, “Temporal link prediction by integrating content and structure information,” in Proceedings of the 20th ACM International Conference on Information and Knowledge Management , 2011, pp. 1169–1174
2011
Earlier work this paper cites.
——, “Leveraging social media networks for classification,” Data Mining and Knowledge Discovery , vol. 23, no. 3, pp. 447–478, 2011
2011
Earlier work this paper cites.
A. Bordes, J. Weston, R. Collobert, Y. Bengio et al. , “Learning structured embeddings of knowledge bases.” in Proceedings of the 25th AAAI Conference on Artificial Intelligence , 2011, pp. 301–306
2011
Earlier work this paper cites.
A. Liberzon, A. Subramanian, R. Pinchback, H. Thorvaldsdóttir, P. Tamayo, and J. P. Mesirov, “Molecular signatures database (MSigDB) 3.0,” Bioinformatics , vol. 27, no. 12, pp. 1739–1740, 2011
2011
Cited alongside, same era.
D. I. Shuman, P. Vandergheynst, and P. Frossard, “Chebyshev polynomial approximation for distributed signal processing,” in Distributed Computing in Sensor Systems and Workshops (DCOSS), 2011 International Conference on , 2011, pp. 1–8
2011
Cited alongside, same era.
J. Zhu, A. Ahmed, and E. P. Xing, “MedLDA: Maximum margin supervised topic models,” Journal of Machine Learning Research , vol. 13, no. Aug, pp. 2237–2278, 2012
2012
Cited alongside, same era.
2012
Cited alongside, same era.
2017
Closest in time.
T. Lyu, Y. Zhang, and Y. Zhang, “Enhancing the network embedding quality with structural similarity,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 147–156
2017
Closest in time.
D. Zhang, J. Yin, X. Zhu, and C. Zhang, “User profile preserving social network embedding,” in Proceedings of the 26th International Joint Conference on Artificial Intelligence , 2017, pp. 3378–3384
2017
Closest in time.
C. Li, S. Wang, D. Yang, Z. Li, Y. Yang, X. Zhang, and J. Zhou, “PPNE: Property preserving network embedding,” in International Conference on Database Systems for Advanced Applications , 2017, pp. 163–179
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Kazienko and T. Kajdanowicz, “Label-dependent node classification in the network,” Neurocomputing , vol. 75, no. 1, pp. 199–209, 2012
2012
Cited alongside, same era.
A. L. Traud, P. J. Mucha, and M. A. Porter, “Social structure of facebook networks,” Physica A: Statistical Mechanics and its Applications , vol. 391, no. 16, pp. 4165–4180, 2012
2012
Cited alongside, same era.
M. U. Gutmann and A. Hyvärinen, “Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics,” Journal of Machine Learning Research , vol. 13, no. Feb, pp. 307–361, 2012
2012
Cited alongside, same era.
F. D. Malliaros and M. Vazirgiannis, “Clustering and community detection in directed networks: A survey,” Physics Reports , vol. 533, no. 4, pp. 95–142, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Advances in Neural Information Processing Systems , 2013, pp. 3111–3119
2013
Cited alongside, same era.
B. Perozzi, R. Al-Rfou, and S. Skiena, “DeepWalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2014, pp. 701–710
2014
Cited alongside, same era.
N. Natarajan and I. S. Dhillon, “Inductive matrix completion for predicting gene–disease associations,” Bioinformatics , vol. 30, no. 12, pp. i60–i68, 2014
2014
Cited alongside, same era.
C. Li, Z. Li, S. Wang, Y. Yang, X. Zhang, and J. Zhou, “Semi-supervised network embedding,” in International Conference on Database Systems for Advanced Applications , 2017, pp. 131–147
2017
Closest in time.
V. Martinez, F. Berzal, and J.-C. Cubero, “A survey of link prediction in complex networks,” ACM Computing Surveys , vol. 49, no. 4, p. 69, 2017
2017
Closest in time.
S. Cavallari, V. W. Zheng, H. Cai, K. C.-C. Chang, and E. Cambria, “Learning community embedding with community detection and node embedding on graphs,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 377–386
2017
Closest in time.
C. Wang, S. Pan, G. Long, X. Zhu, and J. Jiang, “MGAE: Marginalized hraph autoencoder for graph clustering,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 889–898
2017
Closest in time.
D. Yang, S. Wang, C. Li, X. Zhang, and Z. Li, “From properties to links: Deep network embedding on incomplete graphs,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 367–376
2017
Closest in time.
J. Li, H. Dani, X. Hu, J. Tang, Y. Chang, and H. Liu, “Attributed network embedding for learning in a dynamic environment,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 387–396
2017
Closest in time.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” pp. 1025–1035, 2017
2017
Closest in time.
2017
Closest in time.
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, “Geometric deep learning: going beyond euclidean data,” IEEE Signal Processing Magazine , vol. 34, no. 4, pp. 18–42, 2017
2017
Closest in time.
2017
Closest in time.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in Proceedings of the 23th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2017, pp. 135–144
2017
Closest in time.
Y. Zhang, Y. Xiong, X. Kong, and Y. Zhu, “Learning node embeddings in interaction graphs,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 397–406
2017
Closest in time.
M. Qu, J. Tang, J. Shang, X. Ren, M. Zhang, and J. Han, “An attention-based collaboration framework for multi-view network representation learning,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 1767–1776
2017
Closest in time.
T.-y. Fu, W.-C. Lee, and Z. Lei, “HIN2Vec: Explore meta-paths in heterogeneous information networks for representation learning,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 1797–1806
2017
Closest in time.
Y. Chen and C. Wang, “HINE: Heterogeneous information network embedding,” in International Conference on Database Systems for Advanced Applications , 2017, pp. 180–195
2017
Closest in time.
S. Wang, J. Tang, C. Aggarwal, Y. Chang, and H. Liu, “Signed network embedding in social media,” in Proceedings of the 2017 SIAM International Conference on Data Mining , 2017, pp. 327–335
2017
Closest in time.
S. Wang, C. Aggarwal, J. Tang, and H. Liu, “Attributed signed network embedding,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 137–146
2017
Closest in time.
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 Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 2355–2362
2018
Closest in time.
P. Goyal and E. Ferrara, “Graph embedding techniques, applications, and performance: A survey,” Knowledge Based Systems , vol. 151, pp. 78–94, 2018
2018
Closest in time.
P. Cui, X. Wang, J. Pei, and W. Zhu, “A survey on network embedding,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
Closest in time.
H. Cai, V. W. Zheng, and K. C.-C. Chang, “A comprehensive survey of graph embedding: Problems, techniques and applications,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
Closest in time.
H. Wang, J. Wang, J. Wang, M. Zhao, W. Zhang, F. Zhang, X. Xie, and M. Guo, “GraphGAN: Graph representation learning with generative adversarial nets,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 2508–2515
2018
Closest in time.
R. Feng, Y. Yang, W. Hu, F. Wu, and Y. Zhuang, “Representation learning for scale-free networks,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 282–289
2018
Closest in time.
H. Chen, B. Perozzi, Y. Hu, and S. Skiena, “HARP: Hierarchical representation learning for networks,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 2127–2134
2018
Closest in time.
P. Wang, J. Zhang, G. Liu, Y. Fu, and C. Aggarwal, “Ensemble-spotting: Prioritizing vibrant communities via POI embedding with multi-view spatial graphs,” in Proceedings of the 2018 SIAM International Conference on Data Mining , 2018, pp. 351–359
2018
Closest in time.
L. Yang, X. Cao, and Y. Guo, “Multi-facet network embedding: Beyond the general solution of detection and representation,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 499–506
2018
Closest in time.
Y. Zhang, T. Lyu, and Y. Zhang, “COSINE: Community-preserving social network embedding from information diffusion cascades,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 2620–2627
2018
Closest in time.
Z. Wang, X. Ye, C. Wang, Y. Wu, C. Wang, and K. Liang, “RSDNE: Exploring relaxed similarity and dissimilarity from completely-imbalanced labels for network embedding,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 475–482
2018
Closest in time.
X. Huang, Q. Song, J. Li, and X. Hu, “Exploring expert cognition for attributed network embedding,” in Proceedings of the 10th ACM International Conference on Web Search and Data Mining , 2018
2018
Closest in time.
V. Misra and S. Bhatia, “Bernoulli embeddings for graphs,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 3812–3819
2018
Closest in time.
J. Qiu, Y. Dong, H. Ma, J. Li, K. Wang, and J. Tang, “Network embedding as matrix factorization: unifying DeepWalk, LINE, PTE, and node2vec,” in Proceedings of the 10th ACM International Conference on Web Search and Data Mining , 2018
2018
Closest in time.
L. Zhou, Y. Yang, X. Ren, F. Wu, and Y. Zhuang, “Dynamic network embedding by modeling triadic closure process,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 571–578
2018
Closest in time.
K. Tu, P. Cui, X. Wang, F. Wang, and W. Zhu, “Structural deep embedding for hyper-networks,” in Proceedings of the 32nd AAAI Conference on Artificial Intelligence , 2018, pp. 426–433
2018
Closest in time.
Y. Ma, Z. Ren, Z. Jiang, J. Tang, and D. Yin, “Multi-dimensional network embedding with hierarchical structure,” in Proceedings of the 10th ACM International Conference on Web Search and Data Mining , 2018
2018
Closest in time.
H. Wang, F. Zhang, M. Hou, X. Xie, M. Guo, and Q. Liu, “SHINE: Signed heterogeneous information network embedding for sentiment link prediction,” in Proceedings of the 10th ACM International Conference on Web Search and Data Mining , 2018
2018
Closest in time.
S. Pan, R. Hu, G. Long, J. Jiang, L. Yao, and C. Zhang, “Adversarially regularized graph autoencoder,” Proceedings of the 26th International Joint Conference on Artificial Intelligence , 2018
2018
Closest in time.