2018 International Workshop on Big Data and Information Security (IWBIS)最新文献

筛选
英文 中文
Support Vector Slant Binary Tree Architecture for Facial Stress Recognition Based on Gabor and HOG Feature 基于Gabor和HOG特征的人脸应力识别支持向量倾斜二叉树结构
2018 International Workshop on Big Data and Information Security (IWBIS) Pub Date : 2018-05-01 DOI: 10.1109/IWBIS.2018.8471709
Barlian Henryranu Prasetio, H. Tamura, K. Tanno
{"title":"Support Vector Slant Binary Tree Architecture for Facial Stress Recognition Based on Gabor and HOG Feature","authors":"Barlian Henryranu Prasetio, H. Tamura, K. Tanno","doi":"10.1109/IWBIS.2018.8471709","DOIUrl":"https://doi.org/10.1109/IWBIS.2018.8471709","url":null,"abstract":"The facial stress recognition with histogram information is discussed in this paper. The patterns of facial stress are recognized into three stages, these include a registered image, feature extraction, and classification. The registered image process takes three important parts of the face (the pair of eyes, the nose, and the mouth). While the histogram method such as Gabor filter and HOG feature is used as the feature extraction. Furthermore, the proposed method is to combine SVM and Slant Binary Tree algorithm. Each part of face processed on a different pipeline. Based on the experiment result, the proposed system has accuracy about 86.7{% and it is outperforming the previous methods. The results of the tree structure show that the nose is a part of the face that most indicates stress.","PeriodicalId":398233,"journal":{"name":"2018 International Workshop on Big Data and Information Security (IWBIS)","volume":"426 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116052655","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}
引用次数: 7
Descriptive And Predictive Analysis Of Mail Order Pharmacy 邮购药房的描述性和预测性分析
2018 International Workshop on Big Data and Information Security (IWBIS) Pub Date : 2018-05-01 DOI: 10.1109/IWBIS.2018.8471714
Hafid Yoza Putra, M. L. Khodra
{"title":"Descriptive And Predictive Analysis Of Mail Order Pharmacy","authors":"Hafid Yoza Putra, M. L. Khodra","doi":"10.1109/IWBIS.2018.8471714","DOIUrl":"https://doi.org/10.1109/IWBIS.2018.8471714","url":null,"abstract":"Mail Order Pharmacy is an online pharmacy service which has been widely applied in developed countries. Mail Order Pharmacy has many advantages, especially in long-term treatment patients. In this experiment, Mail Order Pharmacy data of one country in Europe will be used to descriptive and predictive analysis. Descriptive analysis by building data mart basedt on the list of available decisions. Then built data visualization. Prediction using data mining consists of classification and regression. The feature set used consists of feature selection using pearson correlation and feature deletion. Experiments were performed to get the best performance using Naive Bayes, Multi Layer Perceptron and Support Vector Machine. Classification to predict order status yes or no. The best classification F-Measure using Multi Layer Perceptron is 0.577 with 10 fold cross-validation and 0.463 using data testing. Regression to predict sale_quantity. The best regression Root Mean Square Error using Multi Layer Perceptron is 1.4736 with 10 fold cross-validation and 1.6654 using data testing. Both classification and regression used to predict revenue in the next month.","PeriodicalId":398233,"journal":{"name":"2018 International Workshop on Big Data and Information Security (IWBIS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129454865","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
Browsing Behavior Analysis from Wi-Fi Logs Based on Community Detection: Case Study on Educational Institution 基于社区检测的Wi-Fi日志浏览行为分析——以教育机构为例
2018 International Workshop on Big Data and Information Security (IWBIS) Pub Date : 2018-05-01 DOI: 10.1109/IWBIS.2018.8471720
M. Saputri, A. Wibisono, Adila Alfa Krisnadhi, Adhi Yuniarto Laurentius Yohanes, T. Faisal, Alvin Wardhana Utama, Muhammad Azmi Malik Ariefa, Andre Ramadhani, Aminur Muda
{"title":"Browsing Behavior Analysis from Wi-Fi Logs Based on Community Detection: Case Study on Educational Institution","authors":"M. Saputri, A. Wibisono, Adila Alfa Krisnadhi, Adhi Yuniarto Laurentius Yohanes, T. Faisal, Alvin Wardhana Utama, Muhammad Azmi Malik Ariefa, Andre Ramadhani, Aminur Muda","doi":"10.1109/IWBIS.2018.8471720","DOIUrl":"https://doi.org/10.1109/IWBIS.2018.8471720","url":null,"abstract":"As the growth of technology, the need of internet increases. Wireless internet technology or called Wi-Fi is dominate. Hence, monitoring the usage of Wi-Fi is crucial. Community detection is a technique which can be used to understand browsing behavior analysis. Using this approach, a website is represented as a node in a graph and the transition over websites is represented as an edge where the weight of an edge is calculated based on the frequency of website transition. In this study, we implement two community detection algorithms which support directed and weighted graph, i.e Girvan-Newman and Infomap to know the communities of websites accessed by Wi-Fi users. An evaluation metrics named modularity is employed to access the quality of both algorithms. The results of our experiment show that Infomap performs better to detect communities than Girvan-Newman. Based on browsing behavior analysis, it can be understood that the Wi-Fi network is mostly used for education, entertainment and government purposes. However, we also obtain insight regarding the misbehavior activities which need prevention.","PeriodicalId":398233,"journal":{"name":"2018 International Workshop on Big Data and Information Security (IWBIS)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882302","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
Comparing Index Structures for Completeness Reasoning 完备性推理的索引结构比较
2018 International Workshop on Big Data and Information Security (IWBIS) Pub Date : 2018-05-01 DOI: 10.1109/iwbis.2018.8471712
Fariz Darari, W. Nutt, Simon Razniewski
{"title":"Comparing Index Structures for Completeness Reasoning","authors":"Fariz Darari, W. Nutt, Simon Razniewski","doi":"10.1109/iwbis.2018.8471712","DOIUrl":"https://doi.org/10.1109/iwbis.2018.8471712","url":null,"abstract":"Data quality is a major issue in the devel- opment of knowledge graphs. Data completeness is a key factor in data quality pertaining to how broad and deep is information contained in knowledge graphs. As for large- scale knowledge graphs (e.g., DBpedia, Wikidata), it is conceivable that given the vast amount of information contained in there, they may be complete for a wide range of topics, such as children of Joko Widodo, cantons of Switzerland, and presidents of Indonesia. Previous research has shown how one can augment knowledge graphs with statements about their completeness, stating which parts of data are complete. Such meta-information can be leveraged to check query completeness, that is, whether the answer returned by a query is complete. Yet, it is still unclear how such a check can be done in practice, especially when many completeness statements are involved. We devise implementation techniques to make completeness reasoning in the presence of large sets of completeness statements feasible, and experimentally evaluate their effectiveness in realistic settings based on the characteristics of real-world knowledge graphs.","PeriodicalId":398233,"journal":{"name":"2018 International Workshop on Big Data and Information Security (IWBIS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121691916","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}
引用次数: 1
Performance Comparison of Rank Aggregation Using Borda and Copeland in Recommender System 推荐系统中基于Borda和Copeland的等级聚合性能比较
2018 International Workshop on Big Data and Information Security (IWBIS) Pub Date : 2018-05-01 DOI: 10.1109/IWBIS.2018.8471722
Sri Lestari, T. B. Adji, A. E. Permanasari
{"title":"Performance Comparison of Rank Aggregation Using Borda and Copeland in Recommender System","authors":"Sri Lestari, T. B. Adji, A. E. Permanasari","doi":"10.1109/IWBIS.2018.8471722","DOIUrl":"https://doi.org/10.1109/IWBIS.2018.8471722","url":null,"abstract":"The rapid development of e-commerce will certainly be followed by an increasing number and more varied marketed products, making it confusing and time-consuming for users to choose from a large number of desired products. Consequently, a recommendation system is required to give products suggestion to the users with high accuracy. One of the most commonly techniques for the recommendation system is the collaborative filtering technique. However, this technique faces major problems, i.e., sparsity, scalability, and cold start. This paper combine clustering and ranking aggregation approaches to solve the problem. The clustering approach uses K-means algorithm. The approach is implemented into MovieLens dataset, which consists of the demographic and genre information. Meanwhile, the ranking aggregation approach uses Borda and Copeland methods to be compared. The results of the experiment show that Borda method is superior than Copeland method. The mean score of NDCG for Borda and Copeland methods are 0.6251 and 0.5649 respectively. Whilst the running time of Borda method is 63.6793 seconds faster than that of Copeland method.","PeriodicalId":398233,"journal":{"name":"2018 International Workshop on Big Data and Information Security (IWBIS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874313","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}
引用次数: 8
Who is Alice? Privacy Risk, the Case of Regression (Extended Abstract) 爱丽丝是谁?隐私风险,回归案例(扩展摘要)
2018 International Workshop on Big Data and Information Security (IWBIS) Pub Date : 2018-05-01 DOI: 10.1109/IWBIS.2018.8471721
Ashish Dandekar, S. Bressan
{"title":"Who is Alice? Privacy Risk, the Case of Regression (Extended Abstract)","authors":"Ashish Dandekar, S. Bressan","doi":"10.1109/IWBIS.2018.8471721","DOIUrl":"https://doi.org/10.1109/IWBIS.2018.8471721","url":null,"abstract":"While there seems to be no turning back from data becoming a commodity, news headlines and scandals recurrently exacerbate a general concern for privacy. Can Alice’s data be collected, analysed and the results meaningfully published and shared without compromising Alice's privacy? How can organizations assess the privacy risk before disclosing data or the results of their analysis of data? We discuss two streams of research that study the assessment of privacy risk: statistical disclosure and differential privacy. We critically discuss their similarities and dissimilarities. We comparatively and empirically evaluate the two approaches with a canonical dataset and the scenario of synthetic data generation with linear regression..","PeriodicalId":398233,"journal":{"name":"2018 International Workshop on Big Data and Information Security (IWBIS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128131035","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书