The purpose of this study is to propose an approach to recommend classification algorithms for real-world classification problems. First, the extension rhombus thinking mode is used to construct performance indicators...
详细信息
ISBN:
(纸本)9781509030712
The purpose of this study is to propose an approach to recommend classification algorithms for real-world classification problems. First, the extension rhombus thinking mode is used to construct performance indicators of the classification algorithm. Second, an extension-based recommendation method about classification algorithm is proposed. Third, a recommendation system is designed to implement our recommendation method. The system input is divided into two parts: expert knowledge and user preference. In order to reduce user workloads and confusions about parameter settings, a real-time interaction progressive strategy is proposed to help users complete their inputs. Additionally, the case function is designed so that users can get more support information from current and previous cases. At last, an application is used to verify the effectiveness of our system. And the application result shows that our system can provide an efficient and intelligent decision support for users.
This work presented a defect classification methods based on improved classification algorithm in additive manufacturing process. To make the algorithm be applicable in process monitoring tasks, a method of optimizing...
详细信息
ISBN:
(纸本)9781614997795;9781614997788
This work presented a defect classification methods based on improved classification algorithm in additive manufacturing process. To make the algorithm be applicable in process monitoring tasks, a method of optimizing the evolution process in GP evolution was raised in this work. A series of specific functions and their linear combinations were introduced to represent the GP classification model. The evolution process in this strategy is designed to optimize the coefficients of these functions and the offset. The advantaged in GP are also completely inherited. Comparing with GP alone, the improved strategy could reach higher classification accuracy in engineering application, i.e., process monitoring of additive manufacture.
This paper proposes a classification algorithm including two stages. In training stage, multiple hyper-spheres are generated respectively to enclose every category of samples following the order from the biggest hyper...
详细信息
This paper proposes a classification algorithm including two stages. In training stage, multiple hyper-spheres are generated respectively to enclose every category of samples following the order from the biggest hyper-sphere to the smallest one, and some of hyper-spheres are discarded while they only enclose one sample. In testing stage, testing samples are checked by using hyper-spheres firstly, and the category of a sample is recognized by the enclosing hyper-sphere. If a sample is not surrounded by any hyper-sphere, KNN method is used to decide its category. Four real datasets are utilized to do experiments. The results show better performance than two multiple hyper-spheres classification algorithms and attest the effectiveness of this algorithm.
ID3 decision tree is the most extensive method. It can be used to classify, identify and predict data information, and the whole system can be divided into several stages according to its nature. It plays an important...
详细信息
With the mountains of classification algorithms proposed in the literature, the study of how to select suitable classifier(s) for a given problem is important and practical. Existing methods rely on a single learner b...
详细信息
With the mountains of classification algorithms proposed in the literature, the study of how to select suitable classifier(s) for a given problem is important and practical. Existing methods rely on a single learner built on one type of meta-features or a simple combination of several types of meta-features to address this problem. In this paper, we propose a two-layer classification algorithm recommendation method called EML (Ensemble of ML-KNN for classification algorithm recommendation) to leverage the diversity of different sets of meta-features. The proposed method can automatically recommend different numbers of appropriate algorithms for different dataset, rather than specifying a fixed number of appropriate algorithm(s) as done by the ML-KNN, SLP-based and OBOE methods. Experimental results on 183 public datasets show the effectiveness of the EML method compared to the three baseline methods. (c) 2021 Elsevier B.V. All rights reserved.
Data classification is an important aspect of machine learning, as it is utilized to solve issues in a wide variety of contexts. There are numerous classifiers, but there is no single best-performing classifier for al...
详细信息
Data classification is an important aspect of machine learning, as it is utilized to solve issues in a wide variety of contexts. There are numerous classifiers, but there is no single best-performing classifier for all types of data, as the no free lunch theorem implies. Topological data analysis is an emerging topic concerned with the shape of data. One of the key tools in this field for analyzing the shape or topological properties of a dataset is persistent homology, an algebraic topology-based method for estimating the topological features of a space of points that persists across several resolutions. This study proposes a supervised learning classification algorithm that makes use of persistent homology between training data classes in the form of persistence diagrams to predict the output category of new observations. Validation of the developed algorithm was performed on real-world and synthetic datasets. The performance of the proposed classification algorithm on these datasets was compared to that of the most widely used classifiers. Validation runs demonstrated that the proposed persistent homology classification algorithm performed at par if not better than the majority of classifiers considered.
This paper present three characteristic functions which can express the luminance distribute characteristic much better. Based on these functions a region classification algorithm is presented. The algorithm can offer...
详细信息
This paper present three characteristic functions which can express the luminance distribute characteristic much better. Based on these functions a region classification algorithm is presented. The algorithm can offer more information on regions' similarity and greatly improve the efficiency and performance of match seeking in fractal coding. It can be widely applied to many kinds of fractal coding algorithms. Analysis and experimental results proved that it can offer more information on luminance distribute characteristics among regions and greatly improve the decoding quality and compression ratio with holding the running speed.
Reliable forecasting of crude oil price has received a prodigious attention by both investment companies and governments. Motivated by this issue, this paper seeks to propose a new hybrid forecasting model for crude o...
详细信息
Reliable forecasting of crude oil price has received a prodigious attention by both investment companies and governments. Motivated by this issue, this paper seeks to propose a new hybrid forecasting model for crude oil price trend prediction. For this purpose, the crude oil price series is initially decomposed by variational mode decomposition algorithm, and the multi-modal data features are extracted based on the decomposed modes. The volatility of crude oil prices is simultaneously converted into trend symbols through symbolic time series analysis. Machine learning multi-classifier are then trained with multi -modal data features and historical volatility as input and trend symbols as output. The well-trained models are used to predict the trend symbols of West Texas Intermediate crude oil future price. Empirical results demonstrate that the proposed hybrid forecasting model outperforms its counterparts. Among the classifiers used, the hybrid prediction model using support vector machine classifier exhibits superior predictive ability. The accuracy of the proposed model for predicting high volatility of crude oil prices is evidenced to be better than that of low volatility. (c) 2021 Elsevier Ltd. All rights reserved.
With the advent of high-dimensional stored big data and streaming data, suddenly machine learning on a very large scale has become a critical need. Such machine learning should be extremely fast, should scale up easil...
详细信息
With the advent of high-dimensional stored big data and streaming data, suddenly machine learning on a very large scale has become a critical need. Such machine learning should be extremely fast, should scale up easily with volume and dimension, should be able to learn from streaming data, should automatically perform dimension reduction for high-dimensional data, and should be deployable on hardware. Neural networks are well positioned to address these challenges of large scale machine learning. In this paper, we present a method that can effectively handle large scale, high-dimensional data. It is an online method that can be used for both streaming and large volumes of stored big data. It primarily uses Kohonen nets, although only a few selected neurons (nodes) from multiple Kohonen nets are actually retained in the end; we discard all Kohonen nets after training. We use Kohonen nets both for dimensionality reduction through feature selection and for building an ensemble of classifiers using single Kohonen neurons. The method is meant to exploit massive parallelism and should be easily deployable on hardware that implements Kohonen nets. Some initial computational results are presented.
The current classification is difficult to overcome the high-dimension classification problems. So, we will design the decreasing dimension method. Locally linear embedding is that the local optimum gradually approach...
详细信息
The current classification is difficult to overcome the high-dimension classification problems. So, we will design the decreasing dimension method. Locally linear embedding is that the local optimum gradually approaches the global optimum, especially the complicated manifold learning problem used in big data dimensionality reduction needs to find an optimization method to adjust k-nearest neighbors and extract dimensionality. Therefore, we intend to use orthogonal mapping to find the optimization closest neighbors k, and the design is based on the Lebesgue measure constraint processing technology particle swarm locally linear embedding to improve the calculation accuracy of popular learning algorithms. So, we propose classification algorithm based on improved locally linear embedding. The experiment results show that the performance of proposed classification algorithm is best compared with the other algorithm.
暂无评论