{"title":"ReSkill: Relative Skill-Level Calculation System","authors":"C. Kiourt, G. Pavlidis, Dimitris Kalles","doi":"10.1145/2903220.2903224","DOIUrl":"https://doi.org/10.1145/2903220.2903224","url":null,"abstract":"The introduction of social dynamics in multi-agent environments with synthetic agents is an effective way to simulate real-life conditions. Nowadays there is a trend towards the integration of social dynamics in multi-agent virtual environments to better assess the performance of synthetic agents in competitive situations. This assessment is usually carried out using human rating methods, such as Elo and Glicko, two of the most widespread methods, primarily used for chess. This paper introduces a web-based system that was developed to provide a way for everyone to be able to use these well-known human rating systems in various multi-agent rating experiments. A large-scale experiment has been conducted and the results have been used to present and prove the functionality of the developed system.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129192753","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}
Aggelos Gaitanidis, V. Vassiliadis, Christos Kyriklidis, G. Dounias
{"title":"Hybrid Evolutionary Algorithms in Resource Leveling Optimization: Application in a Large Real Construction Project of a 50000 DWT Ship","authors":"Aggelos Gaitanidis, V. Vassiliadis, Christos Kyriklidis, G. Dounias","doi":"10.1145/2903220.2903227","DOIUrl":"https://doi.org/10.1145/2903220.2903227","url":null,"abstract":"In this paper, the optimization problem of resource leveling is considered. More specifically, the problem at-hand refers to a very large project, i.e. the construction of a ship, which is comprised of numerous activities. The essence of resource leveling is to allocate the project's resource in an efficient way, and in the same time maintain the restrictions imposed by the activities' correlations. Ship construction constitutes a domain of high complexity due to the large number of activities involved (more than a thousand). In order to tackle with this kind of problem, evolutionary and hybrid evolutionary techniques are implemented. These algorithms are based on the main genetic algorithm's principles with the addition of some local search elements, so as to boost performance. Results indicate that hybrid schemes manage to perform better resource allocation, based on the objectives at-hand.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460007","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}
Ioannis Kavakiotis, A. Triantafyllidis, Grigorios Tsoumakas, I. Vlahavas
{"title":"Ensemble Feature Selection using Rank Aggregation Methods for Population Genomic Data","authors":"Ioannis Kavakiotis, A. Triantafyllidis, Grigorios Tsoumakas, I. Vlahavas","doi":"10.1145/2903220.2903233","DOIUrl":"https://doi.org/10.1145/2903220.2903233","url":null,"abstract":"Single Nucleotide Polymorphisms (SNPs) constitute important genetic markers with numerous medical and biological applications of high scientific and economic interest. SNP datasets are typically high dimensional, containing up to million features. Reasons originating from both biology and machine learning, dictate to perform feature selection which is mainly performed after feature evaluation. In this paper we present methods for SNP evaluation and eventually selection, based on combining results obtained from established genetic marker evaluation methods originating from the field of population genetics. To achieve this we have formulated the feature selection task as a ranking aggregation problem, which is a classical problem in social choice and voting theory.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115755218","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":"Efficient MapReduce Kernel k-Means for Big Data Clustering","authors":"N. Tsapanos, A. Tefas, N. Nikolaidis, I. Pitas","doi":"10.1145/2903220.2903255","DOIUrl":"https://doi.org/10.1145/2903220.2903255","url":null,"abstract":"Data clustering is an unsupervised learning task that has found many applications in various scientific fields. The goal is to find subgroups of closely related data samples (clusters) in a set of unlabeled data. A classic clustering algorithm is the so-called k-Means. It is very popular, however, it is also unable to handle cases in which the clusters are not linearly separable. Kernel k-Means is a state of the art clustering algorithm, which employs the kernel trick, in order to perform clustering on a higher dimensionality space, thus overcoming the limitations of classic k-Means regarding the non linear separability of the input data. It has recently received a distributed implementation, named Trimmed Kernel k-Means, following the MapReduce distributed computing model. In addition to performing the computations in a distributed manner, Trimmed Kernel k-Means also trims the kernel matrix, in order to reduce the memory requirements and improve performance. The trimming of each row of the kernel matrix is achieved by attempting to estimate the cardinality of the cluster that the corresponding sample belongs to, and removing the kernel matrix entries connecting the sample to samples that probably belong to another cluster. The Spark cluster computing framework was used for the distributed implementation. In this paper, we present a distributed clustering scheme that is based on Trimmed Kernel k-Means, which employs subsampling, in order to be able to efficiently perform clustering on an extremely large dataset. The results indicate that the proposed method run much faster than the original Trimmed Kernel k-Means, while still providing clustering performance competitive with other state of the art kernel approaches.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133003523","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":"Short-Term Load Forecasting using a Cluster of Neural Networks for the Greek Energy Market","authors":"Apostolos N. Adamakos, Michalis K. Titsias","doi":"10.1145/2903220.2903222","DOIUrl":"https://doi.org/10.1145/2903220.2903222","url":null,"abstract":"In the context of the liberalization of the Greek Energy Market, load forecasting is essential in various system programming procedures. Short-term load forecasting extends from one to seven days, although in this paper a model is proposed for the next calendar day in step of sixty minutes. The objective is to design and implement a software-based short-term load forecasting model for the Greek interconnected transmission system that will show improved performance compared to previous methods. The proposed model introduces a categorization of the forecasted days along with a dedicated artificial neural network for each category. Appropriate input vectors are selected at the training process for each custom-built network.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132289584","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}
Sotiris Karapostolakis, E. Rigas, Nick Bassiliades, S. Ramchurn
{"title":"EVLib: A Library for the Management of the Electric Vehicles in the Smart Grid","authors":"Sotiris Karapostolakis, E. Rigas, Nick Bassiliades, S. Ramchurn","doi":"10.1145/2903220.2903225","DOIUrl":"https://doi.org/10.1145/2903220.2903225","url":null,"abstract":"EVLib is a Java library for the management and simulation of a number of Electric Vehicle (EV) activities, at a charging station level, within a Smart Grid environment. EVLib aims to solve interoperability issues between a number of Artificial Intelligence (AI)-related techniques already applied in this field. Thus, it provides a simple, yet efficient interface for the management of all major EV-related activities such as the charging and dis-charging of batteries, as well as the battery swapping. Moreover, a large number of parameters, such as the number of chargers, the waiting queues, and the available energy can be easily configured. On top of this, the library supports the simultaneous operation of many EV activities through the efficient use of threads. Finally, the library's efficiency and scalability have been tested in realistic scenarios, while the correctness and safety of the code have been verified using state of the art tools.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134118352","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}
A. Fachantidis, Athanasios Tsiaras, Grigorios Tsoumakas, I. Vlahavas
{"title":"Segmento: An R-based Visualization-rich System for Customer Segmentation and Targeting","authors":"A. Fachantidis, Athanasios Tsiaras, Grigorios Tsoumakas, I. Vlahavas","doi":"10.1145/2903220.2903245","DOIUrl":"https://doi.org/10.1145/2903220.2903245","url":null,"abstract":"Customer segmentation is one of the most efficient and promising tools in a marketer's toolbox. In this paper, we introduce Segmento, an R-based customer segmentation system that uses clustering techniques to discover customer segments and offers tools to design and evaluate marketing campaigns. We present the features and the functionality of the system, as well as some of its unique, state-of-the-art visualizations.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134260876","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":"Piece of Pie Search: Confidently Exploiting Heuristics","authors":"Nikolaos Pothitos, Panagiotis Stamatopoulos","doi":"10.1145/2903220.2903242","DOIUrl":"https://doi.org/10.1145/2903220.2903242","url":null,"abstract":"Search is not a direct path to a solution. While searching for a solution to a problem, heuristics consult us to avoid paths with dead ends, but they are not infallible. Many popular search methodologies \"disobey\" them during critical points of the search. In this work, we found an efficient stochastic methods framework that smoothly combines randomness with normal heuristics. We consider a factor of disobedience to the heuristics and we fine-tune it each time, according to our estimation of heuristic-reliability. We prove mathematically that while the disobedience factor falls, the stochastic methods approximate deterministic methods. Our algebraic evidence is supported by empirical evaluations on real life problems, such as course scheduling and frequency assignment. In this context, we exploit our proposed heuristic-reliability semantics in order to produce a piece of pie search (PoPS) method that can outperform other known constructive search processes in hard optimization problems.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117145713","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}
Eftychia Fotiadou, I. Kapsouras, N. Nikolaidis, A. Tefas
{"title":"A Bag of Words approach for recognition of Greek folk dances","authors":"Eftychia Fotiadou, I. Kapsouras, N. Nikolaidis, A. Tefas","doi":"10.1145/2903220.2903221","DOIUrl":"https://doi.org/10.1145/2903220.2903221","url":null,"abstract":"In this paper we explore the problem of distinguishing Greek folk dances from other kinds of activities, as well as from other dance genres, using video recordings. For this purpose, we adopt dense trajectories descriptors along with a Bag of Words (BoW) model to represent the motion depicted in the videos. Subsequently, a Support Vector Machine (SVM) classifier is used for classification. In order to evaluate the performance and the adequacy of the aforementioned framework for the dance recognition task, we performed experiments for three different classification setups: 1) Greek folk dances vs other activities (including different dance genres), 2) six different dance genres and 3) Greek vs Balkan folk dances. The aforementioned experiments exhibited satisfactory results, with successful recognition rates higher than 89.74%.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115285016","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":"Constraint Programming MapReduce'd","authors":"Nikolaos Pothitos, Panagiotis Stamatopoulos","doi":"10.1145/2903220.2903248","DOIUrl":"https://doi.org/10.1145/2903220.2903248","url":null,"abstract":"While Constraint Programming (CP) aims to explore efficiently large search trees, MapReduce (MR) is a framework that focuses on huge databases and text files. In this work, we try to bridge these two cutting-edge paradigms in order to solve Constraint Satisfaction Problems (CSPs) in distributed and/or parallel environments. We implement a CP system that is responsible to distribute the parts of the serial search tree to the workers in order to explore it. MR is responsible to allocate the physical resources of a cluster and assigns them to the workers. The CP and MR phases interchange and this novel coordination results into significant speedups while solving CSPs. Empirically, our approach is applied on common CSPs, such as N Queens and Number Partitioning.","PeriodicalId":122018,"journal":{"name":"Proceedings of the 9th Hellenic Conference on Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439558","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}