2018 12th International Conference on Open Source Systems and Technologies (ICOSST)最新文献_第2页

ApproxCT: Approximate Clustering Techniques for Energy Efficient Computer Vision in Cyber-Physical Systems 网络物理系统中节能计算机视觉的近似聚类技术

2018 12th International Conference on Open Source Systems and Technologies (ICOSST) Pub Date : 2018-12-01 DOI: 10.1109/ICOSST.2018.8632191

Raja Haseeb Javed, Ayesha Siddique, R. Hafiz, Osman Hasan, M. Shafique

{"title":"ApproxCT: Approximate Clustering Techniques for Energy Efficient Computer Vision in Cyber-Physical Systems","authors":"Raja Haseeb Javed, Ayesha Siddique, R. Hafiz, Osman Hasan, M. Shafique","doi":"10.1109/ICOSST.2018.8632191","DOIUrl":"https://doi.org/10.1109/ICOSST.2018.8632191","url":null,"abstract":"The emerging trends in miniaturization of Internet of Things (IoT) have highly empowered the Cyber-Physical Systems (CPS) for many social applications especially, medical imaging in healthcare. The medical imaging usually involves big data processing and it is expedient to realize its clustering after data acquisition. However, the state-of-the-art clustering techniques are compute intensive and tend to reduce the processing capability of battery-driven or energy harvested IoT based embedded devices (e.g., edge and fogs). Thus, there is a desire to perform energy efficient implementation of the machine learning based clustering techniques. Since, the clustering techniques are inherently resilient to noise and thus, their resilience can be exploited for energy efficiency using approximate computing. In this paper, we proposed approximate versions of the widely used K-Means and Mean Shift clustering techniques using the state-of-the-art low power approximate adders (IMPACT). The trade-off between power consumption and the output quality is exploited using five well-known pattern recognition datasets. The experiments reveal that K-Means algorithm exhibits more error resilience towards approximation with a maximum of 10% - 25% power savings.","PeriodicalId":261288,"journal":{"name":"2018 12th International Conference on Open Source Systems and Technologies (ICOSST)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114944448","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}

引用次数: 5

Handling Missing Values in Chronic Kidney Disease Datasets Using KNN, K-Means and K-Medoids Algorithms 使用KNN, K-Means和k - mediids算法处理慢性肾脏疾病数据集的缺失值

2018 12th International Conference on Open Source Systems and Technologies (ICOSST) Pub Date : 2018-12-01 DOI: 10.1109/ICOSST.2018.8632179

Tahira Mahboob, A. Ijaz, Amber Shahzad, Muqadas Kalsoom

{"title":"Handling Missing Values in Chronic Kidney Disease Datasets Using KNN, K-Means and K-Medoids Algorithms","authors":"Tahira Mahboob, A. Ijaz, Amber Shahzad, Muqadas Kalsoom","doi":"10.1109/ICOSST.2018.8632179","DOIUrl":"https://doi.org/10.1109/ICOSST.2018.8632179","url":null,"abstract":"Missing values in large datasets have become a difficult task for researchers and industrialists. Specifically in the field of medicine, the datasets contain missing values due to human error or non-availability of data. If these datasets have to utilized for inference purposes or predictive studies, the resutls are not that reliable. Discarding such instances is an option but effects overall accuracy and thus it is viable to perform some replacement or imputation technique. Here, imputaiton technique enable to estimate the missing values in the datasets by applying various algorithms. Therefore, in this paper we present a framework that assists in imouting missing values in a large Chronic Kidney Disease (CKD) datasets. We have used three machine learning algorithms i.e., K-Nearest Neighbors, K-Means and K-Medoids Clustering to impute the missing values. Performance evaluation of the proposed technique has been carried out by application of Decision Tree and Random Forest algorithms. Experimental results demonstrate that KNN algorithm provides the most accurate results compared with K-Means and K-Medoids clustering algorithms. KNN achieves an accuracy of 86.67% for Decision Tree algorithm, and 75.25% for Random Forest algorithm. Additionally it also has a less relative, absolute and root mean square error. Conclusively, KNN imputed datasets are used in our research for future predictions.","PeriodicalId":261288,"journal":{"name":"2018 12th International Conference on Open Source Systems and Technologies (ICOSST)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125898841","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}

引用次数: 14

An Ontology-Based Approach to Semi-Automate Systematic Literature Reviews 基于本体的半自动化系统文献综述方法

2018 12th International Conference on Open Source Systems and Technologies (ICOSST) Pub Date : 2018-12-01 DOI: 10.1109/ICOSST.2018.8632205

Asad Ali, C. Gravino

{"title":"An Ontology-Based Approach to Semi-Automate Systematic Literature Reviews","authors":"Asad Ali, C. Gravino","doi":"10.1109/ICOSST.2018.8632205","DOIUrl":"https://doi.org/10.1109/ICOSST.2018.8632205","url":null,"abstract":"A Systematic Literature Review (SLR) allows us to combine and analyze data from multiple (published and unpublished) studies. Though it provides a complete and comprehensive empirical evidence of an area of interest, the results we usually get from the data synthesis phase of an SLR include huge tables and graphs and thus, for users, it is a tedious and time-consuming job to get the required results. In this work, we propose to semi-automate some steps which can be used to fetch the information from an SLR, beyond the traditional tables, graphs, and plots. The automation is performed using Semantic Web technologies like ontology, Jena API and SPARQL queries. The Semantic Web, also called Web 3.0, provides a common framework and thus allows us to share and re-use the data across the applications and enterprises. It can be used to integrate, extract, and infer the most relevant data required by the users, which are hidden behind the huge information on the Web. We also provide an easy-to-use user interface in order to allow users to perform different searches and find their required SLR results easily and quickly. Finally, we present the results of a preliminary user study performed to analyze the amount of time users need to extract their required information, both via the SLR tables and our proposal. The results revealed that with our system the users get their required information in less time compared to the manual system.","PeriodicalId":261288,"journal":{"name":"2018 12th International Conference on Open Source Systems and Technologies (ICOSST)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132683266","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}

引用次数: 0

Exploring Media Bias and Toxicity in South Asian Political Discourse 探讨南亚政治话语中的媒体偏见和毒性

2018 12th International Conference on Open Source Systems and Technologies (ICOSST) Pub Date : 2018-11-16 DOI: 10.1109/ICOSST.2018.8632183

A. Qayyum, Z. Gilani, S. Latif, Junaid Qadir, J. Singh

引用次数: 13