標(biāo)題: Titlebook: Databases Theory and Applications; 31st Australasian Da Renata Borovica-Gajic,Jianzhong Qi,Weiqing Wang Conference proceedings 2020 Springe [打印本頁] 作者: 本義 時間: 2025-3-21 19:41
書目名稱Databases Theory and Applications影響因子(影響力)
書目名稱Databases Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Databases Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Databases Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Databases Theory and Applications被引頻次
書目名稱Databases Theory and Applications被引頻次學(xué)科排名
書目名稱Databases Theory and Applications年度引用
書目名稱Databases Theory and Applications年度引用學(xué)科排名
書目名稱Databases Theory and Applications讀者反饋
書目名稱Databases Theory and Applications讀者反饋學(xué)科排名
作者: 身心疲憊 時間: 2025-3-21 23:01
Hulda R. Jonsdottir,Ronald Dijkmanain experts and knowledge engineers who work together to bring out the required knowledge for building the information system. The most popular modelling approaches to develop these models include entity relationship modelling, object role modelling, and object-oriented modelling. These conceptual m作者: Accessible 時間: 2025-3-22 02:55 作者: 連詞 時間: 2025-3-22 05:14
Chantal J. Snoeck,Siamak Zoharication-based queries on road networks. Under the large demand of ride-hailing, the non-occupied vehicles might be insufficient for new-coming user requests. However, the occupied vehicles which are about to arrive their destinations could be the candidates to serve the requests close to their destin作者: Transfusion 時間: 2025-3-22 11:58 作者: FLOAT 時間: 2025-3-22 14:30 作者: FLOAT 時間: 2025-3-22 20:21
Elena Lokhman,Srijana Rai,William Matthewslassical indexes offer optimal worst-case guarantees, recent research suggests that average-case performance might be improved by alternative machine learning-based models such as deep neural networks. This paper explores an alternative approach by modelling the task as one of function approximation作者: Epidural-Space 時間: 2025-3-22 21:30
Luis Enjuanes,Stuart G. Siddell,Willy Spaanntations for node enhancement based on nodes attributes and network structures can improve link prediction performance. Node attributes are important factors in forming networks, like psychological factors and appearance features affecting friendship networks. However, little to no work has detected作者: MAPLE 時間: 2025-3-23 02:18 作者: 得意牛 時間: 2025-3-23 09:29 作者: 護(hù)身符 時間: 2025-3-23 12:35
Coronaviruses and their Diseasestwo decades and, driven by the emerging applications, is still under development. There is a lack of categorisation of existing solutions recently and analysis for future research directions. In this paper, we review the current status of the map-matching problem and survey the existing algorithms. 作者: 不能強(qiáng)迫我 時間: 2025-3-23 16:10
https://doi.org/10.1007/978-94-017-1179-1f graph analysis tasks including link prediction, node classification, recommendation and visualization. Most existing approaches represent graph nodes as point vectors in a low-dimensional embedding space, ignoring the uncertainty present in the real-world graphs. Furthermore, many real-world graph作者: 羽飾 時間: 2025-3-23 18:12
A. Balogh,J. T. Gosling,H. Kunowiring the location dimension while minimizing the gap between physical world and virtual social networking. This in return, has resulted in the generation of geo-tagged data at unprecedented scale and has facilitated users to fully capture and share their geo-locations with timestamps on social medi作者: 滲透 時間: 2025-3-23 23:02 作者: 強(qiáng)有力 時間: 2025-3-24 06:23 作者: Ebct207 時間: 2025-3-24 10:35
https://doi.org/10.1057/9780230355569to infer complex fashion compatibility patterns from a large number of fashion items. Previous work mainly utilises metric learning techniques to model the compatibility relationships, such that compatible items are closer to each other than incompatible ones in the latent space. However, they ignor作者: Dorsal 時間: 2025-3-24 14:28 作者: 取之不竭 時間: 2025-3-24 17:36
Corpora and Translation Educationt works considered users’ topical activeness in detecting communities. However, not enough attention is paid to the degree of temporal topical interactions among the members in the retrieved communities. We propose a method to search temporal active intimate community in which community members are 作者: Rheumatologist 時間: 2025-3-24 21:36 作者: 鞏固 時間: 2025-3-24 23:19 作者: Pedagogy 時間: 2025-3-25 03:57
978-3-030-39468-4Springer Nature Switzerland AG 2020作者: 瑣碎 時間: 2025-3-25 11:13 作者: Trypsin 時間: 2025-3-25 14:12
PAIC: Parallelised Attentive Image Captioningned by Back Propagation Through Time (BPTT) is inherently time-consuming, accompanied by the gradient vanishing problem. To overcome these difficulties, we propose a novel Parallelised Attentive Image Captioning Model (.) that purely employs the optimised attention mechanism to decode natural senten作者: 大猩猩 時間: 2025-3-25 19:52 作者: WAX 時間: 2025-3-25 20:13 作者: pericardium 時間: 2025-3-26 00:55 作者: 遺棄 時間: 2025-3-26 06:57 作者: HARP 時間: 2025-3-26 11:07
DEFINE: Friendship Detection Based on Node Enhancementntations for node enhancement based on nodes attributes and network structures can improve link prediction performance. Node attributes are important factors in forming networks, like psychological factors and appearance features affecting friendship networks. However, little to no work has detected作者: 船員 時間: 2025-3-26 14:54
Semi-supervised Cross-Modal Hashing with Graph Convolutional Networksorage efficiency. However, it is still challenging to generate high-quality binary codes to preserve inter-modal and intra-modal semantics, especially in a semi-supervised manner. In this paper, we propose a semi-supervised cross-modal discrete code learning framework. This is . of applying asymmetr作者: Rinne-Test 時間: 2025-3-26 17:14 作者: palpitate 時間: 2025-3-27 00:46
A Survey on Map-Matching Algorithmstwo decades and, driven by the emerging applications, is still under development. There is a lack of categorisation of existing solutions recently and analysis for future research directions. In this paper, we review the current status of the map-matching problem and survey the existing algorithms. 作者: 苦澀 時間: 2025-3-27 02:39
Gaussian Embedding of Large-Scale Attributed Graphsf graph analysis tasks including link prediction, node classification, recommendation and visualization. Most existing approaches represent graph nodes as point vectors in a low-dimensional embedding space, ignoring the uncertainty present in the real-world graphs. Furthermore, many real-world graph作者: legacy 時間: 2025-3-27 08:28 作者: profligate 時間: 2025-3-27 10:36
Effective and Efficient Community Search in Directed Graphs Across Heterogeneous Social Networksn retrieving communities online. Although certain effort has been put into community search, users’ information has not been well exploited for effective search. Meanwhile, existing approaches for retrieval of communities are not efficient when applied in huge social networks. Motivated by this, in 作者: INERT 時間: 2025-3-27 15:14
Entity Extraction with Knowledge from Web Scale Corporags from free text against a dictionary of entities. In this paper, we present several techniques as a post-processing step for improving the effectiveness of the existing entity extraction technique. These techniques utilise models trained with the web-scale corpora which makes our techniques robust作者: 斗爭 時間: 2025-3-27 20:10
Graph-Based Relation-Aware Representation Learning for Clothing Matchingto infer complex fashion compatibility patterns from a large number of fashion items. Previous work mainly utilises metric learning techniques to model the compatibility relationships, such that compatible items are closer to each other than incompatible ones in the latent space. However, they ignor作者: conformity 時間: 2025-3-28 01:16 作者: dermatomyositis 時間: 2025-3-28 03:56 作者: 諷刺 時間: 2025-3-28 10:08
Chantal J. Snoeck,Siamak Zoharipied and non-occupied moving objects. Accordingly, we propose an efficient grid-based expand-and-bound algorithm for the approachable .NN search and conduct extensive experiments on real-world data. The results demonstrate the effectiveness and efficiency of our proposed solutions.作者: Atheroma 時間: 2025-3-28 10:28
https://doi.org/10.1007/978-1-0716-0900-2ing a multivariate gaussian distribution, and reduces backup data if we can recover such data from the partial backup data and the probabilistic model. In this paper, we focus on average, sum, max, and min queries and propose a greedy-based backup selection algorithm. We evaluate the validity and ef作者: 親密 時間: 2025-3-28 18:15
Luis Enjuanes,Stuart G. Siddell,Willy Spaannetwork structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other作者: crucial 時間: 2025-3-28 19:46 作者: 誘騙 時間: 2025-3-29 00:47
Research and Practice in Applied Linguisticsinally, we construct an index to search communities efficiently for queries. Extensive experiments demonstrate the efficiency and effectiveness of our proposed solution in directed graphs, based on heterogeneous social networks.作者: iodides 時間: 2025-3-29 04:41
Jun Pan,Billy Tak Ming Wong,Honghua Wangthe Web service networks constructed in our previous works. We evaluate the models with respect to the precision with which they unpack specific topological properties of the networks. We investigate the influence of each topological property on the accuracy of the prediction task. We conduct our ex作者: BABY 時間: 2025-3-29 10:42
Efficient ,NN Search with Occupation in Large-Scale On-demand Ride-Hailingpied and non-occupied moving objects. Accordingly, we propose an efficient grid-based expand-and-bound algorithm for the approachable .NN search and conduct extensive experiments on real-world data. The results demonstrate the effectiveness and efficiency of our proposed solutions.作者: 種子 時間: 2025-3-29 12:00
Approximate Fault Tolerance for Sensor Stream Processinging a multivariate gaussian distribution, and reduces backup data if we can recover such data from the partial backup data and the probabilistic model. In this paper, we focus on average, sum, max, and min queries and propose a greedy-based backup selection algorithm. We evaluate the validity and ef作者: infelicitous 時間: 2025-3-29 16:09
DEFINE: Friendship Detection Based on Node Enhancementnetwork structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other作者: 美食家 時間: 2025-3-29 20:16
Semi-supervised Cross-Modal Hashing with Graph Convolutional Networks asymmetric graph convolutional layers, which employ randomly sampled anchors to tackle the scalability and out-of-sample issue in graph learning, and reduce the complexity of cross-modal similarity calculation. Extensive experiments conducted on benchmark datasets demonstrate that our method can ac作者: 新娘 時間: 2025-3-30 02:50
Effective and Efficient Community Search in Directed Graphs Across Heterogeneous Social Networksinally, we construct an index to search communities efficiently for queries. Extensive experiments demonstrate the efficiency and effectiveness of our proposed solution in directed graphs, based on heterogeneous social networks.作者: 臥虎藏龍 時間: 2025-3-30 04:28
Evaluating Random Walk-Based Network Embeddings for Web Service Applicationsthe Web service networks constructed in our previous works. We evaluate the models with respect to the precision with which they unpack specific topological properties of the networks. We investigate the influence of each topological property on the accuracy of the prediction task. We conduct our ex作者: BET 時間: 2025-3-30 11:46
Query-Oriented Temporal Active Intimate Community Searchdensely-connected as well as actively participate and have active temporal interactions among them with respect to the given query consisting of a set of query nodes (users) and a set of attributes. Experiments on real datasets demonstrate the effectiveness of our proposed approach.作者: 量被毀壞 時間: 2025-3-30 15:58
0302-9743 and data analytics between researchers and practitioners from around the globe, particularly Australia, New Zealand and in the World..978-3-030-39468-4978-3-030-39469-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CONE 時間: 2025-3-30 19:23
Elena Lokhman,Srijana Rai,William Matthewsver deep neural networks. In particular, our proposed function interpolation models exhibit memory footprint two orders of magnitude smaller compared to neural network models, and 30–40% accuracy improvement over neural networks trained with the same amount of time, while keeping query time generally on-par with neural network models.作者: 酷熱 時間: 2025-3-30 21:28
Coronaviruses and their Diseasesthree representative methods from different categories to reveal how matching model affects the performance. Besides, the experiments are conducted on multiple real datasets with different settings to demonstrate the influence of other factors in map-matching problem, like the trajectory quality, data compression and matching latency.作者: 其他 時間: 2025-3-31 01:21
Function Interpolation for Learned Index Structuresver deep neural networks. In particular, our proposed function interpolation models exhibit memory footprint two orders of magnitude smaller compared to neural network models, and 30–40% accuracy improvement over neural networks trained with the same amount of time, while keeping query time generally on-par with neural network models.作者: 尖牙 時間: 2025-3-31 06:52 作者: Onerous 時間: 2025-3-31 12:46 作者: regale 時間: 2025-3-31 17:23 作者: 多產(chǎn)子 時間: 2025-3-31 21:00
Mariette F. Ducatez,Jean-Luc GuérinC can efficiently exploit the parallel computation advantages of GPU hardware for training, and further facilitate the gradient propagation. Extensive experiments on MS-COCO demonstrate that the proposed PAIC significantly reduces the training time, while achieving competitive performance compared to conventional RNN-based models.
