2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications最新文献_第3页

GN-DTD: Graphical Notations for Describing XML Documents GN-DTD:描述XML文档的图形符号

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.29

Z. Zainol, Bing Wang

引用次数: 6

A Data Mining-Based Solution for Detecting Suspicious Money Laundering Cases in an Investment Bank 基于数据挖掘的某投资银行可疑洗钱案件检测解决方案

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.27

Nhien-An Le-Khac, S. Markos, Mohand Tahar Kechadi

引用次数: 38

Indexing Semi-structured Data for Efficient Handling of Branching Path Expressions 索引半结构化数据以有效处理分支路径表达式

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.15

T. B. Viana, Thiago Vinicius Freire de Araujo Ribeiro, Glêdson Elias da Silveira

引用次数: 4

Using Class-Based Reasoning to Improve the Accuracy of Symbolic Rules in a Hybrid Possibilistic Approach 基于类推理的混合可能性方法提高符号规则的准确性

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.39

Myriam Bounhas, K. Mellouli

{"title":"Using Class-Based Reasoning to Improve the Accuracy of Symbolic Rules in a Hybrid Possibilistic Approach","authors":"Myriam Bounhas, K. Mellouli","doi":"10.1109/DBKDA.2010.39","DOIUrl":"https://doi.org/10.1109/DBKDA.2010.39","url":null,"abstract":"A common strategy used in rule inductive algorithms is to assign an unseen example, not covered by any rule, to a static default class fixed at the inductive time and not updated thereafter. This paper presents a rule-based system using a Hybrid Possibilistic Inference Mechanism, which combines a Possibilistic Rule-based with a Class-based Reasoning. The inference process gives pre-eminence to Possibilistic Rule-based Reasoning, which selects the most suitable rule used to reach a conclusion in response to input facts. The proposed approach encodes relationship dependencies existing between facts and rules through Possibilistic Networks and quantifies these relationships by means of two measures: possibility and necessity. If the Possibilistic Rule-based Reasoning is blocked due the lack of satisfied rules, the Hybrid Possibilistic Inference Mechanism favours the Possibilistic Class-based Reasoning, which is the main contribution of this paper as it dynamically assigns a default class to each specific fact base not covered by any rule. To do so, we use a possibilistic network which searches for the most plausible class by quantifying relationship between facts and classes through a distance measure. Experimentation results demonstrate that the hybrid approach leads to accuracy improvement of the system.","PeriodicalId":273177,"journal":{"name":"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125205572","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}

引用次数: 0

Towards an Automatic Detection of Sensitive Information in a Database 数据库中敏感信息的自动检测

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.17

C. Mouza, Elisabeth Métais, Nadira Lammari, J. Akoka, T. Aubonnet, I. Comyn-Wattiau, Hammou Fadili, S. Cherfi

{"title":"Towards an Automatic Detection of Sensitive Information in a Database","authors":"C. Mouza, Elisabeth Métais, Nadira Lammari, J. Akoka, T. Aubonnet, I. Comyn-Wattiau, Hammou Fadili, S. Cherfi","doi":"10.1109/DBKDA.2010.17","DOIUrl":"https://doi.org/10.1109/DBKDA.2010.17","url":null,"abstract":"In order to validate user requirements, tests are often conducted on real data. However, developments and tests are more and more outsourced, leading companies to provide external staff with real confidential data. A solution to this problem is known as Data Scrambling. Many algorithms aim at smartly replacing true data by false but realistic ones. However, nothing has been developed to automate the crucial task of the detection of the data to be scrambled. In this paper we propose an innovative approach - and its implementation as an expert system - to achieve the automatic detection of the candidate attributes for scrambling. Our approach is mainly based on semantic rules that determine which concepts have to be scrambled, and on a linguistic component that retrieves the attributes that semantically correspond to these concepts. Since attributes can not be considered independently from each other we also address the challenging problem of the propagation of the scrambling among the whole database. An important contribution of our approach is to provide a semantic modelling of sensitive data. This knowledge is made available through production rules, operationalizing the sensitive data detection","PeriodicalId":273177,"journal":{"name":"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126712226","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}

引用次数: 21

Sudoku Bit Arrangement for Combined Demosaicking and Watermarking in Digital Camera 数字相机去马赛克与水印相结合的数独位排列

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.43

Pooya Monshizadeh Naini, S. M. Fakhraie, A. Avanaki

引用次数: 7

Phenomena-Based Management of Geotime-Tagged Contents on the Web 基于现象的Web地理时间标记内容管理

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.38

Kyoung-Sook Kim, K. Zettsu, Y. Kidawara, Y. Kiyoki

{"title":"Phenomena-Based Management of Geotime-Tagged Contents on the Web","authors":"Kyoung-Sook Kim, K. Zettsu, Y. Kidawara, Y. Kiyoki","doi":"10.1109/DBKDA.2010.38","DOIUrl":"https://doi.org/10.1109/DBKDA.2010.38","url":null,"abstract":"Recently, Geoweb services help people easily create and share geo-spatiotemporal contents through Internet. As a result, it becomes an emerging issue to manage Geoweb contents in exploding lots of spatiotemporal information and to obtain comprehensive knowledge about the real world using web contents. This paper proposes a novel approach for managing geotime-tagged contents on the basis of moving phenomena, such as typhoons, earthquakes, and flooding. In this study, a moving phenomenon is represented by a predefined three-dimensional object in a spatiotemporal domain with predefined meanings, and we define a phenomena-based predicate template named Relates as a combination of spatial, temporal, and thematic constraints. By using the Relates predicate, we can dynamically aggregate geotime-tagged contents along three aspects: location, time, and topic. Moreover, we present an application of the phenomena-based contents management, called k-Sticker. k-Sticker allows users to find top-k terms related to their own moving phenomenon through a three-dimensional (two spatial dimensions and one temporal dimension) visualization method.","PeriodicalId":273177,"journal":{"name":"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117098854","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}

引用次数: 0

Exploring the Use of Mixed Abstractions in SQL:1999 - A Framework-Based Approach 探索SQL:1999中混合抽象的使用——一种基于框架的方法

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.13

Christopher Ireland, D. Bowers, M. Newton, K. Waugh

引用次数: 1

Exploring Social Patterns in Mobile Data 探索移动数据中的社交模式

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.37

P. Kasarapu, M. Saravanan, G. Prasad

{"title":"Exploring Social Patterns in Mobile Data","authors":"P. Kasarapu, M. Saravanan, G. Prasad","doi":"10.1109/DBKDA.2010.37","DOIUrl":"https://doi.org/10.1109/DBKDA.2010.37","url":null,"abstract":"To compete with other telecom providers, it is important to understand the behavior of the customers and predict their needs. In order to realize this, it is required to explore the customers details based on their mobile usage behavior into social patterns (segments) and target the suitable segments for advertising. In our approach, the usage data of the customers in association with their browsing behavior is used to form the segments considered to be an important addition. From the analysis of their usage rates with respect to a certain domain, the operator can drill down to the sub domain level interests and target them with specific customized services. This can be done by performing latent semantic analysis using Gibbs sampling algorithm and K-Means clustering on the description of their accessed web pages with their usage and spend data. The traditional method involves forming web communities using link based approach. Our method based on identifying social communities could produce an alternative approach for the mobile operators. The usage rates within a certain cluster, and the customers' interest towards a specific domain can help to determine their extent of willingness to spend in specific areas. Our approach produces better results than the traditional methods by enabling the telecom providers to target a specific group of consumers.","PeriodicalId":273177,"journal":{"name":"2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129803140","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

An Alternative Extension of the FCM Algorithm for Clustering Fuzzy Databases 模糊数据库聚类中FCM算法的另一种扩展

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications Pub Date : 2010-04-11 DOI: 10.1109/DBKDA.2010.35

A. Touzi

引用次数: 9