Search

Data classification is a crucial aspect of knowledge discovery using machinelearning algorithm for supervised learning approach where the goal is to predict the categorical labels of new instances based on past observations. This research presents an innovative classification technique that utilizes Rough Set Attribute Reduction. The proposed method introduces the Re-heat Simulated Annealing (Re-heat SA) algorithm as a meta-heuristic approach. Rough set theory, a mathematical tool dealing with uncertainty and fuzziness in data, is employed to uncover hidden patterns in big data through feature selection. This paper introduces a novel meta-heuristic classification approach that utilizes rough set attribute reduction to achieve optimal accuracy. Re-heat SA effectively optimizes the problem by controlling the dependency degree to identify the minimal reducts required for classification prediction using the Rosetta software. Experimental results demonstrate that Re-heat SA outperforms comparable classification algorithms in discovering classification rules. The results reveal that three datasets achieved 100% accuracy, four datasets achieved accuracy rates ranging from 60% to 99%, and six datasets achieved accuracy rates ranging from 30% to 59%. Additionally, this paper discusses the need for standardization concerning the machine learning pipeline processes as big data and its handling grows exponentially. [ABSTRACT FROM AUTHOR]

A great deal of study has been done recently on support vector machines (SVMs) and how they are used in various scientific domains. The statistical learning theory's mathematical foundation allows SVM to offer logical solutions to issues. A portion of the training input serves as the SVM's solution. SVM is frequently employed in applications involving feature reduction. regression. and novelty detection. Additionally, studies conducted in certain fields where SVM performs badly have prompted the creation of alternative SVM applications. including big data sets, multiclassification SVM. and imbalanced data sets SVM. Furthermore, SVM is used with other more sophisticated techniques. such as evolve algorithms. to enhance classification performance and optimize parameters. SVM algorithms are now widely used in research and applications across a number of scientific and engineering domains. The SVM might be one of the primary options for big data compatibility and big data classification because of its advantages. Data preparation methods must be created in order to mask data into the appropriate format for learning in order to do this. This paper provides a quick overview of SVM. list several applications, draw attention to current issues and patterns, and point out sonic of SVM's drawbacks in this essay. This document can be used to categorize vast volumes of data and recommend research areas for further investigation. [ABSTRACT FROM AUTHOR]

In recent years, various studies have been conducted on SVMs and their applications in different area. They have been developed significantly in many areas. SVM is one of the most robust classification and regression algorithms that plays a significant role in pattern recognition. However, SVM has not been developed significantly in some areas like large-scale datasets, unbalanced datasets, and multiclass classification. Efficient SVM training in large-scale datasets is of great importance in the big data era. However, as the number of samples increases, the time and memory required to train SVM increase, making SVM impractical even for a medium-sized problem. With the emergence of big data, this problem becomes more significant. This paper presents a novel distributed method for SVM training in which a very small subset of training samples is used for classification, which reduces the problem size and thus the required memory and computational resources. The solution of this problem almost converges to standard SVM. This method includes three steps: first, detecting a subset of distributed training samples, second, creating local models of SVM and obtaining partial vectors, and finally combining the partial vectors and obtaining the global vector and the final model. In addition, the datasets which suffer from unbalanced number of samples and tend to the majority class, the proposed method balances the samples of the two classes and it can be used in unbalanced datasets. The empirical results show that using this method is efficient for large-scale problems. [ABSTRACT FROM AUTHOR]

Recently, with the development of technology, it is quite important to study scalable computational methods for handling large-scale data in big data applications. The cloud/edge computing are powerful tools for solving big data problems, and provide flexible computation and huge storage capability. Moreover, in the real world, the data in big data applications usually are stored in decentralized computation resources, which affects the design of artificial intelligence algorithms. Therefore, in this work, we focus on distribution machine learning, and propose a novel distributed classification algorithm to deal with imbalanced data. Specifically, we explore the distributed alternating direction method of multipliers (ADMM) framework, and divide the distributed classification problem as some small problems which can be solved by the decentralized resources in parallel. Furthermore, based on the distributed framework, we use a acceleration strategy to improve the time efficiency with designing a more suitable model for imbalanced data classification. The theoretical analysis and experiments results show that our proposed method converges faster than other distributed ADMM method and saves training time, which can improve the scalability of distributed classification on imbalanced data. [ABSTRACT FROM AUTHOR]