New Advances in Data Analytics and Mining

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 9 June 2026 | Viewed by 4311

Special Issue Editor


E-Mail Website
Guest Editor
School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China
Interests: clustering and classification algorithms; feature selection; rough set; granular computing; machine learning
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

In recent years, with the rapid development of computer and network techniques, some traditional data analytics and mining technologies are facing unprecedented challenges. How to deal with large scale data is now a challenging task in the fields of information science and artificial intelligence. Many new data analytics and mining methods, including deep learning, granular computing, concept lattice and visualization method, are developed in order to solve the problem of big data analytics and mining.

This Special Issue provides a platform for researchers to present their novel and unpublished works in the domain of data analytics and mining. We are pleased to invite you, along with the members of your research group, to contribute to the forthcoming Special Issue, entitled “New Advances in Data Analytics and Mining”. Potential topics include, but are not limited to, the following:

  1. Data mining techniques;
  2. Knowledge-based granular data analytics;
  3. Knowledge-based three-way data analytics;
  4. Concept lattice;
  5. Visualization methods;
  6. Deep learning;
  7. Clustering and classification algorithms;
  8. Uncertainty in big data;
  9. Cognitive computing;
  10. Features selection.

Prof. Dr. Xibei Yang
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • data mining
  • data analytics
  • granular computing
  • uncertainty analysis

Published Papers (4 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

13 pages, 8207 KiB  
Article
Enhancement of the Classification Performance of Fuzzy C-Means through Uncertainty Reduction with Cloud Model Interpolation
by Weiwei Mao and Kaijie Xu
Mathematics 2024, 12(7), 975; https://doi.org/10.3390/math12070975 - 25 Mar 2024
Viewed by 520
Abstract
As an information granulation technology, clustering plays a pivotal role in unsupervised learning, serving as a fundamental cornerstone for various data mining techniques. The effective and accurate classification of data is a central focus for numerous researchers. For a dataset, we assert that [...] Read more.
As an information granulation technology, clustering plays a pivotal role in unsupervised learning, serving as a fundamental cornerstone for various data mining techniques. The effective and accurate classification of data is a central focus for numerous researchers. For a dataset, we assert that the classification performance of a clustering method is significantly influenced by uncertain data, particularly those situated at the cluster boundaries. It is evident that uncertain data encapsulate richer information compared with others. Generally, the greater the uncertainty, the more information the data holds. Therefore, conducting a comprehensive analysis of this particular subset of data carries substantial significance. This study presents an approach to characterize data distribution properties using fuzzy clustering and defines the boundary and non-boundary characteristics (certainty and uncertainty) of the data. To improve the classification performance, the strategy focuses on reducing the uncertainty associated with boundary data. The proposed scheme involves inserting data points with the cloud computing technology based on the distribution characteristics of the membership functions to diminish the uncertainty of uncertain data. Building upon this, the contribution of boundary data is reassigned to the prototype in order to diminish the proportion of uncertain data. Subsequently, the classifier is optimized through data label (classification error) supervision. Ultimately, the objective is to leverage clustering algorithms for classification, thereby enhancing overall classification accuracy. Experimental results substantiate the effectiveness of the proposed scheme. Full article
(This article belongs to the Special Issue New Advances in Data Analytics and Mining)
Show Figures

Figure 1

16 pages, 449 KiB  
Article
A Task Orchestration Strategy in a Cloud-Edge Environment Based on Intuitionistic Fuzzy Sets
by Chunmei Huang, Bingbing Fan and Chunmao Jiang
Mathematics 2024, 12(1), 122; https://doi.org/10.3390/math12010122 - 29 Dec 2023
Viewed by 610
Abstract
In the context of the burgeoning cloud-edge collaboration paradigm, powered by advancements in the Internet of Things (IoT), cloud computing, and 5G technology, this paper proposes a task orchestrating strategy for cloud-edge collaborative environments based on intuitionistic fuzzy sets. The proposed strategy prioritizes [...] Read more.
In the context of the burgeoning cloud-edge collaboration paradigm, powered by advancements in the Internet of Things (IoT), cloud computing, and 5G technology, this paper proposes a task orchestrating strategy for cloud-edge collaborative environments based on intuitionistic fuzzy sets. The proposed strategy prioritizes efficient resource utilization, minimizes task failures, and reduces service time. First, WAN bandwidth, edge server virtual machine utilization, delay sensitivity of the task, and task length are used to determine whether the task should be executed on the cloud or edge device. Then, the cloud-edge collaborative decision-making algorithm is used to select the task’s target edge servers (either the local edge servers or the neighboring edge servers). Finally, simulation experiments are conducted to demonstrate the effectiveness and efficacy of the proposed algorithm. Full article
(This article belongs to the Special Issue New Advances in Data Analytics and Mining)
Show Figures

Figure 1

26 pages, 10013 KiB  
Article
An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
by Kezong Tang, Xiong-Fei Wei, Yuan-Hao Jiang, Zi-Wei Chen and Lihua Yang
Mathematics 2023, 11(21), 4439; https://doi.org/10.3390/math11214439 - 26 Oct 2023
Cited by 2 | Viewed by 1468
Abstract
The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed. To solve this problem, an adaptive ant colony optimization for large-scale traveling salesman problem (AACO-LST) is proposed. First, AACO-LST [...] Read more.
The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed. To solve this problem, an adaptive ant colony optimization for large-scale traveling salesman problem (AACO-LST) is proposed. First, AACO-LST improves the state transfer rule to make it adaptively adjust with the population evolution, thus accelerating its convergence speed; then, the 2-opt operator is used to locally optimize the part of better ant paths to further optimize the solution quality of the proposed algorithm. Finally, the constructed adaptive pheromone update rules can significantly improve the search efficiency and prevent the algorithm from falling into local optimal solutions or premature stagnation. The simulation based on 45 traveling salesman problem instances shows that AACO-LST improves the solution quality by 79% compared to the ant colony system (ACS), and in comparison with other algorithms, the PE of AACO-LST is not more than 1% and the Err is not more than 2%, which indicates that AACO-LST can find high-quality solutions with high stability. Finally, the convergence speed of the proposed algorithm was tested. The data shows that the average convergence speed of AACO-LST is more than twice that of the comparison algorithm. The relevant code can be found on our project homepage. Full article
(This article belongs to the Special Issue New Advances in Data Analytics and Mining)
Show Figures

Figure 1

30 pages, 1552 KiB  
Article
A Broad TSK Fuzzy Classifier with a Simplified Set of Fuzzy Rules for Class-Imbalanced Learning
by Jinghong Zhang, Yingying Li, Bowen Liu, Hao Chen, Jie Zhou, Hualong Yu and Bin Qin
Mathematics 2023, 11(20), 4284; https://doi.org/10.3390/math11204284 - 13 Oct 2023
Viewed by 721
Abstract
With the expansion of data scale and diversity, the issue of class imbalance has become increasingly salient. The current methods, including oversampling and under-sampling, exhibit limitations in handling complex data, leading to overfitting, loss of critical information, and insufficient interpretability. In response to [...] Read more.
With the expansion of data scale and diversity, the issue of class imbalance has become increasingly salient. The current methods, including oversampling and under-sampling, exhibit limitations in handling complex data, leading to overfitting, loss of critical information, and insufficient interpretability. In response to these challenges, we propose a broad TSK fuzzy classifier with a simplified set of fuzzy rules (B-TSK-FC) that deals with classification tasks with class-imbalanced data. Firstly, we select and optimize fuzzy rules based on their adaptability to different complex data to simplify the fuzzy rules and therefore improve the interpretability of the TSK fuzzy sub-classifiers. Secondly, the fuzzy rules are weighted to protect the information demonstrated by minority classes, thereby improving the classification performance on class-imbalanced datasets. Finally, a novel loss function is designed to derive the weights for each TSK fuzzy sub-classifier. The experimental results on fifteen benchmark datasets demonstrate that B-TSK-FC is superior to the comparative methods from the aspects of classification performance and interpretability in the scenario of class imbalance. Full article
(This article belongs to the Special Issue New Advances in Data Analytics and Mining)
Show Figures

Figure 1

Back to TopTop