The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Label Informed Attributed Network Embedding
Abstract
Attributed network embedding aims to seek low-dimensional vector representations for nodes in a network, such that original network topological structure and node attribute proximity can be preserved in the vectors. These learned representations have been demonstrated to be helpful in many learning tasks such as network clustering and link prediction. While existing algorithms follow an unsupervised manner, nodes in many real-world attributed networks are often associated with abundant label information, which is potentially valuable in seeking more effective joint vector representations. In this paper, we investigate how labels can be modeled and incorporated to improve attributed network embedding. This is a challenging task since label information could be noisy and incomplete. In addition, labels are completely distinct with the geometrical structure and node attributes. The bewildering combination of heterogeneous information makes the joint vector representation learning more difficult. To address these issues, we propose a novel Label informed Attributed Network Embedding (LANE) framework. It can smoothly incorporate label information into the attributed network embedding while preserving their correlations. Experiments on real-world datasets demonstrate that the proposed framework achieves significantly better performance compared with the state-of-the-art embedding algorithms.
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
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
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
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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 · cited 1×
“Due to heterogeneity of the two information sources, it is challenging for existing network embedding algorithms to be directly applied on ANE.”
BackgroundLaplacian 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
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Yan, S., Xu, D., Zhang, B., Zhang, H.-J., Yang, Q., & Lin, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.250598 · Cited by 3,031
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
(2008) · Choice Reviews Online · doi:10.5860/choice.45-5628 · Cited by 2,725
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Homophily, Selection, and Socialization in Adolescent Friendships
Kandel, D. B. (1978) · American Journal of Sociology · doi:10.1086/226792 · Cited by 1,486
Co-regularized Multi-view Spectral Clustering
Kumar, A., Rai, P., & Daumé, H. (2011) · neural information processing systems · Cited by 1,467
Relational learning via collective matrix factorization
Singh, A. P., & Gordon, G. J. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401969 · Cited by 1,204
A survey of multi-view machine learning
Sun, S. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1362-6 · Cited by 878
Network Studies of Social Influence
MARSDEN, P. V., & FRIEDKIN, N. E. (1993) · Sociological Methods & Research · doi:10.1177/0049124193022001006 · Cited by 844
Homogeneity in confiding relations
Marsden, P. V. (1988) · Social Networks · doi:10.1016/0378-8733(88)90010-x · Cited by 804
Distributed large-scale natural graph factorization
Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., & Smola, A. J. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488393 · Cited by 648
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
Deep Learning via Semi-supervised Embedding
Weston, J., Ratle, F., Mobahi, H., & Collobert, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_34 · Cited by 534
Bach, F., & Jordan, M. I. (2003) · UC Berkeley · Cited by 493
What's in a hashtag?: content based prediction of the spread of ideas in microblogging communities
Tsur, O., & Rappoport, A. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124320 · Cited by 423
Topic modeling with network regularization
Mei, Q., Cai, D., Zhang, D., & Zhai, C. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367512 · Cited by 392
Exploiting social relations for sentiment analysis in microblogging
Hu, X., Tang, L., Tang, J., & Liu, H. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433465 · Cited by 384
Self-citationVisualizing Large-scale and High-dimensional Data
Tang, J., Liu, J., Zhang, M., & Mei, Q. (2016) · Proceedings of the 25th International Conference on World Wide Web · doi:10.1145/2872427.2883041 · Cited by 306
Exploiting homophily effect for trust prediction
Tang, J., Gao, H., Hu, X., & Liu, H. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433405 · Cited by 303
Self-citationRevisiting Semi-Supervised Learning with Graph Embeddings
Yang, Z., Cohen, W. W., & Salakhutdinov, R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.08861 · Cited by 263
Combining 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
Understanding retweeting behaviors in social networks
Yang, Z., Guo, J., Cai, K., Tang, J., Li, J., Zhang, L., & Su, Z. (2010) · Proceedings of the 19th ACM international conference on Information and knowledge management · doi:10.1145/1871437.1871691 · Cited by 250
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
Singular-value decomposition and embedding dimension
Mees, A. I., Rapp, P. E., & Jennings, L. S. (1987) · Physical Review A · doi:10.1103/physreva.36.340 · Cited by 202
Structure preserving embedding
Shaw, B., & Jebara, T. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553494 · Cited by 200
Temporal link prediction by integrating content and structure information
Gao, S., Denoyer, L., & Gallinari, P. (2011) · Proceedings of the 20th ACM international conference on Information and knowledge management · doi:10.1145/2063576.2063744 · Cited by 158
Exploring Context and Content Links in Social Media: A Latent Space Method
Qi, G.-J., Aggarwal, C. C., Tian, Q., Ji, H., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.191 · Cited by 158
Network Studies of Social Influence
Marsden, P. V., & Friedkin, N. E. (1994) · Sage eBooks · doi:10.4135/9781452243528.n1 · Cited by 143
Learning social network embeddings for predicting information diffusion
Bourigault, S., Lagnier, C., Lamprier, S., et al. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556216 · Cited by 140
Unsupervised 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-citationLearning 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
Probabilistic latent semantic visualization
Iwata, T., Yamada, T., & Ueda, N. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401937 · Cited by 85
Probabilistic Latent Document Network Embedding
Le, T. M. V., & Lauw, H. W. (2014) · Proceedings · doi:10.1109/icdm.2014.119 · Cited by 74
Pre-Trained Multi-View Word Embedding Using Two-Side Neural Network
Luo, Y., Tang, J., Yan, J., Xu, C., & Chen, Z. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8956 · Cited by 38
A Reconstruction Error Based Framework for Multi-Label and Multi-View Learning
Qian, B., Wang, X., Ye, J., et al. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2339860 · Cited by 37
(2002)
Cited by
metapath2vec: Scalable Representation Learning for Heterogeneous Networks
Dong, Y., Chawla, N. V., & Swami, A. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098036 · Cited by 2,210
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
“Other works ([46, 47, 48]) perform similar transformations between various node attributes and learn joint embedding.”
BackgroundCui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
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
GraphGAN: Graph Representation Learning With Generative Adversarial Nets
Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W., Zhang, F., Xie, X., & Guo, M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11872 · Cited by 653
Metadata
- Authors
- Huang, X., Li, J., & Hu, X.
- Venue
- Proceedings of the Tenth ACM International Conference on Web Search and Data Mining
- Publisher
- ACM
- Published
- 2017-02-02
- Pages
- 731-739
- OpenAlex
- W2583803680
- Cited by
- 487
- References
- 48
- FWCI
- 34.43
- Type
- conference paper
- Language
- en
- Open access
- closed
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.