Titlebook: Database and Expert Systems Applications; 25th International C Hendrik Decker,Lenka Lhotská,Roland R. Wagner Conference proceedings 2014 Sp

夸大

书目名称Database and Expert Systems Applications影响因子(影响力)




书目名称Database and Expert Systems Applications影响因子(影响力)学科排名




书目名称Database and Expert Systems Applications网络公开度




书目名称Database and Expert Systems Applications网络公开度学科排名




书目名称Database and Expert Systems Applications被引频次




书目名称Database and Expert Systems Applications被引频次学科排名




书目名称Database and Expert Systems Applications年度引用




书目名称Database and Expert Systems Applications年度引用学科排名




书目名称Database and Expert Systems Applications读者反馈




书目名称Database and Expert Systems Applications读者反馈学科排名

全部

叙述

Helena Holmström Olsson,Jan Boscha consensus. Interpretability, in this context, is favored for the reason that they can be used to identify the key features influencing the classification outcome. In order to address this problem, we present Arguing Prism, an argumentation based approach for collaborative classification. The propo

exceptional

Antonio Martini,Lars Pareto,Jan Boschlections is a tough task that has been drawing researchers’ attention for two decades. A typical general strategy to retrieve the most similar objects to a given example is to access and then refine a . of objects; the overall search costs (and search time) then typically correlate with the candidat

Bravura

Helena Holmström Olsson,Jan Boschgiven distance function and a given closeness threshold. Solving such problem for high–dimensional data sets is computationally expensive, since the amount of computation required to assess the similarity between any two elements increases with the number of dimensions. As a motivating example, an i

CUR

Albert Huch,Renate Huch,Gösta Roothalid words within a text, with a supporting dictionary. However, they are not rich enough to encode phonetic information to assist the search. In this paper, we present a novel approach for efficiently perform phonetic similarity search over large data sources, that uses a data structure called . to

CUR

Jürgen M. Steinacker,Kai Röckers articles. We propose methods to rank news articles based on analyzing difference in descriptions of named entities. We extend the stakeholder mining proposed by Ogawa et al. and extract descriptions of named entities in articles. Then, four ranking measures (.) are calculated by analyzing the pres

Enteropathic

Albert Huch,Renate Huch,Gösta Rooth often overwhelm users. We observe that a database is in fact a repository of real world objects that interact with each other via relationships. In this work, we identify four types of semantic paths between objects and design an algorithm called . to compute and rank the results of keyword queries

cloture

Colm Lanigan,Jose Ponte,John Moxhamoy fraudulent activities like money laundering, tax fraud, or bankruptcy fraud. Therefore, in the Netherlands legal persons are automatically screened for misuse based on a set of so called risk indicators. These indicators, which are based on the data obtained from, among others, the Netherlands Ch

Slit-Lamp

Mikhail Z. Zgurovsky,Victor A. Sadovnichiy dependency to the current target stream value. Existing solutions fail in several important dependency cases, such as the not-similar-but-frequent patterns, the signals with multiple lags, and the single point dependencies. To reveal these hard-to-detect local patterns in streams, a statistical mod