Sort:
Open Access Issue
A Semi-Supervised Deep Network Embedding Approach Based on the Neighborhood Structure
Big Data Mining and Analytics 2019, 2 (3): 205-216
Published: 04 April 2019
Abstract PDF (514.4 KB) Collect
Downloads:40

Network embedding is a very important task to represent the high-dimensional network in a low-dimensional vector space, which aims to capture and preserve the network structure. Most existing network embedding methods are based on shallow models. However, actual network structures are complicated which means shallow models cannot obtain the high-dimensional nonlinear features of the network well. The recently proposed unsupervised deep learning models ignore the labels information. To address these challenges, in this paper, we propose an effective network embedding method of Structural Labeled Locally Deep Nonlinear Embedding (SLLDNE). SLLDNE is designed to obtain highly nonlinear features through utilizing deep neural network while preserving the label information of the nodes by using a semi-supervised classifier component to improve the ability of discriminations. Moreover, we exploit linear reconstruction of neighborhood nodes to enable the model to get more structural information. The experimental results of vertex classification on two real-world network datasets demonstrate that SLLDNE outperforms the other state-of-the-art methods.

Open Access Issue
A Novel Deep Hybrid Recommender System Based on Auto-encoder with Neural Collaborative Filtering
Big Data Mining and Analytics 2018, 1 (3): 211-221
Published: 24 May 2018
Abstract PDF (504.2 KB) Collect
Downloads:66

Due to the widespread availability of implicit feedback (e.g., clicks and purchases), some researchers have endeavored to design recommender systems based on implicit feedback. However, unlike explicit feedback, implicit feedback cannot directly reflect user preferences. Therefore, although more challenging, it is also more practical to use implicit feedback for recommender systems. Traditional collaborative filtering methods such as matrix factorization, which regards user preferences as a linear combination of user and item latent vectors, have limited learning capacities and suffer from data sparsity and the cold-start problem. To tackle these problems, some authors have considered the integration of a deep neural network to learn user and item features with traditional collaborative filtering. However, there is as yet no research combining collaborative filtering and content-based recommendation with deep learning. In this paper, we propose a novel deep hybrid recommender system framework based on auto-encoders (DHA-RS) by integrating user and item side information to construct a hybrid recommender system and enhance performance. DHA-RS combines stacked denoising auto-encoders with neural collaborative filtering, which corresponds to the process of learning user and item features from auxiliary information to predict user preferences. Experiments performed on the real-world dataset reveal that DHA-RS performs better than state-of-the-art methods.

Open Access Issue
PBNA: An Improved Probabilistic Biological Network Alignment Method
Tsinghua Science and Technology 2014, 19 (6): 658-667
Published: 20 November 2014
Abstract PDF (497.5 KB) Collect
Downloads:16

Biological network alignment is an important research topic in the field of bioinformatics. Nowadays almost every existing alignment method is designed to solve the deterministic biological network alignment problem. However, it is worth noting that interactions in biological networks, like many other processes in the biological realm, are probabilistic events. Therefore, more accurate and better results can be obtained if biological networks are characterized by probabilistic graphs. This probabilistic information, however, increases difficulties in analyzing networks and only few methods can handle the probabilistic information. Therefore, in this paper, an improved Probabilistic Biological Network Alignment (PBNA) is proposed. Based on IsoRank, PBNA is able to use the probabilistic information. Furthermore, PBNA takes advantages of Contributor and Probability Generating Function (PGF) to improve the accuracy of node similarity value and reduce the computational complexity of random variables in similarity matrix. Experimental results on dataset of the Protein-Protein Interaction (PPI) networks provided by Todor demonstrate that PBNA can produce some alignment results that ignored by the deterministic methods, and produce more biologically meaningful alignment results than IsoRank does in most of the cases based on the Gene Ontology Consistency (GOC) measure. Compared with Prob method, which is designed exactly to solve the probabilistic alignment problem, PBNA can obtain more biologically meaningful mappings in less time.

Total 3