Graph Regularized Transductive Classification on Heterogeneous Information Networks

  title={Graph Regularized Transductive Classification on Heterogeneous Information Networks},
  author={Ming Ji and Yizhou Sun and Marina Danilevsky and Jiawei Han and Jing Gao},
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information networks are prevalent in the real world. Sometimes, label information is available for some objects. Learning from such labeled and unlabeled data via transductive classification can lead to good knowledge extraction of the hidden network structure. However, although classification on homogeneous networks has been… 

Transductive Classification on Heterogeneous Information Networks with Edge Betweenness-based Normalization

A novel method for transductive classification on heterogeneous information networks composed of multiple types of vertices, based on the intuition that edges bridging across communities are less trustworthy, which is more effective than a state-of-the-art method, GNetMine.

Representation Learning for Classification in Heterogeneous Graphs with Application to Social Networks

A transductive approach to classification that learns to project the different types of nodes into a common latent space, and embedding is learned so as to reflect different characteristics of the problem such as the correlation between node labels, as well as the graph topology.

A Tensor-Based Markov Chain Model for Heterogeneous Information Network Collective Classification

A Tensor-based Markov chain (T-Mark) approach is proposed, which is able to automatically and simultaneously predict the labels for unlabeled nodes and give the relative importance of types of links that actually improve the classification accuracy.

HetPathMine: A Novel Transductive Classification Algorithm on Heterogeneous Information Networks

This paper uses the concept of meta path to represent the different relation paths in heterogeneous networks and proposes a novel meta path selection model, named HetPathMine, which can get higher accuracy than the existing transductive classification methods and the weight obtained for each meta path is consistent with human intuition or real-world situations.

Robust Classification of Information Networks by Consistent Graph Learning

This work proposes a novel algorithm, namely Consistent Graph Learning, which is robust to the inconsistent links of a network and outperforms the state-of-the-art methods on both homogeneous and heterogeneous network datasets.

Leveraging Meta-path Contexts for Classification in Heterogeneous Information Networks

This work proposes ConCH, a graph neural network model that formulates the classification problem as a multitask learning problem that combines semi-supervised learning with self-super supervised learning to learn from both labeled and unlabeled data.

A parameter-free label propagation algorithm using bipartite heterogeneous networks for text classification

This paper proposes a parameter-free algorithm for transductive classification of textual data, referred to as LPBHN (Label Propagation using Bipartite Heterogeneous Networks), which uses a bipartite heterogeneous network to perform the classification task.

GraphInception: Convolutional Neural Networks for Collective Classification in Heterogeneous Information Networks

A deep convolutional collective classification method, called GraphInception, is proposed, to learn the deep relational features in HINs, which involve different types of autocorrelations, from simple to complex relations, among the instances.

HRank: A Path based Ranking Framework in Heterogeneous Information Network

This paper studies the ranking problem in heterogeneous networks and proposes the HRank framework to evaluate the importance of multiple types of objects and meta paths and proposes a constrained meta path to subtly capture the rich semantics in heterogeneity networks.



Ranking-based clustering of heterogeneous information networks with star network schema

This paper studies clustering of multi-typed heterogeneous networks with a star network schema and proposes a novel algorithm, NetClus, that utilizes links across multityped objects to generate high-quality net-clusters and generates informative clusters.

Probabilistic Classification and Clustering in Relational Data

This work proposes a general class of models for classification and clustering in relational domains that capture probabilistic dependencies between related instances, and shows how to learn such models efficiently from data.

Classification in Networked Data: a Toolkit and a Univariate Case Study

The results demonstrate that very simple network-classification models perform quite well---well enough that they should be used regularly as baseline classifiers for studies of learning with networked data.

Multi-way Clustering on Relation Graphs

This paper proposes a principled multi-way clustering framework for relational data, wherein different types of entities are simultaneously clustered based not only on their intrinsic attribute values, but also on the multiple relations between the entities.

Link-Based Classification

  • Qing LuL. Getoor
  • Computer Science
    Encyclopedia of Machine Learning and Data Mining
  • 2003
A key challenge for machine learning is tackling the problem of mining richly structured data sets, where the objects are linked in some way due to either an explicit or implicit relationship that

Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples

A semi-supervised framework that incorporates labeled and unlabeled data in a general-purpose learner is proposed and properties of reproducing kernel Hilbert spaces are used to prove new Representer theorems that provide theoretical basis for the algorithms.

Discriminative Probabilistic Models for Relational Data

An alternative framework that builds on (conditional) Markov networks and addresses two limitations of the previous approach is presented, showing how to train these models effectively, and how to use approximate probabilistic inference over the learned model for collective classification of multiple related entities.

Manifold Regularization : A Geometric Framework for Learning from Examples

A semi-supervised framework that incorporates labeled and unlabeled data in a general-purpose learner is focused on and properties of Reproducing Kernel Hilbert spaces are utilized to prove new Representer theorems that provide theoretical basis for the algorithms.

Exploring social tagging graph for web object classification

An efficient algorithm is proposed which not only utilizes social tags as enriched semantic features for the objects, but also infers the categories of unlabeled objects from both homogeneous and heterogeneous labeled objects, through the implicit connection of social tags.

Relational Dependency Networks

This paper presents relational dependency networks (RDNs), graphical models that are capable of expressing and reasoning with such dependencies in a relational setting and outlines the relative strengths of RDNs---namely, the ability to represent cyclic dependencies, simple methods for parameter estimation, and efficient structure learning techniques.