Inter-Intra Information Preserving Attributed Network Embedding

To alleviate the problem caused by the sparsity of network structure which is often the case in large-scale network, attributed network embedding has attracted an increasing amount of attention. Some existing attributed network embedding models integrate linkage structure and node attribute by adding a consistency criterion on the structure representation and attribute representation, whereby the similarity between them can be ensured. However, to enforce the structure and attribute representations to be similar may cause the information distortion due to the inherent difference between these two kinds of information. Additionally, the existing models mainly focus on learning the inter-relation between structure and attribute information, while the intra-characteristic of each information is ignored, leading to the information loss. To address the above two problems, we propose a novel model named <bold>I</bold>nter-<bold>I</bold>ntra Information Preserving Attributed <bold>N</bold>etwork <bold>E</bold>mbedding (IINE) to effectively learn the node representations of attributed network, which can <italic>not only</italic> capture the inter-relation between structure and attribute information with less information distortion <italic>but also</italic> effectively preserve the intra-characteristic of each information. The proposed model is composed of a primary model named <bold>coupled autoencoder</bold> and two auxiliary models named <bold>structure miner</bold> and <bold>attribute miner</bold>. The coupled autoencoder trains the node representation by smoothly combining both structure and attribute information, while the structure miner and attribute miner are utilized to further mine the intra-characteristic from the corresponding information so as to assist the primary model. The Extensive experiments are conducted on seven real-world datasets, and the results confirm the superior performance of IINE over several state-of-the-art models.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.