Tien Huu Do
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
Research Subjects
Tien Huu Do has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Nikos Deligiannis
Vrije Universiteit Brussel
11 shared publications - Duc Minh Nguyen
Vrije Universiteit Brussel, Brussels, B-1050, Belgium
4 shared publications - Jelle Hofman
Air Quality & Industrial Emissions Team, Flemish Institute for Technological Research (VITO), Boeretang 200, 2400 Mol, Belgium
4 shared publications - Xuening Qin
Department of Telecommunications and Information Processing, Ghent University, Ghent, Belgium
4 shared publications - Esther Rodrigo Bonet
Vrije Universiteit Brussel
3 shared publications Valerio Panzica La Manna
IMEC, Eindhoven, The Netherlands
3 shared publications
Latest Publications
- 20 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 8, 499-513
Explaining Graph Neural Networks With Topology-Aware Node Selection: Application in Air Quality Inference
Graph neural networks (GNNs) have proven their ability in modelling graph-structured data in diverse domains, including natural language processing and computer vision. However, like other deep learning models, the lack of explainability is becoming a major drawback for GNNs, especially in health-related applications such as air pollution estimation, where a model’s predictions might directly affect humans’ health and habits. In this paper, we present a novel post-hoc explainability framework for GNN-based models. More concretely, we propose a novel topology-aware kernelised node selection method, which we apply over the graph structural and air pollution information. Thanks to the proposed model, we are able to effectively capture the graph topology and, for a certain graph node, infer its most relevant nodes. Additionally, we propose a novel topological node embedding for each node, capturing in a vector-shape the graph walks with respect to every other graph node. To prove the effectiveness of our explanation method, we include commonly employed evaluation metrics as well as fidelity, sparsity and contrastivity, and adapt them to evaluate explainability on a regression task. Extensive experiments on two real-world air pollution data sets demonstrate and visually show the effectiveness of the proposed method.
- 20 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 8, 499-513
Explaining Graph Neural Networks With Topology-Aware Node Selection: Application in Air Quality Inference
Graph neural networks (GNNs) have proven their ability in modelling graph-structured data in diverse domains, including natural language processing and computer vision. However, like other deep learning models, the lack of explainability is becoming a major drawback for GNNs, especially in health-related applications such as air pollution estimation, where a model’s predictions might directly affect humans’ health and habits. In this paper, we present a novel post-hoc explainability framework for GNN-based models. More concretely, we propose a novel topology-aware kernelised node selection method, which we apply over the graph structural and air pollution information. Thanks to the proposed model, we are able to effectively capture the graph topology and, for a certain graph node, infer its most relevant nodes. Additionally, we propose a novel topological node embedding for each node, capturing in a vector-shape the graph walks with respect to every other graph node. To prove the effectiveness of our explanation method, we include commonly employed evaluation metrics as well as fidelity, sparsity and contrastivity, and adapt them to evaluate explainability on a regression task. Extensive experiments on two real-world air pollution data sets demonstrate and visually show the effectiveness of the proposed method.
- Open Access
- 30 May 2022
- Published by MDPI AG in Remote Sensing
- Vol. 14 (11) , 2613
Fine-Grained Urban Air Quality Mapping from Sparse Mobile Air Pollution Measurements and Dense Traffic Density
Urban air quality mapping has been widely applied in urban planning, air pollution control and personal air pollution exposure assessment. Urban air quality maps are traditionally derived using measurements from fixed monitoring stations. Due to high cost, these stations are generally sparsely deployed in a few representative locations, leading to a highly generalized air quality map. In addition, urban air quality varies rapidly over short distances (2 by 100 m and 1 h resolution for fine-grained air quality mapping. The CLADF model exploits deep forest to construct a local model for each cluster consisting of nearest neighbor measurements in contextual feature space, and considers traffic flow as an important contextual feature. Extensive validation experiments were conducted using mobile NO2 measurements collected by 17 postal vans equipped with low-cost sensors operating in Antwerp, Belgium. The experimental results demonstrate that the CLADF model achieves the lowest RMSE as well as advances in accuracy and correlation, compared with various benchmark models, including random forest, deep forest, extreme gradient boosting and support vector regression.
- 30 May 2022
- Published by MDPI AG in Remote Sensing
- Vol. 14 (11) , 2613
Open AccessFine-Grained Urban Air Quality Mapping from Sparse Mobile Air Pollution Measurements and Dense Traffic Density
Urban air quality mapping has been widely applied in urban planning, air pollution control and personal air pollution exposure assessment. Urban air quality maps are traditionally derived using measurements from fixed monitoring stations. Due to high cost, these stations are generally sparsely deployed in a few representative locations, leading to a highly generalized air quality map. In addition, urban air quality varies rapidly over short distances (2 by 100 m and 1 h resolution for fine-grained air quality mapping. The CLADF model exploits deep forest to construct a local model for each cluster consisting of nearest neighbor measurements in contextual feature space, and considers traffic flow as an important contextual feature. Extensive validation experiments were conducted using mobile NO2 measurements collected by 17 postal vans equipped with low-cost sensors operating in Antwerp, Belgium. The experimental results demonstrate that the CLADF model achieves the lowest RMSE as well as advances in accuracy and correlation, compared with various benchmark models, including random forest, deep forest, extreme gradient boosting and support vector regression.
- 9 January 2022
- Published by Elsevier in Environmental Modelling & Software
- Vol. 149
Spatiotemporal air quality inference of low-cost sensor data: Evidence from multiple sensor testbeds
- 9 January 2022
- Published by Elsevier in Environmental Modelling & Software
- Vol. 149
Spatiotemporal air quality inference of low-cost sensor data: Evidence from multiple sensor testbeds
- Open Access
- 17 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 130042-130054
Context-Aware Deep Markov Random Fields for Fake News Detection
Fake news is a serious problem, which has received considerable attention from both industry and academic communities. Over the past years, many fake news detection approaches have been introduced, and most of the existing methods rely on either news content or the social context of the news dissemination process on social media platforms. In this work, we propose a generic model that is able to take into account both the news content and the social context for the identification of fake news. Specifically, we explore different aspects of the news content by using both shallow and deep representations. The shallow representations are produced with word2vec and doc2vec models while the deep representations are generated via transformer-based models. These representations are able to jointly or separately address four individual tasks, namely bias detection, clickbait detection, sentiment analysis, and toxicity detection. In addition, we make use of graph convolutional neural networks and mean-field layers in order to exploit the underlying structural information of the news articles. That way, we are able to take into account the inherent correlation between the articles by leveraging their social context information. Experiments on widely-used benchmark datasets indicate the effectiveness of the proposed method.
- 17 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 130042-130054
Open AccessContext-Aware Deep Markov Random Fields for Fake News Detection
Fake news is a serious problem, which has received considerable attention from both industry and academic communities. Over the past years, many fake news detection approaches have been introduced, and most of the existing methods rely on either news content or the social context of the news dissemination process on social media platforms. In this work, we propose a generic model that is able to take into account both the news content and the social context for the identification of fake news. Specifically, we explore different aspects of the news content by using both shallow and deep representations. The shallow representations are produced with word2vec and doc2vec models while the deep representations are generated via transformer-based models. These representations are able to jointly or separately address four individual tasks, namely bias detection, clickbait detection, sentiment analysis, and toxicity detection. In addition, we make use of graph convolutional neural networks and mean-field layers in order to exploit the underlying structural information of the news articles. That way, we are able to take into account the inherent correlation between the articles by leveraging their social context information. Experiments on widely-used benchmark datasets indicate the effectiveness of the proposed method.
- Open Access
Graph Convolutional Neural Networks with Node Transition Probability-based Message Passing and DropNode Regularization
Graph convolutional neural networks (GCNNs) have received much attention recently, owing to their capability in handling graph-structured data. Among the existing GCNNs, many methods can be viewed as instances of a neural message passing motif; features of nodes are passed around their neighbors, aggregated and transformed to produce better nodes' representations. Nevertheless, these methods seldom use node transition probabilities, a measure that has been found useful in exploring graphs. Furthermore, when the transition probabilities are used, their transition direction is often improperly considered in the feature aggregation step, resulting in an inefficient weighting scheme. In addition, although a great number of GCNN models with increasing level of complexity have been introduced, the GCNNs often suffer from over-fitting when being trained on small graphs. Another issue of the GCNNs is over-smoothing, which tends to make nodes' representations indistinguishable. This work presents a new method to improve the message passing process based on node transition probabilities by properly considering the transition direction, leading to a better weighting scheme in nodes' features aggregation compared to the existing counterpart. Moreover, we propose a novel regularization method termed DropNode to address the over-fitting and over-smoothing issues simultaneously. DropNode randomly discards part of a graph, thus it creates multiple deformed versions of the graph, leading to data augmentation regularization effect. Additionally, DropNode lessens the connectivity of the graph, mitigating the effect of over-smoothing in deep GCNNs. Extensive experiments on eight benchmark datasets for node and graph classification tasks demonstrate the effectiveness of the proposed methods in comparison with the state of the art.
Open AccessGraph Convolutional Neural Networks with Node Transition Probability-based Message Passing and DropNode Regularization
Graph convolutional neural networks (GCNNs) have received much attention recently, owing to their capability in handling graph-structured data. Among the existing GCNNs, many methods can be viewed as instances of a neural message passing motif; features of nodes are passed around their neighbors, aggregated and transformed to produce better nodes' representations. Nevertheless, these methods seldom use node transition probabilities, a measure that has been found useful in exploring graphs. Furthermore, when the transition probabilities are used, their transition direction is often improperly considered in the feature aggregation step, resulting in an inefficient weighting scheme. In addition, although a great number of GCNN models with increasing level of complexity have been introduced, the GCNNs often suffer from over-fitting when being trained on small graphs. Another issue of the GCNNs is over-smoothing, which tends to make nodes' representations indistinguishable. This work presents a new method to improve the message passing process based on node transition probabilities by properly considering the transition direction, leading to a better weighting scheme in nodes' features aggregation compared to the existing counterpart. Moreover, we propose a novel regularization method termed DropNode to address the over-fitting and over-smoothing issues simultaneously. DropNode randomly discards part of a graph, thus it creates multiple deformed versions of the graph, leading to data augmentation regularization effect. Additionally, DropNode lessens the connectivity of the graph, mitigating the effect of over-smoothing in deep GCNNs. Extensive experiments on eight benchmark datasets for node and graph classification tasks demonstrate the effectiveness of the proposed methods in comparison with the state of the art.
- 2 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (9) , 8943-8955
Graph-Deep-Learning-Based Inference of Fine-Grained Air Quality From Mobile IoT Sensors
Internet-of-Things (IoT) technologies incorporate a large number of different sensing devices and communication technologies to collect a large amount of data for various applications. Smart cities employ IoT infrastructures to build services useful for the administration of the city and the citizens. In this article, we present an IoT pipeline for acquisition, processing, and visualization of air pollution data over the city of Antwerp, Belgium. Our system employs IoT devices mounted on vehicles as well as static reference stations to measure a variety of city parameters, such as humidity, temperature, and air pollution. Mobile measurements cover a larger area compared to static stations; however, there is a tradeoff between temporal and spatial resolution. We address this problem as a matrix completion on graphs problem and rely on variational graph autoencoders to propose a deep learning solution for the estimation of the unknown air pollution values. Our model is extended to capture the correlation among different air pollutants, leading to improved estimation. We conduct experiments at different spatial and temporal resolution and compare with state-of-the-art methods to show the efficiency of our approach. The observed and estimated air pollution values can be accessed by interested users through a Web visualization tool designed to provide an air pollution map of the city of Antwerp.
- 2 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (9) , 8943-8955
Graph-Deep-Learning-Based Inference of Fine-Grained Air Quality From Mobile IoT Sensors
Internet-of-Things (IoT) technologies incorporate a large number of different sensing devices and communication technologies to collect a large amount of data for various applications. Smart cities employ IoT infrastructures to build services useful for the administration of the city and the citizens. In this article, we present an IoT pipeline for acquisition, processing, and visualization of air pollution data over the city of Antwerp, Belgium. Our system employs IoT devices mounted on vehicles as well as static reference stations to measure a variety of city parameters, such as humidity, temperature, and air pollution. Mobile measurements cover a larger area compared to static stations; however, there is a tradeoff between temporal and spatial resolution. We address this problem as a matrix completion on graphs problem and rely on variational graph autoencoders to propose a deep learning solution for the estimation of the unknown air pollution values. Our model is extended to capture the correlation among different air pollutants, leading to improved estimation. We conduct experiments at different spatial and temporal resolution and compare with state-of-the-art methods to show the efficiency of our approach. The observed and estimated air pollution values can be accessed by interested users through a Web visualization tool designed to provide an air pollution map of the city of Antwerp.
- Open Access
- 1 January 2019
- Published by Association for Computational Linguistics (ACL)
- p. 1391-1400
Fake News Detection using Deep
- 1 January 2019
- Published by Association for Computational Linguistics (ACL)
- p. 1391-1400
Open AccessFake News Detection using Deep
- Open Access
Twitter User Geolocation using Deep Multiview Learning
Predicting the geographical location of users on social networks like Twitter is an active research topic with plenty of methods proposed so far. Most of the existing work follows either a content-based or a network-based approach. The former is based on user-generated content while the latter exploits the structure of the network of users. In this paper, we propose a more generic approach, which incorporates not only both content-based and network-based features, but also other available information into a unified model. Our approach, named Multi-Entry Neural Network (MENET), leverages the latest advances in deep learning and multiview learning. A realization of MENET with textual, network and metadata features results in an effective method for Twitter user geolocation, achieving the state of the art on two well-known datasets.
Open AccessTwitter User Geolocation using Deep Multiview Learning
Predicting the geographical location of users on social networks like Twitter is an active research topic with plenty of methods proposed so far. Most of the existing work follows either a content-based or a network-based approach. The former is based on user-generated content while the latter exploits the structure of the network of users. In this paper, we propose a more generic approach, which incorporates not only both content-based and network-based features, but also other available information into a unified model. Our approach, named Multi-Entry Neural Network (MENET), leverages the latest advances in deep learning and multiview learning. A realization of MENET with textual, network and metadata features results in an effective method for Twitter user geolocation, achieving the state of the art on two well-known datasets.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6304-6308
Twitter User Geolocation Using Deep Multiview Learning
Predicting the geographical location of users on social networks like Twitter is an active research topic with plenty of methods proposed so far. Most of the existing work follows either a content-based or a network-based approach. The former is based on user-generated content while the latter exploits the structure of the network of users. In this paper, we propose a more generic approach, which incorporates not only both content-based and network-based features, but also other available information into a unified model. Our approach, named Multi-Entry Neural Network (MENET), leverages the latest advances in deep learning and multiview learning. A realization of MENET with textual, network and metadata features results in an effective method for Twitter user geolocation, achieving the state of the art on two well-known datasets.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6304-6308
Twitter User Geolocation Using Deep Multiview Learning
Predicting the geographical location of users on social networks like Twitter is an active research topic with plenty of methods proposed so far. Most of the existing work follows either a content-based or a network-based approach. The former is based on user-generated content while the latter exploits the structure of the network of users. In this paper, we propose a more generic approach, which incorporates not only both content-based and network-based features, but also other available information into a unified model. Our approach, named Multi-Entry Neural Network (MENET), leverages the latest advances in deep learning and multiview learning. A realization of MENET with textual, network and metadata features results in an effective method for Twitter user geolocation, achieving the state of the art on two well-known datasets.
- 1 April 2018
- Published by Elsevier in Telematics and Informatics
- Vol. 35 (1) , 195-212
Twitter data analysis for studying communities of practice in the media industry
- 1 April 2018
- Published by Elsevier in Telematics and Informatics
- Vol. 35 (1) , 195-212
Twitter data analysis for studying communities of practice in the media industry