Do Van Thanh
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
Do Van Thanh has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Duc-Dung Nguyen
Vietnam Academy of Science and Technology
2 shared publications Ivar Jørstad
Ubisafe AS, Norway
2 shared publicationsPhuong Truong Duc
Hanoi Capital University
2 shared publications- Truong Duc Phuong
Hanoi Metropolitan University , Vietnam
2 shared publications Charlott Eliasson
Blekinge Institute of Technology, Karlskrona, Sweden
1 shared publication- Cu Nguyen Giap
Faculty of Economic Information System and E-Commerce, Thuongmai University, Ho Tung Mau, Cau Giay, Hanoi, 100000, Vietnam
1 shared publication
Latest Publications
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 173223-173242
Kernel-Based Dimension Reduction Method for Time Series Nowcasting
Nowadays nowcasts are closely related to big data. Currently, the most popular nowcast model-building approach is to use the factor bridge equation (BE) model or factor mixed data sampling (MIDAS) model, where the factors are extracted from large datasets using the principal component analysis (PCA) method. However, the PCA method only suits datasets approximating a hyperplane and real-world datasets are sometimes unsuitable. This study proposes a kernel-based dimension-reduction method. It is a natural extension of the PCA method and is called KTPCA. The KTPCA can reduce the dimensionality of datasets without approximating a hyperplane. The dimension reduction performance of the iterative KTPCA method was superior to that of the PCA, Sparse PCA (SPCA), Randomized SPCA (RSPCA), and Robust SPCA (ROBSPCA) methods. In addition, PCA and SPCA methods are competitive in terms of dimension reduction performance. This study also proposed a nowcasting procedure using the iterative KTPCA method. This procedure can be applied to build nowcast models and update forecasts of a target variable at a low frequency under real-time data flows of original variables at a higher frequency.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 173223-173242
Open AccessKernel-Based Dimension Reduction Method for Time Series Nowcasting
Nowadays nowcasts are closely related to big data. Currently, the most popular nowcast model-building approach is to use the factor bridge equation (BE) model or factor mixed data sampling (MIDAS) model, where the factors are extracted from large datasets using the principal component analysis (PCA) method. However, the PCA method only suits datasets approximating a hyperplane and real-world datasets are sometimes unsuitable. This study proposes a kernel-based dimension-reduction method. It is a natural extension of the PCA method and is called KTPCA. The KTPCA can reduce the dimensionality of datasets without approximating a hyperplane. The dimension reduction performance of the iterative KTPCA method was superior to that of the PCA, Sparse PCA (SPCA), Randomized SPCA (RSPCA), and Robust SPCA (ROBSPCA) methods. In addition, PCA and SPCA methods are competitive in terms of dimension reduction performance. This study also proposed a nowcasting procedure using the iterative KTPCA method. This procedure can be applied to build nowcast models and update forecasts of a target variable at a low frequency under real-time data flows of original variables at a higher frequency.
- 1 January 2021
- Published by Springer Nature
- p. 83-94
Forecast of the VN30 Index by Day Using a Variable Dimension Reduction Method Based on Kernel Tricks
- 1 January 2021
- Published by Springer Nature
- p. 83-94
Forecast of the VN30 Index by Day Using a Variable Dimension Reduction Method Based on Kernel Tricks
- 1 January 2021
- Published by Springer Nature
- p. 108-128
Nowcasting Vietnam’s RGDP Using a Kernel-Based Dimensional Reduction Method
- 1 January 2021
- Published by Springer Nature
- p. 108-128
Nowcasting Vietnam’s RGDP Using a Kernel-Based Dimensional Reduction Method
- 1 January 2021
- Published by Springer Nature
- p. 138-148
Dimensionality Reduction Performance of Sparse PCA Methods
- 1 January 2021
- Published by Springer Nature
- p. 138-148
Dimensionality Reduction Performance of Sparse PCA Methods
- 25 November 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
- Vol. 28 (06) , 957-979
Mining Fuzzy Common Sequential Rules with Fuzzy Time-Interval in Quantitative Sequence Databases
There are two kinds of sequential rules. They are classical sequential rules and common sequential rules. The common sequential rules present the relationship between unordered itemsets in which all the items in the antecedent part have to appear before the ones in the consequent part. All existing algorithms for mining common sequential rules can not apply to quantitative sequence databases. Furthermore, the common sequential rules found so far did not yet reveal the time gap about the apperance of itemsets in its antecedent and consequent parts. The purpose of this article is to overcome the two disadvantages mentioned above. Specifically, the article proposes an algorithm called IFERMiner to discover common sequential rules in quantitative sequence databases, where the time gap about appearance of two attribute sets in its antecedent and consequent parts is taken account. This algorithm was developed from the ERMiner algorithm that is the most efficient algorithm to discover common sequential rules in transactional sequence databases now. The computational complexity of the IFERMiner algorithm is also shown in the article and it is polynomial. The FCSI rules found out by the IFERMiner algorithm are useful for marketing domain and market analysis.
- 25 November 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
- Vol. 28 (06) , 957-979
Mining Fuzzy Common Sequential Rules with Fuzzy Time-Interval in Quantitative Sequence Databases
There are two kinds of sequential rules. They are classical sequential rules and common sequential rules. The common sequential rules present the relationship between unordered itemsets in which all the items in the antecedent part have to appear before the ones in the consequent part. All existing algorithms for mining common sequential rules can not apply to quantitative sequence databases. Furthermore, the common sequential rules found so far did not yet reveal the time gap about the apperance of itemsets in its antecedent and consequent parts. The purpose of this article is to overcome the two disadvantages mentioned above. Specifically, the article proposes an algorithm called IFERMiner to discover common sequential rules in quantitative sequence databases, where the time gap about appearance of two attribute sets in its antecedent and consequent parts is taken account. This algorithm was developed from the ERMiner algorithm that is the most efficient algorithm to discover common sequential rules in transactional sequence databases now. The computational complexity of the IFERMiner algorithm is also shown in the article and it is polynomial. The FCSI rules found out by the IFERMiner algorithm are useful for marketing domain and market analysis.
- Open Access
- 27 February 2020
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 36 (1) , 17-32
AGGREGATION OF SYMBOLIC POSSIBILISTIC KNOWLEDGE BASES FROM THE POSTULATE POINT OF VIEW
Aggregation of knowledge bases in the propositional language was soon investigated and the requirements of aggregation processes of propositional knowledge bases basically are unified within the community of researchers and applicants. Aggregation of standard possibilistic knowledge bases where the weight of propositional formulas being numeric has also been investigated and applied in building the intelligent systems, in multi-criterion decision-making processes as well as in decision-making processes implemented by many people. Symbolic possibilistic logic (SPL for short) where the weight of the propositional formulas is symbols was proposed, and recently it was proven that SPL is soundness and completeness. In order to apply SPL in building intelligent systems as well as in decision-making processes, it is necessary to solve the problem of aggregation of symbolic possibilistic knowledge bases (SPK bases for short). This problem has not been researched so far. The purpose of this paper is to investigate aggregation processes of SPK bases from the postulate point of view in propositional language. These processes are implemented via impossibility distributions defined from SPK bases. Characteristics of merging operators, including hierarchical merging operators, of symbolic impossibility distributions (SIDs for short) from the postulate point of view will be shown in the paper.
- 27 February 2020
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 36 (1) , 17-32
Open AccessAGGREGATION OF SYMBOLIC POSSIBILISTIC KNOWLEDGE BASES FROM THE POSTULATE POINT OF VIEW
Aggregation of knowledge bases in the propositional language was soon investigated and the requirements of aggregation processes of propositional knowledge bases basically are unified within the community of researchers and applicants. Aggregation of standard possibilistic knowledge bases where the weight of propositional formulas being numeric has also been investigated and applied in building the intelligent systems, in multi-criterion decision-making processes as well as in decision-making processes implemented by many people. Symbolic possibilistic logic (SPL for short) where the weight of the propositional formulas is symbols was proposed, and recently it was proven that SPL is soundness and completeness. In order to apply SPL in building intelligent systems as well as in decision-making processes, it is necessary to solve the problem of aggregation of symbolic possibilistic knowledge bases (SPK bases for short). This problem has not been researched so far. The purpose of this paper is to investigate aggregation processes of SPK bases from the postulate point of view in propositional language. These processes are implemented via impossibility distributions defined from SPK bases. Characteristics of merging operators, including hierarchical merging operators, of symbolic impossibility distributions (SIDs for short) from the postulate point of view will be shown in the paper.
- 1 September 2019
- Published by Institute of Economics of the Ural Branch of the RAS in Economy of regions
- Vol. 15 (3) , 695-706
Macro-Econometric Model for Medium-Term Socio-Economic Development Planning in Vietnam. Part 2: Application of the Model
- 1 September 2019
- Published by Institute of Economics of the Ural Branch of the RAS in Economy of regions
- Vol. 15 (3) , 695-706
Macro-Econometric Model for Medium-Term Socio-Economic Development Planning in Vietnam. Part 2: Application of the Model
- 2 August 2019
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 35 (3) , 217-232
FUZZY COMMON SEQUENTIAL RULES MINING IN QUANTITATIVE SEQUENCE DATABASES
Common Sequential Rules present a relationship between unordered itemsets in which the items in antecedents have to appear before ones in consequents. The algorithms proposed to find the such rules so far are only applied for transactional sequence databases, not applied for quantitative sequence databases.The goal of this paper is to propose a new algorithm for finding the fuzzy common sequential (FCS for short) rules in quantitative sequence databases. The proposed algorithm is improved by basing on the ERMiner algorithm. It is considered to be the most effective today compared to other algorithms for finding common sequential rules in transactional sequence database. FCS rules are more general than classical fuzzy sequential rules and are useful in marketing, market analysis, medical diagnosis and treatment
- 2 August 2019
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 35 (3) , 217-232
FUZZY COMMON SEQUENTIAL RULES MINING IN QUANTITATIVE SEQUENCE DATABASES
Common Sequential Rules present a relationship between unordered itemsets in which the items in antecedents have to appear before ones in consequents. The algorithms proposed to find the such rules so far are only applied for transactional sequence databases, not applied for quantitative sequence databases.The goal of this paper is to propose a new algorithm for finding the fuzzy common sequential (FCS for short) rules in quantitative sequence databases. The proposed algorithm is improved by basing on the ERMiner algorithm. It is considered to be the most effective today compared to other algorithms for finding common sequential rules in transactional sequence database. FCS rules are more general than classical fuzzy sequential rules and are useful in marketing, market analysis, medical diagnosis and treatment
- Open Access
- 2 August 2019
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 35 (3) , 217-232
FUZZY COMMON SEQUENTIAL RULES MINING IN QUANTITATIVE SEQUENCE DATABASES
Common Sequential Rules present a relationship between unordered itemsets in which the items in antecedents have to appear before ones in consequents. The algorithms proposed to find the such rules so far are only applied for transactional sequence databases, not applied for quantitative sequence databases.The goal of this paper is to propose a new algorithm for finding the fuzzy common sequential (FCS for short) rules in quantitative sequence databases. The proposed algorithm is improved by basing on the ERMiner algorithm. It is considered to be the most effective today compared to other algorithms for finding common sequential rules in transactional sequence database. FCS rules are more general than classical fuzzy sequential rules and are useful in marketing, market analysis, medical diagnosis and treatment
- 2 August 2019
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 35 (3) , 217-232
Open AccessFUZZY COMMON SEQUENTIAL RULES MINING IN QUANTITATIVE SEQUENCE DATABASES
Common Sequential Rules present a relationship between unordered itemsets in which the items in antecedents have to appear before ones in consequents. The algorithms proposed to find the such rules so far are only applied for transactional sequence databases, not applied for quantitative sequence databases.The goal of this paper is to propose a new algorithm for finding the fuzzy common sequential (FCS for short) rules in quantitative sequence databases. The proposed algorithm is improved by basing on the ERMiner algorithm. It is considered to be the most effective today compared to other algorithms for finding common sequential rules in transactional sequence database. FCS rules are more general than classical fuzzy sequential rules and are useful in marketing, market analysis, medical diagnosis and treatment
- 1 March 2019
- Published by Institute of Economics of the Ural Branch of the RAS in Economy of regions
- Vol. 15 (1) , 121-136
Macro-Econometric Model for Medium-Term Socio-Economic Development Planning in Vietnam. Part 1: Structure of the Model
- 1 March 2019
- Published by Institute of Economics of the Ural Branch of the RAS in Economy of regions
- Vol. 15 (1) , 121-136
Macro-Econometric Model for Medium-Term Socio-Economic Development Planning in Vietnam. Part 1: Structure of the Model