2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)最新文献

筛选
英文 中文
Timeline and episode-structured clinical data: Pre-processing for Data Mining and analytics 时间线和情节结构的临床数据:数据挖掘和分析的预处理
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495618
Jing Lu, Alan Hales, D. Rew, M. Keech
{"title":"Timeline and episode-structured clinical data: Pre-processing for Data Mining and analytics","authors":"Jing Lu, Alan Hales, D. Rew, M. Keech","doi":"10.1109/ICDEW.2016.7495618","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495618","url":null,"abstract":"Data Mining has been used in the healthcare domain for diagnosis and treatment analysis, resource management and fraud detection. It brings a set of tools and techniques that can be applied to large-scale patient data to discover underlying patterns and provide healthcare professionals an additional source of knowledge for making decisions. The Southampton Breast Cancer Data System (SBCDS) containing some 16,000 timeline-structured records is a visually rich and highly intuitive system for the manual and automated transfer of demographic, pathology and treatment data into an episode-based structure. While expansion of the data mining capability in SBCDS is one of the objectives of our research, real-world patient data is generally incomplete, inconsistent and containing errors. This case study will focus on the data pre-processing stage in order to clean the raw data and prepare the final dataset for use in data mining and analytics. Some initial results are given for sequential patterns mining and classification which highlight the advantages of the approach.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123559527","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}
引用次数: 4
Why-query support in graph databases 为什么图形数据库支持查询
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495652
E. Vasilyeva
{"title":"Why-query support in graph databases","authors":"E. Vasilyeva","doi":"10.1109/ICDEW.2016.7495652","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495652","url":null,"abstract":"Graph databases implementing a property graph model allow storing of heterogeneous information in the form of a graph and support complex graph-specific queries like shortest path, pattern matching, etc. Their flexibility and a rich spectrum of supported queries make it difficult for a user to create correct queries. As a consequence, a user can get unexpected results like too many, too few, or even empty answers. This research aims at providing a basic debugging functionality to a user in order to discover the reasons of a failure and to fix a query. The main goals of this thesis include (1) studying the reasons of a failure in terms of a graph with the focus on cardinality-based problems like too few, too many, and empty results; (2) developing methods for query refinement in order to derive expected answers with considering specifics of a property graph model, and (3) proposing a set of strategies for integrating user intention into the debugging process.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122354692","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
Data mining for better healthcare: A path towards automated data analysis? 为更好的医疗保健进行数据挖掘:通往自动化数据分析的道路?
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495617
T. Cerquitelli, Elena Baralis, L. Morra, S. Chiusano
{"title":"Data mining for better healthcare: A path towards automated data analysis?","authors":"T. Cerquitelli, Elena Baralis, L. Morra, S. Chiusano","doi":"10.1109/ICDEW.2016.7495617","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495617","url":null,"abstract":"In today's world, large volumes of medical data are being continuously generated, but their value is severely undermined by our inability to translate them into knowledge and, ultimately, actions. Data mining techniques allow the extraction of previously unknown interesting patterns from large datasets, but their complexity limits their practical diffusion. Data-driven analysis is a multi-step process, in which health care professionals define analysis goals and assess extracted knowledge, while computer scientists tackle the non trivial task of driving the miner system analysis activity. This paper addresses the mining activity from a different perspective. We believe that mining systems should be able to devise which knowledge could be most interesting to users and extract actionable knowledge from large medical datasets, with minimal user intervention. More specifically, mining systems should be capable of (i) devising viable end-goals for a specific dataset (i.e., that yield actionable knowledge to the user and are feasible given the dataset characteristics and size), based on the expertise acquired during the analysis of previous datasets, and (ii) extracting a manageable set of knowledge. Automated data analysis should fuel the next generation of medical mining systems, thus enabling users to automatically mine massive data repositories.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114154597","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
Querying and mining geo-textual data for exploration: Challenges and opportunities 查询和挖掘用于勘探的地理文本数据:挑战和机遇
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495640
G. Cong, Kaiyu Feng, Kaiqi Zhao
{"title":"Querying and mining geo-textual data for exploration: Challenges and opportunities","authors":"G. Cong, Kaiyu Feng, Kaiqi Zhao","doi":"10.1109/ICDEW.2016.7495640","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495640","url":null,"abstract":"Geo-textual data (e.g., geo-tagged tweets) is becoming increasingly available on the Web. This paper reviews recent studies on searching and mining geo-textual data for exploration, and discusses future directions along with open problems.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016008","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}
引用次数: 8
Parallelizing multiple keyword queries over XML streams 在XML流上并行处理多个关键字查询
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495641
E. Barros, F. G. D. C. Ferreira, Alberto H. F. Laender
{"title":"Parallelizing multiple keyword queries over XML streams","authors":"E. Barros, F. G. D. C. Ferreira, Alberto H. F. Laender","doi":"10.1109/ICDEW.2016.7495641","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495641","url":null,"abstract":"Web users tend to focus their attention on stream data rather than on archival one. In an XML stream environment, data arrive continuously, which means that queries must be evaluated for producing results on the fly. Thus, it is crucial to count on algorithms that efficiently evaluate multiple queries, usually expressed in terms of keywords, over several XML streams. However, there are few algorithms that evaluate this kind of query. One of them is MKStream, which is the current state-of-the-art algorithm for processing keyword-based queries over XML streams. In order to improve scalability, in this paper we introduce PMKStream (Parallel MKStream), which is a parallel version of MKStream. Like MKStream, PMKStream evaluates multiple keyword queries by using multiple parsing stacks. However, it parallelizes them on a multicore platform, thus reducing response time by up to 57%. A comprehensive set of experiments, using distinct datasets, evaluates its performance and shows that PMKStream is a much more efficient alternative for supporting keyword-based search over XML streams.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125584319","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
Resourceful interaction in information discovery 信息发现中的资源交互
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495639
Giulio Jacucci
{"title":"Resourceful interaction in information discovery","authors":"Giulio Jacucci","doi":"10.1109/ICDEW.2016.7495639","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495639","url":null,"abstract":"Resourceful interaction is proposed as a paradigm in which humans and computers mutually make available resources to deliver unprecedented performance, engagement and overall user experience in discovering information. Examples are reported from novel user interfaces for discovering information that exemplify Resourceful Interaction: an interactive model of intent represented by keywords used to direct exploratory search, entity based parallel search streams, eye tracking guidance combined with multitouch input in interactive visualizations. The examples demonstrate how providing access and manipulation of computational constructs such as the intent model constitute an important resource for users in information exploration. Correspondingly providing implicit signals of the user to the retrieval and visualization system can provide important resources to achieve fluid and symbiotic information discovery.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117001408","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
Including hierarchical navigation in a Graph Database query language with an OBDA approach 使用OBDA方法在图形数据库查询语言中包含分层导航
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495627
N. Cysneiros, A. Salgado
{"title":"Including hierarchical navigation in a Graph Database query language with an OBDA approach","authors":"N. Cysneiros, A. Salgado","doi":"10.1109/ICDEW.2016.7495627","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495627","url":null,"abstract":"Distributed and replicated systems, such as Big Data applications, deal with conflicting and duplicated data. Therefore, it is needed a database with flexible data model to materialize the data and an end-user oriented interface in order to allow queries in heterogeneous data. Using OBDA approach in a Graph Database is an attempt to solve these problems. However, new problems arise regarding hierarchical navigation using Graph Database query language. This work proposes a solution in which an ontology's reasoner is used to retrieve the subclasses of the original queried concepts. These retrieved concepts are used to rewrite the submitted query.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114707197","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}
引用次数: 4
Goal-aware data management for retrieval and recommendations 目标感知数据管理检索和建议
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495651
Dimitra Papadimitriou
{"title":"Goal-aware data management for retrieval and recommendations","authors":"Dimitra Papadimitriou","doi":"10.1109/ICDEW.2016.7495651","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495651","url":null,"abstract":"Human activity is almost always intentional. By understanding why user-generated events are happening and what purposes they serve, a system can offer a significantly improved and more engaging experience. Analyzing user actions such as clicks can reveal patterns and behaviors. However, understanding the goals behind these actions is a more challenging issue since goals cannot be easily captured. In this thesis, we present a unified, multi-disciplinary viewpoint for goal management that covers many different cases where goals can be used and techniques with which they can be exploited. We are dealing with the problem of selecting and recommending items that will fulfill, or contribute towards the fulfillment of user goals. Specifically, we suggest a goal-aware solution for the problem of finding related forum posts to a post at-hand within a user-community. Our solution is based on the detection of intention shifts captured through text features. Furthermore, we suggest a general purpose solution for recommending items of any kind by leveraging knowledge about goals that users managed to fulfill in the past through interactions with these items. The items to be recommended are selected considering whether and how they will contribute towards the fulfillment of a number of goals.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128515338","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
A minimally-intrusive approach for query-driven data integration systems 用于查询驱动的数据集成系统的侵入性最小的方法
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495654
A. Wahl
{"title":"A minimally-intrusive approach for query-driven data integration systems","authors":"A. Wahl","doi":"10.1109/ICDEW.2016.7495654","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495654","url":null,"abstract":"Integrating data from very large, dynamic, heterogeneous and autonomous data sources is a key requirement to satisfy growing information needs. In order to allow for ad-hoc answering of analytical questions, necessary up-front integration effort must be minimized and data integration systems must be adapted to the expectations and requirements of their users. While existing approaches offer support for incremental data integration, they require significant usage effort. They usually rely on explicit user feedback or invade the proven analysis workflows of their users. We propose a minimally-intrusive approach for query-driven data integration systems that allows for ad-hoc analysis of different data sources and minimizes the alteration of established analysis workflows. We suggest mechanisms for data source discovery and incremental data integration that primarily rely on implicit user feedback collected by query log analysis. Our proposed system architecture supports different types of data sources and integrates with existing data analysis tools.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130441941","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}
引用次数: 7
A novel hierarchical clustering framework for complex symbolic data exploration 一种新的用于复杂符号数据探索的分层聚类框架
2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW) Pub Date : 2016-05-16 DOI: 10.1109/ICDEW.2016.7495644
Xin Xu
{"title":"A novel hierarchical clustering framework for complex symbolic data exploration","authors":"Xin Xu","doi":"10.1109/ICDEW.2016.7495644","DOIUrl":"https://doi.org/10.1109/ICDEW.2016.7495644","url":null,"abstract":"It has been recognized that the variable values of symbolic data may take the form of either an interval or a set of stochastic measurements of some underlying patterns. However, most existing work in symbolic data exploration are still concentrated on interval values only. Although some work in stochastic pattern-based symbolic data has been explored, it is not adaptable enough for various types of symbolic data yet. As a result, we bring forward a novel hierarchical clustering framework for complex symbolic data exploration. Our framework is able to be applied on either qualitative multi-valued or interval-valued or stochastic pattern-based symbolic data. Extensive experiments on a series of synthetic data sets have validated its efficiency and effectiveness.","PeriodicalId":117361,"journal":{"name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114326222","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
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学术官方微信
小红书