...
首页> 外文期刊>Fuzzy Systems, IEEE Transactions on >T–S Fuzzy Model Identification With a Gravitational Search-Based Hyperplane Clustering Algorithm
【24h】

T–S Fuzzy Model Identification With a Gravitational Search-Based Hyperplane Clustering Algorithm

机译:基于引力搜索的超平面聚类算法识别TS模糊模型

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In order to improve the performance of the fuzzy clustering algorithm in fuzzy space partition in the identification of the Takagi-Sugeno (T-S) fuzzy model, a hyperplane prototype fuzzy clustering model is proposed. To solve the clustering objective function, which could not be handled by the gradient method as the traditional clustering method fuzzy c-means does, a newly developed excellent global search method, which is the gravitational search algorithm (GSA), is employed. Then, the GSA-based hyperplane clustering algorithm (GSHPC) is proposed and illuminated. GSHPC is used to partition the fuzzy space and identify premise parameters of the T-S fuzzy model, and orthogonal least squares is exploited to identify the consequent parameters. Comparative experiments are designed to verify the validity of the proposed clustering algorithm and the T-S fuzzy model identification method, and the results show that the new method is effective in describing a complicated nonlinear system with significantly high accuracies compared with approaches in the literature.
机译:为了提高Takagi-Sugeno(T-S)模糊模型识别中模糊聚类算法在模糊空间划分中的性能,提出了一种超平面原型模糊聚类模型。为了解决聚类目标函数无法通过梯度方法处理的问题,而传统的聚类方法Fuzzy c-means无法做到这一点,采用了一种新开发的出色的全局搜索方法,即重力搜索算法(GSA)。然后,提出并阐明了基于GSA的超平面聚类算法(GSHPC)。 GSHPC用于划分模糊空间并识别T-S模糊模型的前提参数,并利用正交最小二乘来识别后续参数。通过比较实验验证了所提聚类算法和T-S模糊模型识别方法的有效性,结果表明,与文献中的方法相比,该新方法可有效地描述一种精度很高的复杂非线性系统。

著录项

  • 来源
    《Fuzzy Systems, IEEE Transactions on》 |2012年第2期|p.305-317|共13页
  • 作者

    Chaoshun Li;

  • 作者单位
  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号