Annals of Mathematics and Artificial Intelligence最新文献_第3页

Data science meets optimization II 数据科学与优化2

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-04-16 DOI: 10.1007/s10472-025-09980-y

Yingqian Zhang, Tias Guns, Michele Lombardi, Patrick De Causmaecker

引用次数: 0

Towards automated proving in solid geometry 走向立体几何的自动化证明

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-04-01 DOI: 10.1007/s10472-025-09975-9

Danijela Simić, Sana Stojanović-Đurđević, Ivana Tanasijević

引用次数: 0

IncV3-BLSTM: a multi-label inceptionV3-BLSTM model for predicting potential side effects of COVID-19 drugs IncV3-BLSTM：用于预测COVID-19药物潜在副作用的多标签inceptionV3-BLSTM模型

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-03-31 DOI: 10.1007/s10472-025-09978-6

Pranab Das

{"title":"IncV3-BLSTM: a multi-label inceptionV3-BLSTM model for predicting potential side effects of COVID-19 drugs","authors":"Pranab Das","doi":"10.1007/s10472-025-09978-6","DOIUrl":"10.1007/s10472-025-09978-6","url":null,"abstract":"<div><p>Amid the global COVID-19 pandemic, developing effective drugs to combat Coronavirus Disease (COVID-19) has become crucial. However, identifying potential side effects of these drugs remains a significant challenge in the pursuit of effective treatments. Recent advancements in computational models for pharmaceutical development have opened new possibilities for detecting such side effects. In response to the urgent need for effective COVID-19 drugs, this research introduces a novel methodology combining multi-label InceptionV3 and Bidirectional Long Short-Term Memory (IncV3-BLSTM). The experimental evaluations utilize chemical conformers derived from the stick structures of COVID-19 drugs. These conformers’ distinctive features are represented through RGB color channels, with feature extraction performed using InceptionV3, GlobalAveragePooling2D, and BLSTM layers. The results demonstrate the superior efficiency of the IncV3-BLSTM model, outperforming previous studies. Notably, the proposed model achieves a peak accuracy of 97.50% and a co-occurrence potential side effects detection rate of 82.16%. This research marks a significant advancement in modeling drug side effects, particularly for COVID-19 treatments.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 3","pages":"371 - 394"},"PeriodicalIF":1.6,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Improving angular speed uniformity of rational parameterization using piecewise radical reparameterization 采用分段径向重参数化方法改善合理参数化的角速度均匀性

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-03-27 DOI: 10.1007/s10472-025-09976-8

Hoon Hong, Dongming Wang, Jing Yang

引用次数: 0

Decentralized federated multi-view sparse subspace clustering 分散联邦多视图稀疏子空间聚类

IF 1.6 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-03-25 DOI: 10.1007/s10472-025-09977-7

Yifan Lei, Xiaohong Chen

{"title":"Decentralized federated multi-view sparse subspace clustering","authors":"Yifan Lei, Xiaohong Chen","doi":"10.1007/s10472-025-09977-7","DOIUrl":"10.1007/s10472-025-09977-7","url":null,"abstract":"<div><p>Subspace clustering, particularly multi-view subspace clustering, has become increasingly relevant in machine learning due to the proliferation of multi-view data sets. Despite significant advancements, existing multi-view subspace clustering algorithms still encounter two primary limitations. Firstly, most methods learn the affinity matrix using constraints or regularization terms and then apply spectral clustering. This approach is susceptible to noise and redundant information in the original data. Secondly, in practical applications, multi-view data is often stored across different devices, some of which may contain private information that cannot be shared. Although traditional federated learning can address this issue, this approach faces limitations in scenarios where the central server is either absent or has failed. To resolve these problems, we propose a Decentralized Federated Multi-view sparse Subspace Clustering(DFMSC) method. DFMSC introduce a decentralized approach that avoids the need for a central server, reducing the vulnerability to server failure and enhancing data privacy. Specifically, our approach integrate self-representation learning, graph structure updating, and spectral embedding learning within a decentralized framework. We enforce consistency across different views by introducing a consistency constraint, which ensures that updates are made locally while achieving a unified spectral embedding through neighbor communication. Accordingly, we propose an iterative algorithm to solve the resulting optimization problem. Experimental results on a variety of real-world multi-view datasets demonstrate the superiority of our approach.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 3","pages":"345 - 369"},"PeriodicalIF":1.6,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148614435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An XAI-based meta-parameter tuning for time-series forecasting 基于xai的时间序列预测元参数调优

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-03-11 DOI: 10.1007/s10472-025-09973-x

Hiroyuki Nakagawa, Shimon Sumita, Ryuichi Iida, Tatsuhiro Tsuchiya

引用次数: 0

Readable automated proofs of ruler and compass constructions 可读的尺和指南针结构的自动证明

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-20 DOI: 10.1007/s10472-025-09971-z

Vesna Marinković, Tijana Šukilović, Viktor Novaković, Filip Marić

引用次数: 0

Automation of triangle straightedge-and-compass constructions using automated planning 使用自动规划的三角形直罗经结构的自动化

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-19 DOI: 10.1007/s10472-025-09972-y

Milan Banković

{"title":"Automation of triangle straightedge-and-compass constructions using automated planning","authors":"Milan Banković","doi":"10.1007/s10472-025-09972-y","DOIUrl":"10.1007/s10472-025-09972-y","url":null,"abstract":"<div><p>In this paper, we consider automated solving of triangle straightedge-and-compass construction problems by reducing them to automated planning. We consider the problems from the Wernick’s list, where each problem assumes that locations of three significant points of a triangle are given, and the goal is to construct all three vertices of the triangle. We develop two different models of the corresponding planning problem. In the first model, the planning problem is described using the PDDL language, which is suitable for solving with dedicated automated planners. The second model assumes that the planning problem is first expressed as a finite-domain constraint satisfaction problem, and then encoded in the MiniZinc language. Such model is suitable for solving with constraint solvers. In both cases, we employ existing artificial intelligence tools in search for a solution of our construction problem. The main benefit of using the existing tools for such purpose, instead of developing dedicated tools, is that we can rely on the efficient search that is already implemented within the tool, enabling us to focus on geometric aspects of the problem. We evaluate our approach on 74 solvable problems from the Wernick’s list, and compare it to the dedicated triangle construction solver ArgoTriCS. The results show that our approach tends to be superior to dedicated tools in terms of efficiency, while it requires much less effort to implement. Also, we are often able to find shorter construction plans, thanks to the optimization capabilities offered by the modern planners and constraint solvers. The presented approach is only a search method and does not address proving the correctness of the obtained constructions and discussing when solutions exist, leaving these tasks to other tools. Although the paper focuses on a specific set of construction problems, the approach can be generalized to other classes of problems, which will be explored in future work.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"843 - 869"},"PeriodicalIF":1.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Approximate integrity constraints in incomplete databases with limited domains 有限域不完整数据库的近似完整性约束

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-10 DOI: 10.1007/s10472-025-09967-9

Munqath Al-atar, Attila Sali

{"title":"Approximate integrity constraints in incomplete databases with limited domains","authors":"Munqath Al-atar, Attila Sali","doi":"10.1007/s10472-025-09967-9","DOIUrl":"10.1007/s10472-025-09967-9","url":null,"abstract":"<div><p>A strongly possible constraint is an intermediate concept between possible and certain constraints, based on the strongly possible world approach (a strongly possible world is obtained by replacing <span>NULL</span>’s by a value from the ones appearing in the corresponding attribute of the table). In the present paper, we introduce strongly possible versions of multivalued dependencies and cross joins, and we analyse the complexity of checking the validity of a given strongly possible cross joins. We also study two approximation measures, <span>(g_3)</span> and <span>(g_5)</span>, of strongly possible keys (spKeys), functional dependencies (spFDs), multivalued dependencies (spMVDs) and cross joins (spCJs). For spKeys and spFDs, we show that the <span>(g_3)</span> value is always an upper bound of the <span>(g_5)</span> value for a given constraint in a table. However, there are tables of arbitrarily large number of tuples and a constant number of attributes that satisfy <span>(g_3-g_5=frac{p}{q})</span> for any rational number <span>(0le frac{p}{q}<1)</span>. On the other hand, we show that the values of measures <span>(g_3)</span> and <span>(g_5)</span> are independent of each other in the case of spMVDs and spCJs. We prove that checking whether a given strongly possible cross join holds in an incomplete table is NP-complete, in sharp contrast to the fact that checking a given cross join in a complete table is easily seen to be polynomially solvable. We also treat complexity questions of determination of the approximation values, namely we show that both, determining <span>(g_3)</span> and <span>(g_5)</span> for spCJs are NP-complete.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 5","pages":"759 - 786"},"PeriodicalIF":1.0,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09967-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145449776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

35 years of math and AI 35年的数学和人工智能

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-10 DOI: 10.1007/s10472-025-09969-7

Martin Charles Golumbic

引用次数: 0