no code implementations • 3 Sep 2023 • Son Tran, Cong Tran, Anh Tran, Cuong Pham
In this paper, we push forward the state-of-the-art performance of unsupervised MOT methods by proposing UnsMOT, a novel framework that explicitly combines the appearance and motion features of objects with geometric information to provide more accurate tracking.
1 code implementation • 3 Sep 2023 • Ngan Dao Hoang, Dat Tran-Anh, Manh Luong, Cong Tran, Cuong Pham
In this work, our aim is to develop a framework that can effectively perform cough classification even in situations when enormous cough data is not available, while also addressing privacy concerns.
no code implementations • 25 Apr 2023 • Jin-Duk Park, Cong Tran, Won-Yong Shin, Xin Cao
Network alignment (NA) is the task of discovering node correspondences across multiple networks.
no code implementations • 10 Apr 2023 • Yu Hou, Cong Tran, Ming Li, Won-Yong Shin
In social networks, the discovery of community structures has received considerable attention as a fundamental problem in various network analysis tasks.
no code implementations • 23 Aug 2022 • Jin-Duk Park, Cong Tran, Won-Yong Shin, Xin Cao
Network alignment (NA) is the task of discovering node correspondences across different networks.
no code implementations • 23 Aug 2022 • Yu Hou, Cong Tran, Won-Yong Shin
The discovery of community structures in social networks has gained considerable attention as a fundamental problem for various network analysis tasks.
1 code implementation • 26 Jan 2022 • Jin-Duk Park, Cong Tran, Won-Yong Shin, 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.
no code implementations • 5 Jun 2021 • Cong Tran, Won-Yong Shin, 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.
1 code implementation • 12 Apr 2021 • Yong-Min Shin, Cong Tran, Won-Yong Shin, Xin Cao
We study the problem of embedding edgeless nodes such as users who newly enter the underlying network, while using graph neural networks (GNNs) widely studied for effective representation learning of graphs.
no code implementations • 18 Dec 2020 • Cong Tran, Dung D. Vu, Won-Yong Shin
It has been insufficiently explored how to perform density-based clustering by exploiting textual attributes on social media.
1 code implementation • 17 Jul 2019 • Cong Tran, Won-Yong Shin, Andreas Spitz, Michael Gertz
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.
no code implementations • 1 May 2019 • Cong Tran, Jang-Young Kim, Won-Yong Shin, Sang-Wook Kim
As collaborative filtering (CF) is one of the most prominent and popular techniques used for recommender systems, we propose a new clustering-based CF (CBCF) method using an incentivized/penalized user (IPU) model only with ratings given by users, which is thus easy to implement.
no code implementations • 9 Jun 2018 • Cong Tran, Won-Yong Shin, Sang-Il Choi
To overcome these problems, we present DIR-ST$^2$, a novel framework for delineating an imprecise region by iteratively performing density-based clustering, namely DBSCAN, along with not only spatio--textual information but also temporal information on social media.
no code implementations • 30 Dec 2017 • Cong Tran, Won-Yong Shin, Andreas Spitz
The discovery of community structures in social networks has gained significant attention since it is a fundamental problem in understanding the networks' topology and functions.