R. Çelebi, Vahab Mostafapour, Erkan Yasar, Özgür Gümüs, Oğuz Dikenelli
{"title":"Prediction of Drug-Drug Interactions Using Pharmacological Similarities of Drugs","authors":"R. Çelebi, Vahab Mostafapour, Erkan Yasar, Özgür Gümüs, Oğuz Dikenelli","doi":"10.1109/DEXA.2015.23","DOIUrl":"https://doi.org/10.1109/DEXA.2015.23","url":null,"abstract":"Detection of potential Drug-Drug Interactions (DDIs) can reduce the costs associated drug administration and drug developments. It can also prevent serious adverse drug reactions possibly causing death. In this work, we have employed Rooted Page Rank algorithm in DDI network with weights calculated using therapeutic, genomic, phenotypic and chemical similarity of drugs to discover unknown DDIs. Weighting approach is inspired from the method used in collaborative filtering to score for recommendation of an item to a user based on similarities of users or items. Different than our previous work, this method enables the integration of global structure of DDI network with similarity scores of interactions to predict new DDIs. We obtained significant performance enhancement both in terms of AUC and Precision on DDI networks extracted from Drugbank. Interestingly some weighting scheme increases AUC and decreases precision such as in case of applying chemical similarity weighting. However, weighting with drug genomic similarities decreases AUC and raises precision. Therapeutic and phenotypic similarity weighting has increased performance of both in AUC and precision.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123174746","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":"Applying Arabic Stemming Using Query Expansion","authors":"Abdusalam F. A. Nwesri, Hasan A. H. Alyagoubi","doi":"10.1109/DEXA.2015.71","DOIUrl":"https://doi.org/10.1109/DEXA.2015.71","url":null,"abstract":"The process of conflating different Arabic word formats to their stem or root is called stemming. Indexing text collection using stems or roots has been reported to be superior to using original word formats. However, the Arabic text stemming has negative effects on words. It conflates words with different meaning under one index term. This occurs frequently in Arabic when using stems and it becomes more frequent when choosing roots to index the collection. Furthermore, search engine whose index is constructed using a particular stemmer makes it a stemmer-dependent engine. In this paper, we show how we can still use stemming to reach the same results without indexing the stemmed text. Original words have been indexed, and a stemmer used to extract word variants and add them to the user query. Apart from making our search operation stemmer-independent, we proof that our approach is as good as light stemming and is significantly better than root stemming.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129444227","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. Nikander, Markku Koistinen, M. Laajalahti, L. Pesonen, A. Ronkainen, P. Suomi
{"title":"Farm Information Management Infrastructures in the Future","authors":"J. Nikander, Markku Koistinen, M. Laajalahti, L. Pesonen, A. Ronkainen, P. Suomi","doi":"10.1109/DEXA.2015.38","DOIUrl":"https://doi.org/10.1109/DEXA.2015.38","url":null,"abstract":"In the future, the farm will turn into more and more data-rich environment. Thus, in order to successfully gather, store, analyze, and exploit this information in planning and decision making, sophisticated ICT infrastructures are required. In this work we will delve into the theory and requirements such infrastructure has, as well as introduce the Cropinfra system as a prototype of such infrastructure.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"8 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120911916","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}
José-Lázaro Martínez-Rodríguez, I. Lopez-Arevalo, Ana B. Ríos-Alvarado
{"title":"A Classification of Challenges in the Semantic Web Based on the General Architecture","authors":"José-Lázaro Martínez-Rodríguez, I. Lopez-Arevalo, Ana B. Ríos-Alvarado","doi":"10.1109/DEXA.2015.53","DOIUrl":"https://doi.org/10.1109/DEXA.2015.53","url":null,"abstract":"The Semantic Web has the purpose of making information available and understandable for computers and humans. However, some issues and challenges are present during this process. This paper presents a proposal of challenges in the Semantic Web. In this sense, we have considered an organization of three categories based on the general architecture proposed by Berners-Lee: Representation, Reasoning/Querying, and Quality. We also mention some methods for partially solving these challenges, and drawbacks of using machine learning approaches.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116149243","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}
Youhyun Shin, Yeonchan Ahn, Heesik Jeon, Sang-goo Lee
{"title":"Consensus Similarity Measure for Short Text Clustering","authors":"Youhyun Shin, Yeonchan Ahn, Heesik Jeon, Sang-goo Lee","doi":"10.1109/DEXA.2015.65","DOIUrl":"https://doi.org/10.1109/DEXA.2015.65","url":null,"abstract":"Measuring semantic similarity between short texts is challenging because the meaning of short texts may vary dramatically even by a few words due to their limited lengths. In this paper, we propose a novel similarity measure for terms that allows better clustering performance than the state-of-the-art method. To achieve such performance, we incorporate knowledge-based and corpus-based term similarity measures in order to exploit advantages of both approaches. We apply our method to a dialog-utterance dataset, which consists of short dialog texts. Empirical study shows that the proposed method outperforms one of the state-of-the-art clustering algorithms for short text clustering.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126223207","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}
Lena Hettinger, Martin Becker, Isabella Reger, Fotis Jannidis, A. Hotho
{"title":"Genre Classification on German Novels","authors":"Lena Hettinger, Martin Becker, Isabella Reger, Fotis Jannidis, A. Hotho","doi":"10.1109/DEXA.2015.62","DOIUrl":"https://doi.org/10.1109/DEXA.2015.62","url":null,"abstract":"The study of German literature is mostly based on literary canons, i.e., small sets of specifically chosen documents. In particular, the history of novels has been characterized using a set of only 100 to 250 works. In this paper we address the issue of genre classification in the context of a large set of novels using machine learning methods in order to achieve a better understanding of the genre of novels. To this end, we explore how different types of features affect the performance of different classification algorithms. We employ commonly used stylometric features, and evaluate two types of features not yet applied to genre classification, namely topic based features and features based on social network graphs and character interaction. We build features on a data set of close to 1700 novels either written in or translated into German. Even though topics are often considered orthogonal to genres, we find that topic based features in combination with support vector machines achieve the best results. Overall, we successfully apply new feature types for genre classification in the context of novels and give directions for further research in this area.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123857494","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}
Emanuel Weitschek, G. Fiscon, G. Felici, P. Bertolazzi
{"title":"GELA: A Software Tool for the Analysis of Gene Expression Data","authors":"Emanuel Weitschek, G. Fiscon, G. Felici, P. Bertolazzi","doi":"10.1109/DEXA.2015.26","DOIUrl":"https://doi.org/10.1109/DEXA.2015.26","url":null,"abstract":"Leveraging advances in transcriptome profiling technologies (RNA-seq), biomedical scientists are collecting ever-increasing gene expression profiles data with low cost and high throughput. Therefore, automatic knowledge extraction methods are becoming essential to manage them. In this work, we present GELA (Gene Expression Logic Analyzer), a novel pipeline able to perform a knowledge discovery process in gene expression profiles data of RNA-seq. Firstly, we introduce the RNA-seq technologies, then, we illustrate our gene expression profiles data analysis method (including normalization, clustering, and classification), and finally, we test our knowledge extraction algorithm on the public RNA-seq data sets of Breast Cancer and Stomach Cancer, and on the public microarray data sets of Psoriasis and Multiple Sclerosis, obtaining in both cases promising results.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122587765","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":"Cloud Service Matchmaking Approaches: A Systematic Literature Survey","authors":"Begüm Ilke Zilci, Mathias Slawik, Axel Küpper","doi":"10.1109/DEXA.2015.50","DOIUrl":"https://doi.org/10.1109/DEXA.2015.50","url":null,"abstract":"Service matching concerns finding suitable services according to the service requester's requirements, which is a complex task due to the increasing number and diversity of cloud services available. Service matching is discussed in web services composition and user oriented service marketplaces contexts. The suggested approaches have different problem definitions and have to be examined closer in order to identify comparable results and to find out which approaches have built on the former ones. One of the most important use cases is service requesters with limited technical knowledge who need to compare services based on their QoS requirements in cloud service marketplaces. Our survey examines the service matching approaches in order to find out the relation between their context and their objectives. Moreover, it evaluates their applicability for the cloud service marketplaces context.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"399 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122889979","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":"Topic Identification of Noisy Arabic Texts Using Graph Approaches","authors":"K. Abainia, Siham Ouamour-Sayoud, H. Sayoud","doi":"10.1109/DEXA.2015.63","DOIUrl":"https://doi.org/10.1109/DEXA.2015.63","url":null,"abstract":"This paper deals with the problem of automatic topic identification of noisy Arabic texts. Actually, there exist several works in this field based on statistical and machine learning approaches for different text categories. Unfortunately, most of the proposed methods are effective in clean and long texts. In this research work, we use an in-house dataset of noisy Arabic texts, which are collected from several Arabic discussion forums related to 6 topics. In this investigation, we propose a graph approach called LIGA for topic identification task. This approach was firstly introduced for language identification field. Moreover, we propose two other extensions in order to enhance LIGA performances. The experiments undergone on the Arabic dataset have shown quite interesting performances, reaching about 98% of accuracy.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123970859","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. Reyes-Ortíz, Maricela Claudia Bravo, Omar E. Padilla
{"title":"Phrase-Based Semantic Textual Similarity for Linking Researchers","authors":"J. Reyes-Ortíz, Maricela Claudia Bravo, Omar E. Padilla","doi":"10.1109/DEXA.2015.54","DOIUrl":"https://doi.org/10.1109/DEXA.2015.54","url":null,"abstract":"Researchers need to establish networks with colleagues that work similar topics, frequently, they are looking similar works by exploring free text in scientific publications in order to update them with the recent state of the art. They read the abstracts and decide whether or not it is a related and relevant work. Therefore, this paper presents an approach for linking researchers based on measuring the similarity between the abstracts of their scientific publications in English. Our approach discovers ontological relationships between free text scientific publications using statistical and semantic similarity measures. An evaluation of a gold standard data set is presented, it has shown an average of 0.6399 for Pearson product-moment correlation coefficient.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129667187","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}