Cong Tran

Cong Tran

Auto-generated profile, based on publicly available information

Cong Tran

Posts and Telecommunications Institute of Technology

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 October 2020 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
CTCong Tran
Cong Tran
Won-Yong ShinWon-Yong Shin
Won-Yong Shin
ASAndreas Spitz
Andreas Spitz
MGMichael Gertz
Michael Gertz
Most network data are collected from partially observable networks with both missing nodes and missing edges, for example, due to limited resources and privacy settings specified by users on social media. Thus, it stands to reason that inferring the missing parts of the networks by performing network completion should precede downstream applications. However, despite this need, the recovery of missing nodes and edges in such incomplete networks is an insufficiently explored problem due to the modeling difficulty, which is much more challenging than link prediction that only infers missing edges. In this paper, we present DeepNC, a novel method for inferring the missing parts of a network based on a deep generative model of graphs. Specifically, our method first learns a likelihood over edges via an autoregressive generative model, and then identifies the graph that maximizes the learned likelihood conditioned on the observable graph topology. Moreover, we propose a computationally efficient ${\sf DeepNC}$ algorithm that consecutively finds individual nodes that maximize the probability in each node generation step, as well as an enhanced version using the expectation-maximization algorithm. The runtime complexities of both algorithms are shown to be almost linear in the number of nodes in the network. We empirically demonstrate the superiority of DeepNC over state-of-the-art network completion approaches.

1 August 2023 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JPJin-Duk Park
Jin-Duk Park
CTCong Tran
Cong Tran
Won-Yong ShinWon-Yong Shin
Won-Yong Shin
XCXin Cao
Xin Cao
Network alignment (NA) is the task of finding the correspondence of nodes between two networks based on the network structure and node attributes. Our study is motivated by the fact that, since most of existing NA methods have attempted to discover all node pairs at once , they do not harness information enriched through interim discovery of node correspondences to more accurately find the next correspondences during the node matching. To tackle this challenge, we propose ${\sf Grad\text{-}Align}$ , a new NA method that gradually discovers node pairs by making full use of node pairs exhibiting strong consistency, which are easy to be discovered in the early stage of gradual matching. Specifically, ${\sf Grad\text{-}Align}$ first generates node embeddings of the two networks based on graph neural networks along with our layer-wise reconstruction loss , a loss built upon capturing the first-order and higher-order neighborhood structures. Then, nodes are gradually aligned by computing dual-perception similarity measures including the multi-layer embedding similarity as well as the Tversky similarity , an asymmetric set similarity using the Tversky index applicable to networks with different scales. Additionally, we incorporate an edge augmentation module into ${\sf Grad\text{-}Align}$ to reinforce the structural consistency. Through comprehensive experiments using real-world and synthetic datasets, we empirically demonstrate that ${\sf Grad\text{-}Align}$ consistently outperforms state-of-the-art NA methods.

6 February 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
CTCong Tran
Cong Tran
Won-Yong ShinWon-Yong Shin
Won-Yong Shin
ASAndreas Spitz
Andreas Spitz
Since the structure of complex networks is often unknown , we may identify the most influential seed nodes by exploring only a part of the underlying network, given a small budget for node queries. We propose IM-META , a solution to influence maximization (IM) in networks with unknown topology by retrieving information from queries and node metadata. Since using such metadata is not without risk due to the noisy nature of metadata and uncertainties in connectivity inference, we formulate a new IM problem that aims to find both seed nodes and queried nodes. In IM-META , we develop an effective method that iteratively performs three steps: 1) we learn the relationship between collected metadata and edges via a Siamese neural network , 2) we select a number of inferred confident edges to construct a reinforced graph, and 3) we identify the next node to query by maximizing the inferred influence spread using our topology-aware ranking strategy. Through experimental evaluation of IM-META on four real-world datasets, we demonstrate a) the speed of network exploration via node queries, b) the effectiveness of each module, c) the superiority over benchmark methods, d) the robustness to more difficult settings, e) the hyperparameter sensitivity, and f) the scalability.

9 November 2022 in IEEE Access
Verified
Journal Article
Open access
DTDat Tran-Anh
Dat Tran-Anh
BBBao Bui-Quoc
Bao Bui-Quoc
AVAnh Vu-Duc
Anh Vu-Duc
TDTrung-Anh Do
Trung-Anh Do
HVHung Nguyen Viet
Hung Nguyen Viet
CTCong Tran
Cong Tran
There has been an ongoing demand for monitoring landslides due to the heavy economic losses and casualties caused by such natural disasters. In this paper, we introduce a swift landslide detection system that can detect and segment landslides occurring on roads. To tackle the challenges of data collection, we propose an automatic annotation procedure to create a new landslide dataset consisting of 2963 images, termed the LandslidePTIT dataset. Additionally, we construct a novel deep learning architecture that can perform both classification and segmentation tasks well from a few annotated images of landslides. Specifically, the model consists of four main modules that are delicately designed to solve the few-shot segmentation problem using landslide images, namely hypercorrelation construction, attentive squeeze block, a cross-feature layer, and broadcast and squeeze layer. Experimental results exhibit the superiority of the proposed methods in comparison with competitive baselines, in terms of both quantitative and qualitative manners.

28 November 2022 in IEEE Sensors Journal
Verified
Journal Article
Closed access
CPCuong Pham
Cuong Pham
MBManh-Ha Bui
Manh-Ha Bui
VTViet-Anh Tran
Viet-Anh Tran
AVAnh Duc Vu
Anh Duc Vu
CTCong Tran
Cong Tran
Breath sounds have been shown as a potential biometric in personal identification and verification. In this paper, we show that by combining signals captured by motion sensors on the chest with audio features, we can further improve the performance of these tasks. Our work is composed of three main contributions: the design of a newly created IoT device, publication of a novel dataset, and newly proposed multimodal models. Specifically, we first design a new hardware that consists of an acoustic sensor to collect audio features from the nose, as well as an accelerometer and gyroscope to collect movement on the chest as a result of an individual’s breathing. Using this hardware, we collect and publish a dataset from a number of sessions from different volunteers, where each session includes three common gestures: normal, deep, and strong breathing. Finally, we experiment with two multimodal models based on Convolutional Long Short Term Memory (CNN-LSTM) and Temporal Convolutional Networks (TCN) architectures. The results demonstrate the suitability of our new hardware for both verification and identification tasks.

19 September 2023 in IEEE Sensors Journal
Verified
Journal Article
Closed access
HVHoai-Nam Vu
Hoai-Nam Vu
THTrung Hoang
Trung Hoang
CTCong Tran
Cong Tran
CPCuong Pham
Cuong Pham
Sign Language Recognition (SLR) is the task of recognizing human actions that represent the language, which is not only helpful for deaf-mute people but also a means for human-computer interaction. Although data from wearable sensors have been proven useful for this task, it is still difficult to collect such data for training deep fusion models. In this study, our contributions are two-fold: 1) we collect and release a dataset for SLR consisting of both video and sensor data obtained from wearable devices, and 2) we propose the first self-learning fusion model for SLR, termed STSLR, that utilizes a portion of annotated data to simulate sensor embedding vectors. By virtue of the simulated sensor features, the video features from video-only data are enhanced to allow the fusion model to recognize the annotated actions more effectively. We empirically demonstrate the superiority of STSLR over competitive benchmarks on our newly released dataset and well-known publicly available ones.