Dai Hoang Tran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Dai Hoang Tran has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Choong Seon Hong
Kyung Hee University
7 shared publicationsNguyen H. Tran
The University of Sydney
6 shared publications- Wei Emma Zhang
Adelaide University, Adelaide, Australia
6 shared publications - Nguyen Hoang Tran
School of Computer Science, The University of Sydney, Darlington, NSW, Australia
5 shared publications - Chuan Pham
Département de Génie Électrique, École de Technologie Supérieure, Montréal, QC H3C 1K3, Canada
4 shared publications Eui-Nam Huh
Kyung Hee University
4 shared publications
Latest Publications
- Open Access
- 10 May 2022
- Published by Springer Nature in World Wide Web
- Vol. 26 (2) , 713-732
CupMar: A deep learning model for personalized news recommendation based on contextual user-profile and multi-aspect article representation
In modern days, making recommendation for news articles poses a great challenge due to vast amount of online information. However, providing personalized recommendations from news articles, which are the sources of condense textual information is not a trivial task. A recommendation system needs to understand both the textual information of a news article, and the user contexts in terms of long-term and temporary preferences via the user’s historic records. Unfortunately, many existing methods do not possess the capability to meet such need. In this work, we propose a neural deep news recommendation model called CupMar, that not only is able to learn the user-profile representation in different contexts, but also is able to leverage the multi-aspects properties of a news article to provide accurate, personalized news recommendations to users. The main components of our CupMar approach include the News Encoder and the User-Profile Encoder. Specifically, the News Encoder uses multiple properties such as news category, knowledge entity, title and body content with advanced neural network layers to derive informative news representation, while the User-Profile Encoder looks through a user’s browsed news, infers both of her long-term and recent preference contexts to encode a user representation, and finds the most relevant candidate news for her. We evaluate our CupMar model with extensive experiments on the popular Microsoft News Dataset (MIND), and demonstrate the strong performance of our approach.
- 10 May 2022
- Published by Springer Nature in World Wide Web
- Vol. 26 (2) , 713-732
Open AccessCupMar: A deep learning model for personalized news recommendation based on contextual user-profile and multi-aspect article representation
In modern days, making recommendation for news articles poses a great challenge due to vast amount of online information. However, providing personalized recommendations from news articles, which are the sources of condense textual information is not a trivial task. A recommendation system needs to understand both the textual information of a news article, and the user contexts in terms of long-term and temporary preferences via the user’s historic records. Unfortunately, many existing methods do not possess the capability to meet such need. In this work, we propose a neural deep news recommendation model called CupMar, that not only is able to learn the user-profile representation in different contexts, but also is able to leverage the multi-aspects properties of a news article to provide accurate, personalized news recommendations to users. The main components of our CupMar approach include the News Encoder and the User-Profile Encoder. Specifically, the News Encoder uses multiple properties such as news category, knowledge entity, title and body content with advanced neural network layers to derive informative news representation, while the User-Profile Encoder looks through a user’s browsed news, infers both of her long-term and recent preference contexts to encode a user representation, and finds the most relevant candidate news for her. We evaluate our CupMar model with extensive experiments on the popular Microsoft News Dataset (MIND), and demonstrate the strong performance of our approach.
- 11 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 55 (4) , 30-39
Deep Conversational Recommender Systems: Challenges and Opportunities
Unlike traditional recommender systems, the conversational recommender system (CRS) models a user’s preferences through interactive dialogue conversations. Recently, deep learning approaches have been applied to CRSs, producing fruitful results. We discuss the development of deep CRSs and future research directions.
- 11 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 55 (4) , 30-39
Deep Conversational Recommender Systems: Challenges and Opportunities
Unlike traditional recommender systems, the conversational recommender system (CRS) models a user’s preferences through interactive dialogue conversations. Recently, deep learning approaches have been applied to CRSs, producing fruitful results. We discuss the development of deep CRSs and future research directions.
- 8 January 2021
- Published by Springer Nature in Neural Computing and Applications
- Vol. 35 (18) , 13047-13063
HeteGraph: graph learning in recommender systems via graph convolutional networks
- 8 January 2021
- Published by Springer Nature in Neural Computing and Applications
- Vol. 35 (18) , 13047-13063
HeteGraph: graph learning in recommender systems via graph convolutional networks
- 1 January 2021
- Published by Springer Nature
- p. 237-251
Deep News Recommendation with Contextual User Profiling and Multifaceted Article Representation
- 1 January 2021
- Published by Springer Nature
- p. 237-251
Deep News Recommendation with Contextual User Profiling and Multifaceted Article Representation
- Open Access
The 10 Research Topics in the Internet of Things
Since the term first coined in 1999 by Kevin Ashton, the Internet of Things (IoT) has gained significant momentum as a technology to connect physical objects to the Internet and to facilitate machine-to-human and machine-to-machine communications. Over the past two decades, IoT has been an active area of research and development endeavours by many technical and commercial communities. Yet, IoT technology is still not mature and many issues need to be addressed. In this paper, we identify 10 key research topics and discuss the research problems and opportunities within these topics.
Open AccessThe 10 Research Topics in the Internet of Things
Since the term first coined in 1999 by Kevin Ashton, the Internet of Things (IoT) has gained significant momentum as a technology to connect physical objects to the Internet and to facilitate machine-to-human and machine-to-machine communications. Over the past two decades, IoT has been an active area of research and development endeavours by many technical and commercial communities. Yet, IoT technology is still not mature and many issues need to be addressed. In this paper, we identify 10 key research topics and discuss the research problems and opportunities within these topics.
- Open Access
Deep Autoencoder for Recommender Systems: Parameter Influence Analysis
Recommender systems have recently attracted many researchers in the deep learning community. The state-of-the-art deep neural network models used in recommender systems are typically multilayer perceptron and deep Autoencoder (DAE), among which DAE usually shows better performance due to its superior capability to reconstruct the inputs. However, we found existing DAE recommendation systems that have similar implementations on similar datasets result in vastly different parameter settings. In this work, we have built a flexible DAE model, named FlexEncoder that uses configurable parameters and unique features to analyse the parameter influences on the prediction accuracy of recommender systems. This will help us identify the best-performance parameters given a dataset. Extensive evaluation on the MovieLens datasets are conducted, which drives our conclusions on the influences of DAE parameters. Specifically, we find that DAE parameters strongly affect the prediction accuracy of the recommender systems, and the effect is transferable to similar datasets in a larger size. We open our code to public which could benefit both new users for DAE -- they can quickly understand how DAE works for recommendation systems, and experienced DAE users -- it easier for them to tune the parameters on different datasets.
Open AccessDeep Autoencoder for Recommender Systems: Parameter Influence Analysis
Recommender systems have recently attracted many researchers in the deep learning community. The state-of-the-art deep neural network models used in recommender systems are typically multilayer perceptron and deep Autoencoder (DAE), among which DAE usually shows better performance due to its superior capability to reconstruct the inputs. However, we found existing DAE recommendation systems that have similar implementations on similar datasets result in vastly different parameter settings. In this work, we have built a flexible DAE model, named FlexEncoder that uses configurable parameters and unique features to analyse the parameter influences on the prediction accuracy of recommender systems. This will help us identify the best-performance parameters given a dataset. Extensive evaluation on the MovieLens datasets are conducted, which drives our conclusions on the influences of DAE parameters. Specifically, we find that DAE parameters strongly affect the prediction accuracy of the recommender systems, and the effect is transferable to similar datasets in a larger size. We open our code to public which could benefit both new users for DAE -- they can quickly understand how DAE works for recommendation systems, and experienced DAE users -- it easier for them to tune the parameters on different datasets.
- Open Access
- 1 January 2018
- Published by University of Technology, Sydney (UTS)
Deep Autoencoder for Recommender Systems: Parameter Influence Analysis
UTS ePRESS is the open access publishing arm of the University of Technology Sydney (UTS). Our aim is to remove barriers to knowledge by freely disseminating high quality scholarly works. Through this commitment to open knowledge, we contribute to scholarship that seeks to solve global challenges.
- 1 January 2018
- Published by University of Technology, Sydney (UTS)
Open AccessDeep Autoencoder for Recommender Systems: Parameter Influence Analysis
UTS ePRESS is the open access publishing arm of the University of Technology Sydney (UTS). Our aim is to remove barriers to knowledge by freely disseminating high quality scholarly works. Through this commitment to open knowledge, we contribute to scholarship that seeks to solve global challenges.
- 3 April 2017
- Published by Springer Nature in Computing
- Vol. 99 (11) , 1081-1104
OaaS: offload as a service in fog networks
- 3 April 2017
- Published by Springer Nature in Computing
- Vol. 99 (11) , 1081-1104
OaaS: offload as a service in fog networks
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 416-419
HiLiCLoud: High performance and lightweight mobile cloud infrastructure for monitor and benchmark services
In the area of cloud infrastructure environment, the management tool to monitor and control the cloud resources is the important factor that can drive the cost benefit of the cloud vendors. But most these tools are bundled within the high cost commercial platforms and are optimized to run on desktop computers. With the vision that Mobile Cloud Computing will be the future technology paradigm that dominates the IT industry, we want to create a cloud management tool that is open source, fast, lightweight and mobile friendly. We take the initial steps by implementing our framework using several popular technologies such as RESTful, Java Message Service, JSON, and we call it “High performance and Lightweight Mobile Cloud Infrastructure Monitor and Benchmark Service” or HiLiCloud. The initial testings show competitive evaluation results.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 416-419
HiLiCLoud: High performance and lightweight mobile cloud infrastructure for monitor and benchmark services
In the area of cloud infrastructure environment, the management tool to monitor and control the cloud resources is the important factor that can drive the cost benefit of the cloud vendors. But most these tools are bundled within the high cost commercial platforms and are optimized to run on desktop computers. With the vision that Mobile Cloud Computing will be the future technology paradigm that dominates the IT industry, we want to create a cloud management tool that is open source, fast, lightweight and mobile friendly. We take the initial steps by implementing our framework using several popular technologies such as RESTful, Java Message Service, JSON, and we call it “High performance and Lightweight Mobile Cloud Infrastructure Monitor and Benchmark Service” or HiLiCloud. The initial testings show competitive evaluation results.
- 6 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 7 (19493053) , 1
How Geo-Distributed Data Centers Do Demand Response: A Game-Theoretic Approach
We study the demand response (DR) of geo-distributed data centers (DCs) using smart grid's pricing signals set by local electric utilities. The geo-distributed DCs are suitable candidates for the DR programs due to their huge energy consumption and flexibility to distribute their energy demand across time and location, whereas the price signal is well-known for DR programs to reduce the peak-to-average load ratio. There are two dependencies that make the pricing design difficult: 1) dependency among utilities; and 2) dependency between DCs and their local utilities. Our proposed pricing scheme is constructed based on a two-stage Stackelberg game in which each utility sets a real-time price to maximize its own profit in Stage I and based on these prices, the DCs' service provider minimizes its cost via workload shifting and dynamic server allocation in Stage II. For the first dependency, we show that there exists a unique Nash equilibrium. For the second dependency, we propose an iterative and distributed algorithm that can converge to this equilibrium, where the “right prices” are set for the “right demands.” We also verify our proposal by trace-based simulations, and results show that our pricing scheme significantly outperforms other baseline schemes in terms of flattening the power demand over time and space.
- 6 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 7 (19493053) , 1
How Geo-Distributed Data Centers Do Demand Response: A Game-Theoretic Approach
We study the demand response (DR) of geo-distributed data centers (DCs) using smart grid's pricing signals set by local electric utilities. The geo-distributed DCs are suitable candidates for the DR programs due to their huge energy consumption and flexibility to distribute their energy demand across time and location, whereas the price signal is well-known for DR programs to reduce the peak-to-average load ratio. There are two dependencies that make the pricing design difficult: 1) dependency among utilities; and 2) dependency between DCs and their local utilities. Our proposed pricing scheme is constructed based on a two-stage Stackelberg game in which each utility sets a real-time price to maximize its own profit in Stage I and based on these prices, the DCs' service provider minimizes its cost via workload shifting and dynamic server allocation in Stage II. For the first dependency, we show that there exists a unique Nash equilibrium. For the second dependency, we propose an iterative and distributed algorithm that can converge to this equilibrium, where the “right prices” are set for the “right demands.” We also verify our proposal by trace-based simulations, and results show that our pricing scheme significantly outperforms other baseline schemes in terms of flattening the power demand over time and space.