scholarly journals Coupling network vertex representation learning based on network embedding method

2020 ◽  
Vol 50 (8) ◽  
pp. 1197-1216
Author(s):  
Dagao DUAN ◽  
Dan LIU ◽  
Wen LIU ◽  
Zhongming HAN ◽  
Chenye ZHENG ◽  
...  
Keyword(s):  
Representation Learning ◽  
Network Embedding ◽  
Embedding Method ◽  
Vertex Representation

scholarly journals Learning Network Embedding with Community Structural Information

2019 ◽  
Author(s):  
Yu Li ◽  
Ying Wang ◽  
Tingting Zhang ◽  
Jiawei Zhang ◽  
Yi Chang
Keyword(s):  
Community Structure ◽  
Link Prediction ◽  
Structural Information ◽  
Representation Learning ◽  
Network Embedding ◽  
Learning Network ◽  
Optimization Framework ◽  
Vertex Representation ◽  
Low Dimensional ◽  
Embedding Methods

Network embedding is an effective approach to learn the low-dimensional representations of vertices in networks, aiming to capture and preserve the structure and inherent properties of networks. The vast majority of existing network embedding methods exclusively focus on vertex proximity of networks, while ignoring the network internal community structure. However, the homophily principle indicates that vertices within the same community are more similar to each other than those from different communities, thus vertices within the same community should have similar vertex representations. Motivated by this, we propose a novel network embedding framework NECS to learn the Network Embedding with Community Structural information, which preserves the high-order proximity and incorporates the community structure in vertex representation learning. We formulate the problem into a principled optimization framework and provide an effective alternating algorithm to solve it. Extensive experimental results on several benchmark network datasets demonstrate the effectiveness of the proposed framework in various network analysis tasks including network reconstruction, link prediction and vertex classification.

W-MMP2Vec: Topic-driven network embedding model for link prediction in content-based heterogeneous information network

2021 ◽  
Vol 25 (3) ◽  
pp. 711-738
Author(s):  
Phu Pham ◽  
Phuc Do
Keyword(s):  
Link Prediction ◽  
Representation Learning ◽  
Information Network ◽  
Network Embedding ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Learning Framework ◽  
Novel Approach ◽  
Proposed Model ◽  
Meta Path

Link prediction on heterogeneous information network (HIN) is considered as a challenge problem due to the complexity and diversity in types of nodes and links. Currently, there are remained challenges of meta-path-based link prediction in HIN. Previous works of link prediction in HIN via network embedding approach are mainly focused on exploiting features of node rather than existing relations in forms of meta-paths between nodes. In fact, predicting the existence of new links between non-linked nodes is absolutely inconvincible. Moreover, recent HIN-based embedding models also lack of thorough evaluations on the topic similarity between text-based nodes along given meta-paths. To tackle these challenges, in this paper, we proposed a novel approach of topic-driven multiple meta-path-based HIN representation learning framework, namely W-MMP2Vec. Our model leverages the quality of node representations by combining multiple meta-paths as well as calculating the topic similarity weight for each meta-path during the processes of network embedding learning in content-based HINs. To validate our approach, we apply W-TMP2Vec model in solving several link prediction tasks in both content-based and non-content-based HINs (DBLP, IMDB and BlogCatalog). The experimental outputs demonstrate the effectiveness of proposed model which outperforms recent state-of-the-art HIN representation learning models.

scholarly journals Analysis and Classification of Word Co-Occurrence Networks From Alzheimer’s Patients and Controls

2021 ◽  
Vol 3 ◽  
Author(s):  
Tristan Millington ◽  
Saturnino Luz
Keyword(s):  
Word Frequency ◽  
Mean Squared Error ◽  
Cognitive Test ◽  
Edge Density ◽  
Network Embedding ◽  
Embedding Method ◽  
Control Networks ◽  
Network Measures ◽  
Network Properties ◽  
And Control

In this paper we construct word co-occurrence networks from transcript data of controls and patients with potential Alzheimer’s disease using the ADReSS challenge dataset of spontaneous speech. We examine measures of the structure of these networks for significant differences, finding that networks from Alzheimer’s patients have a lower heterogeneity and centralization, but a higher edge density. We then use these measures, a network embedding method and some measures from the word frequency distribution to classify the transcripts into control or Alzheimer’s, and to estimate the cognitive test score of a participant based on the transcript. We find it is possible to distinguish between the AD and control networks on structure alone, achieving 66.7% accuracy on the test set, and to predict cognitive scores with a root mean squared error of 5.675. Using the network measures is more successful than using the network embedding method. However, if the networks are shuffled we find relatively few of the measures are different, indicating that word frequency drives many of the network properties. This observation is borne out by the classification experiments, where word frequency measures perform similarly to the network measures.

scholarly journals ProNE: Fast and Scalable Network Representation Learning

2019 ◽  
Author(s):  
Jie Zhang ◽  
Yuxiao Dong ◽  
Yan Wang ◽  
Jie Tang ◽  
Ming Ding
Keyword(s):  
Large Scale ◽  
Sparse Matrix ◽  
Representation Learning ◽  
Second Step ◽  
Network Embedding ◽  
Network Mining ◽  
Large Scale Networks ◽  
Scalable Network ◽  
Relative Gains ◽  
Sparse Matrix Factorization

Recent advances in network embedding has revolutionized the field of graph and network mining. However, (pre-)training embeddings for very large-scale networks is computationally challenging for most existing methods. In this work, we present ProNE---a fast, scalable, and effective model, whose single-thread version is 10--400x faster than efficient network embedding benchmarks with 20 threads, including LINE, DeepWalk, node2vec, GraRep, and HOPE. As a concrete example, the single-version ProNE requires only 29 hours to embed a network of hundreds of millions of nodes while it takes LINE weeks and DeepWalk months by using 20 threads. To achieve this, ProNE first initializes network embeddings efficiently by formulating the task as sparse matrix factorization. The second step of ProNE is to enhance the embeddings by propagating them in the spectrally modulated space. Extensive experiments on networks of various scales and types demonstrate that ProNE achieves both effectiveness and significant efficiency superiority when compared to the aforementioned baselines. In addition, ProNE's embedding enhancement step can be also generalized for improving other models at speed, e.g., offering >10% relative gains for the used baselines. 

Prediction of Drug Combinations with a Network Embedding Method

2019 ◽  
Vol 21 (10) ◽  
pp. 789-797 ◽  
Author(s):  
Tianyun Wang ◽  
Lei Chen ◽  
Xian Zhao
Keyword(s):  
Computational Methods ◽  
Drug Combination ◽  
Chemical Interaction ◽  
Drug Combinations ◽  
Computational Techniques ◽  
Svm Classifier ◽  
Network Embedding ◽  
Embedding Method ◽  
Topological Features ◽  
Individual Features

Aim and Objective: There are several diseases having a complicated mechanism. For such complicated diseases, a single drug cannot treat them very well because these diseases always involve several targets and single targeted drugs cannot modulate these targets simultaneously. Drug combination is an effective way to treat such diseases. However, determination of effective drug combinations is time- and cost-consuming via traditional methods. It is urgent to build quick and cheap methods in this regard. Designing effective computational methods incorporating advanced computational techniques to predict drug combinations is an alternative and feasible way. Method: In this study, we proposed a novel network embedding method, which can extract topological features of each drug combination from a drug network that was constructed using chemical-chemical interaction information retrieved from STITCH. These topological features were combined with individual features of drug combination reported in one previous study. Several advanced computational methods were employed to construct an effective prediction model, such as synthetic minority oversampling technique (SMOTE) that was used to tackle imbalanced dataset, minimum redundancy maximum relevance (mRMR) and incremental feature selection (IFS) methods that were adopted to analyze features and extract optimal features for building an optimal support machine vector (SVM) classifier. Results and Conclusion: The constructed optimal SVM classifier yielded an MCC of 0.806, which is superior to the classifier only using individual features with or without SMOTE. The performance of the classifier can be improved by combining the topological features and essential features of a drug combination.

Sign in / Sign up

Export Citation Format

Share Document