NANE: Attributed Network Embedding with Local and Global Information
Authors: 
Jingjie Mo, Neng Gao, Yujing Zhou, Yang Pei, Jiong WangAuthors Info & Claims
Pages 247 - 261
Abstract
Attributed network embedding, which aims to map structural and attribute information into a latent vector space jointly, has attracted a surge of research attention in recent years. However, existing methods mostly concentrate on either the local proximity (i.e., the pairwise similarity of connected nodes) or the global proximity (e.g., the similarity of nodes’ correlation in a global perspective). How to learn the global and local information in structure and attribute into a same latent space simultaneously is an open yet challenging problem. To this end, we propose a Neural-based Attributed Network Embedding (NANE) approach. Firstly, an affinity matrix and an adjacency matrix are introduced to encode the attribute and structural information in terms of the overall picture separately. Then, we impose a neural-based framework with a pairwise constraint to learn the vector representation for each node. Specifically, an explicit loss function is designed to preserve the local and global similarity jointly. Empirically, we evaluate the performance of NANE through node classification and clustering tasks on three real-world datasets. Our method achieves significant performance compared with state-of-the-art baselines.
References
[1]
Belkin, M., Niyogi, P.: Laplacian Eigenmaps and spectral techniques for embedding and clustering. In: International Conference on Neural Information Processing Systems: Natural and Synthetic, pp. 585–591 (2002)
[2]
Bhagat S, Cormode G, and Muthukrishnan S Node Classification in Social Networks 2011 New York Springer
[3]
Bhuyan MH, Bhattacharyya DK, and Kalita JK Network anomaly detection: methods, systems and tools IEEE Commun. Surv. Tutor. 2014 16 1 303-336
[4]
Burger, J.D., Henderson, J., Kim, G., Zarrella, G.: Discriminating gender on twitter. In: Conference on Empirical Methods in Natural Language Processing, pp. 1301–1309 (2011)
[5]
Cao, S., Lu, W., Xu, Q.: Deep neural networks for learning graph representations. In: Thirtieth AAAI Conference on Artificial Intelligence, pp. 1145–1152 (2016)
[6]
Dong, Y., Zhang, J., Tang, J., Chawla, N.V., Wang, B.: Coupledlp: link prediction in coupled networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208 (2015)
[7]
Erhan D, Bengio Y, Courville A, Manzagol PA, Vincent P, and Bengio S Why does unsupervised pre-training help deep learning? J. Mach. Learn. Res. 2010 11 3 625-660
[8]
Granovetter M The strength of weak ties: a network theory revisited Sociol. Theory 1983 1 6 201-233
[9]
Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: KDD 2016, pp. 855–864 (2016)
[10]
Huang, X., Li, J., Hu, X.: Label informed attributed network embedding. In: Tenth ACM International Conference on Web Search and Data Mining, pp. 731–739 (2017)
[11]
Hubert L and Arabie P Comparing partitions J. Classification 1985 2 1 193-218
[12]
Kossinets G and Watts DJ Origins of homophily in an evolving social network1 Am. J. Sociol. 2009 115 2 405-450
[13]
Le, Q.V., Mikolov, T.: Distributed representations of sentences and documents, vol. 4, p. II-1188 (2014)
[14]
Leskovec, J.: Graphs over time: densification laws, shrinking diameters, explanations and realistic generators. In: KDD, pp. 177–187 (2005)
[15]
Mcauley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: International Conference on Neural Information Processing Systems, pp. 539–547 (2012)
[16]
Mccallum AK, Nigam K, Rennie J, and Seymore K Automating the construction of internet portals with machine learning Inf. Retr. 2000 3 2 127-163
[17]
Mcpherson JM and Smith-Lovin L Homophily in voluntary organizations: status distance and the composition of face-to-face groups Am. Sociol. Rev. 1987 52 3 370-379
[18]
Menche J et al. Disease networks. Uncovering disease-disease relationships through the incomplete interactome Science 2015 347 6224 1257601
[19]
Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. In: Computer Science (2013)
[20]
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., Dean, J.: Distributed representations of words and phrases and their compositionality, vol. 26, pp. 3111–3119 (2013)
[21]
Narayanan, A., Chandramohan, M., Chen, L., Liu, Y., Saminathan, S.: subgraph2vec: learning distributed representations of rooted sub-graphs from large graphs (2016)
[22]
Pan, S., Wu, J., Zhu, X., Zhang, C., Wang, Y.: Tri-party deep network representation. In: International Joint Conference on Artificial Intelligence, pp. 1895–1901 (2016)
[23]
Pennacchiotti, M., Popescu, A.M.: Democrats, republicans and starbucks afficionados: user classification in twitter. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 430–438 (2011)
[24]
Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)
[25]
Roweis ST and Saul LK Nonlinear dimensionality reduction by locally linear embedding Science 2000 290 5500 2323-6
[26]
Salakhutdinov Ruslan and Hinton Geoffrey Semantic hashing International Journal of Approximate Reasoning 2009 50 7 969-978
[27]
Tang, J., Liu, J., Zhang, M., Mei, Q.: Visualizing large-scale and high-dimensional data, vol. 37(7), pp. 287–297 (2016)
[28]
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line:large-scale information network embedding, vol. 2, pp. 1067–1077 (2015)
[29]
Tenenbaum JB, Silva VD, and Langford JC A global geometric framework for nonlinear dimensionality reduction Science 2000 290 5500 2319
[30]
Traud AL, Mucha PJ, and Porter MA Social structure of facebook networks Physica A Stat. Mech. Appl. 2012 391 16 4165-4180
[31]
Tsur, O., Rappoport, A.: What’s in a hashtag? Content based prediction of the spread of ideas in microblogging communities. In: ACM International Conference on Web Search and Data Mining, pp. 643–652 (2012)
[32]
Vinh, N.X., Epps, J., Bailey, J.: Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance (2010). JMLR.org
[33]
Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225–1234 (2016)
[34]
Yang, C., Liu, Z., Zhao, D., Sun, M., Chang, E.Y.: Network representation learning with rich text information. In: International Conference on Artificial Intelligence, pp. 2111–2117 (2015)
[35]
Zhang, D., Yin, J., Zhu, X., Zhang, C.: User profile preserving social network embedding. In: Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 3378–3384 (2017)
Recommendations
Local and Global Information Fusion for Top-N Recommendation in Heterogeneous Information Network
CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge ManagementSince heterogeneous information network (HIN) is able to integrate complex information and contain rich semantics, there is a surge of HIN based recommendation in recent years. Although existing methods have achieved performance improvement to some ...
Label Informed Attributed Network Embedding
WSDM '17: Proceedings of the Tenth ACM International Conference on Web Search and Data MiningAttributed 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 ...
Local versus global link information in the Web
Information derived from the cross-references among the documents in a hyperlinked environment, usually referred to as link information, is considered important since it can be used to effectively improve document retrieval. Depending on the retrieval ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Nov 2018
523 pages
ISBN:978-3-030-02921-0
DOI:10.1007/978-3-030-02922-7
© Springer Nature Switzerland AG 2018.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 12 November 2018
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025