Pub Date : 2022-10-18DOI: 10.1016/j.procs.2022.09.330
Davit Gogolashvili, B. Kozyrskiy, M. Filippone
{"title":"Locally Smoothed Gaussian Process Regression","authors":"Davit Gogolashvili, B. Kozyrskiy, M. Filippone","doi":"10.1016/j.procs.2022.09.330","DOIUrl":"https://doi.org/10.1016/j.procs.2022.09.330","url":null,"abstract":"","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-12DOI: 10.48550/arXiv.2209.05282
Yosra Hajjaji, W. Boulila, I. Farah
Over the past few years, total financial investment in the agricultural sector has increased substantially. Palm tree is important for many countries' economies, particularly in northern Africa and the Middle East. Monitoring in terms of detection and counting palm trees provides useful information for various stakeholders; it helps in yield estimation and examination to ensure better crop quality and prevent pests, diseases, better irrigation, and other potential threats. Despite their importance, this information is still challenging to obtain. This study systematically reviews research articles between 2011 and 2021 on artificial intelligence (AI) technology for smart palm tree detection. A systematic review (SR) was performed using the PRISMA approach based on a four-stage selection process. Twenty-two articles were included for the synthesis activity reached from the search strategy alongside the inclusion criteria in order to answer to two main research questions. The study's findings reveal patterns, relationships, networks, and trends in applying artificial intelligence in palm tree detection over the last decade. Despite the good results in most of the studies, the effective and efficient management of large-scale palm plantations is still a challenge. In addition, countries whose economies strongly related to intelligent palm services, especially in North Africa, should give more attention to this kind of study. The results of this research could benefit both the research community and stakeholders.
{"title":"Leveraging Artificial Intelligence Techniques for Smart Palm Tree Detection: A Decade Systematic Review","authors":"Yosra Hajjaji, W. Boulila, I. Farah","doi":"10.48550/arXiv.2209.05282","DOIUrl":"https://doi.org/10.48550/arXiv.2209.05282","url":null,"abstract":"Over the past few years, total financial investment in the agricultural sector has increased substantially. Palm tree is important for many countries' economies, particularly in northern Africa and the Middle East. Monitoring in terms of detection and counting palm trees provides useful information for various stakeholders; it helps in yield estimation and examination to ensure better crop quality and prevent pests, diseases, better irrigation, and other potential threats. Despite their importance, this information is still challenging to obtain. This study systematically reviews research articles between 2011 and 2021 on artificial intelligence (AI) technology for smart palm tree detection. A systematic review (SR) was performed using the PRISMA approach based on a four-stage selection process. Twenty-two articles were included for the synthesis activity reached from the search strategy alongside the inclusion criteria in order to answer to two main research questions. The study's findings reveal patterns, relationships, networks, and trends in applying artificial intelligence in palm tree detection over the last decade. Despite the good results in most of the studies, the effective and efficient management of large-scale palm plantations is still a challenge. In addition, countries whose economies strongly related to intelligent palm services, especially in North Africa, should give more attention to this kind of study. The results of this research could benefit both the research community and stakeholders.","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134504512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-06DOI: 10.48550/arXiv.2208.02334
N. Sahlab, Hesham Kahoul, N. Jazdi, M. Weyrich
Systematic Literature Reviews aim at investigating current approaches to conclude a research gap or determine a futuristic approach. They represent a significant part of a research activity, from which new concepts stem. However, with the massive availability of publications at a rapid growing rate, especially digitally, it becomes challenging to efficiently screen and assess relevant publications. Another challenge is the continuous assessment of related work over a long period of time and the consequent need for a continuous update, which can be a time-consuming task. Knowledge graphs model entities in a connected manner and enable new insights using different reasoning and analysis methods. The objective of this work is to present an approach to partially automate the conduction of a Systematic Literature Review as well as classify and visualize the results as a knowledge graph. The designed software prototype was used for the conduction of a review on context-awareness in automation systems with considerably accurate results compared to a manual conduction.
{"title":"A Knowledge Graph-Based Method for Automating Systematic Literature Reviews","authors":"N. Sahlab, Hesham Kahoul, N. Jazdi, M. Weyrich","doi":"10.48550/arXiv.2208.02334","DOIUrl":"https://doi.org/10.48550/arXiv.2208.02334","url":null,"abstract":"Systematic Literature Reviews aim at investigating current approaches to conclude a research gap or determine a futuristic approach. They represent a significant part of a research activity, from which new concepts stem. However, with the massive availability of publications at a rapid growing rate, especially digitally, it becomes challenging to efficiently screen and assess relevant publications. Another challenge is the continuous assessment of related work over a long period of time and the consequent need for a continuous update, which can be a time-consuming task. Knowledge graphs model entities in a connected manner and enable new insights using different reasoning and analysis methods. The objective of this work is to present an approach to partially automate the conduction of a Systematic Literature Review as well as classify and visualize the results as a knowledge graph. The designed software prototype was used for the conduction of a review on context-awareness in automation systems with considerably accurate results compared to a manual conduction.","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132267284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-06DOI: 10.48550/arXiv.2207.02995
N. Sahlab, N. Jazdi, M. Weyrich
Automation systems are increasingly being used in dynamic and various operating conditions. With higher flexibility demands, they need to promptly respond to surrounding dynamic changes by adapting their operation. Context information collected during runtime can be useful to enhance the system’s adaptability. Context-aware systems represent a design paradigm for modeling and applying context in various applications such as decision-making. In order to address context for automation systems, a state-of-the-art assessment of existing approaches is necessary. Thus, the objective of this work is to provide an overview on the design and applications of context and context models for automation systems. A systematic literature review has been conducted, the results of which are represented as a knowledge graph.
{"title":"An Overview on Designs and Applications of Context-Aware Automation Systems","authors":"N. Sahlab, N. Jazdi, M. Weyrich","doi":"10.48550/arXiv.2207.02995","DOIUrl":"https://doi.org/10.48550/arXiv.2207.02995","url":null,"abstract":"Automation systems are increasingly being used in dynamic and various operating conditions. With higher flexibility demands, they need to promptly respond to surrounding dynamic changes by adapting their operation. Context information collected during runtime can be useful to enhance the system’s adaptability. Context-aware systems represent a design paradigm for modeling and applying context in various applications such as decision-making. In order to address context for automation systems, a state-of-the-art assessment of existing approaches is necessary. Thus, the objective of this work is to provide an overview on the design and applications of context and context models for automation systems. A systematic literature review has been conducted, the results of which are represented as a knowledge graph.","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115409476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-25DOI: 10.48550/arXiv.2205.12504
Yukita Fujitani, Tomoki Yamauchi, Yuki Miyashita, T. Sugawara
This paper proposes a control method for the multi-agent pickup and delivery problem (MAPD problem) by extending the priority inheritance with backtracking (PIBT) method to make it applicable to more general environments. PIBT is an effective algorithm that introduces a priority to each agent, and at each timestep, the agents, in descending order of priority, decide their next neighboring locations in the next timestep through communications only with the local agents. Unfortunately, PIBT is only applicable to environments that are modeled as a bi-connected area, and if it contains dead-ends, such as tree-shaped paths, PIBT may cause deadlocks. However, in the real-world environment, there are many dead-end paths to locations such as the shelves where materials are stored as well as loading/unloading locations to transportation trucks. Our proposed method enables MAPD tasks to be performed in environments with some tree-shaped paths without deadlock while preserving the PIBT feature; it does this by allowing the agents to have temporary priorities and restricting agents' movements in the trees. First, we demonstrate that agents can always reach their delivery without deadlock. Our experiments indicate that the proposed method is very efficient, even in environments where PIBT is not applicable, by comparing them with those obtained using the well-known token passing method as a baseline.
{"title":"Deadlock-Free Method for Multi-Agent Pickup and Delivery Problem Using Priority Inheritance with Temporary Priority","authors":"Yukita Fujitani, Tomoki Yamauchi, Yuki Miyashita, T. Sugawara","doi":"10.48550/arXiv.2205.12504","DOIUrl":"https://doi.org/10.48550/arXiv.2205.12504","url":null,"abstract":"This paper proposes a control method for the multi-agent pickup and delivery problem (MAPD problem) by extending the priority inheritance with backtracking (PIBT) method to make it applicable to more general environments. PIBT is an effective algorithm that introduces a priority to each agent, and at each timestep, the agents, in descending order of priority, decide their next neighboring locations in the next timestep through communications only with the local agents. Unfortunately, PIBT is only applicable to environments that are modeled as a bi-connected area, and if it contains dead-ends, such as tree-shaped paths, PIBT may cause deadlocks. However, in the real-world environment, there are many dead-end paths to locations such as the shelves where materials are stored as well as loading/unloading locations to transportation trucks. Our proposed method enables MAPD tasks to be performed in environments with some tree-shaped paths without deadlock while preserving the PIBT feature; it does this by allowing the agents to have temporary priorities and restricting agents' movements in the trees. First, we demonstrate that agents can always reach their delivery without deadlock. Our experiments indicate that the proposed method is very efficient, even in environments where PIBT is not applicable, by comparing them with those obtained using the well-known token passing method as a baseline.","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133107772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-12DOI: 10.48550/arXiv.2204.05667
Jonas Wacker, M. Filippone
A fundamental drawback of kernel-based statistical models is their limited scalability to large data sets, which requires resorting to approximations. In this work, we focus on the popular Gaussian kernel and on techniques to linearize kernel-based models by means of random feature approximations. In particular, we do so by studying a less explored random feature approximation based on Maclaurin expansions and polynomial sketches. We show that such approaches yield poor results when modelling high-frequency data, and we propose a novel localization scheme that improves kernel approximations and downstream performance significantly in this regime. We demonstrate these gains on a number of experiments involving the application of Gaussian process regression to synthetic and real-world data of di ff erent data sizes and dimensions.
{"title":"Local Random Feature Approximations of the Gaussian Kernel","authors":"Jonas Wacker, M. Filippone","doi":"10.48550/arXiv.2204.05667","DOIUrl":"https://doi.org/10.48550/arXiv.2204.05667","url":null,"abstract":"A fundamental drawback of kernel-based statistical models is their limited scalability to large data sets, which requires resorting to approximations. In this work, we focus on the popular Gaussian kernel and on techniques to linearize kernel-based models by means of random feature approximations. In particular, we do so by studying a less explored random feature approximation based on Maclaurin expansions and polynomial sketches. We show that such approaches yield poor results when modelling high-frequency data, and we propose a novel localization scheme that improves kernel approximations and downstream performance significantly in this regime. We demonstrate these gains on a number of experiments involving the application of Gaussian process regression to synthetic and real-world data of di ff erent data sizes and dimensions.","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126656184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-11DOI: 10.48550/arXiv.2203.06221
Jivr'i Mazurek, K. Kułakowski, Sebastian Ernst, Michal Strada
This paper examines the differences in ordinal rankings obtained from a pairwise comparison matrix using the eigenvalue method and the geometric mean method. First, we introduce several propositions on the (dis)similarity of both rankings con- cerning the matrix size and its inconsistency expressed by the Koczkodaj’s inconsistency index. Further on, we examine the relationship between differences in both rankings and Kendall’s rank correlation coefficient τ and Spearman’s rank coef-ficient ρ . Apart from theoretical results, intuitive numerical examples and Monte Carlo simulations are also provided.
{"title":"Some Notes on the Similarity of Priority Vectors Derived by the Eigenvalue Method and the Geometric Mean Method","authors":"Jivr'i Mazurek, K. Kułakowski, Sebastian Ernst, Michal Strada","doi":"10.48550/arXiv.2203.06221","DOIUrl":"https://doi.org/10.48550/arXiv.2203.06221","url":null,"abstract":"This paper examines the differences in ordinal rankings obtained from a pairwise comparison matrix using the eigenvalue method and the geometric mean method. First, we introduce several propositions on the (dis)similarity of both rankings con- cerning the matrix size and its inconsistency expressed by the Koczkodaj’s inconsistency index. Further on, we examine the relationship between differences in both rankings and Kendall’s rank correlation coefficient τ and Spearman’s rank coef-ficient ρ . Apart from theoretical results, intuitive numerical examples and Monte Carlo simulations are also provided.","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1016/j.procs.2021.09.123
M. B. Dehkordi, A. Zaraki, R. Setchi
{"title":"Optimal Feature Set for Smartphone-based Activity Recognition","authors":"M. B. Dehkordi, A. Zaraki, R. Setchi","doi":"10.1016/j.procs.2021.09.123","DOIUrl":"https://doi.org/10.1016/j.procs.2021.09.123","url":null,"abstract":"","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133537143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1016/j.procs.2021.09.122
M. B. Dehkordi, R. Mansy, A. Zaraki, Arpit Singh, R. Setchi
{"title":"Explainability in Human-Robot Teaming","authors":"M. B. Dehkordi, R. Mansy, A. Zaraki, Arpit Singh, R. Setchi","doi":"10.1016/j.procs.2021.09.122","DOIUrl":"https://doi.org/10.1016/j.procs.2021.09.122","url":null,"abstract":"","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127854569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-13DOI: 10.1016/j.procs.2021.09.182
M. B. Amor, Julian Stier, M. Granitzer
{"title":"Correlation Analysis between the Robustness of Sparse Neural Networks and their Random Hidden Structural Priors","authors":"M. B. Amor, Julian Stier, M. Granitzer","doi":"10.1016/j.procs.2021.09.182","DOIUrl":"https://doi.org/10.1016/j.procs.2021.09.182","url":null,"abstract":"","PeriodicalId":306329,"journal":{"name":"International Conference on Knowledge-Based Intelligent Information & Engineering Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133917553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：