scholarly journals Relationship Matrix Nonnegative Decomposition for Clustering

2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Ji-Yuan Pan ◽  
Jiang-She Zhang
Keyword(s):  
Nonnegative Solution ◽  
Nonnegative Matrix ◽  
Positive Semidefinite ◽  
Descent Method ◽  
Steepest Descent Method ◽  
Low Rank ◽  
Relationship Matrix ◽  
Similarity Matrix ◽  
Pairwise Similarity ◽  
Nonnegative Decomposition

Nonnegative matrix factorization (NMF) is a popular tool for analyzing the latent structure of nonnegative data. For a positive pairwise similarity matrix, symmetric NMF (SNMF) and weighted NMF (WNMF) can be used to cluster the data. However, both of them are not very efficient for the ill-structured pairwise similarity matrix. In this paper, a novel model, called relationship matrix nonnegative decomposition (RMND), is proposed to discover the latent clustering structure from the pairwise similarity matrix. The RMND model is derived from the nonlinear NMF algorithm. RMND decomposes a pairwise similarity matrix into a product of three low rank nonnegative matrices. The pairwise similarity matrix is represented as a transformation of a positive semidefinite matrix which pops out the latent clustering structure. We develop a learning procedure based on multiplicative update rules and steepest descent method to calculate the nonnegative solution of RMND. Experimental results in four different databases show that the proposed RMND approach achieves higher clustering accuracy.

Solution of inverse coefficient problem for fractional anomalous diffusion equation

2012 ◽  
Vol 9 (2) ◽  
pp. 65-70
Author(s):  
E.V. Karachurina ◽  
S.Yu. Lukashchuk
Keyword(s):  
Anomalous Diffusion ◽  
Fractional Derivatives ◽  
Descent Method ◽  
Extremum Problem ◽  
Steepest Descent Method ◽  
Coefficient Problem ◽  
Caputo Fractional Derivatives ◽  
Inverse Coefficient Problem ◽  
Residual Functional ◽  
Inverse Coefficient

An inverse coefficient problem is considered for time-fractional anomalous diffusion equations with the Riemann-Liouville and Caputo fractional derivatives. A numerical algorithm is proposed for identification of anomalous diffusivity which is considered as a function of concentration. The algorithm is based on transformation of inverse coefficient problem to extremum problem for the residual functional. The steepest descent method is used for numerical solving of this extremum problem. Necessary expressions for calculating gradient of residual functional are presented. The efficiency of the proposed algorithm is illustrated by several test examples.

scholarly journals Improved Immune Algorithm Combined with Steepest Descent Method for Optimal Design of IPMSM for FCEV Traction Motor

Energies ◽  
2021 ◽  
Vol 14 (13) ◽  
pp. 3904
Author(s):  
Ji-Chang Son ◽  
Myung-Ki Baek ◽  
Sang-Hun Park ◽  
Dong-Kuk Lim
Keyword(s):  
Optimal Design ◽  
Permanent Magnet Synchronous Motor ◽  
Torque Ripple ◽  
Descent Method ◽  
Immune Algorithm ◽  
Electric Machines ◽  
Steepest Descent Method ◽  
Superior Performance ◽  
Element Analysis ◽  
Traction Motor

In this paper, an improved immune algorithm (IIA) was proposed for the torque ripple reduction optimal design of an interior permanent magnet synchronous motor (IPMSM) for a fuel cell electric vehicle (FCEV) traction motor. When designing electric machines, both global and local solutions of optimal designs are required as design result should be compared in various aspects, including torque, torque ripple, and cogging torque. To lessen the computational burden of optimization using finite element analysis, the IIA proposes a method to efficiently adjust the generation of additional samples. The superior performance of the IIA was verified through the comparison of optimization results with conventional optimization methods in three mathematical test functions. The optimal design of an IPMSM using the IIA was conducted to verify the applicability in the design of practical electric machines.

Multiview Common Subspace Clustering via Coupled Low Rank Representation

2021 ◽  
Vol 12 (4) ◽  
pp. 1-25
Author(s):  
Stanley Ebhohimhen Abhadiomhen ◽  
Zhiyang Wang ◽  
Xiangjun Shen ◽  
Jianping Fan
Keyword(s):  
Common Knowledge ◽  
Subspace Clustering ◽  
Laplacian Matrix ◽  
Low Rank ◽  
Connected Components ◽  
Similarity Matrix ◽  
Benchmark Datasets ◽  
Low Rank Representation ◽  
Low Dimensional ◽  
Shared Structure

Multi-view subspace clustering (MVSC) finds a shared structure in latent low-dimensional subspaces of multi-view data to enhance clustering performance. Nonetheless, we observe that most existing MVSC methods neglect the diversity in multi-view data by considering only the common knowledge to find a shared structure either directly or by merging different similarity matrices learned for each view. In the presence of noise, this predefined shared structure becomes a biased representation of the different views. Thus, in this article, we propose a MVSC method based on coupled low-rank representation to address the above limitation. Our method first obtains a low-rank representation for each view, constrained to be a linear combination of the view-specific representation and the shared representation by simultaneously encouraging the sparsity of view-specific one. Then, it uses the k -block diagonal regularizer to learn a manifold recovery matrix for each view through respective low-rank matrices to recover more manifold structures from them. In this way, the proposed method can find an ideal similarity matrix by approximating clustering projection matrices obtained from the recovery structures. Hence, this similarity matrix denotes our clustering structure with exactly k connected components by applying a rank constraint on the similarity matrix’s relaxed Laplacian matrix to avoid spectral post-processing of the low-dimensional embedding matrix. The core of our idea is such that we introduce dynamic approximation into the low-rank representation to allow the clustering structure and the shared representation to guide each other to learn cleaner low-rank matrices that would lead to a better clustering structure. Therefore, our approach is notably different from existing methods in which the local manifold structure of data is captured in advance. Extensive experiments on six benchmark datasets show that our method outperforms 10 similar state-of-the-art compared methods in six evaluation metrics.

Controlling Chaos by Hybrid System Based on FREN and Sliding Mode Control

2005 ◽  
Vol 128 (2) ◽  
pp. 352-358 ◽  
Author(s):  
C. Treesatayapun ◽  
S. Uatrongjit
Keyword(s):  
Sliding Mode ◽  
Adaptive Controller ◽  
Descent Method ◽  
Fuzzy Rules ◽  
System Stability ◽  
Steepest Descent Method ◽  
Upper And Lower Bounds ◽  
Adaptation Algorithm ◽  
Control Effort ◽  
Fine Tune

This paper presents a direct adaptive controller for chaotic systems. The proposed adaptive controller is constructed using the network called fuzzy rules emulated network (FREN). FREN’s structure is based on human knowledge in the form of fuzzy rules. Parameter adaptation algorithm based on the steepest descent method is presented to fine tune the controller’s performance. To improve the system stability, the modified sliding mode algorithm is applied to estimate the upper and lower bounds of the control effort. The suitable control effort is generated by FREN and kept within these bounds. Some computer simulations of using the controller to control the Hénon map have been performed to demonstrate the performance of the proposed controller.

Sign in / Sign up

Export Citation Format

Share Document