Annals of Mathematics and Artificial Intelligence最新文献

{"title":"Automated programming, symbolic computation, machine learning: my personal view","authors":"Bruno Buchberger","doi":"10.1007/s10472-023-09894-7","DOIUrl":"10.1007/s10472-023-09894-7","url":null,"abstract":"<div><p>In this note, I present my personal view on the interaction of the three areas Automated Programming, Symbolic Computation, and Machine Learning. Programming is the activity of finding a (hopefully) correct program (algorithm) for a given problem. Programming is central to automation in all areas and is considered one of the most creative human activities. However, already very early in the history of programming, people started to “jump to the meta-level” of programming, i.e., started to develop procedures that automate, or semi-automate, (various aspects or parts of) the process of programming. This area has various names like “Automated Programming”, “Automated Algorithm Synthesis”, etc. Developing compilers can be considered an early example of a problem in automated programming. Automated reasoners for proving the correctness of programs with respect to a specification is an advanced example of a topic in automated programming. ChatGPT producing (amazingly good) programs from problem specifications in natural language is a recent example of automated programming. Programming tends to become the most important activity as the level of technological sophistication increases. Therefore, automating programming is maybe the most exciting and relevant technological endeavor today. It also will have enormous impact on the global job market in the software industry. Roughly, I see two main approaches to automated programming:</p><ul>\u0000 <li>\u0000 <p>symbolic computation</p>\u0000 </li>\u0000 <li>\u0000 <p>and machine learning.</p>\u0000 </li>\u0000 </ul><p> In this note, I explain how the two approaches work and that they are fundamentally different because they address two completely different ways of how problems are specified. Together, the two approaches constitute (part of) what some people like to call “artificial intelligence”. In my analysis, both approaches are just part of (algorithmic) mathematics. The approaches, like all non-trivial mathematical methods, need quite some intelligence on the side of the human inventors of the methods. However, applying the methods is just “machine execution” of algorithms. It is misleading to call the application “machine intelligence” or “artificial intelligence”. The analysis of the two approaches to automated programming also suggests that the two approaches, in the future, should be combined to achieve even higher levels of sophistication. At the end of this note, I propose some research questions for this new direction.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 5","pages":"569 - 589"},"PeriodicalIF":1.2,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09894-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50470061","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}

{"title":"Making model checking feasible for GOAL","authors":"Yi Yang,&nbsp;Tom Holvoet","doi":"10.1007/s10472-023-09898-3","DOIUrl":"10.1007/s10472-023-09898-3","url":null,"abstract":"<div><p>Agent Programming Languages have been studied for over 20 years for programming complex decision-making for autonomous systems. The GOAL agent programming language is particularly interesting since it depends on automated planning based on beliefs and goals to determine behavior rather than preprogrammed planning by developers. Model checking is a powerful verification technique to guarantee the safety of an autonomous system. Despite studies of model checking in other agent programming languages, GOAL lacks support for model checking of GOAL programs. The fundamental challenge is to make GOAL programs feasible for model checking. In this paper, we tackle this fundamental issue. First, we formalize the syntax and semantics of the logic underpinning stratified single-agent GOAL programs. Second, we devise an algorithm for transforming a stratified single-agent GOAL program to a transition system that is equivalent in terms of operational semantics, enabling model checking. Third, we develop an automated translator for a stratified single-agent GOAL program. The translator consists of (1) the automated transformation of a GOAL program into its operational semantically equivalent transition system, and (2) the interface generation of the generated transition system into a Prism model, an input for two probabilistic symbolic model checkers: Storm and Prism. Moreover, we point out that we will extend the applicability of the transformation algorithm and its implementation to all stratified GOAL programs.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 4","pages":"837 - 853"},"PeriodicalIF":1.2,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134947476","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}

{"title":"Parameter tuning of continuous Hopfield network applied to combinatorial optimization","authors":"Safae Rbihou,&nbsp;Nour-Eddine Joudar,&nbsp;Khalid Haddouch","doi":"10.1007/s10472-023-09895-6","DOIUrl":"10.1007/s10472-023-09895-6","url":null,"abstract":"<div><p>The continuous Hopfield network (CHN) has provided a powerful approach to optimization problems and has shown good performance in different domains. However, two primary challenges still remain for this network: defining appropriate parameters and hyperparameters. In this study, our objective is to address these challenges and achieve optimal solutions for combinatorial optimization problems, thereby improving the overall performance of the continuous Hopfield network. To accomplish this, we propose a new technique for tuning the parameters of the CHN by considering its stability. To evaluate our approach, three well-known combinatorial optimization problems, namely, weighted constraint satisfaction problems, task assignment problems, and the traveling salesman problem, were employed. The experiments demonstrate that the proposed approach offers several advantages for CHN parameter tuning and the selection of optimal hyperparameter combinations.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 2","pages":"257 - 275"},"PeriodicalIF":1.2,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136060942","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}

{"title":"Path planning algorithm for mobile robots based on clustering-obstacles and quintic trigonometric Bézier curve","authors":"Vahide Bulut","doi":"10.1007/s10472-023-09893-8","DOIUrl":"10.1007/s10472-023-09893-8","url":null,"abstract":"<div><p>Finding a collision-free feasible path for mobile robots is very important because they are essential in many fields such as healthcare, military, and industry. In this paper, a novel Clustering Obstacles (CO)-based path planning algorithm for mobile robots is presented using a quintic trigonometric Bézier curve and its two shape parameters. The CO-based algorithm forms clusters of geometrically shaped obstacles and finds the cluster centers. Moreover, the proposed waypoint algorithm (WP) finds the waypoints of the predefined skeleton path in addition to the start and destination points in an environment. Based on all these points, the predefined quintic trigonometric Bézier path candidates, taking the skeleton path as their convex hull, are then generated using the shape parameters of this curve. Moreover, the performance of the proposed algorithm is compared with K-Means and agglomerative hierarchical algorithms to obtain the quintic trigonometric Bézier paths desired by the user. The experimental results show that the CO-based path planning algorithm achieves better cluster centers and consequently better collision-free predefined paths.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 2","pages":"235 - 256"},"PeriodicalIF":1.2,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136313827","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}

{"title":"kNN Classification: a review","authors":"Panos K. Syriopoulos,&nbsp;Nektarios G. Kalampalikis,&nbsp;Sotiris B. Kotsiantis,&nbsp;Michael N. Vrahatis","doi":"10.1007/s10472-023-09882-x","DOIUrl":"10.1007/s10472-023-09882-x","url":null,"abstract":"<div><p>The <i>k-</i>nearest neighbors (<i>k</i>/NN) algorithm is a simple yet powerful non-parametric classifier that is robust to noisy data and easy to implement. However, with the growing literature on <i>k</i>/NN methods, it is increasingly challenging for new researchers and practitioners to navigate the field. This review paper aims to provide a comprehensive overview of the latest developments in the <i>k</i>/NN algorithm, including its strengths and weaknesses, applications, benchmarks, and available software with corresponding publications and citation analysis. The review also discusses the potential of <i>k</i>/NN in various data science tasks, such as anomaly detection, dimensionality reduction and missing value imputation. By offering an in-depth analysis of <i>k</i>/NN, this paper serves as a valuable resource for researchers and practitioners to make informed decisions and identify the best <i>k</i>/NN implementation for a given application.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"43 - 75"},"PeriodicalIF":1.2,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48667907","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}

{"title":"Digital continuity of rotations in the 2D regular grids","authors":"Müge Saadetoğlu,&nbsp;Benedek Nagy,&nbsp;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}

{"title":"A combinatorial technique for generation of digital plane using GCD","authors":"Somrita Saha,&nbsp;Arindam Biswas","doi":"10.1007/s10472-023-09889-4","DOIUrl":"10.1007/s10472-023-09889-4","url":null,"abstract":"<div><p>A digital plane is a digitization of a Euclidean plane. A plane is specified by its normal, which is a 3D vector with integer coordinates, as considered in this case. It is established here that a 3D digital straight line segment, shifted by an integer amount, can produce the digitized plane. 3D plane’s normals are classified based on the Greatest Common Divisor (GCD) of its components, and the net code is calculated separately for each case. Experimental results are provided for several normals. Also, we show that the digital plane segment generated is a connected digital plane. The proposed method mainly involves integer arithmetic.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 1","pages":"139 - 167"},"PeriodicalIF":1.2,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45076952","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}

{"title":"On hedonic games with common ranking property","authors":"Bugra Caskurlu,&nbsp;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 &gt; 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}

{"title":"Realtime gray-box algorithm configuration using cost-sensitive classification","authors":"Dimitri Weiss,&nbsp;Kevin Tierney","doi":"10.1007/s10472-023-09890-x","DOIUrl":"10.1007/s10472-023-09890-x","url":null,"abstract":"<div><p>A solver’s runtime and the quality of the solutions it generates are strongly influenced by its parameter settings. Finding good parameter configurations is a formidable challenge, even for fixed problem instance distributions. However, when the instance distribution can change over time, a once effective configuration may no longer provide adequate performance. Realtime algorithm configuration (RAC) offers assistance in finding high-quality configurations for such distributions by automatically adjusting the configurations it recommends based on instances seen so far. Existing RAC methods treat the solver as a black box, meaning the solver is given a configuration as input, and it outputs either a solution or runtime as an objective function for the configurator. However, analyzing intermediate output from the solver can enable configurators to avoid wasting time on poorly performing configurations. We propose a gray-box approach that utilizes intermediate output during evaluation and implement it within the RAC method Contextual Preselection with Plackett-Luce (CPPL blue). We apply cost-sensitive machine learning with pairwise comparisons to determine whether ongoing evaluations can be terminated to free resources. We compare our approach to a black-box equivalent on several experimental settings and show that our approach reduces the total solving time in several scenarios and improves solution quality in an additional scenario.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"109 - 130"},"PeriodicalIF":1.2,"publicationDate":"2023-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09890-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42645690","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}

{"title":"Novel SVM-based classification approaches for evaluating pancreatic carcinoma","authors":"Ammon Washburn,&nbsp;Neng Fan,&nbsp;Hao Helen Zhang","doi":"10.1007/s10472-023-09888-5","DOIUrl":"10.1007/s10472-023-09888-5","url":null,"abstract":"<div><p>In this paper, we develop two SVM-based classifiers named stable nested one-class support vector machines (SN-1SVMs) and decoupled margin-moment based SVMs (DMMB-SVMs), to predict the specific type of pancreatic carcinoma using quantitative histopathological signatures of images. For each patient, the diagnosis can produce hundreds of images, which can be used to classify the pancreatic tissues into three classes: chronic pancreatitis, intraductal papillary mucinous neoplasms, and pancreatic carcinoma. The proposed two approaches tackle the classification problems from two different perspectives: the SN-1SVM treats each image as a classification point in a nested fashion to predict malignancy of the tissues, while the DMMB-SVM treats each patient as a classification point by assembling information across images. One attractive feature of the DMMB-SVM is that, in addition to utilizing the mean information, it also takes into account the covariance of features extracted from images for each patient. We conduct numerical experiments to evaluate and compare performance of the two methods. It is observed that the SN-1SVM can take advantage of the data structure more effectively, while the DMMB-SVM demonstrates better computational efficiency and classification accuracy. To further improve interpretability of the final classifier, we also consider the <span>(ell _1)</span>-norm in the DMMB-SVM to handle feature selection.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 1","pages":"93 - 108"},"PeriodicalIF":1.2,"publicationDate":"2023-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47529434","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}