標(biāo)題: Titlebook: Database Systems for Advanced Applications; 19th International C Sourav S. Bhowmick,Curtis E. Dyreson,Bernhard Thal Conference proceedings [打印本頁(yè)] 作者: 聯(lián)系 時(shí)間: 2025-3-21 16:29
書目名稱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é)科排名
作者: 效果 時(shí)間: 2025-3-21 23:53 作者: 沙發(fā) 時(shí)間: 2025-3-22 03:58 作者: AVID 時(shí)間: 2025-3-22 05:34 作者: 細(xì)胞學(xué) 時(shí)間: 2025-3-22 12:06 作者: 本土 時(shí)間: 2025-3-22 15:31 作者: 本土 時(shí)間: 2025-3-22 19:52 作者: 入會(huì) 時(shí)間: 2025-3-22 22:52
Contemporary British Queer Performanceare further proposed based on the total relation. Finally, a multi-objective optimization strategy improves the overall recommendation quality by combining accuracy and novelty scores. Experimental results on a real dataset show that our proposed method outperforms state-of-the-art recommendation methods on both accuracy and novelty.作者: 昏暗 時(shí)間: 2025-3-23 05:01 作者: coalition 時(shí)間: 2025-3-23 07:48
Efficient Sampling Methods for Shortest Path Query over Uncertain Graphstain graphs is #P-hard, we propose different kinds of sampling methods to efficiently compute an approximate answer. The error is very small in our algorithm, which is proved and further verified in our experiments.作者: debble 時(shí)間: 2025-3-23 11:26 作者: 離開真充足 時(shí)間: 2025-3-23 14:00
Access Control for Data Integration in Presence of Data Dependenciess by identifying additional access control rules that should be added to the mediator. We also state the complexity of the algorithms and discuss a set of experiments we conducted by using both real and synthetic datasets. Tests also confirm the complexity and upper bounds in worst-case scenarios of the proposed algorithms.作者: 背心 時(shí)間: 2025-3-23 18:03
Thwarting Passive Privacy Attacks in Collaborative Filtering to provide a novel rigorous inference-proof privacy guarantee, known as .-., with desirable data utility and scalability. We propose anonymization algorithms based on suppression and a novel mechanism, ., tailored to our problem. Experiments on real-life data demonstrate that our solutions are both effective and efficient.作者: Painstaking 時(shí)間: 2025-3-24 01:11 作者: maroon 時(shí)間: 2025-3-24 03:23 作者: 紋章 時(shí)間: 2025-3-24 09:13 作者: hurricane 時(shí)間: 2025-3-24 14:44
Politics, Police, the Courts and Redressge content, to ease the annotation process. SASS intelligently blends supervised machine learning techniques with simple user feedback. Moreover, additional support features for binding attributes to values even further reduces the necessary effort. We show that SASS is superior to current tools for schema.org annotations.作者: 松軟 時(shí)間: 2025-3-24 18:28 作者: 慢慢流出 時(shí)間: 2025-3-24 20:48
Any Suggestions? Active Schema Support for Structuring Web Informationge content, to ease the annotation process. SASS intelligently blends supervised machine learning techniques with simple user feedback. Moreover, additional support features for binding attributes to values even further reduces the necessary effort. We show that SASS is superior to current tools for schema.org annotations.作者: 碎片 時(shí)間: 2025-3-25 02:29 作者: Delectable 時(shí)間: 2025-3-25 06:08 作者: 用不完 時(shí)間: 2025-3-25 09:38 作者: CHAFE 時(shí)間: 2025-3-25 13:43
-uncertainty Anonymization by Partial Suppressions, the framework attempts to either preserve the original data distribution or retain mineable useful association rules, which targets statistical analysis and association mining, two major data mining applications on set-valued data.作者: 補(bǔ)助 時(shí)間: 2025-3-25 18:41 作者: 慷慨援助 時(shí)間: 2025-3-25 22:31
https://doi.org/10.1057/9781137393722f these estimates compared to the true number of results on both real and synthetic data, analyzing the potentials of the proposed approximations to make accurate predictions that can be used to generate efficient query execution plans.作者: overhaul 時(shí)間: 2025-3-26 02:07 作者: OUTRE 時(shí)間: 2025-3-26 07:10 作者: Congestion 時(shí)間: 2025-3-26 08:54 作者: 輕浮思想 時(shí)間: 2025-3-26 16:26 作者: agenda 時(shí)間: 2025-3-26 17:36 作者: placebo 時(shí)間: 2025-3-26 23:49
Identify and Trace Criminal Suspects in the Crowd Aided by Fast Trajectories Retrievalristics based query optimization algorithm to prune unnecessary data access. Extensive experiments based on real mobile phone trajectory data show that a suspect’s phone can be uniquely identified with high probability while he is captured by more than four cameras distributed in different cells of 作者: Munificent 時(shí)間: 2025-3-27 02:50
A Skylining Approach to Optimize Influence and Cost in Location Selectionl spatial join algorithm. We derive influence and cost bounds to prune irrelevant R-tree entries and to early confirm part of the final answers. Theoretical analysis and extensive experiments demonstrate the efficiency and scalability of our proposed algorithms.作者: BOGUS 時(shí)間: 2025-3-27 09:19
Geo-Social Skyline Queries . and closely connected to . in SN. We measure the social connectivity between users using the widely adoted, but very expensive Random Walk with Restart method (RWR) to obtain the social distance between users in the social network. We propose an efficient solution by showing how the RWR-distance 作者: 故意 時(shí)間: 2025-3-27 10:19 作者: poliosis 時(shí)間: 2025-3-27 17:12 作者: Gingivitis 時(shí)間: 2025-3-27 19:47 作者: Anticlimax 時(shí)間: 2025-3-27 23:02
Rubiya Nadaf,Jane Kinsella,Robert Wynnis employed to get a near-optimal solution. Through the extensive experiments on 36 real datasets, our empirical studies demonstrate that our proposed approaches are capable of achieving superior performance and better efficiency.作者: atrophy 時(shí)間: 2025-3-28 04:04 作者: 四海為家的人 時(shí)間: 2025-3-28 07:25
Contemporary British Drama 1950–1976l spatial join algorithm. We derive influence and cost bounds to prune irrelevant R-tree entries and to early confirm part of the final answers. Theoretical analysis and extensive experiments demonstrate the efficiency and scalability of our proposed algorithms.作者: 信徒 時(shí)間: 2025-3-28 14:02 作者: stratum-corneum 時(shí)間: 2025-3-28 16:18
https://doi.org/10.1057/9781137393722queries on uncertain trajectory databases in accordance with the possible worlds semantics. We include an extensive experimental evaluation on both real and synthetic data sets to verify our theoretical results.作者: CANDY 時(shí)間: 2025-3-28 20:43 作者: 娘娘腔 時(shí)間: 2025-3-29 02:39 作者: 步兵 時(shí)間: 2025-3-29 05:53 作者: 真繁榮 時(shí)間: 2025-3-29 08:37
Identify and Trace Criminal Suspects in the Crowd Aided by Fast Trajectories Retrieval it is usually hard to identify the suspects only according to the content of surveillance video due to the low resolution rate, insufficient brightness or occlusion. To address this problem, we consider the information of when and where a suspect is captured by the surveillance cameras and achieve 作者: Mri485 時(shí)間: 2025-3-29 14:16 作者: 結(jié)合 時(shí)間: 2025-3-29 15:43 作者: 小樣他閑聊 時(shí)間: 2025-3-29 23:14
A Skylining Approach to Optimize Influence and Cost in Location Selectionch can find many applications such as banking outlet and hotel locations selections. In particular, given a number of spatial objects and a set of location candidates, we select some locations which maximize the influence but minimize the cost. The influence of a location is defined by the number of作者: Airtight 時(shí)間: 2025-3-30 02:39
Geo-Social Skyline Queriess that combine location-based services with social networking services is growing drastically. Based on geo-social networks that couple personal location information with personal social context information, such services are facilitated by geo-social queries that extract useful information combinin作者: PAGAN 時(shí)間: 2025-3-30 07:17 作者: TAIN 時(shí)間: 2025-3-30 11:56
Selectivity Estimation of Reverse ,-Nearest Neighbor Queriesr of results for a given R.NN query, providing a key ingredient of common (relational) query optimizers. A range of experiments evaluate the quality of these estimates compared to the true number of results on both real and synthetic data, analyzing the potentials of the proposed approximations to m作者: Guileless 時(shí)間: 2025-3-30 15:17
Efficient Sampling Methods for Shortest Path Query over Uncertain Graphsompleteness in data collection. This is why uncertain graphs catch much attention of researchers. However, the uncertain graph models in existing works assume all edges in a graph are independent of each other, which dose not really make sense in real applications. Thus, we propose a new model for u作者: escalate 時(shí)間: 2025-3-30 18:14
Exploiting Transitive Similarity and Temporal Dynamics for Similarity Search in Heterogeneous Inform In this paper, we study the problem of similarity search in heterogeneous information networks, and extend the meta path-based similarity measure . by incorporating richer information, such as transitive similarity and temporal dynamics. Experiments on a large DBLP network show that our improved si作者: obtuse 時(shí)間: 2025-3-30 21:28
Top-k Similarity Matching in Large Graphs with Attributesd graph, effective and efficient graph matching methods are critical. However, due to the noisy and the incomplete nature of real graph data, approximate graph matching is essential. On the other hand, most users are only interested in the top-. similar matching, which proposed the problem of top-. 作者: Albinism 時(shí)間: 2025-3-31 02:30
On Perspective-Aware Top-, Similarity Search in Multi-relational Networksmmendation, link prediction, and web searching. Existing approaches to this problem do not consider types of relationships (edges) between two nodes. However, in real networks there exist different kinds of relationships. These kinds of network are called multi-relational networks, in which, differe作者: 表主動(dòng) 時(shí)間: 2025-3-31 07:45 作者: AVID 時(shí)間: 2025-3-31 11:27
Access Control for Data Integration in Presence of Data Dependenciescess control policy and cannot anticipate data inferences that can arise when data is integrated at the mediator level. Inferences, e.g., using functional dependencies, can allow malicious users to obtain, at the mediator level, prohibited information by linking multiple queries and thus violating t作者: Innocence 時(shí)間: 2025-3-31 16:28 作者: Benzodiazepines 時(shí)間: 2025-3-31 21:00
Privacy-Preserving Schema Reuseeuse is a methodology that allows users to create new schemas by copying and adapting existing ones. This methodology supports to reduce not only the effort of designing new schemas but also the heterogeneity between them. One of the biggest barriers of schema reuse is about privacy concerns that di作者: APEX 時(shí)間: 2025-3-31 23:13
Any Suggestions? Active Schema Support for Structuring Web Informationa corpus of 733 million Web documents shows that, a year after its introduction, only 1.56% of documents featured any schema.org annotations. A probable reason is that providing annotations is quite tiresome, hindering wide-spread adoption. Here even state-of-the-art tools like Google’s Structured D作者: Inscrutable 時(shí)間: 2025-4-1 04:51 作者: 拔出 時(shí)間: 2025-4-1 07:45 作者: 圍裙 時(shí)間: 2025-4-1 10:42 作者: FILTH 時(shí)間: 2025-4-1 16:38
978-3-319-05812-2Springer International Publishing Switzerland 2014
