{"title":"Exact-match Based Wikipedia-WordNet Integration","authors":"Tomasz Boinski, J. Szymański, Tymoteusz Cejrowski","doi":"10.1109/INISTA.2019.8778336","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778336","url":null,"abstract":"Ability to link between WordNet synsets and Wikipedia articles allows usage of those resources by computers during natural language processing. A lot of work was done in this field, however most of the approaches focus on similarity between Wikipedia articles and WordNet synsets rather than creation of perfect matches. In this paper we proposed a set of methods for automatic perfect matching generation. The proposed methods were evaluated and integrated into one unified solution for generating matches with good quality. The paper describes and evaluates the proposed methods and presents the integration process. The evaluation of the final proposed solution is given.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114961226","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}
J. Todorov, I. Krasteva, Vanya Ivanova, E. Doychev
{"title":"BLISS-A CPSS-like Application for Lifelong Learning","authors":"J. Todorov, I. Krasteva, Vanya Ivanova, E. Doychev","doi":"10.1109/INISTA.2019.8778363","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778363","url":null,"abstract":"This paper presents a Cyber-Physical-SocialSpace (CPSS)-like application known as BLISS. The system supports a kind of lifelong learning where people who need to be educated have dropped out of school for various reasons but wish to complete their education through individual training. The active components of BLISS called personal assistants are implemented as intelligent agents. The agents' environment consists of three parts - an event-driven BLISS server, a set of personal assistants that will be described in the publication and a School Diary implemented as a blockchain. Furthermore, the reference architecture named Virtual Physical Space (ViPS), used to develop the application, is briefly described.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128254468","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":"Adversarial Nuclei Segmentation on H&E Stained Histopathology Images","authors":"O. Koyun, T. Yıldırım","doi":"10.1109/INISTA.2019.8778369","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778369","url":null,"abstract":"Computer aided methods in pathology are advancing rapidly. Problems like segmentation, classification and detection of pathology images are solved with machine learning and image processing techniques. State-of-the-art methods in nuclei segmentation problem include supervised deep learning techniques. However, labeling process of pathology images is an expensive and time consuming process. In this work, nuclei segmentation problem is formulated as image-to-image translation problem and using Cycle-Consistent Generative Adversarial Networks, an unsupervised segmentation scheme is proposed for hematoxylin&eosin stained histopathology data.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134223813","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":"CoMACAV: Cooperative MAC Protocol for Autonomous Vehicles","authors":"Muhammet Ali Karabulut, A. Shah, H. Ilhan","doi":"10.1109/INISTA.2019.8778404","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778404","url":null,"abstract":"In this paper, a novel cooperative ad hoc medium access control (MAC) protocol is proposed for autonomous vehicles (AVs) referred to as CoMACAV. Three data transmission modes have been offered to increase the throughput which are direct transmission (DT), cooperative relaying (CR) and multi-hop relaying (MHR). The IEEE 802.11 standard defined mechanism only for direct communication which is not suitable for cooperative communication. Therefore, new control packets are introduced, and format of existing control packets is modified for cooperative communication. An analytical model based on the Markov chain model is presented. Simulation results show that the proposed CoMACAV protocol increases throughput.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129872644","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":"Comparison of CNN Tolerances to Intra Class Variety in Food Recognition","authors":"M. Taskiran, N. Kahraman","doi":"10.1109/INISTA.2019.8778355","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778355","url":null,"abstract":"Intra-class variation defines image variations occur between different images of one class. The similarity between samples within the same class is typically measured by the Intra-class Correlation coefficient. A high Intra-class Correlation Coefficient close to 1 indicates high similarity between samples from the same class where a low ICC close to zero means opposite. This paper deals with intra-class variety problem of Kegels Foodl0l dataset. 21 classes that have high ICC values were chosen. We have applied well known convolutional neural networks including ResNet, GoogleNet, MobileNet and VGG-Net with different train and test percentages in order to compare the recognition rates for the classes. Although the samples in Food101 dataset vary widely, GoogleNet (Inception V3) has the highest validation accuracy value with the lowest number of epochs.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122890529","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":"The Analysis of Text Categorization Represented With Word Embeddings Using Homogeneous Classifiers","authors":"Z. H. Kilimci, S. Akyokuş","doi":"10.1109/INISTA.2019.8778329","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778329","url":null,"abstract":"Text data mining is the process of extracting and analyzing valuable information from text. A text data mining process generally consists of lexical and syntax analysis of input text data, the removal of non-informative linguistic features and the representation of text data in appropriate formats, and eventually analysis and interpretation of the output. Text categorization, text clustering, sentiment analysis, and document summarization are some of the important applications of text mining. In this study, we analyze and compare the performance of text categorization by using different single classifiers, an ensemble of classifiers, a neural probabilistic representation model called word2vec on English texts. The neural probabilistic based model namely, word2vec, enables the representation of terms of a text in a new and smaller space with word embedding vectors instead of using original terms. After the representation of text data in new feature space, the training procedure is carried out with the well-known classification algorithms, namely multivariate Bernoulli naïve Bayes, support vector machines and decision trees and an ensemble algorithm such as bagging, random subspace and random forest. A wide range of comparative experiments are conducted on English texts to analyze the effectiveness of word embeddings on text classification. The evaluation of experimental results demonstrates that an ensemble of algorithms models with word embeddings performs better than other classification algorithms that uses traditional methods on English texts.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123774695","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 Hybrid Translation System from Turkish Spoken Language to Turkish Sign Language","authors":"Dilek Kayahan, Tunga Güngör","doi":"10.1109/INISTA.2019.8778347","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778347","url":null,"abstract":"Sign language is the primary tool of communication for deaf and mute people. It employs hand gestures, facial expressions, and body movements to state a word or a phrase. Like spoken languages, sign languages also vary among the regions and the cultures. The aim of this study is to implement a machine translation system to convert Turkish spoken language into Turkish Sign Language (TID). The advantages of rule-based and statistical machine translation techniques are combined into a hybrid translation system.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116013388","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}
Aydın Gerek, Mehmet Can Yüney, Erencan Erkaya, M. Ganiz
{"title":"Effects of Positivization on the Paragraph Vector Model","authors":"Aydın Gerek, Mehmet Can Yüney, Erencan Erkaya, M. Ganiz","doi":"10.1109/INISTA.2019.8778304","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778304","url":null,"abstract":"Natural language processing (NLP) is an important field of Artificial Intelligence. One of the fundamental problems in NLP is to create vector (distributed) representations of words so that vectors of words that have similar meaning lie closer in space. One of the most popular algorithms for creating these representations are word embedding models such as word2vec and fastText. Similarly the paragraph vector model (doc2vec) is used to create distributed representations of documents while simultaneously creating distributed representations for the words in these documents. These models create a dense, and low dimensional (usually in the low hundreds) vector representations which may include negative values. In this study we focus on these negative values and introduce a family of regularization methods in which document, word and/or context vectors of the paragraph vector model are forced to have only positive components. We measure its effects on several tasks; text classification, semantic similarity, and analogy tasks. Although positivization greatly increases the sparsity of the word embeddings, and should be expected to result in a loss of information, our results show that there is almost no reduction in the performance of the regularized embeddings in these tasks. We also observe an increase in the classification accuracy in one case. We foresee that these approaches can be beneficial in machine learning systems which require non-negative vectors.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132550883","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 Fractional Order Memristance Simulator Circuit Design","authors":"Zehra Gulru Cam Taskiran, M. Taskiran","doi":"10.1109/INISTA.2019.8778386","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778386","url":null,"abstract":"In this study, a previously defined integer order memristor element equation has been modified and a similar form of fractional order memristor is given. In the resulting mathematical equation, frequency dependent pinched hysteresis curves are obtained. A memristance simulator circuit providing the proposed mathematical relationship is proposed. The proposed circuit can be implemented with the integrated circuit elements commercially available in the market. In recent years, due to the non-volatile memory, nonlocality, and weak singularity characteristics, fractional calculus has been successfully applied to ANN s. Thus, this circuit can be useful for physical realization of the fractional order neural networks.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124025259","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":"Host-based Intrusion Detection Systems Inspired by Machine Learning of Agent-Based Artificial Immune Systems","authors":"C. Ou","doi":"10.1109/INISTA.2019.8778269","DOIUrl":"https://doi.org/10.1109/INISTA.2019.8778269","url":null,"abstract":"An adaptable agent-based IDS (AAIDS) inspired by the danger theory of artificial immune system is proposed. The learning mechanism of AAIDS is designed by emulating how dendritic cells (DC) in immune systems detect and classify danger signals. AG agent, DC agent and TC agent coordinate together and respond to system calls directly rather than analyze network packets. Simulations show AAIDS can determine several critical scenarios of the system behaviors where packet analysis is impractical.","PeriodicalId":262143,"journal":{"name":"2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124326624","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}