Bich-Ngan Thi Nguyen

Mrs. Bich-Ngan Thi Nguyen

Ho Chi Minh City University of Food Industry, Ho Chi Minh City, Hồ Chí Minh, Vietnam
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
9 November 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
VLVan-Vang Le
Van-Vang Le
TVTomas Vantuch
Tomas Vantuch
In social influence analysis, viral marketing, and other fields, the influence maximization problem is a fundamental one with critical applications and has attracted many researchers in the last decades. This problem asks to find a k-size seed set with the largest expected influence spread size. Our paper studies the problem of fairness budget distribution in influence maximization, aiming to find a seed set of size k fairly disseminated in target communities. Each community has certain lower and upper bounded budgets, and the number of each community’s elements is selected into a seed set holding these bounds. Nevertheless, resolving this problem encounters two main challenges: strongly influential seed sets might not adhere to the fairness constraint, and it is an NP-hard problem. To address these shortcomings, we propose three algorithms (FBIM1, FBIM2, and FBIM3). These algorithms combine an improved greedy strategy for selecting seeds to ensure maximum coverage with the fairness constraints by generating sampling through a Reverse Influence Sampling framework. Our algorithms provide a (1/2−ϵ)-approximation of the optimal solution, and require OkTlog(8+2ϵ)nln2δ+ln(kn)ϵ2, OkTlognϵ2k, and OTϵlogkϵlognϵ2k complexity, respectively. We conducted experiments on real social networks. The result shows that our proposed algorithms are highly scalable while satisfying theoretical assurances, and that the coverage ratios with respect to the target communities are larger than those of the state-of-the-art alternatives; there are even cases in which our algorithms reaches 100% coverage with respect to target communities. In addition, our algorithms are feasible and effective even in cases involving big data; in particular, the results of the algorithms guarantee fairness constraints.

26 October 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
VLVan-Vang Le
Van-Vang Le
TTToai Kim Tran
Toai Kim Tran
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
QNQuoc-Dung Nguyen
Quoc-Dung Nguyen
TVTomas Vantuch
Tomas Vantuch
Network alignment, which is also known as user identity linkage, is a kind of network analysis task that predicts overlapping users between two different social networks. This research direction has attracted much attention from the research community, and it is considered to be one of the most important research directions in the field of social network analysis. There are many different models for finding users that overlap between two networks, but most of these models use separate and different techniques to solve prediction problems, with very little work that has combined them. In this paper, we propose a method that combines different embedding techniques to solve the network alignment problem. Each association network alignment technique has its advantages and disadvantages, so combining them together will take full advantage and can overcome those disadvantages. Our model combines three-level embedding techniques of text-based user attributes, a graph attention network, a graph-drawing embedding technique, and fuzzy c-mean clustering to embed each piece of network information into a low-dimensional representation. We then project them into a common space by using canonical correlation analysis and compute the similarity matrix between them to make predictions. We tested our network alignment model on two real-life datasets, and the experimental results showed that our method can considerably improve the accuracy by about 10–15% compared to the baseline models. In addition, when experimenting with different ratios of training data, our proposed model could also handle the over-fitting problem effectively.

19 November 2020
Verified
Book Chapter
Closed access
PDF file
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
PPPhuong N. H. Phạm
Phuong N. H. Phạm
VNVu Thanh Nguyen
Vu Thanh Nguyen
PVPhan Quoc Viet
Phan Quoc Viet
LTLe Dinh Tuan
Le Dinh Tuan
VSVaclav Snasel
Vaclav Snasel

19 August 2021
Verified
Conference Paper
Closed access
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
CPCanh V. Pham
Canh V. Pham
NNNghia D. Nghia
Nghia D. Nghia
TVTomas Vantuch
Tomas Vantuch
In the context of viral marketing in Online Social Networks (OSNs), companies often find some users (called a seed set) to initiate the spread of their product’s information so that the benefit gained exceeds a given threshold. However, in a realistic scenario, marketing strategies often change so the selection of a seed set for a particular threshold is not enough to provide an effective solution. Motivated by this phenomenon, we investigate the Multiple Benefit Thresholds (MBT), defined as follows: Given a social network under an information diffusion and a set of thresholds T = {T 1 , T 2 , … , T k }, the problem finds seed sets S 1 , S 2 , … , S k with the minimal cost so that their benefit gained after the influence process are at least T 1 , T 2 , … , T k , respectively. To find the solution, we propose an efficient algorithm with theoretical guarantees, named Efficient Sampling for Selecting Multiple seed sets (ESSM) by developing an algorithmic framework and utilizing the sampling technique for estimating the objective function. We perform extensive experiments using some real networks show that the effective and performance of our algorithm, which outperforms other algorithms in term both the cost and running time.

19 August 2021
Verified
Conference Paper
Closed access
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
CPCanh V. Pham
Canh V. Pham
ASAnh N. Su
Anh N. Su
TVTomas Vantuch
Tomas Vantuch
Submodular Cover problem has attracted the attention of researchers because of its wide variety of applications in economics, machine learning, digital marketing, and computer science. Previous studies on this problem have focused on solving it under the assumption in a non-noise environment, or using the greedy algorithm to solve under noise. However, in some applications, the data is often large scale and brings the noisy version, so the effectiveness of existing solutions is low or not applicable in large and noisy data. Motivated by this phenomenon, we study the Submodular Cover under Noise (SCN) problem and propose a single pass streaming algorithm, which provides a bicriteria approximation solution for SCN. The experiment results indicate that our algorithm provides solutions with the high value of objective functions and outperforms the-state-of-art algorithm in terms of both number of queries and running time.

19 May 2022
Verified
Book Chapter
Closed access
PDF file
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
LTLoi H. Tran
Loi H. Tran
CPCanh V. Pham
Canh V. Pham
TVTomas Vantuch
Tomas Vantuch