Blog
About

2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A General Framework for Content-enhanced Network Representation Learning

      Preprint

      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          This paper investigates the problem of network embedding, which aims at learning low-dimensional vector representation of nodes in networks. Most existing network embedding methods rely solely on the network structure, i.e., the linkage relationships between nodes, but ignore the rich content information associated with it, which is common in real world networks and beneficial to describing the characteristics of a node. In this paper, we propose content-enhanced network embedding (CENE), which is capable of jointly leveraging the network structure and the content information. Our approach integrates text modeling and structure modeling in a general framework by treating the content information as a special kind of node. Experiments on several real world net- works with application to node classification show that our models outperform all existing network embedding methods, demonstrating the merits of content information and joint learning.

          Related collections

          Most cited references 3

          • Record: found
          • Abstract: not found
          • Article: not found

          Long Short-Term Memory

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Nonlinear dimensionality reduction by locally linear embedding.

            Many areas of science depend on exploratory data analysis and visualization. The need to analyze large amounts of multivariate data raises the fundamental problem of dimensionality reduction: how to discover compact representations of high-dimensional data. Here, we introduce locally linear embedding (LLE), an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs. Unlike clustering methods for local dimensionality reduction, LLE maps its inputs into a single global coordinate system of lower dimensionality, and its optimizations do not involve local minima. By exploiting the local symmetries of linear reconstructions, LLE is able to learn the global structure of nonlinear manifolds, such as those generated by images of faces or documents of text.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Latent Space Approaches to Social Network Analysis

                Bookmark

                Author and article information

                Journal
                2016-10-10
                Article
                1610.02906

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                Custom metadata
                cs.SI cs.LG

                Social & Information networks, Artificial intelligence

                Comments

                Comment on this article