標(biāo)題: Titlebook: Database and Expert Systems Applications; 27th International C Sven Hartmann,Hui Ma Conference proceedings 2016 Springer International Publ [打印本頁] 作者: Motion 時(shí)間: 2025-3-21 17:43
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database and Expert Systems Applications被引頻次
書目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書目名稱Database and Expert Systems Applications年度引用
書目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書目名稱Database and Expert Systems Applications讀者反饋
書目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: intention 時(shí)間: 2025-3-21 21:10
General Purpose Index-Based Method for Efficient MaxRS Queryod 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作者: Rodent 時(shí)間: 2025-3-22 03:01
An Efficient Method for Identifying MaxRS Location in Mobile Ad Hoc Networksg 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 作者: 傻 時(shí)間: 2025-3-22 06:21 作者: 昏暗 時(shí)間: 2025-3-22 09:24 作者: Invigorate 時(shí)間: 2025-3-22 15:24 作者: Invigorate 時(shí)間: 2025-3-22 18:49 作者: Clumsy 時(shí)間: 2025-3-22 22:39 作者: inflate 時(shí)間: 2025-3-23 04:39
Modeling Information Diffusion via Reputation Estimationffusion process in the near future. Although this problem has been extensively studied, the challenge of how to effectively combine user activities, network structures and diffused information in social data remains largely open. In addition, no prior work judged the effect of user reputation on the作者: Decongestant 時(shí)間: 2025-3-23 05:55
Mining Arbitrary Shaped Clusters and Outputting a High Quality Dendrograme existing HC algorithms focus on either the quality of the dendrogram or the ability of mining arbitrary shaped clusters. To address the above two aspects simultaneously, we present HICMEN by adopting (1) the classic agglomerative clustering framework that can generate a complete dendrogram, and (2作者: 貧窮地活 時(shí)間: 2025-3-23 10:33
Hierarchically Clustered LSH for Hierarchical Outliers Detection novel framework that permits us to detect hierarchical outliers in a consistent manner, providing a desired monotonicity property, which implies that a data observation that finds enough support so as to be disregarded as an outlier at a level of the hierarchy, will not be labelled as an outlier wh作者: 分開如此和諧 時(shí)間: 2025-3-23 17:31 作者: intelligible 時(shí)間: 2025-3-23 18:26
“Overloaded!” — A Model-Based Approach to Database Stress Testingand velocity applications. Although the development agenda goes at full pace, the current testing agenda does not keep up, especially to validate non-functional requirements, such as: performance and scalability. The testing approaches strongly rely on the combination of unit testing tools and bench作者: 啤酒 時(shí)間: 2025-3-23 23:24 作者: addict 時(shí)間: 2025-3-24 03:13
Conference proceedings 2016NoSQL, NewSQL; Multimedia Data; Personal Information Management; Semantic Web and Ontologies; Database and Information System Architectures; Query Answering and Optimization; Information Retrieval, and Keyword Search; Data Modelling, and Uncertainty..作者: 天氣 時(shí)間: 2025-3-24 06:59 作者: 類人猿 時(shí)間: 2025-3-24 12:32
Controlling in mittelst?ndischen Unternehmenividual items. The . is used as an interestingness measure to filter out uninteresting patterns in . dimension. In addition, a new interestingness measure, called ., is being proposed to filter out uninteresting patterns in . dimension. We have proposed a model by combining both measures and propose作者: Biofeedback 時(shí)間: 2025-3-24 17:37
https://doi.org/10.1007/978-3-663-14815-9d the . of HUIs in the MIU-tree are proposed. Moreover, a vertical compact utility-list structure is adopted to store the information required for discovering HUIs without performing additional database scans and generating candidates. An extensive experimental study on real-world and synthetic data作者: 摻假 時(shí)間: 2025-3-24 19:53 作者: folliculitis 時(shí)間: 2025-3-25 02:27 作者: Myofibrils 時(shí)間: 2025-3-25 06:32 作者: gene-therapy 時(shí)間: 2025-3-25 09:34
Entwicklungsperspektiven des Controllingrepresents the possible running states of the DBMS. Therefore, testers can define state goals or specific state transitions that revealed bugs. Testers can also use MoDaST to pinpoint the conditions of performance loss and thrashing states. We put MoDaST to practical application testing two popular 作者: 背信 時(shí)間: 2025-3-25 14:17
An Efficient Method for Identifying MaxRS Location in Mobile Ad Hoc Networksre propose a communication-efficient method which retrieves the MaxRS location in two phases. Phase 1 plays the important role of pruning data items not necessary to identify the MaxRS location, and enables the retrieval of only necessary data items in phase 2. Simulation experiments demonstrate the作者: 除草劑 時(shí)間: 2025-3-25 19:44
Discovering Periodic-Frequent Patterns in Transactional Databases Using All-Confidence and Periodic-ividual items. The . is used as an interestingness measure to filter out uninteresting patterns in . dimension. In addition, a new interestingness measure, called ., is being proposed to filter out uninteresting patterns in . dimension. We have proposed a model by combining both measures and propose作者: HEPA-filter 時(shí)間: 2025-3-25 20:06 作者: engrave 時(shí)間: 2025-3-26 01:48
Automated ,-Anonymization and ,-Diversity for Shared Data Privacyur results show that automating .-diversity results in an added average information loss of 7?% over automated .-anonymization, but in a diversity of between 9–14?% in comparison to 10–30?% in .-anonymised datasets. The lesson that emerges is that automated .-diversity offers better privacy than .-a作者: Mediocre 時(shí)間: 2025-3-26 06:13 作者: 以煙熏消毒 時(shí)間: 2025-3-26 09:57 作者: 圍裙 時(shí)間: 2025-3-26 16:23
“Overloaded!” — A Model-Based Approach to Database Stress Testingrepresents the possible running states of the DBMS. Therefore, testers can define state goals or specific state transitions that revealed bugs. Testers can also use MoDaST to pinpoint the conditions of performance loss and thrashing states. We put MoDaST to practical application testing two popular 作者: 結(jié)構(gòu) 時(shí)間: 2025-3-26 19:18 作者: RACE 時(shí)間: 2025-3-26 21:31 作者: MORT 時(shí)間: 2025-3-27 04:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263485.jpg作者: 反感 時(shí)間: 2025-3-27 08:26 作者: 吸引力 時(shí)間: 2025-3-27 13:13
ü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 時(shí)間: 2025-3-27 17:19
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 作者: 招待 時(shí)間: 2025-3-27 20:11 作者: 騎師 時(shí)間: 2025-3-28 00:05
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 時(shí)間: 2025-3-28 05:31
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 時(shí)間: 2025-3-28 08:15 作者: ARCH 時(shí)間: 2025-3-28 10:53
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 作者: 減少 時(shí)間: 2025-3-28 17:23 作者: Ancestor 時(shí)間: 2025-3-28 19:48
Prospects of the further development of EISe existing HC algorithms focus on either the quality of the dendrogram or the ability of mining arbitrary shaped clusters. To address the above two aspects simultaneously, we present HICMEN by adopting (1) the classic agglomerative clustering framework that can generate a complete dendrogram, and (2作者: canvass 時(shí)間: 2025-3-28 23:12
Thomas Reichmann,Alfred Vo?schulte novel framework that permits us to detect hierarchical outliers in a consistent manner, providing a desired monotonicity property, which implies that a data observation that finds enough support so as to be disregarded as an outlier at a level of the hierarchy, will not be labelled as an outlier wh作者: 單挑 時(shí)間: 2025-3-29 03:22 作者: AUGUR 時(shí)間: 2025-3-29 10:42 作者: 暗語 時(shí)間: 2025-3-29 13:36 作者: 鍍金 時(shí)間: 2025-3-29 17:10
https://doi.org/10.1007/978-3-319-44403-1data mining; linked open data; mobile ad hoc networks; natural language processing; semantic Web; context作者: Humble 時(shí)間: 2025-3-29 20:26 作者: 軍械庫 時(shí)間: 2025-3-30 03:57
Database and Expert Systems Applications978-3-319-44403-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 金桌活畫面 時(shí)間: 2025-3-30 06:37
General Purpose Index-Based Method for Efficient MaxRS Queryed to solve the .-enclosing problem in time .(1) for any given . value if indexes are sorted according to the optimizing criteria, or . without using any index, which is comparative to the current most efficient work.作者: 極深 時(shí)間: 2025-3-30 10:30 作者: PANT 時(shí)間: 2025-3-30 14:59
Target-Oriented Keyword Search over Temporal Databasesonships between two keywords. We design a target-oriented search over an augmented data graph to efficiently evaluate such temporal keyword queries. Experiments on 3 datasets demonstrate the efficiency of the proposed approach to answer complex temporal keyword queries.作者: BARK 時(shí)間: 2025-3-30 18:05 作者: Paleontology 時(shí)間: 2025-3-30 20:57
Controlling in mittelst?ndischen Unternehmen (1) storage cost, which comprises the occupation, the energy and the endurance costs, (2) the penalty cost that could arise from the SLA (Service Level Agreement) violation, and (3) the migration cost resulting from the object movement between storage systems. We also evaluate the relevance of our model and its usability throughout examples.
