2015 26th International Workshop on Database and Expert Systems Applications (DEXA)最新文献

筛选
英文 中文
Incremental Data Uncertainty Handling Using Evidence Combination: A Case Study on Maritime Data Reasoning 基于证据组合的增量数据不确定性处理:以海事数据推理为例
Mena B. Habib, Brend Wanders, J. Flokstra, M. V. Keulen
{"title":"Incremental Data Uncertainty Handling Using Evidence Combination: A Case Study on Maritime Data Reasoning","authors":"Mena B. Habib, Brend Wanders, J. Flokstra, M. V. Keulen","doi":"10.1109/DEXA.2015.45","DOIUrl":"https://doi.org/10.1109/DEXA.2015.45","url":null,"abstract":"Semantic incompatibility is a conflict that occurs in the meanings of data. In this paper, we propose an approach for data cleaning by resolving semantic incompatibility. Our approach applies a dynamic and incremental enhancement of data quality. It checks the coherency/conflict of the newly recorded facts/relations against the existing ones. It reasons over the existing information and comes up with new discovered facts/relations. We choose maritime data cleaning as a validation scenario.","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":"125416310","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
An Improved K-Means Algorithm for DNA Sequence Clustering DNA序列聚类的改进K-Means算法
Nassima Aleb, Narimane Labidi
{"title":"An Improved K-Means Algorithm for DNA Sequence Clustering","authors":"Nassima Aleb, Narimane Labidi","doi":"10.1109/DEXA.2015.27","DOIUrl":"https://doi.org/10.1109/DEXA.2015.27","url":null,"abstract":"In recent years, billions of DNA and protein sequences are subject to sequencing. However, few of them have known structures and functions, most remain unknown. The solution to this problem is to link sequences between them rather than revisit each new sequence independently of other sequences. Thus, if we manage to assimilate a sequence S1 to another sequence S2 or to a group of previously studied sequences, this will allow us to directly deduce the structure, functions and phylogenetic classification of S2. The purpose of this work is to adapt clustering methods to the specific problem of classification of DNA sequences. We introduce a new method based on K-means clustering for DNA sequences clustering. We begin by explaining and motivating our approach, then we present obtained results.","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":"128852338","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
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学术官方微信