Neutrosophic Clustering Algorithm Based on Sparse Regular Term Constraint
Clustering algorithm is one of the important research topics in the field of machine learning. Neutrosophic clustering is the generalization of fuzzy clustering and has been applied to many fields. This paper presents a new neutrosophic clustering algorithm with the help of regularization. Firstly,...
Saved in:
Main Authors: | Dan Zhang, Yingcang Ma, Hu Zhao, Xiaofei Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/6657849 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A weighted sparse constraint Capon beamforming algorithm
by: Yongxin DU, et al.
Published: (2018-03-01) -
Sparse View CT Reconstruction Algorithm Based on Non-Local Generalized Total Variation Regularization
by: Min JIANG, et al.
Published: (2025-01-01) -
Joint Nonnegative Matrix Factorization Based on Sparse and Graph Laplacian Regularization for Clustering and Co-Differential Expression Genes Analysis
by: Ling-Yun Dai, et al.
Published: (2020-01-01) -
Smoothing and Regularization with Modified Sparse Approximate Inverses
by: T. Huckle, et al.
Published: (2010-01-01) -
Sparse group LASSO constraint eigenphone speaker adaptation method for speech recognition
by: Dan QU, et al.
Published: (2015-09-01)