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

kNN Classification: a review kNN分类：综述

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-09-01 DOI: 10.1007/s10472-023-09882-x

Panos K. Syriopoulos, Nektarios G. Kalampalikis, S. Kotsiantis, M. Vrahatis

引用次数: 0

Digital continuity of rotations in the 2D regular grids 二维规则网格中旋转的数字连续性

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-29 DOI: 10.1007/s10472-023-09891-w

Müge Saadetoğlu, Benedek Nagy, Aydın Avkan

{"title":"Digital continuity of rotations in the 2D regular grids","authors":"Müge Saadetoğlu, Benedek Nagy, Aydın Avkan","doi":"10.1007/s10472-023-09891-w","DOIUrl":"10.1007/s10472-023-09891-w","url":null,"abstract":"<div><p>A digitized rigid motion is called digitally continuous if two neighbor pixels still stay neighbors after the motion. This concept plays important role when people or computers (artificial intelligence, machine vision) need to recognize the object shown in the image. In this paper, digital rotations of a pixel with its closest neighbors are of our interest. We compare the neighborhood motion map results among the three regular grids, when the center of rotation is the midpoint of a main pixel, a grid point (corner of a pixel) or an edge midpoint. The first measure about the quality of digital rotations is based on bijectivity, e.g., measuring how many of the cases produce bijective and how many produce not bijective neighborhood motion maps (Avkan et. al, 2022). Now, a second measure is investigated, the quality of bijective digital rotations is measured by the digital continuity of the resulted image: we measure how many of the cases are bijective and also digitally continuous. We show that rotations on the triangular grid prove to be digitally continuous at many more real angles and also as a special case, many more integer angles compared to the square grid or to the hexagonal grid with respect to the three different rotation centers.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 1","pages":"115 - 137"},"PeriodicalIF":1.2,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43672320","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

A combinatorial technique for generation of digital plane using GCD 用GCD生成数字平面的组合技术

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-28 DOI: 10.1007/s10472-023-09889-4

Somrita Saha, Arindam Biswas

引用次数: 0

On hedonic games with common ranking property 论具有共同等级属性的享乐博弈

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-23 DOI: 10.1007/s10472-023-09892-9

Bugra Caskurlu, Fatih Erdem Kizilkaya

{"title":"On hedonic games with common ranking property","authors":"Bugra Caskurlu, Fatih Erdem Kizilkaya","doi":"10.1007/s10472-023-09892-9","DOIUrl":"10.1007/s10472-023-09892-9","url":null,"abstract":"<div><p>Hedonic games are a prominent model of coalition formation, in which each agent’s utility only depends on the coalition she resides. The subclass of hedonic games that models the formation of general partnerships (Larson 2018), where all affiliates receive the same utility, is referred to as hedonic games with common ranking property (HGCRP). Aside from their economic motivation, HGCRP came into prominence since they are guaranteed to have core stable solutions that can be found efficiently (Farrell and Scotchmer Q. J. Econ. <b>103</b>(2), 279–297 1988). We improve upon existing results by proving that every instance of HGCRP has a solution that is Pareto optimal, core stable, and individually stable. The economic significance of this result is that efficiency is not to be totally sacrificed for the sake of stability in HGCRP. We establish that finding such a solution is <b>NP-hard</b> even if the sizes of the coalitions are bounded above by 3; however, it is polynomial time solvable if the sizes of the coalitions are bounded above by 2. We show that the gap between the total utility of a core stable solution and that of the socially-optimal solution (OPT) is bounded above by <i>n</i>, where <i>n</i> is the number of agents, and that this bound is tight. Our investigations reveal that computing OPT is inapproximable within better than <span>(O(n^{1-epsilon }))</span> for any fixed <span>(epsilon > 0)</span>, and that this inapproximability lower bound is polynomially tight. However, OPT can be computed in polynomial time if the sizes of the coalitions are bounded above by 2.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 3","pages":"581 - 599"},"PeriodicalIF":1.2,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135520475","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

Realtime gray-box algorithm configuration using cost-sensitive classification 使用成本敏感分类的实时灰盒算法配置

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-18 DOI: 10.1007/s10472-023-09890-x

D. Weiss, Kevin Tierney

引用次数: 0

Novel SVM-based classification approaches for evaluating pancreatic carcinoma 基于支持向量机的胰腺癌分类新方法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-14 DOI: 10.1007/s10472-023-09888-5

A. Washburn, Neng Fan, Hao Helen Zhang

引用次数: 0

To raise or not to raise: the autonomous learning rate question 提高还是不提高：自主学习率问题

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-08 DOI: 10.1007/s10472-023-09887-6

Xiaomeng Dong, Tao Tan, Michael Potter, Yun-Chan Tsai, Gaurav Kumar, V. Ratna Saripalli, Theodore Trafalis

引用次数: 0

Two parameter-tuned multi-objective evolutionary-based algorithms for zoning management in marine spatial planning 海洋空间规划分区管理的两参数调整多目标进化算法

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-02 DOI: 10.1007/s10472-023-09853-2

Mohadese Basirati, Romain Billot, P. Meyer

引用次数: 1

A study on the predictive strength of fractal dimension of white and grey matter on MRI images in Alzheimer’s disease 阿尔茨海默病MRI图像中白质和灰质分形维数预测强度的研究

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-01 DOI: 10.1007/s10472-023-09885-8

Niccolò Di Marco, Azzurra di Palma, Andrea Frosini, for the Alzheimer’s Disease Neuroimaging Initiative*

{"title":"A study on the predictive strength of fractal dimension of white and grey matter on MRI images in Alzheimer’s disease","authors":"Niccolò Di Marco, Azzurra di Palma, Andrea Frosini, for the Alzheimer’s Disease Neuroimaging Initiative*","doi":"10.1007/s10472-023-09885-8","DOIUrl":"10.1007/s10472-023-09885-8","url":null,"abstract":"<div><p>Many recent studies have shown that Fractal Dimension (FD), a ratio for figuring out the complexity of a system given its measurements, can be used as an useful index to provide information about certain brain disease. Our research focuses on the Alzheimer’s disease changes in white and grey brain matters detected through the FD indexes of their contours. Data used in this study were obtained from the Alzheimer’s Disease (AD) Neuroimaging Initiative database (Normal Condition, <i>N</i> = 57, and Alzheimer’s Disease, <i>N</i> = 60). After standard preprocessing pipeline, the white and grey matter 3D FD indexes are computed for the two groups. A statistical analysis shows that only grey matter 3D FD indexes are able to differentiate healthy and AD subjects. Although white matter 3D FD indexes do not, it is remarkable that their presence enhance the separation capability of previous ones. In order to valuate the classification capability of these indexes on healthy and AD subjects, we define several Neural Networks models. The performances of these models vary according to the statistical analysis and reach their best performances when each 3D FD input index is changed into a sequence of 2D FD indexes of (a subset of) the horizontal slices of the white and grey matter volumes.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 1","pages":"201 - 214"},"PeriodicalIF":1.2,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09885-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47190605","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

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells 用答案集编程处理布尔网络和吸引子计算:在细胞基因调控网络中的应用

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-31 DOI: 10.1007/s10472-023-09886-7

Tarek Khaled, Belaid Benhamou, Van-Giang Trinh

{"title":"Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells","authors":"Tarek Khaled, Belaid Benhamou, Van-Giang Trinh","doi":"10.1007/s10472-023-09886-7","DOIUrl":"10.1007/s10472-023-09886-7","url":null,"abstract":"<div><p>Deciphering gene regulatory networks’ functioning is an essential step for better understanding of life, as these networks play a fundamental role in the control of cellular processes. Boolean networks have been widely used to represent gene regulatory networks. They allow to describe the dynamics of complex gene regulatory networks straightforwardly and efficiently. The attractors are essential in the analysis of the dynamics of a Boolean network. They explain that a particular cell can acquire specific phenotypes that may be transmitted over several generations. In this work, we consider a new representation of Boolean networks’ dynamics based on a new semantics used in Answer Set Programming (ASP). We use logic programs and ASP to express and deal with gene regulatory networks seen as Boolean networks, and develop a method to detect all the attractors of such networks. We first show how to represent and deal with general Boolean networks for the synchronous and asynchronous updates modes, where the computation of attractors requires a simulation of these networks’ dynamics. Then, we propose an approach for the particular case of circular networks where no simulation is needed. This last specific case plays an essential role in biological systems. We show several theoretical properties; in particular, simple attractors of the gene networks are represented by the stable models of the corresponding logic programs and cyclic attractors by its extra-stable models. These extra-stable models correspond to the extra-extensions of the new semantics that are not captured by the semantics of stable models. We then evaluate the proposed approach for general Boolean networks on real biological networks and the one dedicated to the case of circular networks on Boolean networks generated randomly. The obtained results for both approaches are encouraging.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 5","pages":"713 - 750"},"PeriodicalIF":1.2,"publicationDate":"2023-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09886-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44076901","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