標(biāo)題: Titlebook: Database and Expert Systems Applications; 21st International C Pablo García Bringas,Abdelkader Hameurlain,Gerald Conference proceedings 20 [打印本頁(yè)] 作者: Reticent 時(shí)間: 2025-3-21 19:23
書(shū)目名稱Database and Expert Systems Applications影響因子(影響力)
書(shū)目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications被引頻次
書(shū)目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications年度引用
書(shū)目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications讀者反饋
書(shū)目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: 靈敏 時(shí)間: 2025-3-21 20:14 作者: Sciatica 時(shí)間: 2025-3-22 00:24 作者: 代替 時(shí)間: 2025-3-22 05:36
Compound Treatment of Chained Declustered Replicas Using a Parallel Btree for High Scalability and Aement and parallel index structures on shared-nothing parallel infrastructure have been proposed. Data migration with range-partitioned placement using a parallel Btree is one solution. The combination of range partitioning and chained declustered replicas provides high availability while preserving作者: condescend 時(shí)間: 2025-3-22 09:36 作者: 離開(kāi) 時(shí)間: 2025-3-22 13:23
Efficient Parallel Data Retrieval Protocols with MIMO Antennae for Data Broadcast in 4G Wireless Comtion wireless communication system (4G), mobile devices may embed . (MIMO) antennae to setup multi-connections to a base station. In this paper, we deal with data retrieval problem for mobile clients with MIMO antennae to retrieve a set of indexed data from parallel communication channels. Our purpo作者: 離開(kāi) 時(shí)間: 2025-3-22 20:30 作者: 縫紉 時(shí)間: 2025-3-22 23:56 作者: chemical-peel 時(shí)間: 2025-3-23 02:34
An Agent Model of Business Relationshipso build a set of (business) relationships with other agents. A relationship is built by exchanging private information, and is characterised by its intimacy — degree of closeness — and balance — degree of fairness. Each argumentative interaction between two agents then has two goals: to satisfy some作者: sorbitol 時(shí)間: 2025-3-23 08:11
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes a region into subregions by using pivots, and construct a tree structure index. A problem in the existing indexes is that they only focus on the pruning objects and do not take into consideration the tree balancing. The balance of the indexes depends on the data distribution and the indexes don’t r作者: Individual 時(shí)間: 2025-3-23 13:32
Minimum Spanning Tree on Spatio-Temporal Networksted with one or more time intervals; during these time intervals, the total cost of this spanning tree is the least among all spanning trees. The TSMST problem aims to identify a collection of distinct minimum spanning trees and their respective time-sub-intervals. This is an important problem in sp作者: 輕率看法 時(shí)間: 2025-3-23 14:13
Real-Time Temporal Data Warehouse Cubing required. For these applications, data should be incorporated in the warehouse and made available as soon as possible in “Real Time Data Warehouse”. In this paper we propose an indexing model named TiC-Tree, in order to simultaneously index and store multidimensional detailed and aggregated data. O作者: antenna 時(shí)間: 2025-3-23 18:44
PAGER: Parameterless, Accurate, Generic, Efficient ,NN-Based Regressionn algorithms are used for prediction (including forecasting of time-series data), inference, hypothesis testing, and modeling of causal relationships. Although this problem has been studied extensively, most of these approaches are not generic in that they require the user to make an intelligent gue作者: Largess 時(shí)間: 2025-3-23 23:38 作者: 冒煙 時(shí)間: 2025-3-24 03:51
Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databasessupport (.) and maximum periodicity (.) constraints. . constraint controls the minimum number of transactions that a pattern must cover in a database. . constraint controls the maximum duration between the two transactions below which a pattern should reoccur in a database. In the literature an appr作者: phase-2-enzyme 時(shí)間: 2025-3-24 09:24 作者: 品嘗你的人 時(shí)間: 2025-3-24 14:42
An Efficient Computation of Frequent Queries in a Star Schemaing functional and inclusion dependencies, computing frequent conjunctive queries becomes feasible for databases operating over a star schema. However, the implementation considered in this previous work showed severe limitations for large fact tables. The main contribution of this paper is to overc作者: 發(fā)怨言 時(shí)間: 2025-3-24 16:11
Evaluating Evidences for Keyword Query Disambiguation in Entity Centric Database Searchguation process relies on a proper assessment of whether a structured query represents the intent behind the keyword query. In this paper we systematically analyze a number of intuitive statistical measures that can potentially be used in this disambiguation process. We evaluate the impact of these 作者: 易彎曲 時(shí)間: 2025-3-24 21:10 作者: Consequence 時(shí)間: 2025-3-25 01:17 作者: 較早 時(shí)間: 2025-3-25 07:17 作者: surmount 時(shí)間: 2025-3-25 10:51 作者: 拘留 時(shí)間: 2025-3-25 11:44 作者: 觀察 時(shí)間: 2025-3-25 17:20
Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databasesnd rare items we have to specify low . and high .. It is difficult to mine periodic-frequent patterns because the low . and high . can cause combinatorial explosion. In this paper we propose an improved approach which facilitates the user to specify different . and . values for each pattern dependin作者: 條街道往前推 時(shí)間: 2025-3-25 23:03 作者: 闖入 時(shí)間: 2025-3-26 02:03 作者: 翻布尋找 時(shí)間: 2025-3-26 08:15
Alessandro Roncaglia,Mario Tonveronachi presents three solutions to design the time dimension tables and four solutions to design the fact tables. Moreover, each of these solutions is evaluated in different combinations of the time dimension and the fact tables based on a real world farming case study.作者: 滲透 時(shí)間: 2025-3-26 10:22 作者: Yourself 時(shí)間: 2025-3-26 14:52
https://doi.org/10.1007/978-3-642-15251-1cloud computing; data bases; data mining; data warehouse; data warehousing; decision support system; exper作者: Serenity 時(shí)間: 2025-3-26 18:17
978-3-642-15250-4Springer-Verlag Berlin Heidelberg 2010作者: Nomogram 時(shí)間: 2025-3-26 21:47 作者: META 時(shí)間: 2025-3-27 04:45
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263473.jpg作者: 背信 時(shí)間: 2025-3-27 07:49 作者: facilitate 時(shí)間: 2025-3-27 10:33
B2R: An Algorithm for Converting Bayesian Networks to Sets of RulesIn this paper B2R algorithm that converts Bayesian networks into sets of rules is proposed. It is tested on several data sets with various configurations and results show that accuracy is similar to original Bayesian networks even after pruning a high number of rules. It allows to exploit advantages of both knowledge representation techniques.作者: Afflict 時(shí)間: 2025-3-27 17:10 作者: GLADE 時(shí)間: 2025-3-27 18:04
Robust Estimation and Robust Parameterth heart disease do not want to disclose their electrocardiogram time-series, but they still allow mining of some accurate patterns from their time-series. Based on this observation, we introduce the related assumptions and requirements. We show that only randomization methods satisfy all assumption作者: LEVER 時(shí)間: 2025-3-28 00:34
Theory of Statistical Predictionin measures in a multi-dimensional data cube. Sentinels notify users based on previous observations, e.g., that revenue might drop within two months if an increase in customer problems combined with a decrease in website traffic is observed. If the vice versa also holds, we have a . sentinel, which 作者: 袋鼠 時(shí)間: 2025-3-28 05:24 作者: A保存的 時(shí)間: 2025-3-28 07:27
https://doi.org/10.1007/978-1-349-12221-9esearch interest on supporting query answering over the deep web. To answer a deep web query efficiently, the current approaches generate a query plan for each query independently..However, in practice, deep web queries issued by a user over a short period of time can often share similarities. This,作者: 多節(jié) 時(shí)間: 2025-3-28 13:12 作者: AVOW 時(shí)間: 2025-3-28 17:42
Wilhelm Krelle,Hermann Sarrazinimensions is crucial to successful integration. Existing notions of dimension compatibility rely on given and exact dimension hierarchy information being available. In this paper, we propose to infer aggregation hierarchies for dimensions from a database instance and use these inferred aggregation h作者: 橫條 時(shí)間: 2025-3-28 20:11
Alessandro Roncaglia,Mario Tonveronachises use standard dimensional schema designs to organize their data. However, current data warehousing schema designs fall short in their ability to model the multi-granular data found in various real-world application domains. For example, modern farm equipment in a field produces massive amounts of作者: RENIN 時(shí)間: 2025-3-29 02:06 作者: 拋媚眼 時(shí)間: 2025-3-29 04:49
Mario Damill,Roberto Frenkel,Martín Rapetti a region into subregions by using pivots, and construct a tree structure index. A problem in the existing indexes is that they only focus on the pruning objects and do not take into consideration the tree balancing. The balance of the indexes depends on the data distribution and the indexes don’t r作者: 顯赫的人 時(shí)間: 2025-3-29 07:13
Global Governance for Financial Stabilityted with one or more time intervals; during these time intervals, the total cost of this spanning tree is the least among all spanning trees. The TSMST problem aims to identify a collection of distinct minimum spanning trees and their respective time-sub-intervals. This is an important problem in sp作者: 量被毀壞 時(shí)間: 2025-3-29 12:31 作者: 返老還童 時(shí)間: 2025-3-29 18:08
Transforms, Diagrams and Representationsn algorithms are used for prediction (including forecasting of time-series data), inference, hypothesis testing, and modeling of causal relationships. Although this problem has been studied extensively, most of these approaches are not generic in that they require the user to make an intelligent gue作者: VOK 時(shí)間: 2025-3-29 23:17
Moral Hazard and Insurance Contractsally used for the reinforcement of rubber compounds. Nevertheless, the exact reason behind its success in this concrete domain remains unknown. Characterisation of rubber nano-aggregates aims to answer this question. The morphology of the nano-aggregate takes an important part in the final result of作者: 沉著 時(shí)間: 2025-3-30 03:19 作者: Visual-Acuity 時(shí)間: 2025-3-30 05:28 作者: pessimism 時(shí)間: 2025-3-30 10:23 作者: babble 時(shí)間: 2025-3-30 15:01 作者: PANIC 時(shí)間: 2025-3-30 20:37
Database and Expert Systems Applications978-3-642-15251-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: GIST 時(shí)間: 2025-3-30 20:50
https://doi.org/10.1007/978-1-349-07728-1guation process relies on a proper assessment of whether a structured query represents the intent behind the keyword query. In this paper we systematically analyze a number of intuitive statistical measures that can potentially be used in this disambiguation process. We evaluate the impact of these measures through experiments on real-world data.作者: Neonatal 時(shí)間: 2025-3-31 04:25 作者: JAMB 時(shí)間: 2025-3-31 07:55 作者: Lignans 時(shí)間: 2025-3-31 12:19 作者: mydriatic 時(shí)間: 2025-3-31 17:06 作者: Cabg318 時(shí)間: 2025-3-31 18:47
Wilhelm Krelle,Hermann Sarrazinierarchies for integration of data marts. We formulate the problem of inferring aggregation hierarchies as computing a minimal directed graph from data, and develop algorithms to this end. We extend previous notions of dimension compatibility in terms of inferred aggregation hierarchies.作者: Cervical-Spine 時(shí)間: 2025-4-1 00:24 作者: 陳列 時(shí)間: 2025-4-1 02:22 作者: chemoprevention 時(shí)間: 2025-4-1 06:15 作者: 紋章 時(shí)間: 2025-4-1 11:18 作者: 假裝是我 時(shí)間: 2025-4-1 15:00
https://doi.org/10.1007/978-1-349-12221-9ADRS-MIMO), and propose two greedy heuristics named . (.) and . (.). We are the first work to deal with data retrieval with MIMO antennae for wireless data broadcast. We analyze the performances of . and . both theoretically and practically. Simulation results prove the efficiency of the two protocols.
