{"title":"Causal Effects of Landing Parameters on Runway Occupancy Time using Causal Machine Learning Models","authors":"Zhi Jun Lim, S. Goh, Imen Dhief, S. Alam","doi":"10.1109/SSCI47803.2020.9308243","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308243","url":null,"abstract":"Limited runway capacity is a common problem faced by most airports worldwide. The two important factors that affect runway throughput are the wake-vortex separation and Runway Occupancy Time (ROT). Therefore, to improve runway throughput, Wake Turbulence Re-categorisation program (RECAT) was introduced to reduce the minimum separation distance required between successive aircraft on final approach. As a result, the constraining impact of ROT on runway throughput has now become significant. The objective of this paper is to identify data-driven intervention to reduce the ROT of landing aircraft. Specifically, we propose a data-driven approach to estimate the causal effect of landing parameters on ROT. We propose categorisation of each landing parameter into groups using Gaussian process models and employ Generalised Random Forest (GRF) to estimate the average treatment effect and the standard deviation of each landing parameters. Experimental results show that a few procedural changes to current landing procedure may reduce ROT. The results establish that slowing down the aircraft speed in the final approach phase leads to shorter ROT. In the final approach phase, ROTs of aircraft which are at least 10 knots slower than the average aircraft speed are on an average 2.63 seconds shorter. Furthermore, aircraft that are at least 10 knots faster than the average aircraft have on average 4 seconds longer ROTs. The second finding of this work is that flexible glide-slope angles should be introduced for the different aircraft types to achieve better ROT performance. Therefore, our findings also validate the industry need for Ground-Based Augmented System landing system which provides landing guidance with flexible glide-slopes.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115555995","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":"Detecting Subject-Weapon Visual Relationships","authors":"Thomas Truong, S. Yanushkevich","doi":"10.1109/SSCI47803.2020.9308574","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308574","url":null,"abstract":"Computer vision-based weapon detection method- ologies and applications in safety and security have fallen behind when compared to state-of-the-art computer vision applications problems in other areas. In this paper we propose a novel visual relationship detection model trained on the Open Images V6 dataset to detect the visual relationships of “holds” and “wears” between people and objects. We also introduce an application of the proposed model to detect if weapons are being held. Weapons are an unseen object class to the network. The best proposed model achieves an accuracy of 90.01% ±2.05 % on the test set of the Open Images V6 dataset for classifying the “holds” and “wears” visual relationships.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115736096","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":"Hybrid Fuzzy Weighted K-Nearest Neighbor to Predict Hospital Readmission for Diabetic Patients","authors":"Soha Bahanshal, Byung Kim","doi":"10.1109/SSCI47803.2020.9308286","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308286","url":null,"abstract":"Identification of patients at high risk for hospital readmission is of crucial importance for quality health care and cost reduction. Predicting hospital readmissions among diabetic patients has been of great interest to many researchers and health decision makers. We build a prediction model to predict hospital readmission for diabetic patients within 30 days of discharge. The core of the prediction model is a modified k Nearest Neighbor called Hybrid Fuzzy Weighted k Nearest Neighbor algorithm. The prediction is performed on a patient dataset which consists of more than 70,000 patients with 50 attributes. We applied data preprocessing using different techniques in order to handle data imbalance and to fuzzify the data to suit the prediction algorithm. The model so far achieved classification accuracy of 80% compared to other models that only use k Nearest Neighbor.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115006656","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}
Sea Jung Im, Yue Xu, J. Watson, A. Bonner, H. Healy, W. Hoy
{"title":"Hospital Readmission Prediction using Discriminative patterns","authors":"Sea Jung Im, Yue Xu, J. Watson, A. Bonner, H. Healy, W. Hoy","doi":"10.1109/SSCI47803.2020.9308381","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308381","url":null,"abstract":"Avoidable hospital readmission is problematic as it increases the burden on healthcare systems, leads to a shortage of hospital beds and impacts on the costs of healthcare. Various machine learning algorithms have been applied to predict patient readmissions. However, existing literature has only focused on individual features of health conditions without consideration of associations between features. This paper proposes discriminative pattern-based features as a technique to improve readmission prediction. First, discriminative patterns that occur disproportionately between two classes: readmission and non-readmission, were generated based on hospital electronic health records. Second, the patterns were fed as features into a classification model for readmission prediction. Then, we have evaluated these discriminative pattern-based features in three datasets: diabetes, chronic kidney disease and all diseases. Experiments with each dataset showed that the features of chronic disease cohorts have fewer differences between the readmission and the non-readmission classes than the all-diseases cohort. Our proposed pattern-based model improved the prediction performance in terms of AUC (Area Under the receiver operating characteristic curve) by about 12% compared with the baseline models for the all-disease cohort, however, it showed little improvement for either diabetes or chronic kidney disease datasets.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115377121","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":"Averaging Methods using Dynamic Time Warping for Time Series Classification","authors":"Shreyasi Datta, C. Karmakar, M. Palaniswami","doi":"10.1109/SSCI47803.2020.9308409","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308409","url":null,"abstract":"Averaging is an important step in time series classi-fication or clustering, to create representative sequences for each category of data. A global averaging method for Dynamic Time Warping (DTW) based time series analysis is DTW Barycenter Averaging (DBA). In this paper, we propose a recursive tree based implementation of DBA, for faster computation of an average sequence, using the divide-and-conquer strategy. We also propose to automate the termination of DBA using a data-driven approach. The performance of the proposed methods is evaluated using accuracy, precision and recall as performance metrics, in a simple DTW-distance based classification method on ten standard time series datasets. Experimental results demonstrate that the proposed approaches are significantly faster than DBA, while achieving similar performance.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"03 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124471023","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}
Saikat Das, Ph.D., Namita Agarwal, D. Venugopal, Frederick T. Sheldon, S. Shiva
{"title":"Taxonomy and Survey of Interpretable Machine Learning Method","authors":"Saikat Das, Ph.D., Namita Agarwal, D. Venugopal, Frederick T. Sheldon, S. Shiva","doi":"10.1109/SSCI47803.2020.9308404","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308404","url":null,"abstract":"Since traditional machine learning (ML) techniques use black-box model, the internal operation of the classifier is unknown to human. Due to this black-box nature of the ML classifier, the trustworthiness of their predictions is sometimes questionable. Interpretable machine learning (IML) is a way of dissecting the ML classifiers to overcome this shortcoming and provide a more reasoned explanation of model predictions. In this paper, we explore several IML methods and their applications in various domains. Moreover, a detailed survey of IML methods along with identifying the essential building blocks of a black-box model is presented here. Herein, we have identified and described the requirements of IML methods and for completeness, a taxonomy of IML methods which classifies each into distinct groupings or sub-categories, is proposed. The goal, therefore, is to describe the state-of-the-art for IML methods and explain those in more concrete and understandable ways by providing better basis of knowledge for those building blocks and our associated requirements analysis.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894976","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":"AI-Powered Ransomware Detection Framework","authors":"Subash Poudyal, D. Dasgupta","doi":"10.1109/SSCI47803.2020.9308387","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308387","url":null,"abstract":"Ransomware attacks are taking advantage of the ongoing pandemics and attacking the vulnerable systems in business, health sector, education, insurance, bank, and government sectors. Various approaches have been proposed to combat ransomware, but the dynamic nature of malware writers often bypasses the security checkpoints. There are commercial tools available in the market for ransomware analysis and detection, but their performance is questionable. This paper aims at proposing an AI-based ransomware detection framework and designing a detection tool (AIRaD) using a combination of both static and dynamic malware analysis techniques. Dynamic binary instrumentation is done using PIN tool, function call trace is analyzed leveraging Cuckoo sandbox and Ghidra. Features extracted at DLL, function call, and assembly level are processed with NLP, association rule mining techniques and fed to different machine learning classifiers. Support vector machine and Adaboost with J48 algorithms achieved the highest accuracy of 99.54% with 0.005 false-positive rates for a multi-level combined term frequency approach.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122956244","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":"An Effective Measure to Identify Meaningful Concepts in Engineering Design optimization","authors":"Felix Lanfermann, S. Schmitt, S. Menzel","doi":"10.1109/SSCI47803.2020.9308484","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308484","url":null,"abstract":"Identifying similar solutions during an engineering design process and organizing the design data set into several concepts has substantial benefits. A concept is an abstract representation of design solutions that share comparable properties and behavior. Inspecting such concepts facilitates an increase of knowledge about the structure of the design problem. Concepts also allow for the selection of archetypal representatives which can be used as prototypes for further processing. Each prototype represents a different part of the design domain and can, for example, be effectively used to initialize the starting population of a design optimization leading to meaningful variations towards increased design performance. However, identifying meaningful concepts in a large engineering design data set and objectively quantifying the quality of the identified set of concepts is a challenging task. Existing measures to evaluate concepts of design solutions exhibit substantial drawbacks as they do not consider the simultaneous existence and interactions of multiple concepts on one design data set thoroughly. Therefore, we propose a new measure for objectively quantifying the quality of a set of concepts which explicitly takes the overlap and sizes of the concepts into account. We show the benefits of our measure by comparing it to state-of-the art measures in an automated optimization-based concept identification approach for a real-world inspired engineering design data set.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123000740","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}
Viktor Kress, Steven Schreck, Stefan Zernetsch, Konrad Doll, B. Sick
{"title":"Pose Based Action Recognition of Vulnerable Road Users Using Recurrent Neural Networks","authors":"Viktor Kress, Steven Schreck, Stefan Zernetsch, Konrad Doll, B. Sick","doi":"10.1109/SSCI47803.2020.9308462","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308462","url":null,"abstract":"This work investigates the use of knowledge about three dimensional (3D) poses and Recurrent Neural Networks (RNNs) for detection of basic movements, such as wait, start, move, stop, turn left, turn right, and no turn, of pedestrians and cyclists in road traffic. The 3D poses model the posture of individual body parts of these vulnerable road users (VRUs). Fields of application for this technology are, for example, driver assistance systems or autonomous driving functions of vehicles. In road traffic, VRUs are often occluded and only become visible in the immediate vicinity of the vehicle. Hence, our proposed approach is able to classify basic movements after different and especially short observation periods. The classification will then be successively improved in case of a longer observation. This allows countermeasures, such as emergency braking, to be initiated early if necessary. The benefits of using 3D poses are evaluated by a comparison with a method based solely on the head trajectory. We also investigate the effects of different observation periods. Overall, knowledge about 3D poses improves the basic movement detection, in particular for short observation periods. The greatest improvements are achieved for the basic movements start, stop, turn left, and turn right.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123792456","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 Change Detector for Prior Probabilities of Classes","authors":"P. Gonçalves, Roberto S. M. Barros, S. Chartier","doi":"10.1109/SSCI47803.2020.9308146","DOIUrl":"https://doi.org/10.1109/SSCI47803.2020.9308146","url":null,"abstract":"The majority of current concept drift detectors focus on the results of a base classifier. But if there is a change in the data distribution or in the prior probability of the classes, these methods are unable to identify these types of change. This paper proposes Prior Probability Change Detection Method (PCDM), a method suited to identify changes in the prior probabilities of the classes. It works by associating traditional drift detection methods to analyze how the instances belonging to each class changes in time. Experiments in 24 artificial datasets of six generators indicate that PCDM presented the best results considering the sensitivity metric, the Matthews Correlation Coefficient, and the F1 score without losing any performance in the specificity metric.","PeriodicalId":413489,"journal":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"23 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126155751","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}