{"title":"Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms","authors":"Alejandro Arbelaez, C. Truchet, B. O’Sullivan","doi":"10.1109/ICTAI.2016.0105","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0105","url":null,"abstract":"In cloud systems, computation time can be rented by the hour and for a given number of processors. Thus, accurate predictions of the behaviour of both sequential and parallel algorithms has become an important issue, in particular in the case of costly methods such as randomized combinatorial optimization tools. In this work, our objective is to use machine learning to predict performance of sequential and parallel local search algorithms. In addition to classical features of the instances used by other machine learning tools, we consider data on the sequential runtime distributions of a local search method. This allows us to predict with a high accuracy the parallel computation time of a large class of instances, by learning the behaviour of the sequential version of the algorithm on a small number of instances. Experiments with three solvers on SAT and TSP instances indicate that our method works well, with a correlation coefficient of up to 0.85 for SAT instances and up to 0.95 for TSP instances.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134259769","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}
Abdeldjalil Ramoul, D. Pellier, H. Fiorino, S. Pesty
{"title":"HTN Planning Approach Using Fully Instantiated Problems","authors":"Abdeldjalil Ramoul, D. Pellier, H. Fiorino, S. Pesty","doi":"10.1109/ICTAI.2016.0027","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0027","url":null,"abstract":"Many planning techniques have been developed to allow autonomous systems to act and make decisions based on their perceptions of the environment. Among these techniques, HTN (Hierarchical Task Network) planning is one of the most used in practice. Unlike classical approaches of planning. HTN operates by decomposing task into sub-tasks until each of these sub-tasks can be achieved an action. This hierarchical representation provide a richer representation of planning problems and allows to better guide the plan search and provides more knowledge to the underlying algorithms. In this paper, we propose a new approach of HTN planning in which, as in conventional planning, we instantiate all planning operators before starting the search process. This approach has proven its effectiveness in classical planning and is necessary for the development of effective heuristics and encoding planning problems in other formalism such as CSP or SAT. The instantiation is actually used by most modern planners but has never been applied in an HTN based planning framework. We present in this article a generic instantiation algorithm which implements many simplification techniques to reduce the process complexity inspired from those used in classical planning. Finally we present some results obtained from an experimentation on a range of problems used in the international planning competitions with a modified version of SHOP planner using fully instantiated problems.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198404","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}
{"title":"Enhancing Classification of Ecological Momentary Assessment Data Using Bagging and Boosting","authors":"Gerasimos Spanakis, Gerhard Weiss, A. Roefs","doi":"10.1109/ICTAI.2016.0066","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0066","url":null,"abstract":"Ecological Momentary Assessment (EMA) techniques gain more ground in studies and data collection among different disciplines. Decision tree algorithms and their ensemble variants are widely used for classifying this type of data, since they are easy to use and provide satisfactory results. However, most of these algorithms do not take into account the multiple levels (per-subject, per-day, etc.) in which EMA data are organized. In this paper we explore how the EMA data organization can be taken into account when dealing with decision trees and specifically how a combination of bagging and boosting can be utilized in a classification task. A new algorithm called BBT (standing for Bagged Boosted Trees) is proposed which is enhanced by an over/under sampling method leading to better estimates of the conditional class probability function. BBT's necessity and effects are demonstrated using both simulated datasets and real-world EMA data collected using a mobile application following the eating behavior of 100 people. Experimental analysis shows that BBT leads to clear improvements with respect to prediction error reduction and conditional class probability estimation.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123950698","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}
{"title":"Cooperative Multiagent Patrolling for Detecting Multiple Illegal Actions under Uncertainty","authors":"A. Beynier","doi":"10.1109/ICTAI.2016.0013","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0013","url":null,"abstract":"Multiagent patrolling in adversarial domains has been widely studied in recent years. However, little attention has been paid to cooperation issues between patrolling agents. Moreover, most existing works focus on one-shot attacks and assume full rationality of the adversaries. Nonetheless, when patrolling frontiers, detecting illegal fishing or poaching, security forces face several adversaries with limited observability and rationality, that perform multiple illegal actions spread in time and space. In this paper, we develop a cooperative approach to improve defenders efficiency in such settings. We propose a new formalization of multiagent patrolling problems allowing for effective cooperation between the defenders. Our work accounts for uncertainty on action outcomes and partial observability of the system. Unlike existing security games, a generic model of the opponents is considered thus handling limited observability and bounded rationality of the adversaries. We then describe a learning mechanism allowing the defenders to take advantage of their observations about the adversaries and to compute cooperative patrolling strategies consequently.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129380098","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}
Crícia Z. Felício, K. V. R. Paixão, C. Barcelos, P. Preux
{"title":"Preference-Like Score to Cope with Cold-Start User in Recommender Systems","authors":"Crícia Z. Felício, K. V. R. Paixão, C. Barcelos, P. Preux","doi":"10.1109/ICTAI.2016.0020","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0020","url":null,"abstract":"In recent years, there has been an explosion of social recommender systems (SRS) research. However, the dominant trend of these studies has been towards designing new prediction models. The typical approach is to use social information to build those models for each new user. Due to the inherent complexity of this prediction process, for full cold-start user in particular, the performance of most SRS fall a great deal. We, rather, propose that new users are best served by models already built in system. Selecting a prediction model from a set of strong linked users might offer better results than building a personalized model for full cold-start users. We contribute to this line of work comparing several matrix factorization based SRS under full cold-start user scenario, and proposing a general model selection approach, called ToSocialRec, that leverages existing recommendation models to offer items for new users. Our framework is not only able to handle several social network connection weight metrics, but any metric that can be correlated with preference similarity among users, named here as Preference-like score. We perform experiments on real life datasets that show this technique is as efficient or more than current state-of-the-art techniques for cold-start user. Our framework has also been designed to be easily deployed and leveraged by developers to help create a new wave of SRS.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122478262","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}
Aymen Gammoudi, Adel Benzina, M. Khalgui, D. Chillet
{"title":"Real-Time Scheduling of Reconfigurable Battery-Powered Multi-Core Platforms","authors":"Aymen Gammoudi, Adel Benzina, M. Khalgui, D. Chillet","doi":"10.1109/ICTAI.2016.0028","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0028","url":null,"abstract":"This paper deals with the real-time scheduling in a reconfigurable multi-core platform powered by a rechargeable battery. A reconfiguration scenario is defined as an operation that allows the addition-removal-modification of tasks which may result in timing unfeasibility. Such a system may face several scenarios: i) increased power consumption that, in the worst case, may surpass the available energy budget, ii) increased computing demand, which may lead to the violation of real-time constraints, and iii) increased memory demand, potentially exceeding the provided memory capacity. To prevent these problems during the execution, a new scheduling strategy is necessary. The proposal is based on the assignment of tasks to different processor cores to satisfy these constraints simultaneously after any reconfiguration scenario. The effectiveness and performance of the designed approach are evaluated through simulation studies. An intelligent tool named Reconf-Pack is developed in our research laboratory to support this new proposed approach and to simulate it over randomly generated tasks.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125303136","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}
{"title":"Incremental and Adaptive Multi-Robot Mapping for Human Scene Observation","authors":"Jonathan Cohen, L. Matignon, Olivier Simonin","doi":"10.1109/ICTAI.2016.0108","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0108","url":null,"abstract":"This paper aims to use a fleet of mobile robots, each embedding a camera, to optimize the observation of a human dynamic scene. The scene is defined as a sequence of activities, performed by a person in a same place. Mobile robots have to cooperate to find a spatial configuration around the scene that maximizes the joint observation of the human pose skeleton. It is assumed that the robots can communicate but have no map of the environment and no external localisation. This paper presents a concentric navigation topology allowing to keep easily each robot camera towards the scene. This topology is combined with an incremental mapping of the environment in order to limit the complexity of the exploration state space. We also introduce the marginal contribution of each robot observation, to facilitate stability in the search, while the exploration is guided by a meta-heuristics. We developped a simulator that uses skeleton data from real human pose captures. It allows to compare the variants of the approach and to show its features such as adaptation to the dynamic of the scene and robustness to the noise in the observations.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125396356","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}
{"title":"A First Step toward Recommendations Based on the Memory of Users","authors":"F. Marchal, Sylvain Castagnos, A. Boyer","doi":"10.1109/ICTAI.2016.0019","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0019","url":null,"abstract":"Most of recommender systems build their predictions by analysing the preferences of users. However, there are many situations, such as in intelligent tutoring systems, where recommendations of pedagogical resources should rather be based on their memory. So as to infer in real time and with low involvement what has been memorized by users, we highlight in the paper the link between gaze features and visual memory. We designed a user experiment where different subjects had to remember a large set of images. In the meantime, we collected about 19,000 fixation points. Among other metrics, our results show a strong correlation between the relative path angles and the memorized items. It is thus possible to predict the users' memory status by analyzing their gaze data while interacting with the system, so as to provide recommendations that fits their learning curve.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123473899","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}
S. Bharati, Soumyaroop Nandi, Yuanwei Wu, Yao Sui, Guanghui Wang
{"title":"Fast and Robust Object Tracking with Adaptive Detection","authors":"S. Bharati, Soumyaroop Nandi, Yuanwei Wu, Yao Sui, Guanghui Wang","doi":"10.1109/ICTAI.2016.0112","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0112","url":null,"abstract":"Object detection and tracking is an important research topic in computer vision with numerous practical applications. Although great progress has been made both in object detection and tracking, it is still a big challenge in automatic real-time applications. In this paper, a fast and robust approach is proposed by integrating an adaptive object detection technique within a kernelized correlation filter (KCF) framework. The KCF tracker is automatically initialized via salient object detection and localization. An adaptive object detection strategy is proposed to refine the location and boundary of the object when the tracking confidence value is below a certain threshold. In addition, a reliable post-processing technique is designed to accurately localize the object from a saliency map. Extensive quantitative and qualitative experiments on the challenging datasets have been performed to verify the proposed approach, which also demonstrates that our approach greatly outperforms the stateof-the-art methods in terms of tracking speed and accuracy.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116677973","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}
{"title":"Link Prediction in Social Networks with Edge Aging","authors":"Ricky Laishram, K. Mehrotra, C. Mohan","doi":"10.1109/ICTAI.2016.0098","DOIUrl":"https://doi.org/10.1109/ICTAI.2016.0098","url":null,"abstract":"In social networks that change with time, an important problem is the prediction of new links that may be formed in the future. Existing works on link prediction have focused only on networks where links are permanent, an assumption that is not valid in many real world social networks. In many real world networks, in addition to new links being created, existing links also get removed. In this paper, we extend existing link prediction methods and apply a supervised learning algorithm to networks with non-permanent links. The results we obtain on Twitter @-mention networks show that our method performs very well in such networks.","PeriodicalId":245697,"journal":{"name":"2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121140912","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}