Pham Nguyen Huy Phuong

Mr. Pham Nguyen Huy Phuong

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
22 September 2023 in Computer Communications
Verified
Journal Article
Closed access
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
CPCanh V. Pham
Canh V. Pham
HDHieu V. Duong
Hieu V. Duong
TVTomas Vantuch
Tomas Vantuch
NTNguyen Trung Thanh
Nguyen Trung Thanh

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.

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.

9 March 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
BNBich-Ngan Thi Nguyen
Bich-Ngan Thi Nguyen
QCQuy Thi Ngoc Co
Quy Thi Ngoc Co
TVTomas Vantuch
Tomas Vantuch
An important problem in the context of viral marketing in social networks is the Influence Threshold (IT) problem, which aims at finding some users (referred to as a seed set) to begin the process of disseminating their product’s information so that the benefit gained exceeds a predetermined threshold. Even though, marketing strategies exhibit different in several realistic scenarios due to market dependence or budget constraints. As a consequence, picking a seed set for a specific threshold is not enough to come up with an effective solution. To address the disadvantages of previous works with a new approach, we study the Multiple Benefit Thresholds (MBT), a generalized version of the IT problem, as a result of this phenomenon. Given a social network that is subjected to information distribution and a set of thresholds, T={T1,T2,…,Tk},Ti>0, the issue aims to seek the seed sets S1,S2,…,Sk with the lowest possible cost so that the benefit achieved from the influence process is at the very least T1,T2,…,Tk, respectively. The main challenges of this problem are a #NP-hard problem and the estimation of the objective function #P-Hard under traditional information propagation models. In addition, adapting the exist algorithms many times to different thresholds can lead to large computational costs. To address the abovementioned challenges, we introduced Efficient Sampling for Selecting Multiple Seed Sets, an efficient technique with theoretical guarantees (ESSM). At the core of our algorithm, we developed a novel algorithmic framework that (1) can use the solution to a smaller threshold to find that of larger ones and (2) can leverage existing samples with the current solution to find that of larger ones. The extensive experiments on several real social networks were conducted in order to show the effectiveness and performance of our algorithm compared with current ones. The results indicated that our algorithm outperformed other state-of-the-art ones in terms of both the total cost and running time.

1 October 2022 in Bulletin of Electrical Engineering and Informatics
Verified
Journal Article
Open access
PDF file
VLVan-Vang Le
Van-Vang Le
PPPham Nguyen Huy Phuong
Pham Nguyen Huy Phuong
TTToai Kim Tran
Toai Kim Tran
TVTomas Vantuch
Tomas Vantuch
Nowadays social networks such as Twitter, LinkedIn, and Facebook are a popular and necessary platform. It is considered a miniature of an actual social network because of its advantages in connecting and sharing information between users. The analysis of data on online social networks has become a field that has attracted a lot of attention from the research community and anchor link prediction is one of the main research directions in this field. Depending on demand, a user can simultaneously participate in many different online social networks, anchor link prediction is a kind of task that determines the identity of a user on many different social networks. In this article, we proposed an algorithm that determines missing/future anchor links between users from two different online social networks. Our algorithm utilizes the graph attention technique to represent the source and target network into the low-dimension embedding spaces, we then apply the canonical correlation analysis to recline their embeddings into same latent spaces for final prediction.