A Novel Clustering-Forecast Method With Nonlinear Logo Information Filtering Networks

IF 3.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qingyang Liu, Ramin Yahyapour
{"title":"A Novel Clustering-Forecast Method With Nonlinear Logo Information Filtering Networks","authors":"Qingyang Liu,&nbsp;Ramin Yahyapour","doi":"10.1155/int/6410414","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we introduced a novel methodology to build a classification-forecast model used for financial risk forewarning. For the first step, we utilize the K–S test, Mann–Whitney <i>U</i> test, and Pearson’s correlation to select variables. Then, we employ CRITIC and fuzzy comprehensive evaluation (FCE) methods to score the risk of listed companies. Following this, self-organizing maps (SOM) clustering is utilized to segment the samples into five distinct risk levels. For the second step, we utilized triangulated maximally filtered graph (TMFG) and maximally filtered clique forest (MFCF) to minimize the number of indicators based on the dependent relationships between variables. These are then combined with Gaussian Markov random field (GMRF) and Copula algorithms to address nonlinear situations, forming what we refer to as the LoGo model. To further enhance the accuracy of LoGo models, we utilize the square Mahalanobis distance to compute the log-likelihoods as part matrix. The results reveal that the enhanced LoGo model with part matrix improves average accuracy by 7% compared with the original models without part matrix, albeit with a tenfold increase in execution time. MFCF demonstrates superior performance over TMFG in linear situations, achieving a 40% higher accuracy. However, under nonlinear circumstances, TMFG only requires half the execution time of MFCF, yet achieves a slightly higher average accuracy. Furthermore, compared with the widely used CNN models, the enhanced LoGo models show superior performance as they achieved closed accuracy in a shorter time.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7000,"publicationDate":"2025-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/6410414","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/int/6410414","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we introduced a novel methodology to build a classification-forecast model used for financial risk forewarning. For the first step, we utilize the K–S test, Mann–Whitney U test, and Pearson’s correlation to select variables. Then, we employ CRITIC and fuzzy comprehensive evaluation (FCE) methods to score the risk of listed companies. Following this, self-organizing maps (SOM) clustering is utilized to segment the samples into five distinct risk levels. For the second step, we utilized triangulated maximally filtered graph (TMFG) and maximally filtered clique forest (MFCF) to minimize the number of indicators based on the dependent relationships between variables. These are then combined with Gaussian Markov random field (GMRF) and Copula algorithms to address nonlinear situations, forming what we refer to as the LoGo model. To further enhance the accuracy of LoGo models, we utilize the square Mahalanobis distance to compute the log-likelihoods as part matrix. The results reveal that the enhanced LoGo model with part matrix improves average accuracy by 7% compared with the original models without part matrix, albeit with a tenfold increase in execution time. MFCF demonstrates superior performance over TMFG in linear situations, achieving a 40% higher accuracy. However, under nonlinear circumstances, TMFG only requires half the execution time of MFCF, yet achieves a slightly higher average accuracy. Furthermore, compared with the widely used CNN models, the enhanced LoGo models show superior performance as they achieved closed accuracy in a shorter time.

Abstract Image

一种新的非线性标志信息过滤网络聚类预测方法
本文介绍了一种新的方法来建立用于金融风险预警的分类预测模型。第一步,我们利用K-S检验、Mann-Whitney U检验和Pearson相关性来选择变量。然后,采用critical和模糊综合评价(FCE)方法对上市公司风险进行评分。在此之后,利用自组织图(SOM)聚类将样本划分为五个不同的风险水平。第二步,我们利用三角化最大过滤图(TMFG)和最大过滤团森林(MFCF)基于变量之间的依赖关系来最小化指标的数量。然后将它们与高斯马尔可夫随机场(GMRF)和Copula算法结合起来处理非线性情况,形成我们所说的LoGo模型。为了进一步提高LoGo模型的准确性,我们利用马氏距离的平方来计算对数似然作为部分矩阵。结果表明,与没有部分矩阵的原始模型相比,带有部分矩阵的增强LoGo模型的平均准确率提高了7%,尽管执行时间增加了10倍。在线性情况下,MFCF表现出优于TMFG的性能,实现了40%以上的精度。然而,在非线性情况下,TMFG只需要MFCF一半的执行时间,但平均精度略高。此外,与广泛使用的CNN模型相比,增强的LoGo模型在更短的时间内实现了封闭精度,表现出更优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Intelligent Systems
International Journal of Intelligent Systems 工程技术-计算机:人工智能
CiteScore
11.30
自引率
14.30%
发文量
304
审稿时长
9 months
期刊介绍: The International Journal of Intelligent Systems serves as a forum for individuals interested in tapping into the vast theories based on intelligent systems construction. With its peer-reviewed format, the journal explores several fascinating editorials written by today''s experts in the field. Because new developments are being introduced each day, there''s much to be learned — examination, analysis creation, information retrieval, man–computer interactions, and more. The International Journal of Intelligent Systems uses charts and illustrations to demonstrate these ground-breaking issues, and encourages readers to share their thoughts and experiences.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信