{"title":"The di.me Trust Approach for Supporting Collaborative Scenarios","authors":"M. Heupel, Mohamed Bourimi, D. Kesdogan","doi":"10.1109/DEXA.2014.70","DOIUrl":"https://doi.org/10.1109/DEXA.2014.70","url":null,"abstract":"The European research project digital. me (di.me) developed the di.me userware, a social networking application which informs users' privacy by means of an adaptive trust metric. Information spread over different social networks is semantically aggregated and managed with intelligent user interfaces and semantic cores. Due to the nature of addressed collaborative scenarios, an elaboration and extension of trust definitions were required to cover different aspects. In this paper we report on the achievements of di.me regarding the developed trust-enhancing technologies. We primarily address the challenges that led to an extended trust definition followed in di.me. We also show how the respective trust metric was successively refined over the three years of the project by evaluating it within different collaborative scenarios with hundred of users at different events. Special focus lies on two selected scenarios from leisure and professional life, which demonstrate exemplary how trust-based privacy advisory was applied in di.me.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133067219","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":"Honeypot Effectiveness in Different Categories of Attacks on Wireless Sensor Networks","authors":"J. Markert, M. Massoth","doi":"10.1109/DEXA.2014.72","DOIUrl":"https://doi.org/10.1109/DEXA.2014.72","url":null,"abstract":"Wireless sensor networks (WSN) are entering the daily life of many. Like wireless LAN before, these are a new playground for developers, but also offer new ways for misuse of this technology. For the improvement of security and to get more valuable data about new attacks, a honeypot for WSNs is in development. This paper presents an effectiveness analysis of a honeypot for WSN and shows detection capabilities in the categories of known and unknown attacks.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131948277","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":"Toward Efficient Variant Calling Inside Main-Memory Database Systems","authors":"Sebastian Dorok, S. Breß, G. Saake","doi":"10.1109/DEXA.2014.25","DOIUrl":"https://doi.org/10.1109/DEXA.2014.25","url":null,"abstract":"Mutations in genomes indicate predisposition for diseases or effects on efficacy of drugs. A variant calling algorithm determines possible mutations in sample genomes. Afterwards, scientists have to decide about the impact of these mutations. Certainly, many different variant calling algorithms exist that generate different outputs due to different sequence alignments as input and parameterizations of variant calling algorithms. Thus, a combination of variant calling results is necessary to provide a more complete set of mutations than single algorithm runs can provide. Therefore, a system is required that facilitates the integration and parameterization of different variant calling algorithms and processing of different sequence alignments. Moreover, against the backdrop of ever increasing amounts of available genome sequencing data, such a system must provide matured database management capabilities to enable flexible and efficient analyses while keeping data consistent. In this paper, we present a first approach to integrate variant calling into a main-memory database management system that allows for calling variants via SQL.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404383","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}
F. Lopes, H. Algarvio, J. Sousa, H. Coelho, T. Pinto, Gabriel Santos, Z. Vale, Isabel Praça
{"title":"Multi-agent Simulation of Bilateral Contracting in Competitive Electricity Markets","authors":"F. Lopes, H. Algarvio, J. Sousa, H. Coelho, T. Pinto, Gabriel Santos, Z. Vale, Isabel Praça","doi":"10.1109/DEXA.2014.40","DOIUrl":"https://doi.org/10.1109/DEXA.2014.40","url":null,"abstract":"Traditional vertically integrated power utilities around the world have evolved from monopoly structures to open markets that promote competition among suppliers and provide consumers with a choice of services. Market forces drive the price of electricity and reduce the net cost through increased competition. Electricity can be traded in both organized markets or using forward bilateral contracts. This article focuses on bilateral contracts and describes some important features of an agent-based system for bilateral trading in competitive markets. Special attention is devoted to the negotiation process, demand response in bilateral contracting, and risk management. The article also presents a case study on forward bilateral contracting: a retailer agent and a customer agent negotiate a 24h-rate tariff.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125339193","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":"Improving Activity Recognition via Satellite Imagery and Commonsense Knowledge","authors":"N. Bicocchi, Damiano Fontana, F. Zambonelli","doi":"10.1109/DEXA.2014.48","DOIUrl":"https://doi.org/10.1109/DEXA.2014.48","url":null,"abstract":"Activity recognition gained relevance in recent years because of its numerous applications. Despite relevant improvements, current classifiers are still inaccurate in several usage conditions or require time-consuming training. In this paper we show how localisation data and common sense knowledge could be used to improve activity recognition. More specifically, given the GPS position of the user, we both gather (i) a list of neighbouring commercial activities using a reverse geo-coding service and (ii) classify the satellite image of the area with state-of-the-art techniques. The approach maps classification labels produced by the three classifiers (i.e., activity, reverse geocoding localisation, satellite imagery localisation) to concepts within the ConceptNet network for the sake of improving activity recognition accuracy.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132172454","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":"Text Retrieval Based on Dyadic Conceptual Projection","authors":"Sonia Alouane-Ksouri, Minyar Sassi Hidri, Kamel Barkaoui","doi":"10.1109/DEXA.2014.50","DOIUrl":"https://doi.org/10.1109/DEXA.2014.50","url":null,"abstract":"This work exploits the use of Triadic Concept Analysis (TCA) for document retrieval to efficiently answer users' queries. The proposed conceptual analysis aims at describing the documents according to three hierarchical levels with a triadic computing model. It is based on normalisation and prototyping, which, by projection, induce a formal dyadic context. This representation has enabled us to visualize triadic concepts associated with the documents, sentences and words through the construction of fuzzy concept lattice. The lattices generated are then used to organize documents in a hierarchical structure to facilitate retrieval process.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"213 4-5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018137","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 Light-Weight Visualization Tool for Support Vector Machines","authors":"SeungJin Lim","doi":"10.1109/DEXA.2014.34","DOIUrl":"https://doi.org/10.1109/DEXA.2014.34","url":null,"abstract":"The family of Support Vector Machines (SVM) is one of the most popular supervised learning algorithms today. It is renowned for its outstanding performance and accuracy in many different application domains. In this paper, we present a visualization tool to enhance the utility of SVM. It provides access to the distance measure of each data point to the optimal hyperplane. It also provides the distribution of distance values in the feature space. %The tool also provides the interactive features of panning, zooming and picking, which are useful in inspecting misclassified data points. The tool also incorporates capabilities for panning, zooming, and picking. These interactive features are useful for inspecting misclassified data points to improve the performance of SVM. The tool was used in a cancer detection project using FT-IR spectra. Visualization of the spectra led to the detection and removal of noisy spectra.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133256490","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}
Edgardo Ferretti, M. Errecalde, Maik Anderka, Benno Stein
{"title":"On the Use of Reliable-Negatives Selection Strategies in the PU Learning Approach for Quality Flaws Prediction in Wikipedia","authors":"Edgardo Ferretti, M. Errecalde, Maik Anderka, Benno Stein","doi":"10.1109/DEXA.2014.52","DOIUrl":"https://doi.org/10.1109/DEXA.2014.52","url":null,"abstract":"Learning from positive and unlabeled examples (PU learning) has proven to be an effective method in several Web mining applications. In particular, in the 1st International Competition on Quality Flaw Prediction in Wikipedia in 2012, a tailored PU learning approach performed best amongst the competitors. A key feature of that approach is the introduction of sampling strategies within the original PU learning procedure. The paper in hand revisits the winner approach of 2012 and elaborates on neglected aspects in order to provide evidence for the usefulness of sampling in PU learning. In this regard, we propose a modification to this PU learning approach, and we show how the different sampling strategies affect the flaw prediction effectiveness. Our analysis is based on the original evaluation corpus of the 2012-competition on quality flaw prediction. A main outcome is that under the best sampling strategy, our new modified version of PU learning increases in average the flaw prediction effectiveness by 18.31%, when compared against the winning approach of the competition.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123385155","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}
Andreas Bögl, Christine Natschläger, M. Karlinger, M. Schrefl
{"title":"Exploiting Process Patterns and Process Instances to Support Adaptability of Dynamic Business Processes","authors":"Andreas Bögl, Christine Natschläger, M. Karlinger, M. Schrefl","doi":"10.1109/DEXA.2014.46","DOIUrl":"https://doi.org/10.1109/DEXA.2014.46","url":null,"abstract":"The traditional approach for business process modeling is rather static, since all possible process flows must be specified at design-time. This restricts the possibility of the user to react to unexpected situations, so conventional business processes cannot represent the flexible way in which human actors would handle discrepancies between real-world and computerized activities. This paper presents a new approach for dynamic business processes that automatically adapts to changed circumstances based on domain-specific process patterns and an evaluation of related process instances. The presented approach not only finds potential alternatives for failed activities, it also ranks them by exploiting process knowledge implicitly captured by former business process execution.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125359654","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}
Gebrekirstos G. Gebremeskel, Jiyin He, A. D. Vries, Jimmy J. Lin
{"title":"Cumulative Citation Recommendation: A Feature-Aware Comparison of Approaches","authors":"Gebrekirstos G. Gebremeskel, Jiyin He, A. D. Vries, Jimmy J. Lin","doi":"10.1109/DEXA.2014.49","DOIUrl":"https://doi.org/10.1109/DEXA.2014.49","url":null,"abstract":"In this work, we conduct a feature-aware comparison of approaches to Cumulative Citation Recommendation (CCR), a task that aims to filter and rank a stream of documents according to their relevance to entities in a knowledge base. We conducted experiments starting with a big feature set, identified a powerful subset and applied it to comparing classification and learning-to-rank algorithms. With few set of powerful features, we achieve better performance than the state-of-the-art. Surprisingly, our findings challenge the previously known preference of learning-to-rank over classification: in our study, the CCR performance of the classification approach outperforms that using learning-to-rank. This indicates that comparing two approaches is problematic due to the interplay between the approaches themselves and the feature sets one chooses to use.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131518860","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}