scholarly journals Joint Representation Learning for Multi-Modal Transportation Recommendation

2019 ◽  
Vol 33 ◽  
pp. 1036-1043 ◽  
Author(s):  
Hao Liu ◽  
Ting Li ◽  
Renjun Hu ◽  
Yanjie Fu ◽  
Jingjing Gu ◽  
...  
Keyword(s):  
Large Scale ◽  
Optimization Problem ◽  
Representation Learning ◽  
Transport Networks ◽  
Successful Development ◽  
Multimodal Transportation ◽  
Learning Framework ◽  
Transportation Modes ◽  
Transport Modes ◽  
Joint Representation

Multi-modal transportation recommendation has a goal of recommending a travel plan which considers various transportation modes, such as walking, cycling, automobile, and public transit, and how to connect among these modes. The successful development of multi-modal transportation recommendation systems can help to satisfy the diversified needs of travelers and improve the efficiency of transport networks. However, existing transport recommender systems mainly focus on unimodal transport planning. To this end, in this paper, we propose a joint representation learning framework for multi-modal transportation recommendation based on a carefully-constructed multi-modal transportation graph. Specifically, we first extract a multi-modal transportation graph from large-scale map query data to describe the concurrency of users, Origin-Destination (OD) pairs, and transport modes. Then, we provide effective solutions for the optimization problem and develop an anchor embedding for transport modes to initialize the embeddings of transport modes. Moreover, we infer user relevance and OD pair relevance, and incorporate them to regularize the representation learning. Finally, we exploit the learned representations for online multimodal transportation recommendations. Indeed, our method has been deployed into one of the largest navigation Apps to serve hundreds of millions of users, and extensive experimental results with real-world map query data demonstrate the enhanced performance of the proposed method for multimodal transportation recommendations.

scholarly journals Determining the most suitable layout of space for the loading units’ handling in the maritime port

Transport ◽  
2016 ◽  
Vol 33 (1) ◽  
pp. 280-290 ◽  
Author(s):  
Ondrej Stopka ◽  
Rudolf Kampf
Keyword(s):  
Transport Process ◽  
Large Scale ◽  
Cost Effective ◽  
Freight Transport ◽  
Maritime Transport ◽  
Transport Networks ◽  
Transport Modes ◽  
Mode Of Transport

The main advantages of maritime transport are (1) lowest costs, (2) large-scale carriage capacity, (3) carriage of different goods over long distances and (4) the most acceptable mode of transport in the context of the environment. This mode of transport is considered more profitable and more cost-effective than all other transport modes. Modern maritime ports have become the essential nodal components of freight transport networks. This paper is focused on determining the most suitable layout of space for the loading units warehousing and handling in the maritime port using the particular method. In the paper, four types of layout and five criteria were taken into account. Layout of warehousing and handling space can affect the entire transport process and can have a great effect on the economics of enterprises.

scholarly journals Graph Debiased Contrastive Learning with Joint Representation Clustering

2021 ◽  
Author(s):  
Han Zhao ◽  
Xu Yang ◽  
Zhenru Wang ◽  
Erkun Yang ◽  
Cheng Deng
Keyword(s):  
State Of The Art ◽  
False Negative ◽  
Poor Performance ◽  
Representation Learning ◽  
Graph Representation ◽  
Learning Framework ◽  
Clustering And Classification ◽  
Class Information ◽  
Classification Tasks ◽  
Joint Representation

By contrasting positive-negative counterparts, graph contrastive learning has become a prominent technique for unsupervised graph representation learning. However, existing methods fail to consider the class information and will introduce false-negative samples in the random negative sampling, causing poor performance. To this end, we propose a graph debiased contrastive learning framework, which can jointly perform representation learning and clustering. Specifically, representations can be optimized by aligning with clustered class information, and simultaneously, the optimized representations can promote clustering, leading to more powerful representations and clustering results. More importantly, we randomly select negative samples from the clusters which are different from the positive sample's cluster. In this way, as the supervisory signals, the clustering results can be utilized to effectively decrease the false-negative samples. Extensive experiments on five datasets demonstrate that our method achieves new state-of-the-art results on graph clustering and classification tasks.

scholarly journals Edge Caching for D2D Enabled Hierarchical Wireless Networks with Deep Reinforcement Learning

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Wenkai Li ◽  
Chenyang Wang ◽  
Ding Li ◽  
Bin Hu ◽  
Xiaofei Wang ◽  
...  
Keyword(s):  
Decision Process ◽  
Large Scale ◽  
Optimization Problem ◽  
Base Stations ◽  
Learning Framework ◽  
Markov Decision ◽  
Low Efficiency ◽  
Replacement Problem ◽  
User Device ◽  
Edge Caching

Edge caching is a promising method to deal with the traffic explosion problem towards future network. In order to satisfy the demands of user requests, the contents can be proactively cached locally at the proximity to users (e.g., base stations or user device). Recently, some learning-based edge caching optimizations are discussed. However, most of the previous studies explore the influence of dynamic and constant expanding action and caching space, leading to unpracticality and low efficiency. In this paper, we study the edge caching optimization problem by utilizing the Double Deep Q-network (Double DQN) learning framework to maximize the hit rate of user requests. Firstly, we obtain the Device-to-Device (D2D) sharing model by considering both online and offline factors and then we formulate the optimization problem, which is proved as NP-hard. Then the edge caching replacement problem is derived by Markov decision process (MDP). Finally, an edge caching strategy based on Double DQN is proposed. The experimental results based on large-scale actual traces show the effectiveness of the proposed framework.

HERMAS

2021 ◽  
Vol 5 (3) ◽  
pp. 1-21
Author(s):  
Yiwei Song ◽  
Dongzhe Jiang ◽  
Yunhuai Liu ◽  
Zhou Qin ◽  
Chang Tan ◽  
...  
Keyword(s):  
Large Scale ◽  
Human Mobility ◽  
Representation Learning ◽  
User Profiling ◽  
Similarity Measurement ◽  
Learning Framework ◽  
Computation Efficiency ◽  
Trajectory Similarity ◽  
Spatio Temporal ◽  
Embedding Performance

Efficient representations for spatio-temporal cellular Signaling Data (SD) are essential for many human mobility applications. Traditional representation methods are mainly designed for GPS data with high spatio-temporal continuity, and thus will suffer from poor embedding performance due to the unique Ping Pong Effect in SD. To address this issue, we explore the opportunity offered by a large number of human mobility traces and mine the inherent neighboring tower connection patterns. More specifically, we design HERMAS, a novel representation learning framework for large-scale cellular SD with three steps: (1) extract rich context information in each trajectory, adding neighboring tower information as extra knowledge in each mobility observation; (2) design a sequence encoding model to aggregate the embedding of each observation; (3) obtain the embedding for a trajectory. We evaluate the performance of HERMAS based on two human mobility applications, i.e. trajectory similarity measurement and user profiling. We conduct evaluations based on a 30-day SD dataset with 130,612 users and 2,369,267 moving trajectories. Experimental results show that (1) for the trajectory similarity measurement application, HERMAS improves the Hitting Rate (HR@10) from 15.2% to 39.2%; (2) for the user profiling application, HERMAS improves the F1-score for around 9%. More importantly, HERMAS significantly improves the computation efficiency by over 30x.

The Research on Transportation Modes Combinatorial Optimization Model in Multimodal Transportation System

2015 ◽  
Vol 744-746 ◽  
pp. 1915-1918
Author(s):  
Shou Wen Ji ◽  
Kai Di Sun ◽  
Kai Lv
Keyword(s):  
Genetic Algorithm ◽  
Combinatorial Optimization ◽  
Optimization Model ◽  
Optimization Problem ◽  
Transportation System ◽  
Optimal Model ◽  
Efficient Tool ◽  
Multimodal Transportation ◽  
Network Characteristic ◽  
Transportation Modes

This papers focus on the transportation optimal model and algorithm in the multimodal transportation. According to the network characteristic of multimodal transportation system, the transportation modes combinatorial optimization model is designed. Considering the complexity of multimodal transportation, Genetic Algorithm (GA) is used as the efficient tool to solve the optimization problem. At last we use an example to verify the feasibility of the model.

Unifying Heterogenous Electronic Health Records Systems via Text-Based Code Embedding: Study of Predictive Modeling (Preprint)

2021 ◽  
Author(s):  
Kyunghoon Hur ◽  
Jiyoung Lee ◽  
Jungwoo Oh ◽  
Wesley Price ◽  
Young-Hak Kim ◽  
...  
Keyword(s):  
Electronic Health Records ◽  
Predictive Modeling ◽  
Large Scale ◽  
Representation Learning ◽  
Superior Performance ◽  
Health Records ◽  
Learning Framework ◽  
Learning Scenarios ◽  
Electronic Health ◽  
Medical Concepts

BACKGROUND Substantial increase in the use of Electronic Health Records (EHRs) has opened new frontiers for predictive healthcare. However, while EHR systems are nearly ubiquitous, they lack a unified code system for representing medical concepts. Heterogeneous formats of EHR present a substantial barrier for the training and deployment of state-of-the-art deep learning models at scale. OBJECTIVE The aim of this study is to suggest a novel text embedding approach to overcome heterogeneity of EHR structure among different EHR systems. METHODS We introduce Description-based Embedding, DescEmb, a code-agnostic description-based representation learning framework for predictive modeling on EHR. DescEmb takes advantage of the flexibility of neural language understanding models while maintaining a neutral approach that can be combined with prior frameworks for task-specific representation learning or predictive modeling. RESULTS Based on five prediction tasks with two heterogeneous EHR datasets, DescEmb achieves comparable or superior performance to the traditional code-based embedding approach, especially under the zero-shot and few-shot transfer learning scenarios. We also demonstrate that DescEmb enables us to train a single model on a pooled dataset from heterogeneous EHR systems and achieve the same, if not better performance compared to training separate models for each EHR system. CONCLUSIONS Based on the promising results, we believe the description-based embedding approach on EHR will open a new direction for large-scale predictive modeling in healthcare.

A Drug Target Interaction Prediction Based on LINE-RF Learning

2020 ◽  
Vol 15 (7) ◽  
pp. 750-757
Author(s):  
Jihong Wang ◽  
Yue Shi ◽  
Xiaodan Wang ◽  
Huiyou Chang
Keyword(s):  
Network Topology ◽  
Drug Target ◽  
Large Scale ◽  
Representation Learning ◽  
New Drugs ◽  
Combination Method ◽  
Learning Methods ◽  
Network Representation ◽  
On Line ◽  
Clinical Experiments

Background: At present, using computer methods to predict drug-target interactions (DTIs) is a very important step in the discovery of new drugs and drug relocation processes. The potential DTIs identified by machine learning methods can provide guidance in biochemical or clinical experiments. Objective: The goal of this article is to combine the latest network representation learning methods for drug-target prediction research, improve model prediction capabilities, and promote new drug development. Methods: We use large-scale information network embedding (LINE) method to extract network topology features of drugs, targets, diseases, etc., integrate features obtained from heterogeneous networks, construct binary classification samples, and use random forest (RF) method to predict DTIs. Results: The experiments in this paper compare the common classifiers of RF, LR, and SVM, as well as the typical network representation learning methods of LINE, Node2Vec, and DeepWalk. It can be seen that the combined method LINE-RF achieves the best results, reaching an AUC of 0.9349 and an AUPR of 0.9016. Conclusion: The learning method based on LINE network can effectively learn drugs, targets, diseases and other hidden features from the network topology. The combination of features learned through multiple networks can enhance the expression ability. RF is an effective method of supervised learning. Therefore, the Line-RF combination method is a widely applicable method.

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 A Novel Method to Predict Drug-Target Interactions Based on Large-Scale Graph Representation Learning

Cancers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 2111
Author(s):  
Bo-Wei Zhao ◽  
Zhu-Hong You ◽  
Lun Hu ◽  
Zhen-Hao Guo ◽  
Lei Wang ◽  
...  
Keyword(s):  
Drug Target ◽  
Large Scale ◽  
Computational Models ◽  
Structural Information ◽  
Characteristic Curve ◽  
Representation Learning ◽  
Graph Representation ◽  
Convolutional Network ◽  
Novel Method

Identification of drug-target interactions (DTIs) is a significant step in the drug discovery or repositioning process. Compared with the time-consuming and labor-intensive in vivo experimental methods, the computational models can provide high-quality DTI candidates in an instant. In this study, we propose a novel method called LGDTI to predict DTIs based on large-scale graph representation learning. LGDTI can capture the local and global structural information of the graph. Specifically, the first-order neighbor information of nodes can be aggregated by the graph convolutional network (GCN); on the other hand, the high-order neighbor information of nodes can be learned by the graph embedding method called DeepWalk. Finally, the two kinds of feature are fed into the random forest classifier to train and predict potential DTIs. The results show that our method obtained area under the receiver operating characteristic curve (AUROC) of 0.9455 and area under the precision-recall curve (AUPR) of 0.9491 under 5-fold cross-validation. Moreover, we compare the presented method with some existing state-of-the-art methods. These results imply that LGDTI can efficiently and robustly capture undiscovered DTIs. Moreover, the proposed model is expected to bring new inspiration and provide novel perspectives to relevant researchers.

Sign in / Sign up

Export Citation Format

Share Document