Titlebook: Database and Expert Systems Applications; 27th International C Sven Hartmann,Hui Ma Conference proceedings 2016 Springer International Publ

RACE

MORT

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263485.jpg

反感

吸引力

übersicht zu den empirischen Ergebnissenod solves it in time . for a particular given rectangle size. This is inefficient in cases where the queries are frequently called with different parameters. Thus, in this paper, we propose an index-based method that solves the maxRS query in time . for any given query. Besides, our method can be us

EWER

Richard Hammer,Hans H. Hinterhuberg of nodes which hold data items with scores and location information. A query originating node issues a MaxRS query with a size of a rectangle. Then, it retrieves the location of the rectangle which maximizes the sum of the scores of all data items covered by the rectangle (MaxRS location). We can

招待

騎師

https://doi.org/10.1007/978-3-663-14815-9on database. Although HUI mining has numerous applications, a key limitation is that a single minimum utility threshold (.) is used to assess the utility of all items. This simplifying assumption is unrealistic since in real-life all items do not have the same unit profit, and thus do not have an eq

Lymphocyte

Richard Hammer,Hans H. Hinterhuberbases. A major drawback of traditional high-utility itemset mining algorithms is that they can return a large number of HUIs. Analyzing a large result set can be very time-consuming for users. To address this issue, concise representations of high-utility itemsets have been proposed such as closed H

gusher

ARCH

The Evolution of the Term Controllinges based on the situation at hand. For this purpose, we define safety-centric contexts based on risk description that is provided by the safety management system. This paper presents a risk-adaptive access control model that adopts hierarchies of contexts and security domains to make adaptations to