{"title":"Examining self-efficacy perception and attitudes of introduction to programming course students with respect to gender and course language","authors":"Ezgi Deveci, D. Aydin, Kristin S. Benli, F. Tek","doi":"10.1109/UBMK.2017.8093519","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093519","url":null,"abstract":"The purpose of this study is to examine generalized self-efficacy and attitudes of the F.M.V. Işık University Engineering Faculty students of Introduction to Programming Course (CSE101) with respect to student gender and course language (Turkish-English). A total of 114 university students, 40 female and 74 male, participated in the research. In order to measure students' self-efficacy perceptions, General Self-Efficacy scale was used and open-ended questions were asked for evaluation of course outcomes (success and failure) and basic demographic information such as age and gender were collected. The open-ended questions were examined by qualitative analysis method. The quantitative analysis revealed a significant relation between the self-efficacy scores of the students with the General Grade Point Average (GPA); and a non-significant relation with the CSE101 end of term grade average. In addition, it was seen that students' self-efficacy scores did not significantly differ with respect to the gender and language (Turkish-English). The motivation scores of the students do not differ according to the course language. In qualitative analysis, we observed that the frequency percentages of the answers given by the students changed according to their genders. By revealing the gender difference in attitudes towards programming course, it is expected that this study will contribute to the process of determining the variables that predict student success in engineering programming education.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128602144","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 phishing attacks from URL by using NLP techniques","authors":"Ebubekir Buber, B. Diri, O. K. Sahingoz","doi":"10.1109/UBMK.2017.8093406","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093406","url":null,"abstract":"Nowadays, cyber attacks affect many institutions and individuals, and they result in a serious financial loss for them. Phishing Attack is one of the most common types of cyber attacks which is aimed at exploiting people's weaknesses to obtain confidential information about them. This type of cyber attack threats almost all internet users and institutions. To reduce the financial loss caused by this type of attacks, there is a need for awareness of the users as well as applications with the ability to detect them. In the last quarter of 2016, Turkey appears to be second behind China with an impact rate of approximately 43% in the Phishing Attack Analysis report between 45 countries. In this study, firstly, the characteristics of this type of attack are explained, and then a machine learning based system is proposed to detect them. In the proposed system, some features were extracted by using Natural Language Processing (NLP) techniques. The system was implemented by examining URLs used in Phishing Attacks before opening them with using some extracted features. Many tests have been applied to the created system, and it is seen that the best algorithm among the tested ones is the Random Forest algorithm with a success rate of 89.9%.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129783680","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":"Implemention of Benford analysis for electronic invoice audit","authors":"İlknur Gür Nalçacı","doi":"10.1109/UBMK.2017.8093447","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093447","url":null,"abstract":"e-Invoicing Application in Turkey has been implemented since 2010. But after 2014 it has reached widespread usage by government regulation and as of 2017 the number of e-invoice users has exceeded sixty thousands. Generating invoices according to a single standard in electronic environment has made it easier to analyze and inspect through the data. In this case, the analyzes can be performed on the whole of the data rather than on a specific sample. The statistical methods can provide many descriptive information about the mass of the person in hand, and certain analysis models are also guide for auditing. The Benford Analysis is known as one of the most common methods of detecting fraud. In this article, it is explained that how to apply Benford Analysis on e-invoicing data and interpreted the results via real sample application. This article has been realized as an output of the Idea Technology Solutions R&D Center TEYDEB project is named ELICIT: E-Invoice Compatibility and Cheating Audit Project.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127365321","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":"Automation of FMEA for computer servers using log data with grey relational analysis","authors":"Halil Ibrahim Ayaz, M. Testik","doi":"10.1109/UBMK.2017.8093480","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093480","url":null,"abstract":"Failure modes and effects analysis (FMEA) is a powerful and proactive quality tool for defining, detecting, and identifying potential failure modes and their effects. However, conventional FMEA process is sometimes difficult to implement due to workload required and subjectivity of the evaluations performed. Hence, automation of this tool can be useful for some application domains to objectively evaluate failures and faster implementations, which is the aim of this study. To automate the process and eliminate the subjectivity, data-based algorithms such as grey relational analysis and association analysis are implemented in the following with an application to computer servers.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130624443","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":"Car indoor gas detection system","authors":"P. Panahi, C. Bayilmis","doi":"10.1109/UBMK.2017.8093579","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093579","url":null,"abstract":"Thousands of people are dying because of breathing Carbon monoxide (CO) gas every year. In terms of poisons history, it has more unintentionally deaths than any other ones. One of the main resources of generating CO is fuel. Number of vehicles that use LPG are increasing dramatically. Technical problem in LPG injection system sometimes will result in irreversible effects for driver and passengers. At the other hand many people especially in cold climate countries are travelling in winter with their own vehicles. In most cases many of people who their cars getting stuck in the snow, stay inside the car waiting for help. In this situation if the exhaust is blocked by snow or any other resources, the CO enters the car cabin and passengers without being noticed are died. In this paper, we introduce a system by using Arduino that is able to measure CO level, make warnings for driver and send vehicle's geographic coordinate along with warning messages for defined telephone numbers in emergency situations.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128799167","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":"Preprocessing framework for Twitter bot detection","authors":"Mücahit Kantepe, M. Ganiz","doi":"10.1109/UBMK.2017.8093483","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093483","url":null,"abstract":"One of the important problems in social media platforms like Twitter is the large number of social bots or sybil accounts which are controlled by automated agents, generally used for malicious activities. These include directing more visitors to certain websites which can be considered as spam, influence a community on a specific topic, spread misinformation, recruit people to illegal organizations, manipulating people for stock market actions, and blackmailing people to spread their private information by the power of these accounts. Consequently, social bot detection is of great importance to keep people safe from these harmful effects. In this study, we approach the social bot detection on Twitter as a supervised classification problem and use machine learning algorithms after extensive data preprocessing and feature extraction operations. Large number of features are extracted by analysis of Twitter user accounts for posted tweets, profile information and temporal behaviors. In order to obtain labeled data, we use accounts that are suspended by Twitter with the assumption that majority of these are social bot accounts. Our results demonstrate that our framework can distinguish between bot and normal accounts with reasonable accuracy.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853846","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":"Similarity detection between Turkish text documents with distance metrics","authors":"Mümine Kaya Keleş, S. A. Özel","doi":"10.1109/UBMK.2017.8093399","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093399","url":null,"abstract":"The aim of this study is to compare the successes of various distance metrics and to determine the most appropriate methods in order to detect similarities among textual documents written in Turkish. Computing similarities between text documents is the basic step of plagiarism detection, and text mining methods like author detection, text classification and clustering. Therefore, plagiarism detection and text mining applications will be more successful by using the distance metrics that are determined according to the results obtained in this study. For this purpose, chunks of texts in different lengths are selected as the experimental dataset in this study. After that, preprocessing methods are applied to the dataset that is used; therefore new and different experimental scenarios are created by removing stopwords and Turkish characters, and stemming words with Zemberek. According to the experimental results, it is observed that the preprocessing phase increases the accuracy of similarity detection. Especially, stemming using Zemberek increases the success rate. In all cases, the Cosine Similarity method has been observed as more successful than other distance metrics, because of producing more realistic results.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126735693","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":"Gövde-Türk: A Turkish stemming method","authors":"S. Yücebaş, Rabia Tintin","doi":"10.1109/UBMK.2017.8093407","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093407","url":null,"abstract":"This study presents a stemming method for Turkish Language that searches inflectional suffixes at the end of the words and eliminate them according to the rules provided by finite state machines and longest match manner.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123254084","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":"Link prediction methods in bipartite networks","authors":"Serpil Aslan, Mehmet Kaya","doi":"10.1109/UBMK.2017.8093495","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093495","url":null,"abstract":"Nowadays, social networks, whose application areas are increasing day by day; Such as data mining, protein-gene interaction networks, online social networks, transport networks, academic information networks, and telecommunications networks. Many real-world complex networks have a naturel bipartite structure. In bipartite networks, which have become the focus of many researchers who have been dealing with social network analysis in recent years, connection estimation methods are the basic methods used to understand the structure of these networks. This study is a survey work that describes the connection in a bipartite network that is suitable for the nature of today's huge data networks. In this study, a bipartite network interface is an introductory guide for researchers who plan to work on this subject by examining the “internal links” and “bipartite network projection” methods.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"87 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126296029","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 image-based recommender system based on feature extraction techniques","authors":"Zuhal Kurt, Kemal Özkan","doi":"10.1109/UBMK.2017.8093527","DOIUrl":"https://doi.org/10.1109/UBMK.2017.8093527","url":null,"abstract":"Recommender systems provide recommendations about various products and services to their users while using other users data. Their success is imperative for both users and the e-commerce sites utilizing such systems. Providing accurate and dependable recommendations increases user satisfaction that results selling more products and services. Image-based recommender systems are receiving increasing attention in the recent years. These systems are based on images uploaded by users. They first determine the most similar users based on the images they upload to the system. They then return the most likely image to the users based on the images liked by the neighbors. The most challenging problem in image-based recommneder systems is to match an image with the most similar visual words or classes based on the image's visual content. We design a system which is using Bag of words model, to solving this problem.1 BoW model is an effective model in computer vision field, and we use SURF, SIFT and LBP descriptors for extracting features in our system.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120896621","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}