Financial Distress Study Based on PSO k-means Clustering Algorithm and Rough Set Theory

被引:3
|
作者
Wu, Peng [1 ]
Liu, Cheng [1 ]
机构
[1] Univ Sci & Technol Beijing, Dongling Sch Econ & Management, Beijing 100083, Peoples R China
关键词
Particle Swarm Optimization; Rough Set; K-means clustering; financial distress; BANKRUPTCY; RATIOS; PREDICTION;
D O I
10.4028/www.scientific.net/AMM.411-414.2377
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
The traditional financial distress method normally divided samples into two categories by healthy and bankruptcy. And the financial indicators are typically chosen without using a systematic and reasonable theory. To be more realistic, this paper selected all the companies in a certain industry as the research objects. Twenty-one financial indicators were primarily chosen as the condition attributes, reduction set was obtained by matrix reduction identification based on rough set theory. Then PSO-based clustering algorithm K-means was used to divide subjects into 5 categories of different financial status. The decision-making table was formed with the reduction set using the classification as a decision attribute. Finally, we tested the reasonableness of the classification and generated early warning rules together with rough set theory to evaluate the financial status of listed companies. The results showed that PSO-based K-means algorithm was able to reasonably classify companies, at the same time to overcome the subjective impacts in the artificial measure of financial crisis level. Data generated using this method agreed with the rough set theory for up to 87.0%, thus proving this method to be effective and feasible.
引用
收藏
页码:2377 / 2383
页数:7
相关论文
共 50 条
  • [31] A Clustering Method Based on K-Means Algorithm
    Li, Youguo
    Wu, Haiyan
    [J]. INTERNATIONAL CONFERENCE ON SOLID STATE DEVICES AND MATERIALS SCIENCE, 2012, 25 : 1104 - 1109
  • [32] A Fuzzy Clustering Algorithm Based on K-means
    Yan, Zhen
    Pi, Dechang
    [J]. ECBI: 2009 INTERNATIONAL CONFERENCE ON ELECTRONIC COMMERCE AND BUSINESS INTELLIGENCE, PROCEEDINGS, 2009, : 523 - 528
  • [33] An improved algorithm of rough K-means clustering based on variable weighted distance measure
    [J]. Zhang, Tengfei, 1600, Science and Engineering Research Support Society (07):
  • [34] Rough K-means clustering based on unbalanced degree of cluster
    [J]. Zhang, T.-F. (tfzhang@126.com), 1600, Northeast University (28):
  • [35] A GENERALIZED k-MEANS PROBLEM FOR CLUSTERING AND AN ADMM-BASED k-MEANS ALGORITHM
    Ling, Liyun
    Gu, Yan
    Zhang, Su
    Wen, Jie
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (06) : 2089 - 2115
  • [36] The kernel rough k-means algorithm
    Meng, Wang
    Hongyan, Dui
    Shiyuan, Zhou
    Zhankui, Dong
    Zige, Wu
    [J]. Recent Advances in Computer Science and Communications, 2020, 13 (02) : 234 - 239
  • [37] Comparison of conventional and rough K-means clustering
    Lingras, P
    Yan, R
    West, C
    [J]. ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, 2003, 2639 : 130 - 137
  • [38] Cooperative Swarm based Clustering Algorithm based on PSO and k-means to find optimal cluster centroids
    Naik, Bighnaraj
    Swetanisha, Subhra
    Behera, Dayal Kumar
    Mahapatra, Sarita
    Padhi, Bharat Kumar
    [J]. 2012 NATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION SYSTEMS (NCCCS), 2012, : 227 - 231
  • [39] Some refinements of rough k-means clustering
    Peters, Georg
    [J]. PATTERN RECOGNITION, 2006, 39 (08) : 1481 - 1491
  • [40] Research on prediction and recommendation of financial stocks based on K-means clustering algorithm optimization
    Fang, Zheng
    Chiao, Chaoshin
    [J]. JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2021, 21 (05) : 1081 - 1089