New principles of finding and removing elements of mathematical model for reducing computational and time complexity

被引：2

作者：

Matviychuk, Yaroslav ^{[1
]}

Kryvinska, Natalia ^{[2
]}

Shakhovska, Nataliya ^{[1
]}

Poniszewska-Maranda, Aneta ^{[3
]}

机构：

[1] Lviv Polytech Natl Univ, Lvov, Lviv Oblast, Ukraine

[2] Comenius Univ, Bratislava, Slovakia

[3] Lodz Univ Technol, Lodz, Poland

来源：

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING | 2023年 / 14卷 / 04期

关键词：

regularisation; reduction; identification procedure; incorrectness; neural network; NEURAL-NETWORKS;

D O I：

10.1504/IJGUC.2023.132625

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The original principle of removing elements of a mathematical model based on its parametric identification of neural network is proposed in the paper. The essence of proposed method is to find a functional subset with less variable results and higher accuracy than for the initial functional set of the model. It allows reducing the computational and time complexity of the applications built on the model. The comparison with dropout technique shows the 1, 1 decreasing of root mean squared error. In addition, reducing the complexity allows increasing the accuracy of neural network models. Therefore, reducing the number of parameters is an essential step in data preprocessing used in almost all modern systems. However, known methods of reducing the dimension depend on the problem area, making it impossible to use them in ensemble models.

引用

页码：400 / 410

页数：12

共 50 条

[1] A mathematical model for reducing the composting time
Larreategui, Estefania
Banchon, Carlos
ENFOQUE UTE, 2014, 5 (02): : 29 - 37
[2] Mathematical Model of Steganalysis Algorithms Correlation Estimation with Computational Complexity Considering
Atlasov, I. V.
Menshikh, V. V.
Solodukha, R. A.
2017 2ND INTERNATIONAL URAL CONFERENCE ON MEASUREMENTS (URALCON), 2017, : 227 - 232
[3] New Computational Complexity Reducing IDD Scheme Designed with Optimum Parameters
Cho, Jehoon
Kim, Minsung
Jeong, Sinsung
Park, Jungho
Oh, Taewon
IEEE COMMUNICATIONS LETTERS, 2013, 17 (07) : 1313 - 1316
[4] Reducing computational complexity of estimating multivariate histogram-based probabilistic model
Ding, Nan
Xu, Ji
Zhou, Shude
Sun, Zengqi
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 111 - +
[5] FINDING THE STIFFNESSES OF INTERFACE CONTACT ELEMENTS FOR THE COMPUTATIONAL MODEL OF STEAM TURBINE BLADING
Voldrich, Josef
Lazar, Jan
Polach, Pacel
Moravka, Stefan
PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2017, VOL 8, 2017,
[6] Reducing Time Complexity of SVM Model by LVQ Data Compression
Blachnik, Marcin
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT I, 2015, 9119 : 687 - 695
[7] New Mathematical Model for Finding Minimum Vertex Cut Set
Sevim, Tina Beseri
Kutucu, Hakan
Berberler, Murat Ersen
2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI), 2012,
[8] Reducing computational complexity of dynamic time warping based isolated word recognition with Time Scale Modification
Wong, PHW
An, OC
Wong, JWC
Lau, WHB
ICSP '98: 1998 FOURTH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, PROCEEDINGS, VOLS I AND II, 1998, : 722 - 725
[9] REDUCING COMPUTATIONAL COMPLEXITY OF TIME DELAY ESTIMATION METHOD USING FREQUENCY DOMAIN ALIGNMENT
Sahin, Ismet
Yilmazer, Nuri
2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2009, : 43 - +
[10] Time Complexity of Finding Compatible Wellness Groups in The Wellness Profile Model
Juneam, Nopadon
Kantabutra, Sanpawat
2014 11TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING/ELECTRONICS, COMPUTER, TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY (ECTI-CON), 2014,

← 1 2 3 4 5 →