32 results on '"Chen, Badong"'
Search Results
2. Efficient and robust deep learning with Correntropy-induced loss function
- Author
-
Chen, Liangjun, Qu, Hua, Zhao, Jihong, Chen, Badong, and Principe, Jose C.
- Published
- 2016
- Full Text
- View/download PDF
3. Multikernel Correntropy for Robust Learning.
- Author
-
Chen, Badong, Xie, Yuqing, Wang, Xin, Yuan, Zejian, Ren, Pengju, and Qin, Jing
- Abstract
As a novel similarity measure that is defined as the expectation of a kernel function between two random variables, correntropy has been successfully applied in robust machine learning and signal processing to combat large outliers. The kernel function in correntropy is usually a zero-mean Gaussian kernel. In a recent work, the concept of mixture correntropy (MC) was proposed to improve the learning performance, where the kernel function is a mixture Gaussian kernel, namely, a linear combination of several zero-mean Gaussian kernels with different widths. In both correntropy and MC, the center of the kernel function is, however, always located at zero. In the present work, to further improve the learning performance, we propose the concept of multikernel correntropy (MKC), in which each component of the mixture Gaussian kernel can be centered at a different location. The properties of the MKC are investigated and an efficient approach is proposed to determine the free parameters in MKC. Experimental results show that the learning algorithms under the maximum MKC criterion (MMKCC) can outperform those under the original maximum correntropy criterion (MCC) and the maximum MC criterion (MMCC). [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. Efficient and Robust MultiView Clustering With Anchor Graph Regularization.
- Author
-
Yang, Ben, Zhang, Xuetao, Lin, Zhiping, Nie, Feiping, Chen, Badong, and Wang, Fei
- Subjects
NONNEGATIVE matrices ,MATRIX decomposition ,MATHEMATICAL regularization ,COMPUTATIONAL complexity ,GRAPH algorithms ,CHARTS, diagrams, etc. ,LAPLACIAN matrices - Abstract
Multi-view clustering has received widespread attention owing to its effectiveness by integrating multi-view data appropriately, but traditional algorithms have limited applicability to large-scale real-world data due to their high computational complexity and low robustness. Focusing on the aforementioned issues, we propose an efficient and robust multi-view clustering algorithm with anchor graph regularization (ERMC-AGR). In this work, a novel anchor graph regularization (ARG) is designed to improve the quality of the learned embedded anchor graph (EAG), and the obtained EAG is decomposed by nonnegative matrix factorization (NMF) under correntropy criterion to acquire clustering results directly. Different from the traditional graph regularization that needs to construct a large-scale Laplacian matrix pertaining to the all-sample graph, our lightweight AGR, constructed from the perspective of anchors, can reduce the computational complexity significantly while improving the EAG quality. Moreover, a factor matrix of NMF is constrained to be the cluster indicator matrix to omit additional k-means after optimization. Subsequently, correntropy is utilized to improve the effectiveness and robustness of ERMC-AGR owing to its promising performance to complex noises and outliers. Extensive experiments on real-world datasets and noisy datasets show that ERMC-ARG can improve the clustering efficiency and robustness while ensuring comparable or even better effectiveness. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Asymmetric Correntropy for Robust Adaptive Filtering.
- Author
-
Chen, Badong, Xie, Yuqing, Li, Zhuang, Li, Yingsong, and Ren, Pengju
- Abstract
In recent years, correntropy has been successfully applied to robust adaptive filtering to eliminate adverse effects of impulsive noises or outliers. Correntropy is generally defined as the expectation of a Gaussian kernel between two random variables. This definition is reasonable when the error between the two random variables is symmetrically distributed around zero. For the case of asymmetric error distribution, the symmetric Gaussian kernel is however inappropriate and cannot adapt to the error distribution well. To address this problem, in this brief we propose a new variant of correntropy, named asymmetric correntropy, which uses an asymmetric Gaussian model as the kernel function. In addition, a robust adaptive filtering algorithm based on asymmetric correntropy is developed and its steady-state convergence performance is analyzed. Simulations are provided to confirm the theoretical results and good performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. Correntropy-Based Multiview Subspace Clustering.
- Author
-
Xing, Lei, Chen, Badong, Du, Shaoyi, Gu, Yuantao, and Zheng, Nanning
- Abstract
Multiview subspace clustering, which aims to cluster the given data points with information from multiple sources or features into their underlying subspaces, has a wide range of applications in the communities of data mining and pattern recognition. Compared with the single-view subspace clustering, it is challenging to efficiently learn the structure of the representation matrix from each view and make use of the extra information embedded in multiple views. To address the two problems, a novel correntropy-based multiview subspace clustering (CMVSC) method is proposed in this article. The objective function of our model mainly includes two parts. The first part utilizes the Frobenius norm to efficiently estimate the dense connections between the points lying in the same subspace instead of following the standard compressive sensing approach. In the second part, the correntropy-induced metric (CIM) is introduced to characterize the noise in each view and utilize the information embedded in different views from an information-theoretic perspective. Furthermore, an efficient iterative algorithm based on the half-quadratic technique (HQ) and the alternating direction method of multipliers (ADMM) is developed to optimize the proposed joint learning problem, and extensive experimental results on six real-world multiview benchmarks demonstrate that the proposed methods can outperform several state-of-the-art multiview subspace clustering methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
7. Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization.
- Author
-
He, Yicong, Wang, Fei, Li, Yingsong, Qin, Jing, and Chen, Badong
- Subjects
SINGULAR value decomposition ,LOW-rank matrices ,MATRIX decomposition ,MATHEMATICAL optimization ,MATRICES (Mathematics) - Abstract
Robust matrix completion aims to recover a low-rank matrix from a subset of noisy entries perturbed by complex noises. Traditional matrix completion algorithms are always based on $l_2$ -norm minimization and are sensitive to non-Gaussian noise with outliers. In this paper, we propose a novel robust and fast matrix completion method based on the maximum correntropy criterion (MCC). The correntropy-based error measure is utilized instead of the $l_2$ -based error norm to improve robustness against noise. By using the half-quadratic optimization technique, the correntropy-based optimization can be transformed into a weighted matrix factorization problem. Two efficient algorithms are then derived: an alternating minimization-based algorithm and an alternating gradient descent-based algorithm. These algorithms do not require the singular value decomposition (SVD) to be calculated for each iteration. Furthermore, an adaptive kernel width selection strategy is proposed to accelerate the convergence speed as well as improve the performance. A comparison with existing robust matrix completion algorithms is provided by simulations and shows that the new methods can achieve better performance than the existing state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
8. Maximum Correntropy Criterion With Variable Center.
- Author
-
Chen, Badong, Wang, Xin, Li, Yingsong, and Principe, Jose C.
- Subjects
GAUSSIAN function ,KERNEL functions ,SIGNAL processing ,TECHNICAL specifications ,MACHINE learning - Abstract
Correntropy is a local similarity measure defined in kernel space, and the maximum correntropy criterion (mcc) has been successfully applied in many areas of signal processing and machine learning in recent years. The kernel function in correntropy is usually restricted to the Gaussian function with the center located at zero. However, the zero-mean Gaussian function may not be a good choice for many practical applications. In this letter, we propose an extended version of correntropy, whose center can be located at any position. Accordingly, we propose a new optimization criterion called maximum correntropy criterion with variable center (MCC-VC). We also propose an efficient approach to optimize the kernel width and center location in the MCC-VC. Simulation results of regression with linear-in-parameter (LIP) models confirm the desirable performance of the new method. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. Robust High-Order Manifold Constrained Sparse Principal Component Analysis for Image Representation.
- Author
-
Zhou, Nan, Cheng, Hong, Qin, Jing, Du, Yuanhua, and Chen, Badong
- Subjects
PRINCIPAL components analysis ,IMAGE analysis ,IMAGE representation ,LORENTZIAN function ,HYPERSPECTRAL imaging systems ,MANIFOLDS (Mathematics) ,IMAGE processing - Abstract
In order to efficiently utilize the information in the data and eliminate the negative effects of outliers in the principal component analysis (PCA) method, in this paper, we propose a novel robust sparse PCA method based on maximum correntropy criterion (MCC) with high-order manifold constraints called the RHSPCA. Compared with the traditional PCA methods, the proposed RHSPCA has the following benefits: 1) the MCC regression term is more robust to outliers than the MSE-based regression term; 2) thanks to the high-order manifold constraints, the low-dimensional representations can preserve the local relations of the data and greatly improve the clustering and classification performance for image processing tasks; and 3) in order to further counteract the adverse effects of outliers, the MCC-based samples’ mean is proposed to better centralize the data. We also propose a new solver based on the half-quadratic technique and accelerated block coordinate update strategy to solve the RHSPCA model. Extensive experimental results show that the proposed method can outperform the state-of-the-art robust PCA methods on a variety of image processing tasks, including reconstruction, clustering, and classification, on outliers contaminated datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Maximum Total Correntropy Diffusion Adaptation Over Networks With Noisy Links.
- Author
-
He, Yicong, Wang, Fei, Wang, Shiyuan, Ren, Pengju, and Chen, Badong
- Abstract
Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion least mean squares (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from biased estimation and are not robust against impulsive link noise. In this brief, we focus on improving the performance of diffusion adaptation with noisy links from two aspects: accuracy and robustness. A new algorithm called diffusion maximum total correntropy (DMTC) is proposed. The new algorithm is theoretically unbiased in Gaussian noise, and can efficiently handle the link noise in the presence of large outliers. The adaptive combination rule is applied to further improve the performance. The stability analysis of the proposed algorithm is given. Simulation results show that the DMTC algorithm can achieve good performance in both Gaussian and non-Gaussian noise environments. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. Mixture correntropy for robust learning.
- Author
-
Chen, Badong, Wang, Xin, Lu, Na, Wang, Shiyuan, Cao, Jiuwen, and Qin, Jing
- Subjects
- *
MACHINE learning , *SIGNAL processing , *GAUSSIAN function , *KERNEL functions , *REGRESSION analysis - Abstract
Correntropy is a local similarity measure defined in kernel space, hence can combat large outliers in robust signal processing and machine learning. So far, many robust learning algorithms have been developed under the maximum correntropy criterion (MCC), among which, a Gaussian kernel is generally used in correntropy. To further improve the learning performance, in this paper we propose the concept of mixture correntropy, which uses the mixture of two Gaussian functions as the kernel function. Some important properties of the mixture correntropy are presented. Applications of the maximum mixture correntropy criterion (MMCC) to extreme learning machine (ELM) and kernel adaptive filtering (KAF) for function approximation and data regression are also studied. Experimental results show that the learning algorithms under MMCC can perform very well and achieve better performance than the conventional MCC based algorithms as well as several other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
12. Correntropy-Based Evolving Fuzzy Neural System.
- Author
-
Bao, Rong-Jing, Rong, Hai-Jun, Angelov, Plamen P., Chen, Badong, and Wong, Pak Kin
- Subjects
FUZZY neural networks ,APPROXIMATION theory ,MEAN square algorithms - Abstract
In this paper, a correntropy-based evolving fuzzy neural system (CEFNS) is proposed for approximation of nonlinear systems. Different from the commonly used mean-square error criterion, correntropy has a strong outliers rejection ability through capturing the higher moments of the error distribution. Considering the merits of correntropy, this paper brings contributions to build evolving fuzzy neural system (EFNS) based on the correntropy concept to achieve a more stable evolution of the rule base and update of the rule parameters instead of the commonly used mean-square error criterion. The correntropy-EFNS (CEFNS) begins with an empty rule base, and all rules are evolved online based on the correntropy criterion. The consequent part parameters are tuned based on the maximum correntropy criterion, where the correntropy is used as the cost function so as to improve the non-Gaussian noise rejection ability. The steady-state convergence performance of the CEFNS is studied through the calculation of the steady-state excess mean square error (EMSE) in two cases: Gaussian noise; and non-Gaussian noise. Finally, the CEFNS is validated through a benchmark system identification problem, a Mackey-Glass time series prediction problem as well as five other real-world benchmark regression problems under both noise-free and noisy conditions. Compared with other EFNSs, the simulation results show that the proposed CEFNS produces better approximation accuracy using the least number of rules and training time and also owns superior non-Gaussian noise handling capability. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
13. Robust proportionate adaptive filter based on maximum correntropy criterion for sparse system identification in impulsive noise environments.
- Author
-
Ma, Wentao, Zheng, Dongqiao, Zhang, Zhiyu, Duan, Jiandong, and Chen, Badong
- Abstract
Proportionate-type adaptive filtering (PtAF) algorithms have been successfully applied to sparse system identification. The major drawback of the traditional PtAF algorithms based on the mean square error (MSE) criterion show poor robustness in the presence of impulsive noises or abrupt changes because MSE is only valid and rational under Gaussian assumption. However, this assumption is not satisfied in most real-world applications. To improve its robustness under non-Gaussian environments, we incorporate the maximum correntropy criterion (MCC) into the update equation of the PtAF to develop proportionate MCC (PMCC) algorithm. The mean and mean square convergence performance analysis are also performed. Simulation results in sparse system identification and echo cancellation applications are presented, which demonstrate that the proposed PMCC exhibits outstanding performance under the impulsive noise environments. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. Correntropy Maximization via ADMM: Application to Robust Hyperspectral Unmixing.
- Author
-
Zhu, Fei, Halimi, Abderrahim, Honeine, Paul, Chen, Badong, and Zheng, Nanning
- Subjects
MAXIMUM entropy method ,HYPERSPECTRAL imaging systems ,MULTIPLIERS (Mathematical analysis) ,SIGNAL-to-noise ratio ,CONVEX functions ,KERNEL (Mathematics) - Abstract
In hyperspectral images, some spectral bands suffer from low signal-to-noise ratio due to noisy acquisition and atmospheric effects, thus requiring robust techniques for the unmixing problem. This paper presents a robust supervised spectral unmixing approach for hyperspectral images. The robustness is achieved by writing the unmixing problem as the maximization of the correntropy criterion subject to the most commonly used constraints. Two unmixing problems are derived: the first problem considers the fully constrained unmixing, with both the nonnegativity and sum-to-one constraints, while the second one deals with the nonnegativity and the sparsity promoting of the abundances. The corresponding optimization problems are solved using an alternating direction method of multipliers (ADMM) approach. Experiments on synthetic and real hyperspectral images validate the performance of the proposed algorithms for different scenarios, demonstrating that the correntropy-based unmixing with ADMM is particularly robust against highly noisy outlier bands. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
15. Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering.
- Author
-
Chen, Badong, Xing, Lei, Zheng, Nanning, Xu, Bin, Zhao, Haiquan, and Principe, Jose C.
- Subjects
- *
ADAPTIVE filters , *KERNEL functions , *SIGNAL processing , *MACHINE learning , *ALGORITHMS - Abstract
Nonlinear similarity measures defined in kernel space, such as correntropy, can extract higher order statistics of data and offer potentially significant performance improvement over their linear counterparts especially in non Gaussian signal processing and machine learning. In this paper, we propose a new similarity measure in kernel space, called the kernel risk-sensitive loss (KRSL), and provide some important properties. We apply the KRSL to adaptive filtering and investigate the robustness, and then develop the MKRSL algorithm and analyze the mean square convergence performance. Compared with correntropy, the KRSL can offer a more efficient performance surface, thereby enabling a gradient-based method to achieve faster convergence speed and higher accuracy while still maintaining the robustness to outliers. Theoretical analysis results and superior performance of the new algorithm are confirmed by simulation. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
16. Generalized Correntropy for Robust <?Pub _newline ?>Adaptive Filtering.
- Author
-
Chen, Badong, Xing, Lei, Zhao, Haiquan, Zheng, Nanning, and Principe, Jose C.
- Subjects
- *
ADAPTIVE filters , *ROBUST control , *MACHINE learning , *SIGNAL processing , *GAUSSIAN channels , *STEADY-state responses - Abstract
As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has recently been successfully applied in robust regression and filtering. The default kernel function in correntropy is the Gaussian kernel, which is, of course, not always the best choice. In this paper, we propose a generalized correntropy that adopts the generalized Gaussian density (GGD) function as the kernel, and present some important properties. We further propose the generalized maximum correntropy criterion (GMCC) and apply it to adaptive filtering. An adaptive algorithm, called the GMCC algorithm, is derived, and the stability problem and steady-state performance are studied. We show that the proposed algorithm is very stable and can achieve zero probability of divergence (POD). Simulation results confirm the theoretical expectations and demonstrate the desirable performance of the new algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
17. Diffusion maximum correntropy criterion algorithms for robust distributed estimation.
- Author
-
Ma, Wentao, Chen, Badong, Duan, Jiandong, and Zhao, Haiquan
- Subjects
- *
DIFFUSION , *ADAPTIVE estimation (Statistics) , *COST functions , *MEAN square algorithms , *STOCHASTIC convergence - Abstract
Robust diffusion adaptive estimation algorithms based on the maximum correntropy criterion (MCC), including adapt then combine MCC and combine then adapt MCC, are developed to deal with the distributed estimation over network in impulsive (long-tailed) noise environments. The cost functions used in distributed estimation are in general based on the mean square error (MSE) criterion, which is desirable when the measurement noise is Gaussian. In non-Gaussian situations, especially for the impulsive-noise case, MCC based methods may achieve much better performance than the MSE methods as they take into account higher order statistics of error distribution. The proposed methods can also outperform the robust diffusion least mean p-power (DLMP) and diffusion minimum error entropy (DMEE) algorithms. The mean and mean square convergence analysis of the new algorithms are also carried out. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
18. Generalized multikernel correntropy based broad learning system for robust regression.
- Author
-
Zheng, Yunfei, Wang, Shiyuan, and Chen, Badong
- Subjects
- *
INSTRUCTIONAL systems - Abstract
As an emerging learning method belonging to the family of neural networks, the broad learning system (BLS) has been recently proved to be effective and efficient to perform regression tasks in various scenarios. However, if data are contaminated by some outliers or other more complex non-Gaussian noises, the learning performance of BLS may be severely compromised, due to its dependence on the conventional mean square error criterion. To enhance the robustness of BLS to deal with contaminated data, a new similarity measure termed generalized multikernel correntropy (GMKC) is proposed in this paper, and some important properties of this measure are investigated. On the basis of GMKC, a general BLS variant called GMKC-based BLS (GMKC-BLS), is subsequently developed to perform regression tasks with contaminated data. Since GMKC with its unique design actually builds a unified framework for many robust and popular metrics, GMKC-BLS is expected to be with excellent robustness and adaptability, and provides a competitive solution to the regression problems with contaminated data. Meanwhile, GMKC could be integrated with other neural network-based methods to further enhance their robustness. Experimental results on different regression datasets demonstrate the performance superiority of GMKC-BLS compared to the standard BLS and its robust variants. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. Efficient correntropy-based multi-view clustering with anchor graph embedding.
- Author
-
Yang, Ben, Zhang, Xuetao, Chen, Badong, Nie, Feiping, Lin, Zhiping, and Nan, Zhixiong
- Subjects
- *
MATRIX decomposition , *NONNEGATIVE matrices - Abstract
Although multi-view clustering has received widespread attention due to its far superior performance to single-view clustering, it still faces the following issues: (1) high computational cost, considering the introduction of multi-view information, reduces the clustering efficiency greatly; (2) complex noises and outliers, existed in real-world data, pose a huge challenge to the robustness of clustering algorithms. Currently, how to increase the efficiency and robustness has become two important issues of multi-view clustering. To cope with the above issues, an efficient correntropy-based multi-view clustering algorithm (ECMC) is proposed in this paper, which can not only improve clustering efficiency by constructing embedded anchor graph and utilizing nonnegative matrix factorization (NMF), but also enhance the robustness by exploring correntropy to suppress various noises and outliers. To further improve clustering efficiency, one of the factors of NMF is constrained to be an indicator matrix instead of a traditional non-negative matrix, so that the categories of samples can be obtained directly without any extra operation. Subsequently, a novel half-quadratic-based strategy is proposed to optimize the non-convex objective function of ECMC. Finally, extensive experiments on eight real-world datasets and eighteen noisy datasets show that ECMC can guarantee faster speed and better robustness than other state-of-the-art multi-view clustering algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
20. Correntropy Based Divided Difference Filtering for the Positioning of Ships.
- Author
-
Liu, Xi, Chen, Badong, Wang, Shiyuan, and Du, Shaoyi
- Subjects
- *
DEAD reckoning (Navigation) , *INFORMATION filtering , *ROBUST control , *COMPUTER algorithms , *RANDOM noise theory - Abstract
In this paper, robust first and second-order divided difference filtering algorithms based on correntropy are proposed, which not only retain the advantages of divided difference filters, but also exhibit robustness in the presence of non-Gaussian noises, especially when the measurements are contaminated by heavy-tailed noises. The proposed filters are then applied to the problem of ship positioning. In order to improve the accuracy and reliability of ship positioning, the positioning method combines the Dead Reckoning (DR) algorithm and the Global Positioning System (GPS). Experimental results of an illustrative example show the superior performance of the new algorithms when applied to ship positioning. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
21. Robust anchor-based multi-view clustering via spectral embedded concept factorization.
- Author
-
Yang, Ben, Wu, Jinghan, Zhang, Xuetao, Lin, Zhiping, Nie, Feiping, and Chen, Badong
- Subjects
- *
FACTORIZATION , *SPECTRAL element method , *NOISE - Abstract
Multi-view clustering (MVC) often provides superior effectiveness to single-view clustering due to the integration of information from diverse views. Nonetheless, existing MVC methods are limited to large-scale real-world data by the drawbacks of low efficiency and poor robustness. To address these issues, we propose a novel robust anchor-based MVC model via spectral embedded concept factorization (RAMCSF). RAMCSF builds anchor graphs to approximate full-sample graphs and decomposes these anchor graphs by concept factorization (CF). To improve the clustering effectiveness, factor matrices of CF are constrained as orthogonal matrices to reduce the freedom of decomposition, and a novel small-scale anchor-based spectral embedding is designed to explore the high-order neighbor relationships. To restrain complex noises distributed in real-world data, we employ correntropy to measure the error between the original data and the learned representation. Moreover, RAMCSF can get a clustering indicator matrix directly, avoiding additional post-processing and ensuring that changes in data dimensions have a limited impact on efficiency. The model is then optimized by a novel fast half-quadratic-based optimization strategy that combines the orthogonal properties and the traces of matrices. Extensive experiments indicate that RAMCSF can achieve higher efficiency and robustness while maintaining comparable effectiveness to other state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
22. Correntropy based semi-supervised concept factorization with adaptive neighbors for clustering.
- Author
-
Peng, Siyuan, Yang, Zhijing, Nie, Feiping, Chen, Badong, and Lin, Zhiping
- Subjects
- *
FACTORIZATION , *COST functions , *NEIGHBORS - Abstract
Concept factorization (CF) has shown the effectiveness in the field of data clustering. In this paper, a novel and robust semi-supervised CF method, called correntropy based semi-supervised concept factorization with adaptive neighbors (CSCF), is proposed with improved performance in clustering applications. Specifically, on the one hand, the CSCF method adopts correntropy as the cost function to increase the robustness for non-Gaussian noise and outliers, and combines two different types of supervised information simultaneously for obtaining a compact low-dimensional representation of the original data. On the other hand, CSCF assigns the adaptive neighbors for each data point to construct a good data similarity matrix for reducing the sensitiveness of data. Moreover, a generalized version of CSCF is derived for enlarging the clustering application ranges. Analysis is also presented for the relationship of CSCF with several typical CF methods. Experimental results have shown that CSCF has better clustering performance than several state-of-the-art CF methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. Fast correntropy-based multi-view clustering with prototype graph factorization.
- Author
-
Yang, Ben, Wu, Jinghan, Zhang, Xuetao, Lin, Zhiping, Nie, Feiping, and Chen, Badong
- Subjects
- *
GRAPH algorithms , *FACTORIZATION , *PROTOTYPES , *ALGORITHMS , *NOISE - Abstract
As a consequence of the ability to incorporate information from different perspectives, multi-view clustering has gained significant attention. Nevertheless, 1) its high computational cost, particularly when processing large-scale and high-dimensional multi-view data, restricts its applications in practice; and 2) complex noise in real-world data also challenges the robustness of existing algorithms. To tackle the above challenges, we develop a fast correntropy-based multi-view clustering algorithm with prototype graph factorization (FCMCPF). FCMCPF first adopts prototype graphs to effectively mitigate the complexity associated with graph construction, thereby reducing it from a quadratic complexity to a linear one. Then, it decomposes these prototype graphs under the correntropy criterion to robustly find the cluster indicator matrix without any post-processing. To solve the non-convex and non-linear model, we devise a fast half-quadratic-based strategy to first convert it into a convex formulation and then swiftly complete the optimization via the matrix properties of orthogonality and trace. The extensive experiments conducted on noisy and real-world datasets illustrate that FCMCPF is highly efficient and robust compared to other advanced algorithms, with comparable or even superior clustering effectiveness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. Efficient correntropy-based multi-view clustering with alignment discretization.
- Author
-
Wu, Jinghan, Yang, Ben, Liu, Jiaying, Zhang, Xuetao, Lin, Zhiping, and Chen, Badong
- Abstract
Multiview clustering (MVC) has attracted considerable attention owing to its remarkable capacity to reconcile diverse information from multiple perspectives. However, traditional MVC generally has a narrow scope of application owing to its limited efficiency. Consequently, various efficient MVC (EMVC) methods have emerged recently. Despite their promising performance, these EMVC methods still have several unresolved issues: (1) They suffer from reduced effectiveness caused by representation non-alignment across views and information mismatch between stages, and (2) they fail to efficiently resist complex noises and outliers. To address these issues, we propose an efficient correntropy-based multiview clustering method with alignment discretization (ECMCAD). Specifically, a correntropy-based multipartition learning model was developed to efficiently learn view-specific robust partition-level representations. Additionally, a novel alignment discretization strategy was designed to align the learned cross-view representations into a consensus discrete indicator to integrate representation learning, representation alignment, and discrete label acquisition into a unified framework. Furthermore, an efficient alternating optimization method was developed to solve the model. Numerous experiments illustrated the superiority of the proposed method over state-of-the-art baselines. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. Robust spectral embedded bilateral orthogonal concept factorization for clustering.
- Author
-
Yang, Ben, Wu, Jinghan, Zhou, Yu, Zhang, Xuetao, Lin, Zhiping, Nie, Feiping, and Chen, Badong
- Subjects
- *
FACTORIZATION , *NONNEGATIVE matrices , *MATRIX decomposition , *DEGREES of freedom - Abstract
Concept factorization (CF), unlike nonnegative matrix factorization (NMF), can handle data with negative values by approximating the original data with two low-dimensional nonnegative matrices and itself. Nevertheless, existing CF-based methods continue to suffer from the two issues specified as follows: (1) Their effectiveness is reduced by the high degree of factorization freedom and the two-stage mismatch between factorization and category acquisition, and (2) their robustness drops significantly when dealing with complex noise. In response to the aforementioned issues, we propose a robust spectral-embedded bilateral orthogonal concept factorization (RSOCF) model for clustering. It constrains the factor matrices as orthogonal matrices to decrease the freedom and obtain samples' categories directly after factorization, which can significantly improve clustering effectiveness. Moreover, correntropy is introduced into RSOCF to improve its robustness to complex noise. To optimize the non-convex RSOCF model, a half-quadratic-based algorithm is devised. Numerous experiments demonstrate that RSOCF surpasses other state-of-the-art methods in terms of clustering effectiveness and robustness. • A novel robust concept factorization-based clustering model is proposed. • A fast algorithm is proposed to optimize the non-convex model. • Numerous experiments validate its clustering effectiveness and robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. Fast multi-view clustering via correntropy-based orthogonal concept factorization.
- Author
-
Wu, Jinghan, Yang, Ben, Xue, Zhiyuan, Zhang, Xuetao, Lin, Zhiping, and Chen, Badong
- Subjects
- *
MATRIX decomposition , *NONNEGATIVE matrices , *DEGREES of freedom , *MATHEMATICAL regularization , *FACTORIZATION - Abstract
Owing to its ability to handle negative data and promising clustering performance, concept factorization (CF), an improved version of non-negative matrix factorization, has been incorporated into multi-view clustering recently. Nevertheless, existing CF-based multi-view clustering methods still have the following issues: (1) they directly conduct factorization in the original data space, which means its efficiency is sensitive to the feature dimension; (2) they ignore the high degree of factorization freedom of standard CF, which may lead to non-uniqueness factorization thereby causing reduced effectiveness; (3) traditional robust norms they used are unable to handle complex noises, significantly challenging their robustness. To address these issues, we establish a fast multi-view clustering via correntropy-based orthogonal concept factorization (FMVCCF). Specifically, FMVCCF executes factorization on a learned consensus anchor graph rather than directly decomposing the original data, lessening the dimensionality sensitivity. Then, a lightweight graph regularization term is incorporated to refine the factorization process with a low computational burden. Moreover, an improved multi-view correntropy-based orthogonal CF model is developed, which can enhance the effectiveness and robustness under the orthogonal constraint and correntropy criterion, respectively. Extensive experiments demonstrate that FMVCCF can achieve promising effectiveness and robustness on various real-world datasets with high efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. Discrete correntropy-based multi-view anchor-graph clustering.
- Author
-
Yang, Ben, Wu, Jinghan, Zhang, Xuetao, Zheng, Xinhu, Nie, Feiping, and Chen, Badong
- Subjects
- *
ANCHORS , *ALGORITHMS - Abstract
Graph-based clustering commonly provides promising clustering effectiveness as it can preserve samples' local geometric information. Inspired by it, multi-view graph clustering was developed to integrate complementary information among graphs of diverse views and it has received intensive attention recently. Nevertheless, on the one hand, most existing methods require extra k-means after obtaining embedding representations to generate a discrete cluster indicator, which reduces effectiveness due to the two-stage mismatch. On the other hand, numerous complex noises in real-world multi-view data challenge the robustness of existing clustering methods. In this paper, we established a discrete correntropy-based multi-view anchor-graph clustering (DCMAC) model that not only emphasizes the aforementioned issues but also makes use of anchor graphs to improve the efficiency of the graph construction stage. To optimize this non-convex model, we propose a fast half-quadratic-based coordinate descent strategy to acquire the discrete cluster indicator directly without extra k-means. Furthermore, we extend the DCMAC model to a single-view form and provide optimization strategies for it. Extensive experiments illustrate that the proposed method is effective and robust compared to those advanced baselines. • A new discrete correntropy-based multi-view anchor-graph clustering (DCMAC) model is proposed. • A novel half-quadratic-based coordinate descent algorithm is proposed to solve the DCMAC model. • To handle single-view clustering instances, DCMAC is extended to a single-view form named DCAC. • Numerous experiments demonstrate the outstanding effectiveness and robustness of DCMAC. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Robust semi-supervised nonnegative matrix factorization for image clustering.
- Author
-
Peng, Siyuan, Ser, Wee, Chen, Badong, and Lin, Zhiping
- Subjects
- *
MATRIX decomposition , *NONNEGATIVE matrices , *RANDOM noise theory , *EUCLIDEAN distance , *COMPUTATIONAL complexity - Abstract
• A novel correntropy based semi-supervised NMF method is proposed for image clustering. • The proposed method is analysed in terms of convergence, robustness, and computational complexity. • The relationships between the proposed method and several typical NMF based methods are discussed. • Experimental results show the effectiveness and robustness of the proposed method in image clustering tasks. Nonnegative matrix factorization (NMF) is a powerful dimension reduction method, and has received increasing attention in various practical applications. However, most traditional NMF based algorithms are sensitive to noisy data, or fail to fully utilize the limited supervised information. In this paper, a novel robust semi-supervised NMF method, namely correntropy based semi-supervised NMF (CSNMF), is proposed to solve these issues. Specifically, CSNMF adopts a correntropy based loss function instead of the squared Euclidean distance (SED) in constrained NMF to suppress the influence of non-Gaussian noise or outliers contaminated in real world data, and simultaneously uses two types of supervised information, i.e., the pointwise and pairwise constraints, to obtain the discriminative data representation. The proposed method is analyzed in terms of convergence, robustness and computational complexity. The relationships between CSNMF and several previous NMF based methods are also discussed. Extensive experimental results show the effectiveness and robustness of CSNMF in image clustering tasks, compared with several state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
29. Robust orthogonal nonnegative matrix tri-factorization for data representation.
- Author
-
Peng, Siyuan, Ser, Wee, Chen, Badong, and Lin, Zhiping
- Subjects
- *
NONNEGATIVE matrices , *MATRIX decomposition , *DATA mining , *DEGREES of freedom , *MATHEMATICAL regularization , *OUTLIER detection , *DOCUMENT clustering - Abstract
Nonnegative matrix factorization (NMF) has been a vital data representation technique, and has demonstrated significant potential in the field of machine learning and data mining. Nonnegative matrix tri-factorization (NMTF) is an extension of NMF, and provides more degrees of freedom than NMF. In this paper, we propose the correntropy based orthogonal nonnegative matrix tri-factorization (CNMTF) algorithm, which is robust to noisy data contaminated by non-Gaussian noise and outliers. Different from previous NMF algorithms, CNMTF firstly applies correntropy to NMTF to measure the similarity, and preserves double orthogonality conditions and dual graph regularization. We adopt the half-quadratic technique to solve the optimization problem of CNMTF, and derive the multiplicative update rules. The complexity issue of CNMTF is also presented. Furthermore, the robustness of the proposed algorithm is analyzed, and the relationships between CNMTF and several previous NMF based methods are discussed. Experimental results demonstrate that the proposed CNMTF method has better performance on real world image and text datasets for clustering tasks, compared with several state-of-the-art methods. • The correntropy based orthogonal nonnegative matrix tri-factorization (CNMTF) algorithm is proposed. • The robustness of CNMTF is analyzed by make a comparison with several robust NMF methods. • The relationships between CNMTF and several previous NMF methods are also discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
30. Robust nonnegative matrix factorization with local coordinate constraint for image clustering.
- Author
-
Peng, Siyuan, Ser, Wee, Chen, Badong, Sun, Lei, and Lin, Zhiping
- Subjects
- *
NONNEGATIVE matrices , *MATRIX decomposition , *FACTORIZATION , *COMPUTATIONAL complexity , *DATA mining , *MATHEMATICAL optimization , *NONSMOOTH optimization - Abstract
Nonnegative matrix factorization (NMF) has attracted increasing attention in data mining and machine learning. However, existing NMF methods have some limitations. For example, some NMF methods seriously suffer from noisy data contaminated by outliers, or fail to preserve the geometric information of the data and guarantee the sparse parts-based representation. To overcome these issues, in this paper, a robust and sparse NMF method, called correntropy based dual graph regularized nonnegative matrix factorization with local coordinate constraint (LCDNMF) is proposed. Specifically, LCDNMF incorporates the geometrical information of both the data manifold and the feature manifold, and the local coordinate constraint into the correntropy based objective function. The half-quadratic optimization technique is utilized to solve the nonconvex optimization problem of LCDNMF, and the multiplicative update rules are obtained. Furthermore, some properties of LCDNMF including the convergence, relation with gradient descent method, robustness, and computational complexity are analyzed. Experiments of clustering demonstrate the effectiveness and robustness of the proposed LCDNMF method in comparison to several state-of-the-art methods on six real world image datasets. • The LCDNMF algorithm is proposed. • The convergence and relation with gradient descent method of LCDNMF is analyzed. • The robustness and computational complexity of LCDNMF is also analyzed. • Experiment results show the effectiveness and robustness of LCDNMF. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
31. Robust rigid registration algorithm based on pointwise correspondence and correntropy.
- Author
-
Du, Shaoyi, Xu, Guanglin, Zhang, Sirui, Zhang, Xuetao, Gao, Yue, and Chen, Badong
- Subjects
- *
RECORDING & registration , *ENERGY function , *POINT set theory , *ALGORITHMS , *POINT cloud , *DIFFEOMORPHISMS - Abstract
• Correntropy is introduced to the registration problem as a distance metric. • A closed-form solution is given out at each iterative step of the algorithm. • Pointwise correspondences are used to make sure the efficiency. • It's a general framework for m-D point set registration. The iterative closest point (ICP) algorithm is fast and accurate for rigid point set registration, but it works badly when handling noisy data or point clouds with outliers. This paper instead proposes a novel method based on the ICP algorithm to deal with this problem. Firstly, correntropy is introduced into the rigid registration problem which could handle noises and outliers well, and then a new energy function based on maximum correntropy criterion is proposed. After that, a new ICP algorithm based on correntropy is proposed, which performs well in dealing with rigid registration with noises and outliers. This new algorithm converges monotonically from any given parameters, which is similar to the ICP algorithm. Experimental results demonstrate its accuracy and robustness compared with the traditional ICP algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
32. A correntropy inspired variable step-size sign algorithm against impulsive noises.
- Author
-
Wang, Weihua, Zhao, Jihong, Qu, Hua, and Chen, Badong
- Subjects
- *
BURST noise , *MATHEMATICAL variables , *DIGITAL signatures , *COMPUTER simulation , *CONVERGENCE (Telecommunication) , *ADAPTIVE filters , *COMPUTATIONAL complexity - Abstract
The adaptive variable step-size technique is an effective way to improve the convergence rate of an adaptive filtering algorithm. However, for most existing variable step-size sign algorithm against impulsive noise, either the performance is not good enough, or the calculation is complex. In this paper, a correntropy inspired variable step-size method for sign algorithm is proposed. The new variable step-size method is computationally simple and robust to impulsive noises. Theoretical analysis and simulation results demonstrate that the proposed algorithm can achieve desirable performance with low computational complexity in presence of impulsive noises. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.