Quang-Thinh Bui

dblp:257/3577 · DBLP profile ↗
← Back
14ranked-venue papers
6as first author
13since 2021 · last 2026
0000-0002-7357-2574ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 11 · 5 first-author · 10 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Topology-Driven Rough Set Classification Using Ball Mapper Coverings for Healthcare Intelligence
Quang-Thinh Bui, Quang-Loc Pham, Minh-Khoi Pham, Minh-Huy Bui, Phu Pham, Bay Vo
ACIIDS (2)1
2026 Fast-NSTBC: A Scalable Topological-Based Clustering Method for Large Network-Constrained Geospatial Data
Trang T. D. Nguyen, Loan T. T. Nguyen, Quang-Thinh Bui, Phu Pham, Bay Vo
ACIIDS (1)3
2026 A novel neutrosophic fuzzy decision-making approach based on distance from the average solution under uncertainty
Thanh Nha Nguyen, Quang-Thinh Bui, Bay Vo
Eng. Appl. Artif. Intell.2
2026 A novel framework for handling uncertainty: Intuitionistic fuzzy rough soft sets
abstract
Intuitionistic fuzzy sets extend traditional fuzzy sets by incorporating degrees of membership, non-membership, and indeterminacy, making them particularly useful in contexts where uncertainty and hesitancy are prevalent. Rough soft sets combine rough sets' approximation capabilities with soft sets' flexible, parameterized approach to managing uncertainty. This study introduces Intuitionistic Fuzzy Rough Soft (IFRS) sets, integrating these advantages to create a robust framework for handling uncertainty, vagueness, and ambiguity in complex decision-making environments. The paper meticulously defines operations, operators, and measures between IFRS sets, establishing their characteristic properties through rigorous mathematical demonstrations. An innovative algorithm is proposed to address multi-criteria decision-making problems within this framework. The algorithm's effectiveness is thoroughly evaluated through comparisons with state-of-the-art algorithms using reputable datasets in medical consultation, agricultural land evaluation, educational support, and sensitivity analysis experiments. The results demonstrate the proposed algorithm's superior performance and robustness in complex decision-making scenarios, highlighting its potential as a valuable practical tool.
Quang-Thinh Bui, Thanh Nha Nguyen, Hung Son Nguyen, Bay Vo
Inf. Sci.1
2026 U-MobileViT: A Lightweight Vision Transformer-based Backbone for Panoptic Driving Segmentation
Phuoc-Thinh Nguyen, The-Bang Nguyen, Phu Pham, Quang-Thinh Bui
Signal Process. Image Commun.4
2025 Efficient strategies for spatial data clustering using topological relations
Trang T. D. Nguyen, Loan T. T. Nguyen, Quang-Thinh Bui, Le Nhat Duy, Witold Pedrycz, Bay Vo
Appl. Intell.3
2025 NS-IDBSCAN: An efficient incremental clustering method for geospatial data in network space
Trang T. D. Nguyen, Loan T. T. Nguyen, Quang-Thinh Bui, Le Nhat Duy, Bay Vo
Inf. Sci.3
2025 Graph-induced topological space: from topologies to separation axioms
Quang-Thinh Bui, Thanh Nha Nguyen, Tzung-Pei Hong, Bay Vo
Soft Comput.1
2025 Topological Data Analysis in Graph Neural Networks: Surveys and Perspectives
abstract
For many years, topological data analysis (TDA) and deep learning (DL) have been considered separate data analysis and representation learning approaches, which have nothing in common. The root cause of this challenge comes from the difficulties in building, extracting, and integrating TDA constructs, such as barcodes or persistent diagrams, within deep neural network architectures. Therefore, the powers of these two approaches are still on their islands and have not yet combined to form more powerful tools for dealing with multiple complex data analysis tasks. Fortunately, we have witnessed several remarkable attempts to integrate DL-based architectures with topological learning paradigms in recent years. These topology-driven DL techniques have notably improved data-driven analysis and mining problems, especially within graph datasets. Recently, graph neural networks (GNNs) have emerged as a popular deep neural architecture, demonstrating significant performance in various graph-based analysis and learning problems. Explicitly, within the manifold paradigm, the graph is naturally considered as a topological object (e.g., the topological properties of the given graph can be represented by the edge weights). Therefore, integrating TDA and GNN is considered an excellent combination. Many well-known studies have recently presented the effectiveness of TDA-assisted GNN-based architectures in dealing with complex graph-based data representation analysis and learning problems. Motivated by the successes of recent research, we present systematic literature about this nascent and promising research direction in this article, which includes general taxonomy, preliminaries, and recently proposed state-of-the-art topology-driven GNN models and perspectives.
Phu Pham, Quang-Thinh Bui, Ngoc Thanh Nguyen 0001, Robert Kozma 0001, Philip S. Yu, Bay Vo
IEEE Trans. Neural Networks Learn. Syst.2
2024 An efficient strategy for mining high-efficiency itemsets in quantitative databases
Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, Quang-Thinh Bui, Loan T. T. Nguyen, Unil Yun, Bay Vo
Knowl. Based Syst.4
2023 Information measures based on similarity under neutrosophic fuzzy environment and multi-criteria decision problems
Quang-Thinh Bui, My-Phuong Ngo, Václav Snásel, Witold Pedrycz, Bay Vo
Eng. Appl. Artif. Intell.1
2023 An efficient topological-based clustering method on spatial data in network space
Trang T. D. Nguyen, Loan T. T. Nguyen, Quang-Thinh Bui, Unil Yun, Bay Vo
Expert Syst. Appl.3
2021 SFCM: A Fuzzy Clustering Algorithm of Extracting the Shape Information of Data
abstract
Topological data analysis is a new theoretical trend using topological techniques to mine data. This approach helps determine topological data structures. It focuses on investigating the global shape of data rather than on local information of high-dimensional data. The Mapper algorithm is considered as a sound representative approach in this area. It is used to cluster and identify concise and meaningful global topological data structures that are out of reach for many other clustering methods. In this article, we propose a new method called the Shape Fuzzy C-Means (SFCM) algorithm, which is constructed based on the Fuzzy C-Means algorithm with particular features of the Mapper algorithm. The SFCM algorithm can not only exhibit the same clustering ability as the Fuzzy C-Means but also reveal some relationships through visualizing the global shape of data supplied by the Mapper. We present a formal proof and include experiments to confirm our claims. The performance of the enhanced algorithm is demonstrated through a comparative analysis involving the original algorithm, Mapper, and the other fuzzy set based improved algorithm, F-Mapper, for synthetic and real-world data. The comparison is conducted with respect to output visualization in the topological sense and clustering stability.
Quang-Thinh Bui, Bay Vo, Václav Snásel, Witold Pedrycz, Tzung-Pei Hong, Ngoc Thanh Nguyen 0001, Mu-Yen Chen
IEEE Trans. Fuzzy Syst.1
2020 F-Mapper: A Fuzzy Mapper clustering algorithm
Quang-Thinh Bui, Bay Vo, Hoang-Anh Nguyen Do, Nguyen Quoc Viet Hung, Václav Snásel
Knowl. Based Syst.1