The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Attributed Network Embedding for Learning in a Dynamic Environment
Open accessAbstract
Network embedding leverages the node proximity manifested to learn a low-dimensional node vector representation for each node in the network. The learned embeddings could advance various learning tasks such as node classification, network clustering, and link prediction. Most, if not all, of the existing works, are overwhelmingly performed in the context of plain and static networks. Nonetheless, in reality, network structure often evolves over time with addition/deletion of links and nodes. Also, a vast majority of real-world networks are associated with a rich set of node attributes, and their attribute values are also naturally changing, with the emerging of new content patterns and the fading of old content patterns. These changing characteristics motivate us to seek an effective embedding representation to capture network and attribute evolving patterns, which is of fundamental importance for learning in a dynamic environment. To our best knowledge, we are the first to tackle this problem with the following two challenges: (1) the inherently correlated network and node attributes could be noisy and incomplete, it necessitates a robust consensus representation to capture their individual properties and correlations; (2) the embedding learning needs to be performed in an online fashion to adapt to the changes accordingly. In this paper, we tackle this problem by proposing a novel dynamic attributed network embedding framework - DANE. In particular, DANE first provides an offline method for a consensus embedding and then leverages matrix perturbation theory to maintain the freshness of the end embedding results in an online manner. We perform extensive experiments on both synthetic and real attributed networks to corroborate the effectiveness and efficiency of the proposed framework.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Self-citationLaplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Canonical Correlation Analysis: An Overview with Application to Learning Methods
Hardoon, D. R., Szedmak, S., & Shawe-Taylor, J. (2004) · Neural Computation · doi:10.1162/0899766042321814 · Cited by 3,202
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
GraRep: Learning Graph Representations with Global Structural Information
Cao, S., Lu, W., & Xu, Q. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806512 · Cited by 1,571
Network representation learning with rich text information
Yang, C. H., Liu, Z., Zhao, D., Sun, M., & Chang, E. Y. (2015) · International Conference on Artificial Intelligence · Cited by 1,246
The Symmetric Eigenvalue Problem.
Wilkinson, J. H., & Parlett, B. N. (1981) · Mathematics of Computation · doi:10.2307/2007453 · Cited by 1,186
Co-regularized Multi-view Spectral Clustering
Kumar, A., Rai, P., & Daumé, H. (2011) · Cited by 1,093
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Power-Law Distribution of the World Wide Web
Adamic, L. A., & Huberman, B. A. (2000) · Science · doi:10.1126/science.287.5461.2115a · Cited by 1,015
Homophily and contagion are generically confounded in observational social network studies
Shalizi, C. R., & Thomas, A. C. (2011) · Sociological Methods & Research · doi:10.1177/0049124111404820 · Cited by 994 · cited 1×
“It has been widely studied and received that there exhibits a strong correlation among the aributes of linked nodes [27, 29].”
BackgroundA Survey on Multi-view Learning
Xu, C., Tao, D., & Xu, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.5634 · Cited by 942
Network Studies of Social Influence
MARSDEN, P. V., & FRIEDKIN, N. E. (1993) · Sociological Methods & Research · doi:10.1177/0049124193022001006 · Cited by 844
Human mobility, social ties, and link prediction
Wang, D., Pedreschi, D., Song, C., Giannotti, F., & Barabasi, A.-L. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020581 · Cited by 665
Heterogeneous Network Embedding via Deep Architectures
Chang, S., Han, W., Tang, J., Qi, G.-J., Aggarwal, C. C., & Huang, T. S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783296 · Cited by 590
Self-citationNODE CLASSIFICATION IN SOCIAL NETWORKS
Bhagat, S., Cormode, G., & Muthukrishnan, S. (2011) · Cited by 500
Label Informed Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018667 · Cited by 487
Self-citationUser-level sentiment analysis incorporating social networks
Tan, C., Lee, L., Tang, J., Jiang, L., Zhou, M., & Li, P. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020614 · Cited by 419
Self-citationNode Classification in Social Networks
Bhagat, S., Cormode, G., & Muthukrishnan, S. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_5 · Cited by 386
Evolutionary spectral clustering by incorporating temporal smoothness
Chi, Y., Song, X., Zhou, D., Hino, K., & Tseng, B. L. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281212 · Cited by 375
Combining link and content for community detection: a discriminative approach
Yang, T., Jin, R., Chi, Y., & Zhu, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557120 · Cited by 364
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Accelerated Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the 2017 SIAM International Conference on Data Mining · doi:10.1137/1.9781611974973.71 · Cited by 311
Self-citationCombining content and link for classification using matrix factorization
Zhu, S., Yu, K., Chi, Y., & Gong, Y. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277825 · Cited by 262
Radar: Residual Analysis for Anomaly Detection in Attributed Networks
Li, J., Dani, H., Hu, X., & Liu, H. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/299 · Cited by 247
Self-citationCommunity evolution in dynamic multi-mode networks
Tang, L., Liu, H., Zhang, J., & Nazeri, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401972 · Cited by 245
Self-citationUnsupervised feature selection for linked social media data
Tang, J., & Liu, H. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339673 · Cited by 195
Self-citationWho to follow and why: link prediction with explanations
Barbieri, N., Bonchi, F., & Manco, G. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623733 · Cited by 169
An Attention-based Collaboration Framework for Multi-View Network Representation Learning
Qu, M., Tang, J., Shang, J., Ren, X., Zhang, M., & Han, J. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3133021 · Cited by 160
Self-citationUnsupervised Streaming Feature Selection in Social Media
Li, J., Hu, X., Tang, J., & Liu, H. (2015) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2806416.2806501 · Cited by 127
Self-citationColibri: fast mining of large static and dynamic graphs
Tong, H., Papadimitriou, S., Sun, J., Yu, P. S., & Faloutsos, C. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401973 · Cited by 123
Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities
Ning, H., Xu, W. H., Chi, Y., Gong, Y., & Huang, T. S. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.24 · Cited by 113
Learning latent representations of nodes for classifying in heterogeneous social networks
Jacob, Y., Denoyer, L., & Gallinari, P. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556225 · Cited by 107
Power-Law Distribution of the World Wide Web
(2000) · Science · doi:10.1126/science.287.5461.2113o · Cited by 82
Robust Unsupervised Feature Selection on Networked Data
Li, J., Hu, X., Wu, L., & Liu, H. (2016) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974348.44 · Cited by 71
Self-citationUnsupervised Feature Selection in Signed Social Networks
Cheng, K., Li, J., & Liu, H. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098106 · Cited by 65
Self-citationChen, M., Yang, Q., & Tang, X. (2007) · International Joint Conference on Artificial Intelligence · Cited by 64
Toward Time-Evolving Feature Selection on Dynamic Networks
Li, J., Hu, X., Jian, L., & Liu, H. (2016) · Proceedings · doi:10.1109/icdm.2016.0127 · Cited by 55
Self-citationRecommending Groups to Users Using User-Group Engagement and Time-Dependent Matrix Factorization
Wang, X. Y., Donaldson, R., Nell, C., Gorniak, P., Ester, M., & Bu, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10160 · Cited by 52
On Node Classification in Dynamic Content-based Networks
Aggarwal, C. C., & Li, N. (2011) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.31 · Cited by 46
Toward online node classification on streaming networks
Jian, L., Li, J., & Liu, H. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-017-0533-y · Cited by 42
Self-citationCollective Classification via Discriminative Matrix Factorization on Sparsely Labeled Networks
Zhang, D., Yin, J., Xingquan Zhu, A., & Chengqi Zhang, B. (2016) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2983323.2983754 · Cited by 41
Fast Eigen-Functions Tracking on Dynamic Graphs
Chen, C., & Tong, H. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.63 · Cited by 38
Rare Category Detection on Time-Evolving Graphs
Zhou, D., Wang, K., Cao, N., & He, J. (2015) · Proceedings · doi:10.1109/icdm.2015.120 · Cited by 30
Toward Personalized Relational Learning
Li, J., Wu, L., Zai͏̈ane, O. R., & Liu, H. (2017) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611974973.50 · Cited by 25
Self-citationOn the eigen‐functions of dynamic graphs: Fast tracking and attribution algorithms
Chen, C., & Tong, H. (2016) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11310 · Cited by 22
Cited by
Heterogeneous Graph Neural Network
Zhang, C., Song, D., Huang, C., Swami, A., & Chawla, N. V. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330961 · Cited by 1,591
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T., & Leiserson, C. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5984 · Cited by 1,221
Network Representation Learning: A Survey
Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2850013 · Cited by 714
Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks
Kumar, S., Zhang, X., & Leskovec, J. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330895 · Cited by 692
DySAT: Deep Neural Representation Learning on Dynamic Graphs via Self-Attention Networks
Sankar, A., Wu, Y., Gou, L., Zhang, W., & Yang, H. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371845 · Cited by 638
Metadata
- Authors
- Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., & Liu, H.
- Venue
- Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
- Publisher
- ACM
- Published
- 2017-11-06
- Pages
- 387-396
- OpenAlex
- W2623187518
- Cited by
- 352
- References
- 55
- FWCI
- 19.05
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.