AI Communications最新文献_第9页

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-10-27 DOI: 10.3233/aic-210090

H. Prade, G. Richard

{"title":"Multiple analogical proportions","authors":"H. Prade, G. Richard","doi":"10.3233/aic-210090","DOIUrl":"https://doi.org/10.3233/aic-210090","url":null,"abstract":"Analogical proportions are statements of the form “a is to b as c is to d”, denoted a : b : : c : d, that may apply to any type of items a, b, c, d. Analogical proportions, as a building block for analogical reasoning, is then a tool of interest in artificial intelligence. Viewed as a relation between pairs ( a , b ) and ( c , d ), these proportions are supposed to obey three postulates: reflexivity, symmetry, and central permutation (i.e., b and c can be exchanged). The logical modeling of analogical proportions expresses that a and b differ in the same way as c and d, when the four items are represented by vectors encoding Boolean properties. When items are real numbers, numerical proportions – arithmetic and geometric proportions – can be considered as prototypical examples of analogical proportions. Taking inspiration of an old practice where numerical proportions were handled in a vectorial way and where sequences of numerical proportions of the form x 1 : x 2 : ⋯ : x n : : y 1 : y 2 : ⋯ : y n were in use, we emphasize a vectorial treatment of Boolean analogical proportions and we propose a Boolean logic counterpart to such sequences. This provides a linear algebra calculus of analogical inference and acknowledges the fact that analogical proportions should not be considered in isolation. Moreover, this also leads us to reconsider the postulates underlying analogical proportions (since central permutation makes no sense when n ⩾ 3) and then to formalize a weak form of analogical proportion which no longer obeys the central permutation postulate inherited from numerical proportions. But these weak proportions may still be combined in multiple weak analogical proportions.","PeriodicalId":50835,"journal":{"name":"AI Communications","volume":"1992 1","pages":"211-228"},"PeriodicalIF":0.8,"publicationDate":"2021-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89013405","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}

引用次数: 3

A new stochastic gradient descent possibilistic clustering algorithm 一种新的随机梯度下降可能性聚类算法

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-10-18 DOI: 10.3233/aic-210125

A. Koutsimpela, K. Koutroumbas

{"title":"A new stochastic gradient descent possibilistic clustering algorithm","authors":"A. Koutsimpela, K. Koutroumbas","doi":"10.3233/aic-210125","DOIUrl":"https://doi.org/10.3233/aic-210125","url":null,"abstract":"Several well known clustering algorithms have their own online counterparts, in order to deal effectively with the big data issue, as well as with the case where the data become available in a streaming fashion. However, very few of them follow the stochastic gradient descent philosophy, despite the fact that the latter enjoys certain practical advantages (such as the possibility of (a) running faster than their batch processing counterparts and (b) escaping from local minima of the associated cost function), while, in addition, strong theoretical convergence results have been established for it. In this paper a novel stochastic gradient descent possibilistic clustering algorithm, called O- PCM 2 is introduced. The algorithm is presented in detail and it is rigorously proved that the gradient of the associated cost function tends to zero in the L 2 sense, based on general convergence results established for the family of the stochastic gradient descent algorithms. Furthermore, an additional discussion is provided on the nature of the points where the algorithm may converge. Finally, the performance of the proposed algorithm is tested against other related algorithms, on the basis of both synthetic and real data sets.","PeriodicalId":50835,"journal":{"name":"AI Communications","volume":"30 1","pages":"47-64"},"PeriodicalIF":0.8,"publicationDate":"2021-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85440793","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}

引用次数: 4

Deterministic policies based on maximum regrets in MDPs with imprecise rewards 在奖励不精确的mdp中，基于最大遗憾的确定性策略

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-09-20 DOI: 10.3233/aic-190632

Pegah Alizadeh, Emiliano Traversi, A. Osmani

引用次数: 0

An efficient glomerular object locator for renal whole slide images using proposal-free network and dynamic scale evaluation method 基于无提议网络和动态尺度评价方法的肾小球目标定位器

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-08-26 DOI: 10.3233/aic-210073

Xueyu Liu, Ming Li, Yongfei Wu, Yilin Chen, Fang Hao, Daoxiang Zhou, Chen Wang, Chuan-lian Ma, Guangze Shi, Xiaoshuang Zhou

{"title":"An efficient glomerular object locator for renal whole slide images using proposal-free network and dynamic scale evaluation method","authors":"Xueyu Liu, Ming Li, Yongfei Wu, Yilin Chen, Fang Hao, Daoxiang Zhou, Chen Wang, Chuan-lian Ma, Guangze Shi, Xiaoshuang Zhou","doi":"10.3233/aic-210073","DOIUrl":"https://doi.org/10.3233/aic-210073","url":null,"abstract":"In the diagnosis of chronic kidney disease, glomerulus as the blood filter provides important information for an accurate disease diagnosis. Thus automatic localization of the glomeruli is the necessary groundwork for future auxiliary kidney disease diagnosis, such as glomerular classification and area measurement. In this paper, we propose an efficient glomerular object locator in kidney whole slide image(WSI) based on proposal-free network and dynamic scale evaluation method. In the training phase, we construct an intensive proposal-free network which can learn efficiently the fine-grained features of the glomerulus. In the evaluation phase, a dynamic scale evaluation method is utilized to help the well-trained model find the most appropriate evaluation scale for each high-resolution WSI. We collect and digitalize 1204 renal biopsy microscope slides containing more than 41000 annotated glomeruli, which is the largest number of dataset to our best knowledge. We validate the each component of the proposed locator via the ablation study. Experimental results confirm that the proposed locator outperforms recently proposed approaches and pathologists by comparing F 1 and run time in localizing glomeruli from WSIs at a resolution of 0.25 μm/pixel and thus achieves state-of-the-art performance. Particularly, the proposed locator can be embedded into the renal intelligent auxiliary diagnosis system for renal clinical diagnosis by localizing glomeruli in high-resolution WSIs effectively.","PeriodicalId":50835,"journal":{"name":"AI Communications","volume":"65 1","pages":"245-258"},"PeriodicalIF":0.8,"publicationDate":"2021-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77486203","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}

引用次数: 2

Neuro-Symbolic Artificial Intelligence: Current Trends 神经符号人工智能:当前趋势

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-05-11 DOI: 10.3233/aic-210084

Md Kamruzzaman Sarker, Lu Zhou, Aaron Eberhart, P. Hitzler

引用次数: 58

Agents in Traffic and Transportation (ATT 2020) 交通运输代理人(ATT 2020)

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-02-15 DOI: 10.3233/aic-201640

Marin Lujak, Ivana Dusparic, Franziska Klügl-Frohnmeyer, G. Vizzari

引用次数: 1

Policy adaptation for vehicle routing 车辆路线的策略适应

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-02-15 DOI: 10.3233/aic-201577

T. Cazenave, J. Lucas, T. Triboulet, Hyoseok Kim

引用次数: 9

Safety perception and pedestrian dynamics: Experimental results towards affective agents modeling 安全感知与行人动力学:情感主体建模的实验结果

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-01-01 DOI: 10.3233/AIC-201576

F. Gasparini, Marta Giltri, S. Bandini

{"title":"Safety perception and pedestrian dynamics: Experimental results towards affective agents modeling","authors":"F. Gasparini, Marta Giltri, S. Bandini","doi":"10.3233/AIC-201576","DOIUrl":"https://doi.org/10.3233/AIC-201576","url":null,"abstract":"The modeling of a new generation of agent-based simulation systems supporting pedestrian and crowd management taking into account affective states represents a new research frontier. Pedestrian behaviour involves human perception processes, based on subjective and psychological aspects. Following the concept of pedestrian environmental awareness, each walker adapts his/her crossing behaviour according to environmental conditions and his/her perception of safety. Different pedestrian behaviours can be related to subjective mobility and readiness to respond, and these factors are strongly dependent on the subjective interaction with the environment. Having additional inputs about pedestrian behaviour related to their perception processes could be useful in order to develop a more representative pedestrian dynamic model. In particular, the subjective perception of the safeness of crossing should be taken into consideration. In order to focus on the pedestrians’ perception of safe road crossing and walking, an experiment in an uncontrolled urban scenario has been carried out. Besides more conventional self-assessment questionnaires, physiological responses have been considered to evaluate the affective state of pedestrians during the interaction with the urban environment. Results from the analysis of the collected data show that physiological responses are reliable indicators of safety perception while road crossing and interacting with real urban environment, suggesting the design of agent-based models for pedestrian dynamics simulations taking in account the representation of affective states.","PeriodicalId":50835,"journal":{"name":"AI Communications","volume":"2020 1","pages":"5-19"},"PeriodicalIF":0.8,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86918536","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}

引用次数: 3

Agriculture fleet vehicle routing: A decentralised and dynamic problem 农业车队路线:一个分散的动态问题

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-01-01 DOI: 10.3233/aic-201581

Marin Lujak, E. Sklar, F. Semet

{"title":"Agriculture fleet vehicle routing: A decentralised and dynamic problem","authors":"Marin Lujak, E. Sklar, F. Semet","doi":"10.3233/aic-201581","DOIUrl":"https://doi.org/10.3233/aic-201581","url":null,"abstract":"To date, the research on agriculture vehicles in general and Agriculture Mobile Robots (AMRs) in particular has focused on a single vehicle (robot) and its agriculture-specific capabilities. Very little work has explored the coordination of fleets of such vehicles in the daily execution of farming tasks. This is especially the case when considering overall fleet performance, its efficiency and scalability in the context of highly automated agriculture vehicles that perform tasks throughout multiple fields potentially owned by different farmers and/or enterprises. The potential impact of automating AMR fleet coordination on commercial agriculture is immense. Major conglomerates with large and heterogeneous fleets of agriculture vehicles could operate on huge land areas without human operators to effect precision farming. In this paper, we propose the Agriculture Fleet Vehicle Routing Problem (AF-VRP) which, to the best of our knowledge, differs from any other version of the Vehicle Routing Problem studied so far. We focus on the dynamic and decentralised version of this problem applicable in environments involving multiple agriculture machinery and farm owners where concepts of fairness and equity must be considered. Such a problem combines three related problems: the dynamic assignment problem, the dynamic 3-index assignment problem and the capacitated arc routing problem. We review the state-of-the-art and categorise solution approaches as centralised, distributed and decentralised, based on the underlining decision-making context. Finally, we discuss open challenges in applying distributed and decentralised coordination approaches to this problem.","PeriodicalId":50835,"journal":{"name":"AI Communications","volume":"18 1","pages":"55-71"},"PeriodicalIF":0.8,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83291653","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}

引用次数: 5

Reinforcement learning vs. rule-based adaptive traffic signal control: A Fourier basis linear function approximation for traffic signal control 强化学习与基于规则的自适应交通信号控制:交通信号控制的傅里叶基线性函数逼近

IF 0.8 4区计算机科学

AI Communications Pub Date : 2021-01-01 DOI: 10.3233/aic-201580

Theresa Ziemke, L. N. Alegre, A. Bazzan

引用次数: 3