Eleni Tagiou, Y. Kanellopoulos, Christos Aridas, C. Makris
{"title":"A tool supported framework for the assessment of algorithmic accountability","authors":"Eleni Tagiou, Y. Kanellopoulos, Christos Aridas, C. Makris","doi":"10.1109/IISA.2019.8900715","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900715","url":null,"abstract":"Algorithmic decision making is now being used by many organizations and businesses, and in crucial areas that directly affect peoples’ lives. Thus the importance for us to be able to control their decisions and to avoid irreversible errors is rapidly increasing. Evaluating an algorithmic system and the organization that utilizes it in terms of accountability and transparency bears certain challenges. Merely these are the lack of a widely accepted evaluation standard and the tendency of organizations that employ such systems to avoid disclosing any relevant information about them. Our thesis is that the mandate for transparency and accountability should be applicable to both systems and organizations. In this paper we present an evaluation framework regarding the transparency of algorithmic systems by focusing on the way these have been implemented. This framework also evaluates the maturity of the organizations that utilize these systems and their ability to hold them accountable. In order to validate our framework we applied it on a classification algorithm created and utilized by a large financial institution. The main insight for us was that when organizations create their algorithmic systems, accountability and transparency might be indeed recognized as values. However, they are either taken into account at a later stage and from the perspective of control or they are simply neglected. The value of frameworks like the one presented in this paper is that they act as check-lists providing a set of best-practices to organizations in order to cater for accountable algorithmic systems at an early stage of their creation.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134116413","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":"Navigation of inertial forces driven mini-robots using reinforcement learning","authors":"Piyabhum Chaysri, K. Blekas, K. Vlachos","doi":"10.1109/IISA.2019.8900672","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900672","url":null,"abstract":"In this paper we propose a reinforcement learning (RL) framework for the autonomous navigation of a pair of mini-robots that are driven by inertial forces. The inertial forces are provided by two vibration motors on each mini-robot which are controlled by a simple and efficient low-level speed controller. The action of the RL agent is the direction of the velocity of each mini-robot, and it based on the position of each mini-robot, the distance between the mini-robots, and the sign of the distance gradient. Each mini-robot is considered as a moving obstacle to the other that must by avoided. We have introduced a suitable reward function that results into an efficient collaborative RL approach. A simulation environment is created using the ROS framework, that include the dynamic model of the mini-robot and of the vibration motors. Several application scenarios are simulated, and the presented results demonstrate the performance of the proposed framework.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"93 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116695535","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}
Emma Pedersen, Sunil Rao, Sameeksha Katoch, Kristen Jaskie, A. Spanias, C. Tepedelenlioğlu, E. Kyriakides
{"title":"PV Array Fault Detection using Radial Basis Networks","authors":"Emma Pedersen, Sunil Rao, Sameeksha Katoch, Kristen Jaskie, A. Spanias, C. Tepedelenlioğlu, E. Kyriakides","doi":"10.1109/IISA.2019.8900710","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900710","url":null,"abstract":"An increase in grid-connected photovoltaic arrays creates a need for efficient and reliable fault detection. In this paper, machine learning strategies for fault detection are presented. An Artificial Neural Network was studied with the goal of detecting three photovoltaic module conditions. In addition, an unsupervised approach was successfully implemented using the -means clustering algorithm, successfully detecting arc and ground faults. To distinguish and localize additional faults such as shading and soiling, a supervised approach is adopted using a Radial Basis Function Network. A solar array dataset with voltage, current, temperature, and irradiance was examined. This dataset had labeled data with normal conditions and faults due to soiling and shading. A radial basis network was trained to classify faults, resulting in an error rate below 2% on synthetic data with realistic levels of noise.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116246911","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}
J. L. M. Z. Año, Geoffrey A. Solano, John Hernán, R. Francisco
{"title":"WARP: A Workflow-Aware Instructional Platform for Competency-Based Learning","authors":"J. L. M. Z. Año, Geoffrey A. Solano, John Hernán, R. Francisco","doi":"10.1109/IISA.2019.8900784","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900784","url":null,"abstract":"Workflow is the movement of documents and tasks through a business process.Traditionally, workflow technology has been used in applications areas that are clearly procedural and process-oriented such as insurance policy/claim processing, loan request handling, etc. Workflow technology provides a suitable platform to define and manage the coordination of business process activities. Recently, however, competency-based learning (CBL) has been making changes in the educational landscape by allowing a student to take only those modules he needs to. A workflow-aware system is thus necessary to facilitate CBL. This paper discusses WARP, which is a workflow-aware instructional platform for competency-based learning.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126676573","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":"Skip Miner: Towards the Simplification of Spaghetti-like Business Process Models","authors":"Edgar Batista, A. Solanas","doi":"10.1109/IISA.2019.8900713","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900713","url":null,"abstract":"The importance of correctly monitoring business processes within organisations is increasing the interest on process mining techniques, especially process discovery techniques that aim to model the real behaviour of processes from their multiple executions. Notwithstanding, the resulting process models are sometimes extremely complex and lack structure, hence hampering their comprehension. This kind of processes are popularly known as spaghetti processes. With the aim to simplify and bring meaningful structure to spaghetti processes, this article presents Skip Miner, a novel process discovery algorithm implementing a built-in simplification strategy, that attempts to reduce the complexity of process models. For the sake of completeness, the method is evaluated using a real event log encompassing spaghetti-like processes and, it is compared with other simplification techniques available in the literature.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126930471","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}
I. Pikrammenos, Chrristos Lampiris, Panagiotis Tolis, Panagiotis Perakis
{"title":"Emerging multi-functional, personalized secure environments","authors":"I. Pikrammenos, Chrristos Lampiris, Panagiotis Tolis, Panagiotis Perakis","doi":"10.1109/IISA.2019.8900721","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900721","url":null,"abstract":"Secure operational environments are characterized by functional integrity and diversity at the same time, realizing separate spheres of effectiveness. Cooperation of these spheres towards an integrated operational system leaves room for interworking over sphere-specific interfaces and service access points. The interaction among them could overpass the limitations of coupled transactions and their vulnerabilities incorporating a diverse mean of sensitive information handling. This mean could take advantage of the characteristics of Smart Cards, and enhance functionality of the system. A case study of the application of Smart Cards in a WiFi system in order to enhance its operation and leverage its security vulnerability is presented.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124105121","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":"Clique-finding Tool for Detecting Approximate Gene Clusters","authors":"Bianca Camille Silmaro, Geoffrey A. Solano","doi":"10.1109/IISA.2019.8900766","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900766","url":null,"abstract":"Defining relationships between species is a fundamental problem in bioinformatics. One of the ways to define relationships is to detect gene clusters. Graph concepts have been applied to several genomic studies. Approximate gene cluster discovery may be approached as optimization problems in graph, one of which is the Minimum Weight t-Partite Clique Problem (MWtCP). The goal of MWtCP is to create a t-partite graph and to find a t-star with minimum weight, which is used to approximate a t-clique. Clustar is a tool that applies an algorithm which solves the MWtCP for detecting gene clusters. It allows the user to detect gene clusters using three methods: approximate gene clustering, exact gene clustering (using GPU), and exact gene clustering (without using GPU). Clustar is able to produce candidate gene clusters and its alignment among the genomes, as well as the graph representation and the adjacency matrix produced from the generated graph.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342959","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}
J. Gudin, S. Mavroudi, A. Korfiati, K. Theofilatos, D. Dietze, Peter L Hurwitz
{"title":"A precision medicine approach for non-opioid pain therapy using a combination of multi-objective optimization and support vector regression","authors":"J. Gudin, S. Mavroudi, A. Korfiati, K. Theofilatos, D. Dietze, Peter L Hurwitz","doi":"10.1109/IISA.2019.8900689","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900689","url":null,"abstract":"Chronic pain has been linked with negative impacts on psychological and social factors, with mortality and several diseases. Lately, emphasis has been focused on non-opioid treatments to overcome its addictive nature and other side effects. To address this, the OPERA study evaluated the effectiveness of topical analgesics as an alternative method to opioids for pain therapy. Initial results showed that topical analgesics have significant benefits for the majority of chronic pain patients. However, there were segments of patients who did not seem to benefit from prescribed therapy and some participants whose situation deteriorated after the intervention. In the present study, we are exploring the potential of machine learning methods to classify chronic pain patients into those who will benefit from topical analgesics treatment and those who will not, in order to personalize their treatment. For this purpose, we utilized a hybrid combination of multi-objective optimization and support vector regression which is able to handle imbalanced datasets, select the optimal features subset and optimize the parameters of the regression model so as to maximize the predictive accuracy. The proposed method significantly overcame other state-of-the-art methods. Experimental results showed that its application can predict, with reasonable accuracy (AUC 73.8-87.2%), the outcomes of this study allowing for a precision medicine approach in treating chronic pain.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126485576","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}
G. Feretzakis, Dimitris Kalles, Vassilios S. Verykios
{"title":"Local Distortion Hiding in Financial Technology application: a case study with a benchmark data set","authors":"G. Feretzakis, Dimitris Kalles, Vassilios S. Verykios","doi":"10.1109/IISA.2019.8900733","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900733","url":null,"abstract":"Data sharing has become an increasingly common procedure among financial institutions, but any organisation will most probably attempt to conceal some critical rules before exchange their information with others. This paper concentrates on protecting sensitive rules when we assume that binary decision trees will be the models to be induced by the shared data. The suggested heuristic hiding technique is preferred over other heuristic solutions such as output disturbance or encryption methods that restrict data usability, as the raw data itself can then more easily be offered for access by any third parties. In this article, we present a paradigm of using the Local Distortion Hiding (LDH) algorithm in a real-life financial data set to hide a sensitive rule.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125515032","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}
Georgios Kostopoulos, Nikos Fazakis, S. Kotsiantis, K. Sgarbas
{"title":"Multi-objective Optimization of C4.5 Decision Tree for Predicting Student Academic Performance","authors":"Georgios Kostopoulos, Nikos Fazakis, S. Kotsiantis, K. Sgarbas","doi":"10.1109/IISA.2019.8900771","DOIUrl":"https://doi.org/10.1109/IISA.2019.8900771","url":null,"abstract":"Applying data mining methods in the educational field has gained a lot of attention among scientists over the last years. Educational Data Mining forms an ever-developing research area aiming to unveil the hidden knowledge in educational data and improve students’ learning behavior and outcomes. To this end, a plethora of data mining methods have already been implemented in various educational settings solving a variety of tasks, among which the prediction of students’ academic performance as well. Decision trees have proven to be a quite effective method for both classification and regression problems showing a number of considerable advantages, such as efficiency, simplicity, flexibility and interpretability. Moreover, configuration of parameter values has often a material impact on building optimal trees in terms of accuracy and/or size. In this context, the main objective of our study is to yield a highly accurate and interpretable classification tree for the early prognosis of students at risk of failing in a university course. Thereby, effective intervention and support actions could be initiated to motivate students and enhance their performance. The experimental results demonstrate that the induction of the C4.5 decision tree classifier through an evolutionary algorithm, such as the Speed -constrained Multi-objective Particle Swarm Optimization algorithm, yields more accurate and easier to construe trees.","PeriodicalId":371385,"journal":{"name":"2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131839990","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}