发布求助
文献互助 智能选刊 最新文献

2014 25th International Workshop on Database and Expert Systems Applications最新文献

筛选
英文 中文
New Method Combining Feature Weighting and Feature Selection for Protein Classification 结合特征加权和特征选择的蛋白质分类新方法
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.27
S. A. Mohamed, F. Mhamdi
{"title":"New Method Combining Feature Weighting and Feature Selection for Protein Classification","authors":"S. A. Mohamed, F. Mhamdi","doi":"10.1109/DEXA.2014.27","DOIUrl":"https://doi.org/10.1109/DEXA.2014.27","url":null,"abstract":"The primary biological data structure is represented as a string of characters. Several issues in bioinformatics are interested in handling this type of data. Such as the alignment of biological sequences, the 2D/3D structure prediction and detection of anomalies in the genes. Our work is integrated into the framework of knowledge discovery from biological data (KDBD) process and specifically the pre-processing phase. We are interested in protein classification using features extracted from their primary structures. Data mining techniques require a data matrix: Individual X Features (sequence X n-grams, in our case), so we understand the importance of the type of features used, their number and their weighting in the protein classification problem. In this paper we first present a new method for feature weighting based on dynamic programming of the Smith/Waterman local alignment algorithm, then a new method of feature selection. We used the SVM classifier to calculate the error rates. The results have shown the effectiveness of this work, especially by comparing it to previous works.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"179 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":"128165097","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}
引用次数: 3
Towards an Automated Approach to Extract and Compare Fictional Networks: An Initial Evaluation 迈向自动提取和比较虚构网络的方法:初步评估
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.58
M. Trovati, James Brady
{"title":"Towards an Automated Approach to Extract and Compare Fictional Networks: An Initial Evaluation","authors":"M. Trovati, James Brady","doi":"10.1109/DEXA.2014.58","DOIUrl":"https://doi.org/10.1109/DEXA.2014.58","url":null,"abstract":"Within the field of Digital Humanities, fictional networks are defined by the social interactions among characters, capturing unique features associated with each different textual source. The ability to automatically extract, analyse, and assess such properties would open new research directions, and lead to relevant and important results. However, these are challenging tasks which require a multi-disciplinary approach due to their inherent complexity. In this paper, we will describe the initial implementation of a system to address the above. This is part of an ongoing research investigation aiming to define and implement a similarity measure to compare specific properties associated with fictional networks extracted from across different genres and sources, as well as from different historical periods. The preliminary evaluation clearly shows the potential of our approach, as well as the applications to a variety of multi-disciplinary research fields.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"33 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131519806","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}
引用次数: 5
Agent-Based Simulation of Interrelated Wholesale Electricity Markets 基于agent的相互关联的电力批发市场模拟
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.35
Andreas Bublitz, Philipp Ringler, M. Genoese, D. Keles, W. Fichtner
{"title":"Agent-Based Simulation of Interrelated Wholesale Electricity Markets","authors":"Andreas Bublitz, Philipp Ringler, M. Genoese, D. Keles, W. Fichtner","doi":"10.1109/DEXA.2014.35","DOIUrl":"https://doi.org/10.1109/DEXA.2014.35","url":null,"abstract":"In recent years, the increasing electricity generation from fluctuating renewable energy sources has created quite different challenges faced by operators of conventional power plants in the short and long run. In the dynamic and complex environment of electricity markets, model-based analysis can provide valuable support for decision makers. In this paper, a detailed agent-based simulation model is presented. Agent-based simulation as one particular modeling approach is especially suitable for modeling wholesale electricity markets with market participants making individual decisions on interrelated markets. The presented model is able to simulate wholesale electricity markets including relevant interrelations with respect to time and point of delivery of electrical energy. Long-term developments can be analyzed using an integrated investment module for generation capacity by supply agents. Two recent model extensions, namely the implementation of a market coupling algorithm and of an intraday market, and their exemplary applications are illustrated in the paper.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"14 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":"126653894","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}
引用次数: 2
FT-IR Spectra Analysis toward Cancer Detection FT-IR光谱分析在癌症检测中的应用
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.31
SeungJin Lim, M. Cohenford
{"title":"FT-IR Spectra Analysis toward Cancer Detection","authors":"SeungJin Lim, M. Cohenford","doi":"10.1109/DEXA.2014.31","DOIUrl":"https://doi.org/10.1109/DEXA.2014.31","url":null,"abstract":"Computer-based research on cancer detection utilizes various types of data including MRI images, proteins and DNA. In this work, we investigate Fourier-transform infrared (FT-IR) spectra obtained from colon tissues as an alternative method to detect cancer. Fourier-transform infrared (FT-IR) spectra reflect the chemical composition of a source medium and hence provide utility for a wide range of applications including biology and medical science. They are characterized by high dimensionality and being prone to noise. In this paper, we present a study of machine learning algorithms to investigate the validity of FT-IR spectra for cancer detection. The Back-propagation neural network, the Decision tree, the Adaboost with decision tree, and the Support Vector Machine (SVM) algorithms were applied to 894 spectra in supervised learning. Of these algorithms, SVM held the most promise in binary classification. This result demonstrated the potential of FT-IR spectra in cancer research and the potential of SVM in spectra analysis.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"70 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":"123951177","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}
引用次数: 1
Classifying Bacterial Genomes with Compact Logic Formulas on k-Mer Frequencies 基于k-Mer频率的紧凑逻辑公式对细菌基因组进行分类
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.30
Emanuel Weitschek, F. Cunial, G. Felici
{"title":"Classifying Bacterial Genomes with Compact Logic Formulas on k-Mer Frequencies","authors":"Emanuel Weitschek, F. Cunial, G. Felici","doi":"10.1109/DEXA.2014.30","DOIUrl":"https://doi.org/10.1109/DEXA.2014.30","url":null,"abstract":"Alignment-free methods are routinely used in largescale, gene-independent phylogeny reconstruction. Such methods measure the similarity of two genomes by comparing the frequency of all their distinct substrings of length k. In this paper we apply logic data mining methods to discover a minimal subset of k-mers whose frequency information is sufficient to reliably classify bacterial genomes into the corresponding taxa. Specifically, we extract separating, disjunctive normal form logic formulas, predicated on the discretized relative frequencies of few selected k-mers in the genomes. Such formulas are derived using a combination of feature selection, integer programming and adhoc heuristics. Interestingly, we reliably classify strain genomes at multiple taxonomic levels using extremely compact formulas, each involving just few k-mers. Classification performance is promising, suggesting that the phylogenetic signal of each class is strong enough and that our discretization and feature selection approach is effective and robust in identifying it.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"16 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":"115986857","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}
引用次数: 6
Applicability of Prediction Markets in Information Security Risk Management 预测市场在信息安全风险管理中的适用性
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.66
Pankaj Pandey, E. Snekkenes
{"title":"Applicability of Prediction Markets in Information Security Risk Management","authors":"Pankaj Pandey, E. Snekkenes","doi":"10.1109/DEXA.2014.66","DOIUrl":"https://doi.org/10.1109/DEXA.2014.66","url":null,"abstract":"Information security practitioners face a challenging task of assessing the information security risks. The lack of complete information about the vulnerabilities in the system leads to the problem of information asymmetry between the security stakeholders. This leads to difficulty in assessing the severity of vulnerabilities and estimation of the impact of an attack. There are at least two approaches to deal with information asymmetry in the information security market, namely market methods and financial instruments. This paper focuses on a relatively novel method: prediction markets, to deal with the information asymmetry problem in information security domain. In this paper, we examine the applicability of prediction markets in forecasting and assessment of information security events. We describe the usefulness of prediction markets in prediction of vulnerabilities, setting values for vulnerabilities and threats, and as a source of aggregating security information for pricing of cyber-financial instruments, such as cyber-insurance.","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":"130619282","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}
引用次数: 14
Enhancing Patient Safety through Human-Computer Information Retrieval on the Example of German-Speaking Surgical Reports 以德语外科报告为例，人机信息检索提高患者安全
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.53
Christof Stocker, L. Marzi, C. Matula, Johannes Schantl, G. Prohaska, Alberto Brabenetz, Andreas Holzinger
{"title":"Enhancing Patient Safety through Human-Computer Information Retrieval on the Example of German-Speaking Surgical Reports","authors":"Christof Stocker, L. Marzi, C. Matula, Johannes Schantl, G. Prohaska, Alberto Brabenetz, Andreas Holzinger","doi":"10.1109/DEXA.2014.53","DOIUrl":"https://doi.org/10.1109/DEXA.2014.53","url":null,"abstract":"In view of the high number of deaths and complication rates of major surgical procedures worldwide, surgical safety is described as a substantial global public-health concern. Naturally, patient safety has become an international priority. The increasing amount of electronically available clinical documents holds great potential for the computational analysis of large repositories. However, most of this data is in textual form and the clinical domain is a challenging field for the appliance of natural language processing. This is particularly the case if you deal with a language other than English, due to the little attention from the international research community. In this project, we are concerned with the utilization of a Germanspeaking operative report repository for the purpose of risk management and patient safety research. In this particular paper we focus on the description of our information retrieval approach. We investigated the thought process of a domain expert in order to derive his information of interest and describe a facet-based way to navigate this kind of information in the form of extracted phrases. Initial results and feedback has been very promising, but a formal evaluation is still missing.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"43 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":"116358011","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}
引用次数: 10
An(other) Exercise in Measuring the Strength of Source Code Obfuscation 测量源代码混淆强度的一项(其他)练习
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.69
Yan Zhuang, Mykola Protsenko, Tilo Müller, F. Freiling
{"title":"An(other) Exercise in Measuring the Strength of Source Code Obfuscation","authors":"Yan Zhuang, Mykola Protsenko, Tilo Müller, F. Freiling","doi":"10.1109/DEXA.2014.69","DOIUrl":"https://doi.org/10.1109/DEXA.2014.69","url":null,"abstract":"We experimentally compare the strength of different source code obfuscation techniques by measuring the performance of human analysts. We describe an experimental setup by which it is possible to compare different obfuscation techniques with each other. As techniques, we considered name overloading and opaque predicates, as well as the combination of both. While the results are interesting and show that increased levels of obfuscation decrease the performance of humans, only one result (the use of name overloading) was statistically significant.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"575 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":"116260639","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}
引用次数: 2
Keyphrase Extraction Abstracts Instead of Full Papers 关键词提取摘要而不是全文
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.57
S. Popova, V. Danilova
{"title":"Keyphrase Extraction Abstracts Instead of Full Papers","authors":"S. Popova, V. Danilova","doi":"10.1109/DEXA.2014.57","DOIUrl":"https://doi.org/10.1109/DEXA.2014.57","url":null,"abstract":"In the present paper we consider keyphrase extraction problem from scientific articles. Finding an appropriate solution is important for the organization of fast navigation in databases, indexing, clustering and classification of academic papers. The base collection includes keyphrases selected by the experts for each text (SemEval2010). It is shown that the use of abstracts instead of full texts allows to improve the results obtained by processing full texts or abstracts with introduction and conclusion section. Our approach uses the extraction of keyphrases with linguistic patterns (part of speech-based), patterns are built on the basis of an auxiliary dataset. The use of abstracts in this approach allows to reduce the number of words sequences extracted with patterns, as compared to the use of full texts. It allows to simplify or totally omit the ranking stage. Ranking is usually needed, because out of many keyphrases candidates we have to choose only 10-15. This stage is the most difficult and its effectiveness depends on the number of the selected candidates to keyphrases. The use of abstracts makes it possible to considerably reduce the number of candidate phrases and at the same time yields high recall.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"52 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":"125887962","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}
引用次数: 1
Similarity Search of Human Behavior Processes Using Extended Linked Data Semantic Distance 基于扩展关联数据语义距离的人类行为过程相似性搜索
2014 25th International Workshop on Database and Expert Systems Applications Pub Date : 2014-09-07 DOI: 10.1109/DEXA.2014.47
Zhang Zuo, Hung-Hsuan Huang, K. Kawagoe
{"title":"Similarity Search of Human Behavior Processes Using Extended Linked Data Semantic Distance","authors":"Zhang Zuo, Hung-Hsuan Huang, K. Kawagoe","doi":"10.1109/DEXA.2014.47","DOIUrl":"https://doi.org/10.1109/DEXA.2014.47","url":null,"abstract":"Large amounts of sensed data on human behaviors have been collected, and technologies for modeling human behavior have recently been developed. However, the data collected are difficult to analyze and reuse. Thus, in order to mine various aspects of human behaviors, development of an appropriate semantic similarity measure of human behaviors is essential. In this paper, we propose a novel similarity search method that, given a particular behavior, searches for a similar behavior. The proposed method extends the semantic distance calculation method Linked Data Semantic Distance (LDSD) and applies it to human behavior distance calculations. Semantic distance measures for similarity search of human behaviors has, to the best of our knowledge, never been studied before, whereas many studies on similarity measures for linked data, graphs, and processes have been proposed. Our extended LDSD extends distance calculation from three standpoints: temporal, granularity, and content. We present the details of these extensions along with examples, and compare our extended LDSD to the original LDSD and another existing method.","PeriodicalId":291899,"journal":{"name":"2014 25th International Workshop on Database and Expert Systems Applications","volume":"28 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":"134528555","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}
引用次数: 6
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书