Query-dependent cross-domain ranking in heterogeneous network

Many complex systems derived from nature and society consist of multiple types of entities and heterogeneous interactions, which can be effectively modeled as heterogeneous information network (HIN). Structural analysis of heterogeneous networks is of great significance by leveraging the rich semantic information of objects and links in the heterogeneous networks. And, clustering heterogeneous networks aims to group vertices into classes, which sheds light on revealing the structure–function relations of the underlying systems. The current algorithms independently perform the feature extraction and clustering, which are criticized for not fully characterizing the structure of clusters. In this study, we propose a learning model by joint <underline>G</underline>raph <underline>E</underline>mbedding and <underline>N</underline>onnegative <underline>M</underline>atrix <underline>F</underline>actorization (aka GEjNMF ), where feature extraction and clustering are simultaneously learned by exploiting the graph embedding and latent structure of networks. We formulate the objective function of GEjNMF and transform the heterogeneous network clustering problem into a constrained optimization problem, which is effectively solved by l 0 -norm optimization. The advantage of GEjNMF is that features are selected under the guidance of clustering, which improves the performance and saves the running time of algorithms at the same time. The experimental results on three benchmark heterogeneous networks demonstrate that GEjNMF achieves the best performance with the least running time compared with the best state-of-the-art methods. Furthermore, the proposed algorithm is robust across heterogeneous networks from various fields. The proposed model and method provide an effective alternative for heterogeneous network clustering.

Finding different types of communities has become a research hot spot in network science. Plenty of the real-world systems containing different types of objects and relationships can be perfectly described as the heterogeneous networks. However, most of the current research on community detection is applied for the homogeneous networks, while there is no effective function to quantify the quality of the community structure in heterogeneous networks. In this paper, we first propose the null model with the same heterogeneous node degree distribution of the original heterogeneous networks. The probability of there being an edge between two nodes is given to build the modularity function of the heterogeneous networks. Based on our modularity function, a fast algorithm of community detection is proposed for the large scale heterogeneous networks. We use the algorithm to detect the communities in the real-world twitter event networks. The experimental results show that our method perform better than other exciting algorithms and demonstrate that the modularity function of the heterogeneous networks is an effective parameter that can be used to quantify the quality of the community structure in heterogeneous networks.

Recently, there is a surge of interests on heterogeneous information network analysis. Although evaluating the importance of objects has been well studied in homogeneous networks, it is not yet exploited in heterogeneous networks. In this paper, we study the ranking problem in heterogeneous networks and propose the HRank method to evaluate the importance of multiple types of objects and meta paths. A constrained meta path is proposed to subtly capture the rich semantics in heterogeneous networks. Since the importance of objects depends upon the meta paths in heterogeneous networks, HRank develops a path based random walk process. Furthermore, HRank can simultaneously determine the importance of objects and meta paths through applying the tensor analysis. Experiments on three real datasets show that HRank can effectively evaluate the importance of objects and paths together. Moreover, the constrained meta path shows its potential on mining subtle semantics by obtaining more accurate ranking results.

Heterogeneous information networks have drawn much attention in recent years due to their significant applications, such as text mining, e-commerce, social networks, and bioinformatics. Clustering different types of objects simultaneously based upon not only their relations of the same type, but also the relations between different types of objects can improve the clustering quality mutually. In this paper, we propose a general model, in which both the homogeneous and heterogeneous relations are considered simultaneously, to describe the structure of the heterogeneous information networks and devise a novel parametric free multi-type overlapped clustering approach. In this model, different types of relations between different types of objects are represented by a group of matrices. In this way, we transfer the multi-type clustering problem into the information compression problem. Subsequently, greedy search approaches, which aim at describing the group of relational matrices with least bits, are proposed. Moreover, by discovering the discriminative clusters among different types of objects, we devise effective parameter-free strategies to discover either overlapping or non-overlapping structure among different types of clusters. Extensive experiments on real-world and synthetic data sets demonstrate our methods are effective and efficient.

Clustering and ranking have been successfully applied independently to homogeneous information networks, containing only one type of objects. However, real-world information networks are oftentimes heterogeneous, containing multiple types of objects and links. Recent research has shown that clustering and ranking can actually mutually enhance each other, and several techniques have been developed to integrate clustering and ranking together on a heterogeneous information network. To the best of our knowledge, however, all of such techniques assume the network follows a certain schema. In this paper, we propose a probabilistic generative model that simultaneously achieves clustering and ranking on a heterogeneous network that can follow arbitrary schema, where the edges from different types are sampled from a Poisson distribution with the parameters determined by the ranking scores of the nodes in each cluster. A variational Bayesian inference method is proposed to learn these parameters, which can be used to output ranking and clusters simultaneously. Our method is evaluated on both synthetic and real-world networks extracted from the DBLP and YELP data. Experimental results show that our method outperforms the state-of-the-art baselines.

Nowadays, the wide use of the Internet around the world allows people to socialize and connect together. This results of the explosion of the Web 2.0 giving rise to a growing demand for Social Recommendation Systems. Social recommendation systems are introduced to rescue users from searching and choosing by predicting users’ preferences. In this paper, we will focus on recommendation via link prediction across heterogeneous social network. The main objective is to recommend items by predicting the missing or unobserved interactions between actors within a social network while pinpointing different types of objects and links. Probabilistic relational models will be used for prediction of new interactions in a citation network.

Heterogeneous networks are useful for modeling complex systems that consist of different types of objects. However, there are limited statistical models to deal with heterogeneous networks. In this paper, we propose a statistical model for community detection in heterogeneous networks. We formulate a heterogeneous version of the mixed membership stochastic blockmodel to accommodate heterogeneity in the data and the content dependent property of the pairwise relationship. We also apply a variational algorithm for posterior inference. The proposed procedure is shown to be consistent for community detection under mixed membership stochastic blockmodels for heterogeneous networks. We demonstrate the advantage of the proposed method in modeling overlapping communities and multiple memberships through simulation studies and applications to a real data set.

Mining different types of communities from web data have attracted a lot of research efforts in recent years. However, none of the existing community mining techniques has taken into account both the dynamic as well as heterogeneous nature of web data. In this paper, we propose to characterize and predict community members from the evolution of heterogeneous web data. We first propose a general framework for analyzing the evolution of heterogeneous networks. Then, the academic network, which is extracted from 1 million computer science papers, is used as an example to illustrate the framework. Finally, two example applications of the academic network are presented. Experimental results with a real and very large heterogeneous academic network show that our proposed framework can produce good results in terms of community member recommendation. Also, novel knowledge and insights can be gained by analyzing the community evolution pattern.

A relation-aware heterogeneous graph convolutional network for relationship prediction

Citation recommendation is of great value in scientific research during the era of big scholarly data. The task deals with different object types (e.g., paper, author, etc.) and relation types, which naturally constitute a heterogeneous information network (HIN). In order to capture semantic relations and attribute values on relations, we propose a Weighted Heterogeneous Information Network Containing Semantic Linking algorithm (WHIN-CSL) to recommend references. Firstly, we construct a weighted HIN consisting of two kinds of vertexes (papers and authors) and four kinds of relations (semantic linking, citing, writing and co-author). Secondly, we use the network representation learning method to obtain feature representation of each vertex, then we can compute the similarity between vertexes. Finally, we recommend references through linear combination among multimodal similarities. Experimental results on two real-world datasets show that WHIN-CSL achieves better performance because of the flexibly integrating information with the help of weighted HIN containing semantic linking.

This research introduces a new collaborators recommendation model based on multi-feature fusion. Specifically, we use a tree structure to integrate scholar information and extract content features from a scholar tree by using a Tree2vector-CLE model. Then, from the heterogeneous academic network, we extract the meta-path feature between scholars, which quantifies the similarity and co-operation potential between scholars from a multidimensional perspective. By combining content and meta-path features, we reconstruct a co-authorship network. Finally, we use the network representation learning method to represent the nodes in the reconstructed co-authorship network where the top-k collaborators are recommended for the target scholar with the random walk strategy controlled by the meta-path feature weighting. Experimental results on a real dataset demonstrate that our proposed method is effective in the task of collaborators recommendation.KeywordsCollaborators recommendationScholars representationMeta-path featuresNetwork representation learning

Phenotype prediction aims to infer the traits of living organisms based on genomics data, which has important applications in biology such as cancer subtype diagnosis and crop breedings. Traditional phenotype prediction approaches only learn the low-dimensional representation of samples, but ignore the interaction between biomolecules and cannot use the topology structure of heterogeneous molecular networks. Furthermore, most of them lack interpretability and do not effectively identify key biomolecules associated with phenotypes. In this paper, we propose a heterogeneous network embedding based solution (PhenoHNE) to predict phenotype by fusing topology information of molecules. PhenoHNE firstly utilizes variational graph autoencode (VGAE) to obtain the embedding representation of molecules in the heterogeneous network. Secondly, PhenoHNE adopts multilayer perceptron (MLP) with attention mechanism to learn sample representation. Finally, it fuses molecular embedding representation and sample representation to predict the phenotype of samples. In this way, the genetics information of heterogeneous molecular network can further guide the feature learning of samples and improve the prediction performance. Experimental results on human and maize datasets confirm that PhenoHNE outperforms competitive methods by a large margin under different evaluation protocols, and it also can effectively identify the key molecules associated with phenotypes of interests.

Digital advertising is a critical part of many e-commerce platforms such as Taobao and Amazon. While in recent years a lot of attention has been drawn to the consumer side including canonical problems like ctr/cvr prediction, the advertiser side, which directly serves advertisers by providing them with marketing tools, is now playing a more and more important role. When speaking of sponsored search, bid keyword recommendation is the fundamental service. This paper addresses the problem of keyword matching, the primary step of keyword recommendation. Existing methods for keyword matching merely consider modeling relevance based on a single type of relation among ads and keywords, such as query clicks or text similarity, which neglects rich heterogeneous interactions hidden behind them. To fill this gap, the keyword matching problem faces several challenges including: 1) how to learn enriched and robust embeddings from complex interactions among various types of objects; 2) how to conduct high-quality matching for new ads that usually lack sufficient data. To address these challenges, we develop a heterogeneous-graph-neural-network-based model for keyword matching named HetMatch, which has been deployed both online and offline at the core sponsored search platform of Alibaba Group. To extract enriched and robust embeddings among rich relations, we design a hierarchical structure to fuse and enhance the relevant neighborhood patterns both on the micro and the macro level. Moreover, by proposing a multi-view framework, the model is able to involve more positive samples for cold-start ads. Experimental results on a large-scale industrial dataset as well as online AB tests exhibit the effectiveness of HetMatch.

A heterogeneous correlation network represents relationships (edges) among source-typed and attribute-typed objects (nodes). It can be used to model an academic collaboration network, describing connections among authors and published papers. To date, there has been little research into mining communities in heterogeneous networks. The objective of our research is to discover overlapping communities that include all node and edge types in a heterogeneous correlation network. We describe an algorithm, OHC, that detects overlapping communities in heterogeneous correlation networks. Inspired by a homogeneous community scoring function, Triangle Participation Ratio (TPR), OHC finds target heterogeneous communities then expands them recursively with triangle-forming nodes. Experiments on different real world networks demonstrate that OHC identifies heterogeneous communities that are tightly connected internally according to two traditional scoring functions. Additionally, analyzing the top ranking heterogeneous communities in a case study, we evaluate the results qualitatively.

The paper presents an approach to mining heterogeneous information networks by decomposing them into homogeneous networks. The proposed HINMINE methodology is based on previous work that classifies nodes in a heterogeneous network in two steps. In the first step the heterogeneous network is decomposed into one or more homogeneous networks using different connecting nodes. We improve this step by using new methods inspired by weighting of bag-of-words vectors mostly used in information retrieval. The methods assign larger weights to nodes which are more informative and characteristic for a specific class of nodes. In the second step, the resulting homogeneous networks are used to classify data either by network propositionalization or label propagation. We propose an adaptation of the label propagation algorithm to handle imbalanced data and test several classification algorithms in propositionalization. The new methodology is tested on three data sets with different properties. For each data set, we perform a series of experiments and compare different heuristics used in the first step of the methodology. We also use different classifiers which can be used in the second step of the methodology when performing network propositionalization. Our results show that HINMINE, using different network decomposition methods, can significantly improve the performance of the resulting classifiers, and also that using a modified label propagation algorithm is beneficial when the data set is imbalanced.