Annals of Mathematics and Artificial Intelligence最新文献

筛选
英文 中文
Using causal discovery and pattern mining methods for group-specific policy-making: An agent-based model analysis method 在群体决策中使用因果发现和模式挖掘方法:基于主体的模型分析方法
IF 1 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2025-05-08 DOI: 10.1007/s10472-025-09984-8
Shuang Chang, Tatsuya Asai, Yusuke Koyanagi, Kento Uemura, Koji Maruhashi, Kotaro Ohori
{"title":"Using causal discovery and pattern mining methods for group-specific policy-making: An agent-based model analysis method","authors":"Shuang Chang,&nbsp;Tatsuya Asai,&nbsp;Yusuke Koyanagi,&nbsp;Kento Uemura,&nbsp;Koji Maruhashi,&nbsp;Kotaro Ohori","doi":"10.1007/s10472-025-09984-8","DOIUrl":"10.1007/s10472-025-09984-8","url":null,"abstract":"<div><p>An agent-based modelling approach is a powerful means of understanding social phenomena by modelling individual behaviours and interactions. However, the advancements in modelling pose challenges in the model analysis process for understanding the complex effects of input factors, especially when it comes to offering concrete policies for improving system outcomes. In this work, we propose a revised micro-dynamic analysis method that adopts pattern mining and causal discovery methods to enhance the model interpretation and to facilitate group-specific policy-making. It strengthens the explanation power of the conventional micro-dynamic analysis by eliminating ambiguity in the result interpretation and enabling a causal interpretation of a target phenomenon across subgroups. We applied our method to understand an agent-based model that evaluates the effects of a long-term care scheme on access to care. Our findings showed that the method can suggest policies for improving the equity of access more efficiently than the conventional scenario analysis.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 1","pages":"89 - 109"},"PeriodicalIF":1.0,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082527","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
Formalization of gyrovector spaces as models of hyperbolic geometry and special relativity 作为双曲几何和狭义相对论模型的陀螺矢量空间的形式化
IF 1 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2025-04-26 DOI: 10.1007/s10472-025-09979-5
Jelena Marković, Filip Marić
{"title":"Formalization of gyrovector spaces as models of hyperbolic geometry and special relativity","authors":"Jelena Marković,&nbsp;Filip Marić","doi":"10.1007/s10472-025-09979-5","DOIUrl":"10.1007/s10472-025-09979-5","url":null,"abstract":"<div><p>In this paper, we present an Isabelle/HOL formalization of noncommutative and nonassociative algebraic structures known as <i>gyrogroups</i> and <i>gyrovector spaces</i>. These concepts were introduced by Abraham A. Ungar and have deep connections to hyperbolic geometry and special relativity. Gyrovector spaces can be used to define models of hyperbolic geometry. Unlike other models, gyrovector spaces offer the advantage that all definitions exhibit remarkable syntactical similarities to standard Euclidean and Cartesian geometry (e.g., points on the line between <i>a</i> and <i>b</i> satisfy the parametric equation <span>( a oplus totimes (ominus a oplus b))</span>, for <span>(t in mathbb {R})</span>, while the hyperbolic Pythagorean theorem is expressed as <span>(a^2oplus b^2 = c^2)</span>, where <span>(otimes )</span>, <span>(oplus )</span>, and <span>(ominus )</span> represent gyro operations). We begin by formally defining gyrogroups and gyrovector spaces and proving their numerous properties. Next, we formalize Möbius and Einstein models of these abstract structures (formulated in the two-dimensional, complex plane), and then demonstrate that these are equivalent to the Poincaré and Klein-Beltrami models, satisfying Tarski’s geometry axioms for hyperbolic geometry.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"871 - 905"},"PeriodicalIF":1.0,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886917","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
Answer set programming for pattern generation in logical analysis of data 数据逻辑分析中模式生成的答案集编程
IF 1 4区 计算机科学
Annals of Mathematics and Artificial Intelligence Pub Date : 2025-04-16 DOI: 10.1007/s10472-025-09981-x
Katinka Becker, Alexander Bockmayr
{"title":"Answer set programming for pattern generation in logical analysis of data","authors":"Katinka Becker,&nbsp;Alexander Bockmayr","doi":"10.1007/s10472-025-09981-x","DOIUrl":"10.1007/s10472-025-09981-x","url":null,"abstract":"<div><p>Logical Analysis of Data (LAD) is a powerful technique for data classification based on partially defined Boolean functions. The decision rules for class prediction in LAD are formed out of patterns. According to different preferences in the classification problem, various pattern types have been defined. The generation of these patterns plays a key role in the LAD methodology and represents a computationally hard problem. In this article, we introduce a new approach to pattern generation in LAD based on Answer Set Programming (ASP), which can be applied to all common LAD pattern types.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 1","pages":"63 - 87"},"PeriodicalIF":1.0,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09981-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082335","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
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
{"title":"Data science meets optimization II","authors":"Yingqian Zhang,&nbsp;Tias Guns,&nbsp;Michele Lombardi,&nbsp;Patrick De Causmaecker","doi":"10.1007/s10472-025-09980-y","DOIUrl":"10.1007/s10472-025-09980-y","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 3","pages":"343 - 345"},"PeriodicalIF":1.0,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144918591","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
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ć
{"title":"Towards automated proving in solid geometry","authors":"Danijela Simić,&nbsp;Sana Stojanović-Đurđević,&nbsp;Ivana Tanasijević","doi":"10.1007/s10472-025-09975-9","DOIUrl":"10.1007/s10472-025-09975-9","url":null,"abstract":"<div><p>We present an approach for automated theorem proving in 3D solid geometry utilizing multiple algebraic prover engines. Our solution integrates dynamic geometry systems capable of generating solid geometry constructions. We have employed two different methods to transform geometric statements into algebraic representations, while implementing and evaluating these approaches with various theorem provers. Furthermore, we have explored non-degeneracy conditions (NDG) in the context of 3D solid geometry and provided insights into their role in ensuring the validity of geometric relations.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"907 - 952"},"PeriodicalIF":1.0,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886782","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
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
{"title":"Improving angular speed uniformity of rational parameterization using piecewise radical reparameterization","authors":"Hoon Hong,&nbsp;Dongming Wang,&nbsp;Jing Yang","doi":"10.1007/s10472-025-09976-8","DOIUrl":"10.1007/s10472-025-09976-8","url":null,"abstract":"<div><p>For rational parameterization of curves, it is desirable that the angular speed is made as uniform as possible. When the rational parameterization of a curve is given, the uniformity of its angular speed may be enhanced by finding a <i>re</i>-parameterization that achieves better uniformity, where one natural approach is to use <i>piecewise</i> rational reparameterization. However, this approach does <i>not</i> improve the situation when the angular speed of the original rational parameterization is zero at certain points on the curve. In this paper, we demonstrate that the challenge may be tackled by utilizing piecewise <i>radical</i> reparameterization.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"953 - 976"},"PeriodicalIF":1.0,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145887039","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
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,&nbsp;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
{"title":"An XAI-based meta-parameter tuning for time-series forecasting","authors":"Hiroyuki Nakagawa,&nbsp;Shimon Sumita,&nbsp;Ryuichi Iida,&nbsp;Tatsuhiro Tsuchiya","doi":"10.1007/s10472-025-09973-x","DOIUrl":"10.1007/s10472-025-09973-x","url":null,"abstract":"<div><p>How can we efficiently determine meta-parameter values for deep learning-based time-series forecasting given a time-series dataset? This paper introduces <i>Xtune</i>, an efficient and novel meta-parameter tuning method for deep learning-based time-series forecasting, leveraging explainable AI techniques. In particular, this study focuses on optimizing the window size for time-series forecasting. <i>Xtune</i> determines the optimal meta-parameter value for these methods and can also be applied to tune the window size for anomaly detection methods that utilize deep learning-based time-series forecasting. Extensive experiments on real-world datasets and forecasting methods demonstrate that <i>Xtune</i> efficiently identifies the optimal meta-parameter value and consistently outperforms the existing methods in terms of execution speed.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"94 1","pages":"1 - 18"},"PeriodicalIF":1.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-025-09973-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082453","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
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ć
{"title":"Readable automated proofs of ruler and compass constructions","authors":"Vesna Marinković,&nbsp;Tijana Šukilović,&nbsp;Viktor Novaković,&nbsp;Filip Marić","doi":"10.1007/s10472-025-09971-z","DOIUrl":"10.1007/s10472-025-09971-z","url":null,"abstract":"<div><p>Although there are several systems that successfully generate construction steps for ruler and compass construction problems, none of them provides readable synthetic correctness proofs for generated constructions. In this paper, we demonstrate how our triangle construction solver ArgoTriCS can cooperate with automated theorem provers for first-order logic and coherent logic so that it generates construction correctness proofs, that are both human-readable and formal (can be checked by interactive theorem provers such as Isabelle/HOL or Coq). For this purpose we identified a set of relevant lemmas and developed a coherent logic prover GCProver customized for geometry construction problems. Our experiments show that results are much better than with general purpose theorem provers.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 6","pages":"977 - 993"},"PeriodicalIF":1.0,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145887029","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书