標(biāo)題: Titlebook: Database Systems for Advanced Applications; 23rd International C Jian Pei,Yannis Manolopoulos,Jianxin Li Conference proceedings 2018 Spring [打印本頁] 作者: legerdemain 時(shí)間: 2025-3-21 17:59
書目名稱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 22:17
0302-9743 ge graphs; text and data mining; medical data mining; security and privacy; search and information retrieval; query processing and optimizations; data quality and crowdsourcing; learning models; multimedia data processing; and distributed computing.? ?.978-3-319-91457-2978-3-319-91458-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 厭倦嗎你 時(shí)間: 2025-3-22 01:08 作者: Memorial 時(shí)間: 2025-3-22 07:02 作者: cavity 時(shí)間: 2025-3-22 11:48 作者: 游行 時(shí)間: 2025-3-22 12:52
An Adaptive Eviction Framework for?Anti-caching Based In-Memory Databasesembed it into the adaptive eviction framework. The experimental results show that with adaptive eviction, anti-caching based database system can outperform the traditional prototype by 1.2x–1.8x and 1.7x–4.5x under TPC-C benchmark and YCSB benchmark, respectively.作者: 游行 時(shí)間: 2025-3-22 18:23
Publishing Graph Node Strength Histogram with Edge Differential Privacy paper, we investigate the problem of publishing the node strength histogram of a private graph under edge-DP. We propose two clustering approaches based on sequence-aware and local density to aggregate histogram. Our experimental study demonstrates that our approaches can greatly reduce the error of approximating the true node strength histogram.作者: CRACY 時(shí)間: 2025-3-22 21:15
iExplore: Accelerating Exploratory Data Analysis by Predicting User Intentiong of user’s intention. Thus, the exploratory process can be accelerated by the intention-driven recommendation and prefetching mechanisms. Extensive experiments demonstrate that the intention-driven iExplore system can significantly lighten the burden of users and facilitate the exploratory process.作者: 掃興 時(shí)間: 2025-3-23 04:45 作者: 赦免 時(shí)間: 2025-3-23 05:58 作者: ANTE 時(shí)間: 2025-3-23 12:00
FIMA: Fault Intensity Map Analysisg of user’s intention. Thus, the exploratory process can be accelerated by the intention-driven recommendation and prefetching mechanisms. Extensive experiments demonstrate that the intention-driven iExplore system can significantly lighten the burden of users and facilitate the exploratory process.作者: 搬運(yùn)工 時(shí)間: 2025-3-23 14:10
Stefan Mangard,Axel Y. Poschmannermine the gate values. We evaluate the performance of our method on the well-known question answering sites Stackexchange and Quora. Experiments show that our approach can improve the performance on expert finding tasks.作者: 柏樹 時(shí)間: 2025-3-23 21:04
Conference proceedings 2018ed Applications, DASFAA 2018, held in Gold Coast, QLD, Australia, in May 2018..The 83 full papers, 21 short papers, 6 industry papers, and 8 demo papers?were carefully selected from a total of 360 submissions. The papers are?organized around the following topics:?network embedding;?recommendation; g作者: 旋轉(zhuǎn)一周 時(shí)間: 2025-3-24 00:03 作者: 山頂可休息 時(shí)間: 2025-3-24 05:11
Lecture Notes in Computer Sciencelized prescription. Patient-level, disease-level and drug-level representations are simultaneously learned and fused with a trilinear method to achieve personalized prescription for comorbidity. Experiments on a publicly real world EMRs dataset demonstrate PPC outperforms state-of-the-art works.作者: incision 時(shí)間: 2025-3-24 09:25 作者: 歌曲 時(shí)間: 2025-3-24 14:22 作者: 摻和 時(shí)間: 2025-3-24 18:03 作者: 并入 時(shí)間: 2025-3-24 19:42 作者: 中古 時(shí)間: 2025-3-25 00:50
Fast Analytical Rank Estimationt sequential patterns. Utilizing this information, the latter computes their noisy supports and detects the final frequent patterns. Extensive experiments conducted on real-world datasets demonstrate that our approach maintains high utility while providing privacy guarantees.作者: 漸變 時(shí)間: 2025-3-25 06:18
Lecture Notes in Computer Sciencees the privacy of the data, query, result, . and .. At last, we empirically analyze and conduct a comprehensive performance evaluation using real dataset to validate our ideas and the proposed secure algorithms.作者: 難取悅 時(shí)間: 2025-3-25 08:35
Fault Attacks on UOV and Rainbowery demands with respect to their topological distances to the given keywords. Then, we present a search algorithm to solve our problem. It guarantees to return the optimal diverse result set, and can eliminate unnecessary and redundant diversity computation. Lastly, we perform both effectiveness an作者: Diatribe 時(shí)間: 2025-3-25 14:39 作者: Aura231 時(shí)間: 2025-3-25 18:22 作者: 別名 時(shí)間: 2025-3-25 23:50
Takeshi Sugawara,Daisuke Suzuki,Minoru Saekid to schedule transaction conflicts without introducing many overhead; (4) experiments on both the TPC-C and a micro benchmark show that our method achieves better performance than existing solutions.作者: 得意人 時(shí)間: 2025-3-26 00:12 作者: Defraud 時(shí)間: 2025-3-26 05:23
Learning the Representation of Medical Features for Clinical Pathway Analysisd each day embedding is determined by the diagnosis together with the preorder days. We evaluate RoMCP on real-world dataset with 538K inpatient visits for several typical CP analysis tasks. Our method demonstrates significant improvement on performance and interpretation.作者: engrave 時(shí)間: 2025-3-26 08:32 作者: mighty 時(shí)間: 2025-3-26 14:21
: Differentially Private Frequent Time-Constrained Sequential Pattern Miningt sequential patterns. Utilizing this information, the latter computes their noisy supports and detects the final frequent patterns. Extensive experiments conducted on real-world datasets demonstrate that our approach maintains high utility while providing privacy guarantees.作者: seruting 時(shí)間: 2025-3-26 19:59 作者: Irascible 時(shí)間: 2025-3-26 22:16 作者: 結(jié)束 時(shí)間: 2025-3-27 02:03
Novel Approaches to Accelerating the?Convergence Rate of Markov Decision Process for Search Result DP-DIV-kNN method adopts a . nearest neighbor strategy, i.e., discarding the . nearest neighbors of the recently-selected action (document), to reduce the diversification searching space. The MDP-DIV-NTN employs a pre-trained diversification neural tensor network (NTN-DIV) as the evaluation model, an作者: Tincture 時(shí)間: 2025-3-27 09:02 作者: calorie 時(shí)間: 2025-3-27 11:33
Interactive Transaction Processing for?In-Memory Database Systemd to schedule transaction conflicts without introducing many overhead; (4) experiments on both the TPC-C and a micro benchmark show that our method achieves better performance than existing solutions.作者: Ballad 時(shí)間: 2025-3-27 15:29 作者: CLEAR 時(shí)間: 2025-3-27 18:51
Modeling Patient Visit Using Electronic Medical Records for Cost Profile Estimationng clinical approaches only focus on patient’s demographics and historical diagnoses but ignore ample information from clinical records. In this paper, we formulate the problem of patient’s cost profile estimation and use Electronic Medical Records (EMRs) to model patient visit for better estimating作者: 駁船 時(shí)間: 2025-3-27 23:29
Learning the Representation of Medical Features for Clinical Pathway Analysis be divided into several stages, usually in units of days. With the explosion of medical data, CP analysis is receiving increasing attention, which provides important support for CP design and optimization. However, these data-driven researches often suffer from the high complexity of medical data, 作者: 神化怪物 時(shí)間: 2025-3-28 03:38 作者: Adulterate 時(shí)間: 2025-3-28 06:41
Publishing Graph Node Strength Histogram with Edge Differential Privacy combines the topological information with the weight distribution of the weighted graph in a natural way. Since an edge in graph data oftentimes represents relationship between two nodes, edge-differential privacy (edge-DP) can protect relationship between two entities from being disclosed. In this作者: octogenarian 時(shí)間: 2025-3-28 11:21
: Differentially Private Frequent Time-Constrained Sequential Pattern Mininge sequence dataset has been widely studied, in which the transition time between adjacent items should not be too large to form frequent sequential patterns. A wide spectrum of applications can greatly benefit from such patterns, such as movement behavior analysis, targeted advertising, and POI reco作者: mettlesome 時(shí)間: 2025-3-28 17:32 作者: Calibrate 時(shí)間: 2025-3-28 21:07 作者: verdict 時(shí)間: 2025-3-28 23:52 作者: Externalize 時(shí)間: 2025-3-29 03:50
Coverage-Oriented Diversification of?Keyword Search Results on Graphsiven finite result set, in which the results are as dissimilar to each other as possible. However, such a setup may not always hold. Firstly, we may need the result set to be globally diverse with respect to all possible demands behind a given query. Secondly, the result set may not be given before 作者: arthroplasty 時(shí)間: 2025-3-29 08:12
Novel Approaches to Accelerating the?Convergence Rate of Markov Decision Process for Search Result Ding performances can be delivered, MDP-DIV suffers from a very slow convergence, which hinders its usability in real applications. In this paper, we aim to promote the performance of MDP-DIV by speeding up the convergence rate without much accuracy sacrifice. The slow convergence is incurred by two 作者: Osteoporosis 時(shí)間: 2025-3-29 13:20 作者: intercede 時(shí)間: 2025-3-29 15:43
Collusion-Resistant Processing of SQL Range Predicatest-Curious adversarial model, where the server is only permitted to . the encrypted query processing. We consider here a significantly more powerful adversary, wherein the server can launch an . attack by clandestinely issuing specific range queries via . with a few compromised clients. The security 作者: exhilaration 時(shí)間: 2025-3-29 20:41 作者: 蒸發(fā) 時(shí)間: 2025-3-30 02:21 作者: 跳脫衣舞的人 時(shí)間: 2025-3-30 04:10 作者: CHARM 時(shí)間: 2025-3-30 09:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263405.jpg作者: 晚來的提名 時(shí)間: 2025-3-30 13:11 作者: dainty 時(shí)間: 2025-3-30 17:11 作者: 油膏 時(shí)間: 2025-3-30 23:41 作者: 事先無準(zhǔn)備 時(shí)間: 2025-3-31 04:20 作者: 烤架 時(shí)間: 2025-3-31 06:53
