標(biāo)題: Titlebook: Database Systems for Advanced Applications; 21st International C Shamkant B. Navathe,Weili Wu,Hui Xiong Conference proceedings 2016 Springe [打印本頁] 作者: 漏出 時間: 2025-3-21 18:43
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: Guileless 時間: 2025-3-22 00:04
https://doi.org/10.1007/978-3-319-32049-6Big data; Data mining and knowledge discovery; Database management; Evolutionary machine learning; Infor作者: 圓錐 時間: 2025-3-22 04:18 作者: MOAN 時間: 2025-3-22 08:20
Intentions and the Doctrine of Double Effectlarity search, entity profiling and linkage. Most existing work focus on using the main features common to all. While this approach makes sense in settings where commonality is of primary interest, there are many scenarios as important where uncommon and discriminative features are more useful. To a作者: Laconic 時間: 2025-3-22 12:42
Oren Asman,Yechiel Michael Barilantopic or event prediction models have been proposed in the past few years, researches that focus on the single tweet prediction just emerge recently. In this paper, we propose STH-Bass, a Spatial and Temporal Heterogeneous Bass model derived from economic field, to predict the popularity of a single作者: 字形刻痕 時間: 2025-3-22 12:58 作者: 字形刻痕 時間: 2025-3-22 20:12 作者: 羽飾 時間: 2025-3-22 22:22
Palgrave European Film and Media Studiesgregation queries on a set of lists plays an increasingly important role in these domains. Unfortunately the existing solutions, such as threshold-style (TA-style) algorithms, do not guarantee superior performance on a large number of lists. In this paper, we introduce a merge-based strategy, called作者: 圓木可阻礙 時間: 2025-3-23 02:54
https://doi.org/10.1007/978-3-319-89827-8onnecting nodes through a sequence of heterogeneous edges, representing different kinds of semantic relations among nodes. Meta-paths are good mechanisms to improve the quality of graph analysis on heterogeneous information networks. This paper presents an iceberg cube framework for heterogeneous in作者: unstable-angina 時間: 2025-3-23 09:05
https://doi.org/10.1007/978-3-319-89827-8ived significant research attention in the past few years. However, we realise that the state-of-the-art algorithm, SLICE, accesses many objects that do not contribute to its . results when running the filtering phase, which deteriorates the query performance. In this paper, we propose a novel R.NN 作者: 蒼白 時間: 2025-3-23 11:09
https://doi.org/10.1007/978-3-642-40137-4, with increasing data sizes, it is becoming computationally expensive to perform data cube analysis. In this paper, we introduce ., an extension of MapReduce, designed for efficient parallel data cube computation on large-scale data. We also provide a general data cube materialization solution whic作者: mediocrity 時間: 2025-3-23 16:02 作者: Carbon-Monoxide 時間: 2025-3-23 19:39 作者: 極小量 時間: 2025-3-23 23:46 作者: 過去分詞 時間: 2025-3-24 04:32 作者: Pastry 時間: 2025-3-24 09:52
https://doi.org/10.1057/9780230305663tics, namely k-hop window query, that aims to capture the properties of a local community involving the k-hop neighbors (defined on the graph structures) of each vertex. We develop a novel index, ., to facilitate efficient processing of k-hop window queries. Extensive experimental studies conducted 作者: Engaging 時間: 2025-3-24 12:19 作者: 北京人起源 時間: 2025-3-24 17:33 作者: STANT 時間: 2025-3-24 20:39
Shamkant B. Navathe,Weili Wu,Hui XiongIncludes supplementary material: 作者: OPINE 時間: 2025-3-25 00:06 作者: 類似思想 時間: 2025-3-25 04:13
Closeness and Structure of Friends Help to Estimate User Locationsions, thus improving the accuracy of the location estimation models. A confidence iteration method is further introduced to improve estimation accuracy and overcome the problem of scarce location information. We evaluate our methods on two different datasets, Twitter and Gowalla. The results show th作者: 用肘 時間: 2025-3-25 11:11 作者: BRAND 時間: 2025-3-25 11:45
Approximate Iceberg Cube on Heterogeneous Dimensions on meta-paths is employed to measure the similarities. (4) Two pruning strategies are designed for reducing search space when the aggregate function is monotonic. (5) Experiments on both real-world and synthetic networks demonstrate the effectiveness and efficiency of the algorithms.作者: PLAYS 時間: 2025-3-25 16:41 作者: 大罵 時間: 2025-3-25 20:06 作者: boisterous 時間: 2025-3-26 00:12
SF in the EU’s Newest Member Statesdel outperforms IC model in nearly . in weighted IM problem. Moreover, BWR achieves excellent approximation and efficiency which is faster than greedy algorithm more than four orders of magnitude. Especially, BWR can handle huge networks with millions of nodes in several tens of seconds while keepin作者: 狂熱文化 時間: 2025-3-26 06:41
https://doi.org/10.1007/978-3-319-89827-8 on meta-paths is employed to measure the similarities. (4) Two pruning strategies are designed for reducing search space when the aggregate function is monotonic. (5) Experiments on both real-world and synthetic networks demonstrate the effectiveness and efficiency of the algorithms.作者: Inordinate 時間: 2025-3-26 12:23
From “Clothing Standard” to?“Chemometrics”plicate and analyze the approximation-based EMD and the relationship between the proposal and the original EMD. Moreover, our extensive experiments on 4 real world datasets point out the accuracy and efficiency of our approach.作者: 鉆孔 時間: 2025-3-26 15:36 作者: Mnemonics 時間: 2025-3-26 17:39
Intentions and the Doctrine of Double Effectset of feature paths that contain both main and discriminative features. In addition, we develop an effective pruning strategy to achieve greater query performance. Extensive experiments on real datasets demonstrate that our proposed model can achieve high performance.作者: 直覺好 時間: 2025-3-27 00:57
Palgrave European Film and Media Studiesne and distributive, it is much more efficient that .. This observation also inspires the development of our cost model, which can evaluate the best number of merged lists. Experimental results show that ListMerge could outperform the baseline algorithms up?to 4–20 times in synthetic datasets generated by various distributions.作者: sundowning 時間: 2025-3-27 03:02 作者: 制定法律 時間: 2025-3-27 07:54
Mei Zhang,Aijun Zhang,Yongdao Zhouir semantic meanings. To achieve that, we propose a novel indexing structure called NIQ-tree, which integrates spatial, textual and semantic information in a hierarchical manner, so as to prune the search space effectively in query processing. Extensive experiments are carried out to evaluate and compare it with other two baseline algorithms.作者: 繁榮地區(qū) 時間: 2025-3-27 10:19 作者: corporate 時間: 2025-3-27 13:45
ListMerge: Accelerating Top-k Aggregation Queries Over Large Number of Listsne and distributive, it is much more efficient that .. This observation also inspires the development of our cost model, which can evaluate the best number of merged lists. Experimental results show that ListMerge could outperform the baseline algorithms up?to 4–20 times in synthetic datasets generated by various distributions.作者: 打包 時間: 2025-3-27 20:40
TSCluWin: Trajectory Stream Clustering over Sliding Windowopsis data structures are incrementally maintained, and a . phase where a small number of macro-clusters are generated based on micro-clusters. Experimental results show that our proposal is both effective and efficient to handle streaming trajectories without compromising the quality.作者: 不妥協(xié) 時間: 2025-3-27 23:06 作者: 象形文字 時間: 2025-3-28 02:43
Oren Asman,Yechiel Michael Barilancuracy of STH-Bass based on real-world Twitter data. The evaluation results show that STH-Bass obtains much less APE than the baselines when predicting the trend of a single tweet, and an average of 24?% higher . when classifying the tweets popularity.作者: 易發(fā)怒 時間: 2025-3-28 08:52
https://doi.org/10.1007/978-3-319-89827-8at the results of a query . can be computed by using SLICE on only the objects in its guardian set instead of using the whole dataset. Our comprehensive experimental study on synthetic and real datasets demonstrates the proposed approach is the most efficient algorithm for R.NN.作者: Occipital-Lobe 時間: 2025-3-28 12:17 作者: Organization 時間: 2025-3-28 16:42
https://doi.org/10.1007/978-1-349-86105-7among different semantic labels of locations, and enables more meaningful measures of semantic similarity among indoor trajectories. We conduct experiments on indoor trajectories, comparing our proposal with several popular methods. The results suggest that our proposal is effective and represents an improvement over existing methods.作者: 鄙視讀作 時間: 2025-3-28 21:18 作者: 進入 時間: 2025-3-28 22:55
STH-Bass: A Spatial-Temporal Heterogeneous Bass Model to Predict Single-Tweet Popularitycuracy of STH-Bass based on real-world Twitter data. The evaluation results show that STH-Bass obtains much less APE than the baselines when predicting the trend of a single tweet, and an average of 24?% higher . when classifying the tweets popularity.作者: 演講 時間: 2025-3-29 05:46
Pre-computed Region Guardian Sets Based Reverse kNN Queriesat the results of a query . can be computed by using SLICE on only the objects in its guardian set instead of using the whole dataset. Our comprehensive experimental study on synthetic and real datasets demonstrates the proposed approach is the most efficient algorithm for R.NN.作者: fructose 時間: 2025-3-29 07:34 作者: 放大 時間: 2025-3-29 13:10
Effective Similarity Search on Indoor Moving-Object Trajectoriesamong different semantic labels of locations, and enables more meaningful measures of semantic similarity among indoor trajectories. We conduct experiments on indoor trajectories, comparing our proposal with several popular methods. The results suggest that our proposal is effective and represents an improvement over existing methods.作者: 不可侵犯 時間: 2025-3-29 16:18 作者: Offset 時間: 2025-3-29 22:30 作者: Campaign 時間: 2025-3-30 03:47
Towards Neighborhood Window Analytics over Large-Scale Graphsover both real and synthetic datasets with hundreds of millions of vertices and edges show that our proposed solutions are four orders of magnitude faster in query performance than the non-index algorithm, and are superior over the state-of-the-art solution in terms of both scalability and efficiency.作者: linguistics 時間: 2025-3-30 05:24 作者: 單獨 時間: 2025-3-30 10:39 作者: 接觸 時間: 2025-3-30 14:53
