Fetching the paper…
Reading the bibliography…
Graphs, such as social networks, word co-occurrence networks, and communication networks, occur naturally in various real-world applications.
P. Jaccard, Etude comparative de la distribution florale dans une portion des Alpes et du Jura, Impr. Corbaz, 1901
1901
Earlier work this paper cites.
K. Pearson, Liii. on lines and planes of closest fit to systems of points in space, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 2 (11) (1901) 559–572
1901
Earlier work this paper cites.
L. Katz, A new status index derived from sociometric analysis, Psychometrika 18 (1) (1953) 39–43
1953
Earlier work this paper cites.
H. C. White, S. A. Boorman, R. L. Breiger, Social structure from multiple networks. i. blockmodels of roles and positions, American journal of sociology 81 (4) (1976) 730–780
1976
Earlier work this paper cites.
C. F. Van Loan, Generalizing the singular value decomposition, SIAM Journal on Numerical Analysis 13 (1) (1976) 76–83
1976
Earlier work this paper cites.
W. W. Zachary, An information flow model for conflict and fission in small groups, Journal of anthropological research 33 (4) (1977) 452–473
1977
Earlier work this paper cites.
J. B. Kruskal, M. Wish, Multidimensional scaling, Vol. 11, Sage, 1978
1978
Earlier work this paper cites.
J. Rissanen, Modeling by shortest data description, Automatica 14 (5) (1978) 465–471
1978
Earlier work this paper cites.
P. W. Holland, K. B. Laskey, S. Leinhardt, Stochastic blockmodels: First steps, Social networks 5 (2) (1983) 109–137
1983
Earlier work this paper cites.
I. T. Jolliffe, Principal component analysis and factor analysis, in: Principal component analysis, Springer, 1986, pp. 115–128
1986
Earlier work this paper cites.
Y. J. Wang, G. Y. Wong, Stochastic blockmodels for directed graphs, Journal of the American Statistical Association 82 (397) (1987) 8–19
1987
Earlier work this paper cites.
P. Eades, L. Xuemin, How to draw a directed graph, in: Visual Languages, 1989., IEEE Workshop on, IEEE, 1989, pp. 13–17
1989
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, H. White, Universal approximation of an unknown mapping and its derivatives using multilayer feedforward networks, Neural networks 3 (1990) 551–560
1990
Earlier work this paper cites.
T. Feder, R. Motwani, Clique partitions, graph compression and speeding-up algorithms, in: Proceedings of the twenty-third annual ACM symposium on Theory of computing, 1991, pp. 123–133
1991
Earlier work this paper cites.
P. M. Pardalos, J. Xue, The maximum clique problem, Journal of global Optimization 4 (3) (1994) 301–328
1994
Earlier work this paper cites.
G. Di Battista, P. Eades, R. Tamassia, I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry 4 (5) (1994) 235–282
1994
Earlier work this paper cites.
A. McCallum, K. Nigam, et al., A comparison of event models for naive bayes text classification, in: AAAI-98 workshop on learning for text categorization, Vol. 752, Citeseer, 1998, pp. 41–48
1998
Earlier work this paper cites.
N. Friedman, L. Getoor, D. Koller, A. Pfeffer, Learning probabilistic relational models, in: IJCAI, 1999, pp. 1300–1309
1999
Earlier work this paper cites.
L. C. Freeman, Visualizing social networks, Journal of social structure 1 (1) (2000) 4
2000
Earlier work this paper cites.
J. Shi, J. Malik, Normalized cuts and image segmentation, IEEE Transactions on pattern analysis and machine intelligence 22 (8) (2000) 888–905
2000
Earlier work this paper cites.
S. T. Roweis, L. K. Saul, Nonlinear dimensionality reduction by locally linear embedding, Science 290 (5500) (2000) 2323–2326
2000
Earlier work this paper cites.
J. B. Tenenbaum, V. De Silva, J. C. Langford, A global geometric framework for nonlinear dimensionality reduction, science 290 (5500) (2000) 2319–2323
2000
Earlier work this paper cites.
E. R. Gansner, S. C. North, An open graph visualization system and its applications to software engineering, Software Practice and Experience 30 (11) (2000) 1203–1233
2000
Earlier work this paper cites.
I. Herman, G. Melançon, M. S. Marshall, Graph visualization and navigation in information visualization: A survey, IEEE Trans on visualization and computer graphics 6 (1) (2000) 24–43
2000
Earlier work this paper cites.
J. Neville, D. Jensen, Iterative classification in relational data, in: Proc. Workshop on Learning Statistical Models from Relational Data, 2000, pp. 13–20
2000
Earlier work this paper cites.
R. F. i Cancho, R. V. Solé, The small world of human language, Proceedings of the Royal Society of London B: Biological Sciences 268 (1482) (2001) 2261–2265
2001
Earlier work this paper cites.
C. H. Ding, X. He, H. Zha, M. Gu, H. D. Simon, A min-max cut algorithm for graph partitioning and data clustering, in: International Conference on Data Mining, IEEE, 2001, pp. 107–114
2001
Earlier work this paper cites.
M. Belkin, P. Niyogi, Laplacian eigenmaps and spectral techniques for embedding and clustering, in: NIPS, Vol. 14, 2001, pp. 585–591
2001
Earlier work this paper cites.
A. M. Martínez, A. C. Kak, Pca versus lda, IEEE transactions on pattern analysis and machine intelligence 23 (2) (2001) 228–233
2001
Earlier work this paper cites.
Q. Lu, L. Getoor, Link-based classification, in: ICML, Vol. 3, 2003, pp. 496–503
2003
Cited alongside, same era.
L. A. Adamic, E. Adar, Friends and neighbors on the web, Social networks 25 (3) (2003) 211–230
2003
Cited alongside, same era.
M. Brand, Continuous nonlinear dimensionality reduction by kernel eigenmaps, in: IJCAI, 2003, pp. 547–554
2003
Cited alongside, same era.
J. Gehrke, P. Ginsparg, J. Kleinberg, Overview of the 2003 kdd cup, ACM SIGKDD Explorations 5 (2)
2003
Cited alongside, same era.
X. He, P. Niyogi, Locality preserving projections, in: Advances in neural information processing systems, 2004, pp. 153–160
2004
Cited alongside, same era.
M. E. Newman, M. Girvan, Finding and evaluating community structure in networks, Physical review E 69 (2) (2004) 026113
L. Tang, H. Liu, Scalable learning of collective behavior based on sparse social dimensions, in: Proceedings of the 18th ACM conference on Information and knowledge management, ACM, 2009, pp. 1107–1116
2009
Later among the works it cites.
S. Bhagat, G. Cormode, S. Muthukrishnan, Node classification in social networks, in: Social network data analytics, Springer, 2011, pp. 115–148
2011
Later among the works it cites.
D. Luo, F. Nie, H. Huang, C. H. Ding, Cauchy graph embedding, in: Proceedings of the 28th International Conference on Machine Learning (ICML-11), 2011, pp. 553–560
2011
Later among the works it cites.
H. Toivonen, F. Zhou, A. Hartikainen, A. Hinkka, Compression of weighted graphs, in: Proc. 17th international conference on Knowledge discovery and data mining, 2011, pp. 965–973
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
Y.-Y. Lin, T.-L. Liu, H.-T. Chen, Semantic manifold learning for image retrieval, in: Proceedings of the 13th annual ACM international conference on Multimedia, ACM, 2005, pp. 249–258
2005
Cited alongside, same era.
M. E. Newman, A measure of betweenness centrality based on random walks, Social networks 27 (1) (2005) 39–54
2005
Cited alongside, same era.
D. Jungnickel, T. Schade, Graphs, networks and algorithms, Springer, 2005
2005
Cited alongside, same era.
S. White, P. Smyth, A spectral clustering approach to finding communities in graphs, in: Proceedings of the 2005 SIAM international conference on data mining, SIAM, 2005, pp. 274–285
2005
Cited alongside, same era.
K. Yu, W. Chu, S. Yu, V. Tresp, Z. Xu, Stochastic relational models for discriminative link prediction, in: NIPS, 2006, pp. 1553–1560
2006
Cited alongside, same era.
J. Leskovec, J. Kleinberg, C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Transactions on Knowledge Discovery from Data (TKDD) 1 (1) (2007) 2
2007
Cited alongside, same era.
2011
Later among the works it cites.
M. Al Hasan, M. J. Zaki, A survey of link prediction in social networks, in: Social network data analytics, 2011, pp. 243–275
2011
Later among the works it cites.
A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, A. J. Smola, Distributed large-scale natural graph factorization, in: Proceedings of the 22nd international conference on World Wide Web, ACM, 2013, pp. 37–48
2013
Later among the works it cites.
Y. Bengio, A. Courville, P. Vincent, Representation learning: A review and new perspectives, IEEE transactions on pattern analysis and machine intelligence 35 (8) (2013) 1798–1828
2013
Later among the works it cites.
D. W. Hosmer Jr, S. Lemeshow, R. X. Sturdivant, Applied logistic regression, Vol. 398, John Wiley & Sons, 2013
2013
Later among the works it cites.
B. Perozzi, R. Al-Rfou, S. Skiena, Deepwalk: Online learning of social representations, in: Proceedings 20th international conference on Knowledge discovery and data mining, 2014, pp. 701–710
2014
Later among the works it cites.
J. Leskovec, A. Krevl, SNAP Datasets: Stanford large network dataset collection, http://snap.stanford.edu/data (2014)
2014
Later among the works it cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, Q. Mei, Line: Large-scale information network embedding, in: Proceedings 24th International Conference on World Wide Web, 2015, pp. 1067–1077
2015
Later among the works it cites.
S. Cao, W. Lu, Q. Xu, Grarep: Learning graph representations with global structural information, in: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, ACM, 2015, pp. 891–900
2015
Later among the works it cites.
C. Yang, Z. Liu, D. Zhao, M. Sun, E. Y. Chang, Network representation learning with rich text information., in: IJCAI, 2015, pp. 2111–2117
2015
Later among the works it cites.
S. Chang, W. Han, J. Tang, G.-J. Qi, C. C. Aggarwal, T. S. Huang, Heterogeneous network embedding via deep architectures, in: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2015, pp. 119–128
2015
Later among the works it cites.
D. K. Duvenaud, D. Maclaurin, J. Iparraguirre, R. Bombarell, T. Hirzel, A. Aspuru-Guzik, R. P. Adams, Convolutional networks on graphs for learning molecular fingerprints, in: Advances in neural information processing systems, 2015, pp. 2224–2232
2015
Later among the works it cites.
D. Wang, P. Cui, W. Zhu, Structural deep network embedding, in: Proceedings of the 22nd International Conference on Knowledge Discovery and Data Mining, ACM, 2016, pp. 1225–1234
2016
Later among the works it cites.
M. Ou, P. Cui, J. Pei, Z. Zhang, W. Zhu, Asymmetric transitivity preserving graph embedding, in: Proc. of ACM SIGKDD, 2016, pp. 1105–1114
2016
Later among the works it cites.
A. Grover, J. Leskovec, node2vec: Scalable feature learning for networks, in: Proceedings of the 22nd International Conference on Knowledge Discovery and Data Mining, ACM, 2016, pp. 855–864
2016
Later among the works it cites.
S. Cao, W. Lu, Q. Xu, Deep neural networks for learning graph representations, in: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 1145–1152
2016
Later among the works it cites.
C. Tu, W. Zhang, Z. Liu, M. Sun, Max-margin deepwalk: Discriminative learning of network representation., in: IJCAI, 2016, pp. 3889–3895
2016
Later among the works it cites.
D. Zhang, J. Yin, X. Zhu, C. Zhang, Homophily, structure, and content augmented network representation learning, in: Data Mining (ICDM), 2016 IEEE 16th International Conference on, IEEE, 2016, pp. 609–618
2016
Later among the works it cites.
Z. Yang, J. Tang, W. W. Cohen, Multi-modal bayesian embeddings for learning social knowledge graphs., in: IJCAI, 2016, pp. 2287–2293
2016
Later among the works it cites.
J. Li, J. Zhu, B. Zhang, Discriminative deep random walk for network classification., in: ACL (1), 2016
2016
Later among the works it cites.
S. Pan, J. Wu, X. Zhu, C. Zhang, Y. Wang, Tri-party deep network representation, Network 11 (9) (2016) 12
2016
Later among the works it cites.
M. Niepert, M. Ahmed, K. Kutzkov, Learning convolutional neural networks for graphs, in: Proceedings of the 33rd annual international conference on machine learning. ACM, 2016
2016
Later among the works it cites.
M. Defferrard, X. Bresson, P. Vandergheynst, Convolutional neural networks on graphs with fast localized spectral filtering, in: Advances in Neural Information Processing Systems, 2016, pp. 3844–3852
2016
Later among the works it cites.
L. Zhu, D. Guo, J. Yin, G. Ver Steeg, A. Galstyan, Scalable temporal latent space inference for link prediction in dynamic social networks, IEEE Transactions on Knowledge and Data Engineering 28 (10) (2016) 2765–2777
2016
Later among the works it cites.
X. Huang, J. Li, X. Hu, Label informed attributed network embedding, in: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, ACM, 2017, pp. 731–739
2017
Closest in time.