Predicting Anchor Links between Heterogeneous Social Networks

People usually get involved in multiple social networks to enjoy new services or to fulfill their needs. Many new social networks try to attract users of other existing networks to increase the number of their users. Once a user (called source user) of a social network (called source network) joins a new social network (called target network), a new inter-network link (called anchor link) is formed between the source and target networks. In this paper, we concentrated on predicting the formation of such anchor links between heterogeneous social networks. Unlike conventional link prediction problems in which the formation of a link between two existing users within a single network is predicted, in anchor link prediction, the target user is missing and will be added to the target network once the anchor link is created. To solve this problem, we use meta-paths as a powerful tool for utilizing heterogeneous information in both the source and target networks. To this end, we propose an effective general meta-path-based approach called Connector and Recursive Meta-Paths (CRMP). By using those two different categories of meta-paths, we model different aspects of social factors that may affect a source user to join the target network, resulting in the formation of a new anchor link. Extensive experiments on real-world heterogeneous social networks demonstrate the effectiveness of the proposed method against the recent methods.Comment: To be published in "Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)

Link Prediction via Matrix Completion

Inspired by practical importance of social networks, economic networks, biological networks and so on, studies on large and complex networks have attracted a surge of attentions in the recent years. Link prediction is a fundamental issue to understand the mechanisms by which new links are added to the networks. We introduce the method of robust principal component analysis (robust PCA) into link prediction, and estimate the missing entries of the adjacency matrix. On one hand, our algorithm is based on the sparsity and low rank property of the matrix, on the other hand, it also performs very well when the network is dense. This is because a relatively dense real network is also sparse in comparison to the complete graph. According to extensive experiments on real networks from disparate fields, when the target network is connected and sufficiently dense, whatever it is weighted or unweighted, our method is demonstrated to be very effective and with prediction accuracy being considerably improved comparing with many state-of-the-art algorithms

Forecasting the Missing Links in Heterogeneous Social Networks

Social network analysis has gained attention from several researchers in the past time because of its wide application in capturing social interactions. One of the aims of social network analysis is to recover missing links between the users which may exist in the future but have not yet appeared due to incomplete data. The prediction of hidden or missing links in criminal networks is also a significant problem. The collection of criminal data from these networks appears to be incomplete and inconsistent which is reflected in the structure in the form of missing nodes and links. Many machine learning algorithms are applied for this detection using supervised techniques. But, supervised machine learning algorithms require large datasets for training the link prediction model for achieving optimum results. In this research, we have used a Facebook dataset to solve the problem of link prediction in a network. The two machine learning classifiers applied are LogisticRegression and K-Nearest Neighbour where KNN has higher accuracy than LR. In this article, we have proposed an algorithm Graph Sample Aggregator with Low Reciprocity, (GraphSALR), for the generation of node embeddings in larger graphs which use node feature information

Survey on Link Prediction and Page Ranking In Blogs S.Geetha

This paper presents a study of the various aspects of link prediction and page ranking in blogs. Social networks have taken on a new eminence from the prospect of the analysis of social networks, which is a recent area of research which grew out of the social sciences as well as the exact sciences, especially with the computing capacity for mathematical calculations and even modelling which was previously impossible. An essential element of social media, particularly blogs, is the hyperlink graph that connects various pieces of content. Link prediction has many applications, including recommending new items in online networks (e.g., products in eBay and Amazon, and friends in Face book), monitoring and preventing criminal activities in a criminal network, predicting the next web page users will visit, and complementing missing links in automatic web data crawlers. Page Rank is the technique used by Google to determine importance of page on the web. It considers all incoming links to a page as votes for Page Rank. Our findings provide an overview of social relations and we address the problem of page ranking and link prediction in networked data, which appears in many applications such as network analysis or recommended systems. Keywords- web log, social networks analysis, readership, link prediction, Page ranking. I

A NETWORK LINK PREDICTION MODEL BASED ON OBJECT-OBJECT MATCH METHOD

In this paper, we proposed and evaluated a new network link prediction method that can be used to predict missing links in a social network. In the proposed model, to improve the prediction accuracy, the network link prediction problem is transformed to a general object-object match prediction problem, in which the nodes of a network are regarded as objects and the neighbors of a node are regarded as the node\u27s associated features. Also a machine learning framework is devised for the systematic prediction. We compare the prediction accuracy of the proposed method with existing network link prediction methods using well-known network datasets such as a scientific co-authorship network, an e-mail communication network, and a product co-purchasing network. The results showed that the proposed approach made a significant improvement in all three networks. Also it reveals that considering the neighbor\u27s neighbors are critical to improve the prediction accuracy