Search

Twin support vector regression (TSVR) is a useful extension of traditional support vector regression (SVR). As a new regression model, the basic idea of TSVR is generating a pair of nonparallel functions on both sides of the training data points, such that the ε -insensitive upper and lower bounds of the regression function can be determined. Owing to its excellent learning ability, TSVR has become a research hotspot in the field of machine learning. With the deepening of such research, scholars have found that TSVR also has certain limitations, and thus various improved models have been proposed. This review aims to report the recent developments in twin support vector regression. First, the basic concepts and basic models of TSVR are introduced. Second, the improved algorithms and applications of TSVR in recent years are summarized, and the advantages and disadvantages of its representative algorithms are analyzed and compared with the experiments. Finally, we discuss the research conducted on TSVR. [ABSTRACT FROM AUTHOR]

Twin support vector machines (TWSVM) is a new machine learning method based on the theory of Support Vector Machine (SVM). Unlike SVM, TWSVM would generate two non-parallel planes, such that each plane is closer to one of the two classes and is as far as possible from the other. In TWSVM, a pair of smaller sized quadratic programming problems (QPPs) is solved, instead of solving a single large one in SVM, making the computational speed of TWSVM approximately 4 times faster than the standard SVM. At present, TWSVM has become one of the popular methods because of its excellent learning performance. In this paper, the research progress of TWSVM is reviewed. Firstly, it analyzes the basic theory of TWSVM, then tracking describes the research progress of TWSVM including the learning model and specific applications in recent years, finally points out the research and development prospects. This helps researchers to effectively use TWSVM as an emerging research approach, encouraging them to work further on performance improvement. [ABSTRACT FROM AUTHOR]

Recently, some nonparallel plane regressors, such as twin support vector regression (TSVR), and least squares TSVR (LSTSVR), have been proposed and have attracted much attention. However, these algorithms are not sparse, which would make their learning speed low. In this paper, we propose a novel nonparallel plane regressor, which can automatically select the relevant features. Firstly, we introduce a regularization term to the objective function of LSTSVR, which can guarantee two quadratic programming problems (QPPs) are strong convex, implying that the proposed algorithm can obtain the global but unique solution. Secondly, the primal formulation is converted to a linear programming (LP) problem. Then, we solve the dual of the LP formulation by minimizing its exterior penalty problem, which would make our method yield very sparse solutions. In other words, this method can suppress input features so that it can obtain comparable regression performance when using fewer computational time. Numerical experiments on artificial dataset and benchmark datasets demonstrate the feasibility and validity of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In recent years, with the great success of deep learning and especially deep unsupervised learning, many deep architectural clustering methods, collectively known as deep clustering, have emerged. Deep clustering shows the potential to outperform traditional methods, especially in handling complex high-dimensional data, taking full advantage of deep learning. To achieve a comprehensive overview of the field of deep clustering, this review systematically explores deep clustering methods and their various applications. First, the basic network architecture of deep clustering is described in detail, including the common network frameworks, and loss functions. Subsequently, deep clustering is divided into several categories based on the network architecture, and benchmark datasets and evaluation metrics in the field are introduced. Next, the real-world applications of deep clustering are explored in depth, providing successful cases in the fields of bioinformatics, medicine, anomaly detection, and image processing, highlighting the broad applicability of deep clustering in solving real-world challenges. Finally, the paper summarizes its contributions and explores potential directions for future research in deep clustering. • Analyze the theory of deep clustering and its performance advantages and disadvantages. • Summarizes the improvement of deep clustering in recent years, analyzes the improvement effect, and shows it with experimental data. • Finally, the related application research of deep clustering in different fields is introduced. At the same time, we summarize and prospect the improvement and development of deep clustering. [ABSTRACT FROM AUTHOR]

• Analyze the theory of density peaks clustering (DPC) and its performance. • Summarizes the improvement of DPC and analyzes it with experimental data. • The related application research of improved DPC in different fields is introduced. Density peaks clustering (DPC) algorithm is a new algorithm based on density clustering analysis, which can quickly obtain the cluster centers by drawing the decision diagram by using the calculation of local density and relative distance. Without prior knowledge and iteration, the parameters and structure are simple and easy to implement. Since it was proposed in 2014, it has attracted a large number of researchers to explore experiments and improve applications in recent years. In this paper, we first analyze the theory of DPC and its performance advantages and disadvantages. Secondly, it summarizes the improvement of DPC in recent years, analyzes the improvement effect, and shows it with experimental data. The related application research of DPC in different fields is introduced. Finally, the clustering results of DPC, LCDPC, DCHDPC and NADPC algorithms in different data sets are analyzed. Experiments show that the improved algorithm can divide the clustering more accurately, which provides new ideas for improving DPC algorithm in the future. At the same time, this paper summarizes and prospects the improvement and development of DPC. [ABSTRACT FROM AUTHOR]

Abstract Functional networks (FNs) are extensions of neural networks (NNs). Unlike NNs, FNs considers general functional models instead of sigmoid-like models. Additionally, in FNs, there are no weights associated with the links that connect neurons. In this paper, we review the research progress and applications of FNs models in recent years. First, we introduce FNs architecture, three typical functional models and the learning process, and we explain the differences between NNs and FNs. Second, we discuss recent applications of FNs that have been introduced in many fields, such as time series prediction, differential and functional equations, pattern classification, detection and prediction, approximation computation, complex system modeling, computer-aided design (CAD), and linear and nonlinear regression. Finally, we present some remarks on future research directions for FNs. [ABSTRACT FROM AUTHOR]