標題: Titlebook: Database Systems for Advanced Applications; 28th International C Xin Wang,Maria Luisa Sapino,Hongzhi Yin Conference proceedings 2023 The Ed [打印本頁] 作者: 佯攻 時間: 2025-3-21 17:43
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡公開度學科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學科排名
作者: ostrish 時間: 2025-3-21 22:26
978-3-031-30674-7The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Tractable 時間: 2025-3-22 03:25
https://doi.org/10.1007/978-3-658-42489-3r and what their relationship is. This task is challenging because the heterogeneous social network is non-trivial to leverage and the collected data is always noisy and incomplete, which leads that the existing rule-based and representation methods cannot efficiently and accurately reason social re作者: Root494 時間: 2025-3-22 07:33 作者: 拱墻 時間: 2025-3-22 10:15
Carlos Gómez-Corona,Heber Rodriguessince society is evolving with constantly emerging social events, it is extremely difficult to accurately capture their semantics and evolution rules at an early stage. Meanwhile, traditional solutions require extensive training from scratch to accommodate new events, leading to lagging predictions 作者: 使饑餓 時間: 2025-3-22 13:17 作者: 使饑餓 時間: 2025-3-22 17:04
Oscar Vorobjovas-Pinta,Clifford Lewismunity search on signed network expects to explore the polarized communities (i.e., two antagonistic subgraphs) containing the set of query nodes. Though previous studies have been proven effective, they generally ignore two insights. First, node attributes provide side information to describe featu作者: 虛假 時間: 2025-3-22 22:25
Offshore Sailing: Subcultures and Neotribes To support subgraph reconstruction, a naive approach is materializing subgraph embeddings for all possible candidate subgraphs in advance, which is impractical since the subgraphs are exponential to the size of the input graph. Therefore, it is desired to devise a subgraph embedding based on which 作者: 卡死偷電 時間: 2025-3-23 05:27 作者: Palate 時間: 2025-3-23 08:06 作者: 碎片 時間: 2025-3-23 13:26
Consumer attitudes to food quality productsrs are seldom to build complex user-defined integrity constraints; worse, the systems often do not have the capabilities of defining complex integrity constraints. For these reasons, violation of the implicit integrity constraints widely exists and leads to various data quality issues in property gr作者: 大方不好 時間: 2025-3-23 16:14 作者: FANG 時間: 2025-3-23 21:19 作者: commute 時間: 2025-3-24 00:47 作者: 一大塊 時間: 2025-3-24 06:19
Christopher S. Tang,Serguei Netessinepically represent the dynamic graph as a sequence of discrete static subgraphs and apply a recurrent neural network (RNN) to capture graph evolution over multiple discrete-time subgraphs. However, these approaches fail to capture the fine-grained temporal evolution leading to introducing temporal in作者: Anthropoid 時間: 2025-3-24 09:05
Laurens G. Debo,Senthil K. Veeraraghavanst existing work assumes a static graph. However, graphs are dynamic in nature, which is described as streaming graphs. Mining top-. frequent patterns in streaming graphs is challenging due to the streaming nature of the input and the exponential time complexity of the problem. A naive solution is t作者: 名義上 時間: 2025-3-24 13:45 作者: 籠子 時間: 2025-3-24 17:39 作者: homeostasis 時間: 2025-3-24 21:30
Database Systems for Advanced Applications978-3-031-30675-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 草率男 時間: 2025-3-25 00:45
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263412.jpg作者: minimal 時間: 2025-3-25 05:07 作者: 負擔 時間: 2025-3-25 07:39
Methods and Protocols in Food Sciencen, and temporal-aware loss, SRACas learns a better latent representation of cascades at both the node level, sub-cascade level, and cascade level. Moreover, there lacks a platform with standard prepossessing procedures that allow convenient configuration and fair competition between information casc作者: ethnology 時間: 2025-3-25 15:02 作者: 不如樂死去 時間: 2025-3-25 16:43
https://doi.org/10.1007/978-1-0716-3000-6requent patterns that frequently appear in each group. A feature vector is constructed for each subject based on these pairs by drawing on the network motif idea and the classifier is used to detect Alzheimer’s disease (AD). Comprehensive experiments on ADNI public datasets demonstrate the effective作者: Intellectual 時間: 2025-3-25 23:25 作者: 楓樹 時間: 2025-3-26 02:52 作者: 植物群 時間: 2025-3-26 05:02
https://doi.org/10.1007/978-981-15-7150-3analyze the effect of the two parameters on the search results of RB-.-core searches. Then, we explore two effective algorithms by refining the initial search parameters . and . of RB-.-core searches. Finally, we conduct comprehensive experimental studies on four real geo-social networks to evaluate作者: 他很靈活 時間: 2025-3-26 09:55
https://doi.org/10.1007/978-3-030-53983-2n nodes. Extensive experiments on multiple benchmark datasets show that, the quality of community detection can be remarkably enhanced under the regime of attribute subspaces, achieving the state-of-the-art performance.作者: 感激小女 時間: 2025-3-26 16:20
Consumer attitudes to food quality productsen as anomalies. To mine abnormal CGPs and their matches automatically and efficiently, we then propose an efficient parallel approach called . . . . .. ACGPMiner follows the generation-and-validation paradigm and does the anomaly detection level by level. At each level ., we generate CGPs with . ed作者: SMART 時間: 2025-3-26 16:52
Felipe Caro,Victor Martínez-de-Albéenizted memory usage. . maps each subgraph into the corresponding bucket based on hash functions to compute the persistence of each pattern. Then we introduce optimizations to separate persistent and non-persistent patterns, further improving the effectiveness and throughput in space-scarce scenarios. E作者: cancer 時間: 2025-3-27 00:36 作者: NAV 時間: 2025-3-27 04:19 作者: SLUMP 時間: 2025-3-27 08:06 作者: 加強防衛(wèi) 時間: 2025-3-27 09:29 作者: 幸福愉悅感 時間: 2025-3-27 15:35 作者: Innovative 時間: 2025-3-27 20:26
Local Spectral for?Polarized Communities Search in?Attributed Signed Networkch helps to make the most of the different dimensions of information. Furthermore, to search for polarized communities containing the set of query nodes, a sparse indicator-vector is developed based on Rayleigh quotient via solving a linear programming problem. Extensive experimental results on two 作者: Wallow 時間: 2025-3-27 23:25
Subgraph Reconstruction via?Reversible Subgraph Embeddingubgraph from the decoded aggregation vector, we present a bijective rule by applying a simple transformation between binary number and decimal number with a scale operation. We conduct extensive experiments over real graphs to evaluate the proposed subgraph embedding. Experimental results demonstrat作者: FLING 時間: 2025-3-28 05:51 作者: 上腭 時間: 2025-3-28 09:55 作者: Tailor 時間: 2025-3-28 14:00 作者: diathermy 時間: 2025-3-28 16:59
Discovering Persistent Subgraph Patterns over?Streaming Graphsted memory usage. . maps each subgraph into the corresponding bucket based on hash functions to compute the persistence of each pattern. Then we introduce optimizations to separate persistent and non-persistent patterns, further improving the effectiveness and throughput in space-scarce scenarios. E作者: outer-ear 時間: 2025-3-28 22:20
Mining Top-, Frequent Patterns over?Streaming Graphsn provide unbiased estimation and then give an error bound of our algorithm. In addition, we propose a vertical hashing and candidate buckets sampling technique to further improve . with higher space utilization and higher accuracy. Extensive experiments confirm that our approach generates high-qual作者: Aboveboard 時間: 2025-3-29 00:31 作者: 肥料 時間: 2025-3-29 06:34
0302-9743 D consortium papers are included. The conference presents papers on subjects such as model, graph, learning, performance, knowledge, time, recommendation, representation, attention, prediction, and network..978-3-031-30674-7978-3-031-30675-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 發(fā)電機 時間: 2025-3-29 08:56
0302-9743 for Advanced Applications, DASFAA 2023, held in April 2023 in Tianjin, China..The total of 125 full papers, along with 66 short papers, are presented together in this four-volume set was carefully reviewed and selected from 652 submissions. Additionally, 15 industrial papers, 15 demo papers and 4 Ph作者: 赦免 時間: 2025-3-29 14:20
Conference proceedings 2023ed Applications, DASFAA 2023, held in April 2023 in Tianjin, China..The total of 125 full papers, along with 66 short papers, are presented together in this four-volume set was carefully reviewed and selected from 652 submissions. Additionally, 15 industrial papers, 15 demo papers and 4 PhD consorti作者: 溫順 時間: 2025-3-29 16:40 作者: jabber 時間: 2025-3-29 22:30 作者: 伸展 時間: 2025-3-30 00:41
Edge Coloring on?Dynamic Graphsan efficient dynamic edge coloring algorithm that only explores the edges with color change and their 2-hop incident edges to maintain the coloring. Moreover, we propose some early pruning rules to further reduce the unnecessary computation. Experimental results on real graphs demonstrate the efficiency of our approach.作者: bronchodilator 時間: 2025-3-30 07:19
TE-DyGE: Temporal Evolution-Enhanced Dynamic Graph Embedding Networkd information. Additionally, we introduce temporal-dependent weight to enhance the structure attention network. We evaluate the TE-DyGE in link prediction tasks. The experimental results demonstrate a generally higher performance of TE-DyGE compared with several state-of-the-art related baselines.作者: 顛簸下上 時間: 2025-3-30 11:17 作者: 新娘 時間: 2025-3-30 13:11 作者: 廚師 時間: 2025-3-30 17:41
https://doi.org/10.1007/1-4020-4097-0ion, but also effectively reduces the memory consumption at all time. We also devise an effective workload balance mechanism that is automatically triggered by the idle machines to handle skewed workloads. The experiment results demonstrate the efficiency and scalability of our proposed algorithm.作者: restrain 時間: 2025-3-30 23:04
MRSCN: A GNN-based Model for?Mining Relationship Strength Changes Between Nodes in?Dynamic Networksup model. We develop two group mining algorithms. We conduct extensive experiments on real-life dynamic networks to evaluate our models. The results demonstrate the effectiveness of the proposed MRSCN model and the drastic group mining method.作者: 提升 時間: 2025-3-31 02:05
An Efficient Index-Based Method for?Skyline Path Query over?Temporal Graphs with?LabelsMP nodes search and Mout set construction. Based on this index, we propose an efficient TMP algorithm to provide the skyline path query over temporal graphs with labels. Finally, extensive experiments show the effectiveness and efficiency of our proposed algorithm.作者: 原告 時間: 2025-3-31 06:47
Efficient and?Scalable Distributed Graph Structural Clustering at?Billion Scaleion, but also effectively reduces the memory consumption at all time. We also devise an effective workload balance mechanism that is automatically triggered by the idle machines to handle skewed workloads. The experiment results demonstrate the efficiency and scalability of our proposed algorithm.作者: 舊石器 時間: 2025-3-31 13:15 作者: 跑過 時間: 2025-3-31 15:35
SRACas: A Social Role-Aware Graph Neural Network-Based Model for?Popularity Prediction of?Informatioors and change the structure and popularity of information cascades. Existing deep learning-based methods utilize several independent sub-cascade graphs or paths to learn cascade representations, which lose vital information about social roles and dynamics between sub-cascades at different moments.
