{"title":"ML-SPD: Machine Learning based Sentiment Polarity Detection","authors":"Jelena Graovac, M. Radović, Berna Altinel Girgin","doi":"10.1109/INISTA49547.2020.9194633","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194633","url":null,"abstract":"Internet revolution creates very important trends in people's life like news-portals, online-education, home-offices, online shopping, social media, etc. Without any controversy, social media is one of the most important outcomes of the Web. Today, social media is more than a communication channel where people have the opportunity to express their feelings, write their comments on microblogging sites, discussion groups, review sites, etc. These common habits have resulted in two important consequences: 1) Accumulation of very huge data on online platforms, 2) The requirement of automatic systems to classify these accumulated big data by subjective and sentimentally. In many cases, Sentiment Polarity Detection (SPD) in text may be an urgent requirement, rather than identifying the subject of the text. For instance, positively or negatively labeled product reviews may give sufficient summary information to readers about the review. In this study, to solve SPD problem we explore different text representation models in conjunction with state-of-the-art traditional Machine Learning techniques: Support Vector Machines (SVM), Neural Networks (NN), Nave Bayes (NB), and combination of NB and SVM classifier (NBSVM). We perform experiments on three publicly available benchmark movie review datasets in different languages: CornellPD in English, HUMIR in Turkish and SerbSPD-2C in Serbian. Experimental results confirm that the presented techniques achieve improvements over the previously published techniques applied to movie reviews datasets in Turkish and English. Developed software package “ML-SPD” is made publicly available to the research community so it can serve as a good baseline for future research.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457082","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 bi-objective maximal covering location problem: a service network design application","authors":"Lazar Mrkela, Z. Stanimirović","doi":"10.1109/INISTA49547.2020.9194660","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194660","url":null,"abstract":"This paper proposes a bi-objective maximal covering location problem (MCLP) that involves customer preferences and balances between covered demand and the number of uncovered customers. The first objective maximizes the weighted sum of the covered demand, in which the weights are based on customer preferences, while the second objective is to minimize the number of uncovered customers. This newly proposed bi-objective model can be applied to the design of service networks, such as post offices, health centers, delivery services, etc. Three multi-objective evolutionary algorithms (MOEAs) are adapted to the considered bi-objective MCLP and applied on the set of modified real-life MCLP test instances that include large number of customer nodes and potential facility locations. The obtained experimental results show that all three MOEAs are suitable for solving the bi-objective MCLP, as they successfully provide solutions on the considered test instances of challenging dimensions.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116869296","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":"Gated Echo State Networks: a preliminary study","authors":"Daniele Di Sarli, C. Gallicchio, A. Micheli","doi":"10.1109/INISTA49547.2020.9194681","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194681","url":null,"abstract":"Gating mechanisms are widely used in the context of Recurrent Neural Networks (RNNs) to improve the network's ability to deal with long-term dependencies within the data. The typical approach for training such networks involves the expensive algorithm of gradient descent and backpropagation. On the other hand, Reservoir Computing (RC) approaches like Echo State Networks (ESNs) are extremely efficient in terms of training time and resources thanks to their use of randomly initialized parameters that do not need to be trained. Unfortunately, basic ESNs are also unable to effectively deal with complex long-term dependencies. In this work, we start investigating the problem of equipping ESNs with gating mechanisms. Under rigorous experimental settings, we compare the behaviour of an ESN with randomized gate parameters (initialized with RC techniques) against several other models, among which a leaky ESN and a fully trained gated RNN. We observe that the use of randomized gates by itself can increase the predictive accuracy of a ESN, but this increase is not meaningful when compared with other techniques. Given these results, we propose a research direction for successfully designing ESN models with gating mechanisms.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549656","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 New Approach for Predicting an Important User on a Topic on Twitter","authors":"H. Phan, Dai Tho Dang, N. Nguyen, D. Hwang","doi":"10.1109/INISTA49547.2020.9194658","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194658","url":null,"abstract":"Twitter is an online social networking service with millions of users and an impressive flow of messages that are published and spread daily through interactions among users. There are different types of users on Twitter; therefore, determining the most important users in each topic is highly challenging. Hence, it is necessary to define efficient computed measures to classify users according to the criteria of relevance and the possibility of representing reality. Although several studies have considered identifying the user influence, user popularity, or user activity in a social network, relatively less focus has been on measuring and predicting important users in case of a topic. In this study, we have proposed a method to determine an important user based on the activities related to each topic on Twitter by combining the measures related to user influence, user activity, and user popularity. The results verified the effectiveness of our proposed approach for the identification of important users in each topic.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116775539","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}
Abdullah Al Nahas, Aysenur Kulunk, Burak Gözütok, S. Kalkan, Hakki Yagiz Erdinc
{"title":"How to Segment Turkish Words for Neural Text Classification?","authors":"Abdullah Al Nahas, Aysenur Kulunk, Burak Gözütok, S. Kalkan, Hakki Yagiz Erdinc","doi":"10.1109/INISTA49547.2020.9194661","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194661","url":null,"abstract":"Neural text classifiers of agglutinative languages often suffer from large vocabulary sizes of training data and high out of vocabulary rates during the test time. The natural language processing community has developed and used numerous word segmentation procedures to alleviate these problems. However, their effect on the performance of neural classifiers of Turkish documents requires further investigation. In this empirical study, we carry out an extensive series of experiments to investigate the effect of the choice of word segmentation procedure on the performance of three different neural text classifiers on Turkish documents across multiple domains. Our experiments show that the choice of word segmentation procedure is another hyperparameter that needs tuning. This choice may depend on the domain and the neural architecture.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116093017","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 Urban Intelligence Service for the impact of urbanization on National Park","authors":"Yuan-Chih Yu","doi":"10.1109/INISTA49547.2020.9194672","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194672","url":null,"abstract":"Yangmingshan National Park occupies half of Taipei's area in Taiwan. However, due to urbanization, many problems have arisen, including transportation, housing, food, shopping, development management, and ecological protection. Among them, the transportation problem is the key issue. To analyze the transportation problem, we construct the graph analytical model to present the logical meaning of the traffic/tourist distribution in time and space and to reflect the traffic functionality of each tourist attraction area. Based on this model, we can deploy it on the cloud as an intelligence analysis service to explore the recreation function of the national park area by analyzing the flows of tourism and traffic with open data. Enabling urban intelligence with big data and AI, sustainable improvement of people's lives, city operation systems, and the environment can be achieved. We hope the introduction of urban intelligence service benefits the development of Yangmingshan National Park, effectively solving the problems of traffic congestion, environmental degradation, and cumbersome planning dilemma.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130525529","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":"Document Processing: Methods for Semantic Text Similarity Analysis","authors":"A. Qurashi, Violeta Holmes, Anju P. Johnson","doi":"10.1109/INISTA49547.2020.9194665","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194665","url":null,"abstract":"The document text similarity measurement and analysis is a growing application of Natural Language Processing. This paper presents the results of using different techniques for semantic text similarity measurements in documents used for safety-critical systems. The research objective of this work is to measure the degree of semantic equivalence of multi-word sentences for rules and procedures contained in the documents on railway safety. These documents, with unstructured data and different formats, need to be preprocessed and cleaned before the set of Natural Language Processing toolkits, and Jaccard and Cosine similarity metrics are applied. The results demonstrate that it is feasible to automate the process of identifying equivalent rules and procedures and measure similarity of disparate safety-critical documents using Natural language processing and similarity measurement techniques.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132001891","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":"Speeding up the SUCCESS Approach for Massive Industrial Datasets","authors":"Krisztián Búza, Aleksandra Revina","doi":"10.1109/INISTA49547.2020.9194656","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194656","url":null,"abstract":"In many applications, it may be expensive, difficult or even impossible to obtain class labels for a large amount of the instances, therefore, the labeled data may not be representative. Semi-supervised learning aims to alleviate this problem by using both labeled and unlabeled data. Recently, we introduced the SUCCESS approach for semi-supervised classification of time series. Although SUCCESS achieved promising results, its ability to classify massive, industrial datasets has not been studied yet. In this paper, we aim to fill this gap: we propose a simple but effective method to speed up SUCCESS without loss of its accuracy. We evaluate the resulting approach on the classification of both publicly available and industrial datasets. Hence, we expect the increase of interest in the algorithm both in industry and the research community.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121101518","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}
Milana Grbić, Vukasin Crnogorac, M. Predojević, Aleksandar Kartelj, Dragan Matic
{"title":"How well are known protein complexes supported in PPI networks?","authors":"Milana Grbić, Vukasin Crnogorac, M. Predojević, Aleksandar Kartelj, Dragan Matic","doi":"10.1109/INISTA49547.2020.9194663","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194663","url":null,"abstract":"Protein complexes are groups of two or more associated proteins which are in a stable long-term interaction. This paper examine how well protein complexes are supported in protein-protein interaction (PPI) networks, i.e. whether they form connected subnetworks in a particular PPI network. For that purpose, we apply a variable neighborhood search metaheuristic algorithm for adding the minimum number of interactions in order to support each protein complex. Obtained experimental results can be useful for further biological interpretation and developing of PPI prediction models.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132607788","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":"Fast Object Recognition for Humanoid Robots by Using Deep Learning Models with Small Structure","authors":"Simge Nur Aslan, A. Uçar, C. Güzelı̇ş","doi":"10.1109/INISTA49547.2020.9194644","DOIUrl":"https://doi.org/10.1109/INISTA49547.2020.9194644","url":null,"abstract":"In these days, the humanoid robots are expected to help people in healthcare, house and hotels, industry, military and the other security environments by performing specific tasks or to replace with people in dangerous scenarios. For this purpose, the humanoid robots should be able to recognize objects and then to do the desired tasks. In this study, it is aimed for Robotis-Op3 humanoid robot to recognize the different shaped objects with deep learning methods. First of all, new models with small structure of Convolutional Neural Networks (CNNs) were proposed. Then, the popular deep neural networks models such as VGG16 and Residual Network (ResNet) that is good at object recognition were used for comparing at recognizing the objects. The results were compared in terms of training time, performance, and model complexity. Simulation results show that new models with small layer structure produced higher performance than complex models.","PeriodicalId":124632,"journal":{"name":"2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060040","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}