標(biāo)題: Titlebook: Big Data Analytics and Knowledge Discovery; 23rd International C Matteo Golfarelli,Robert Wrembel,Ismail Khalil Conference proceedings 2021 [打印本頁] 作者: Mottled 時間: 2025-3-21 19:05
書目名稱Big Data Analytics and Knowledge Discovery影響因子(影響力)
書目名稱Big Data Analytics and Knowledge Discovery影響因子(影響力)學(xué)科排名
書目名稱Big Data Analytics and Knowledge Discovery網(wǎng)絡(luò)公開度
書目名稱Big Data Analytics and Knowledge Discovery網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Big Data Analytics and Knowledge Discovery被引頻次
書目名稱Big Data Analytics and Knowledge Discovery被引頻次學(xué)科排名
書目名稱Big Data Analytics and Knowledge Discovery年度引用
書目名稱Big Data Analytics and Knowledge Discovery年度引用學(xué)科排名
書目名稱Big Data Analytics and Knowledge Discovery讀者反饋
書目名稱Big Data Analytics and Knowledge Discovery讀者反饋學(xué)科排名
作者: progestin 時間: 2025-3-21 23:01
Benchmarking Data Lakes Featuring Structured and Unstructured Data with DLBenchdata lake systems. However, these proposals are difficult to evaluate as there are no commonly shared criteria for comparing data lake systems. Thus, we introduce DLBench, a benchmark to evaluate and compare data lake implementations that support textual and/or tabular contents. More concretely, we 作者: Ordeal 時間: 2025-3-22 02:51
Towards an Adaptive Multidimensional Partitioning for Accelerating Spark SQL partitioning and data allocation algorithms, but they suffer when handling dynamic changes in query workload. On the other hand, Spark SQL has become a solution to process query workloads on big data, outside the DBMS realm. Unfortunately, Spark SQL incurs into significant random disk I/O cost, bec作者: LASH 時間: 2025-3-22 07:13
Selecting Subexpressions to Materialize for Dynamic Large-Scale Workloadssub-expressions. More recently, a few largely industry-led studies have focussed on the problem of identifying beneficial sub-expressions for large-scale workloads running outside of a DBMS for materialization purposes. However, these works have unfortunately ignored the large-scale workloads runnin作者: 壓倒 時間: 2025-3-22 10:22
A Chain Composite Item Recommender for Lifelong Pathwaysr fulfilling a personal lifelong project. This problem raises some specific challenges, since the recommendation process is constrained by the user profile, the time they can devote to the actions in the pathway, the obligation to smooth the learning curve of the user. We model lifelong pathways as 作者: 宮殿般 時間: 2025-3-22 15:05 作者: 強行引入 時間: 2025-3-22 17:41 作者: GUISE 時間: 2025-3-22 23:28
Universal Storage Adaption for Distributed RDF-Triple StoresResource Description Framework (RDF) plays a big role in modelling and linking web data and their relations. Dedicated systems (RDF stores/triple stores) were designed to store and query the RDF data. Due to the size of RDF data, a distributed RDF store may use several federated working nodes to sto作者: 監(jiān)禁 時間: 2025-3-23 03:29 作者: Fissure 時間: 2025-3-23 06:43
Document Ranking for Curated Document Databases Using BERT and Knowledge Graph Embeddings: Introducitention has been given to the use of various document ranking algorithms to support the maintenance of CDDs. The typical approach is to represent the update document collection using a form of word embedding and to input this into a ranking model; the resulting document rankings can then be used to 作者: 后天習(xí)得 時間: 2025-3-23 11:44
Contextual and Behavior Factors Extraction from Pedestrian Encounter Scenes Using Deep Language Mode that describes the environment and pedestrian behaviors at the pedestrian encounter scenes. The performance is compared against a baseline BiLSTM-CRF model trained for each factor separately. The evaluation results show that the proposed NLP framework outperforms the baseline model. We show that th作者: 禍害隱伏 時間: 2025-3-23 16:46 作者: Flinch 時間: 2025-3-23 18:05
Impact of Textual Data Augmentation on Linguistic Pattern Extraction to Improve the Idiomaticity of sis shows that the process of writing summaries should take into account not only terminological and collocational extraction, but also a range of linguistic material referred to here as the “support lexicon”, that plays an important role in the cognitive organisation of the field. On this basis, th作者: bioavailability 時間: 2025-3-24 01:09 作者: Fabric 時間: 2025-3-24 05:16
Efficient Graph Analytics in Python for Large-Scale Data Sciencekages for graph analytics. However, those packages are either too specific or cannot work on graphs that cannot fit into the main memory. Moreover, it is hard to handle new graph algorithms or even customize existing ones according to the analyst’s need. In this paper, we develop a general graph C++作者: connoisseur 時間: 2025-3-24 06:36 作者: libertine 時間: 2025-3-24 12:36
https://doi.org/10.1007/978-1-4842-3252-1processing, based on a genetic optimization problem formulation. Our approach intensively rewrites queries by exploiting different dimension hierarchies that may exist among dimension attributes, skipping irrelevant data to improve I/O performance. We present an experimental validation on a Spark SQL parallel cluster, showing promising results.作者: heirloom 時間: 2025-3-24 16:39
Linux Distro Selection Criteriaroposed model yields significant improvements over existing methods on the benchmark VCR dataset. Moreover, the proposed model provides intuitive interpretation into visual commonsense reasoning. A Python implementation of our mechanism is publicly available at .作者: 制定法律 時間: 2025-3-24 19:59 作者: exclamation 時間: 2025-3-25 02:21 作者: 全國性 時間: 2025-3-25 05:41 作者: 共同確定為確 時間: 2025-3-25 10:31 作者: 蕨類 時間: 2025-3-25 13:56 作者: PRISE 時間: 2025-3-25 17:51 作者: NUL 時間: 2025-3-26 00:02 作者: Monolithic 時間: 2025-3-26 04:11 作者: 錢財 時間: 2025-3-26 04:50 作者: 小母馬 時間: 2025-3-26 11:30
Object Relational Mapping and JPA,tances based on bounding boxes, (2) we formulate and prove several theorems regarding such a representation that can improve instances identification step, (3) we provide a novel algorithm utilizing the aforementioned theorems and analyze its complexity. Finally, we experimentally demonstrate the efficiency of the proposed solution.作者: 有偏見 時間: 2025-3-26 15:50
https://doi.org/10.1007/978-1-4302-5849-0propose a data model made of both textual and CSV documents, a workload model composed of a set of various tasks, as well as a set of performance-based metrics, all relevant to the context of data lakes. As a proof of concept, we use DLBench to evaluate an open source data lake system we previously developed.作者: Robust 時間: 2025-3-26 19:52 作者: 上流社會 時間: 2025-3-26 23:28
Math and Computer Programming Languages,allel clustering of large textual data through Spark framework and implementing a new document hashing strategy. Experiments performed on several large collections of documents have shown the effectiveness of the proposed method compared to existing ones in terms of running time and clustering accuracy.作者: 異端 時間: 2025-3-27 03:53
https://doi.org/10.1007/978-1-4842-2349-9is paper highlights the relevance of pre-training the CamemBERT model on a French financial dataset to extend its domain-specific vocabulary and fine-tuning it on extractive summarisation. We then evaluate the impact of textual data augmentation, improving the performance of our extractive text summarisation model by up?to 6%–11%.作者: 初學(xué)者 時間: 2025-3-27 07:37 作者: Aggregate 時間: 2025-3-27 11:45
Linux Distro Selection Criteriais data model. In this paper, we however argue that by concentrating on transaction related functionalities rather than analytical operations, most of these systems address the wrong data market. We motivate this claim by presenting several concrete arguments.作者: subordinate 時間: 2025-3-27 14:21
RDF Data Management is an Analytical Market, not a Transaction Oneis data model. In this paper, we however argue that by concentrating on transaction related functionalities rather than analytical operations, most of these systems address the wrong data market. We motivate this claim by presenting several concrete arguments.作者: arrogant 時間: 2025-3-27 20:31 作者: 分離 時間: 2025-3-28 01:18
https://doi.org/10.1007/978-1-4842-5410-3annot fit in the main memory. Our function is developed in C++, but it can be easily called in Python. Experimental comparison with state-of-art Python packages show that our C++ function has comparative performance for both small and large graphs.作者: Obloquy 時間: 2025-3-28 05:50
A Chain Composite Item Recommender for Lifelong Pathwaysr measuring the quality of the recommended pathways. We experiment with both artificial and real datasets, showing our approach is a promising building block of an interactive lifelong pathways recommender system.作者: Decline 時間: 2025-3-28 10:12 作者: agenda 時間: 2025-3-28 11:54 作者: 受人支配 時間: 2025-3-28 16:07 作者: 偶然 時間: 2025-3-28 22:47 作者: TERRA 時間: 2025-3-29 02:45
Introducing JavaScript Game Developmentsub-expressions. More recently, a few largely industry-led studies have focussed on the problem of identifying beneficial sub-expressions for large-scale workloads running outside of a DBMS for materialization purposes. However, these works have unfortunately ignored the large-scale workloads runnin作者: Rinne-Test 時間: 2025-3-29 03:57 作者: 實施生效 時間: 2025-3-29 08:49 作者: 過份好問 時間: 2025-3-29 14:17
Linux Distro Selection Criteriascene understanding task with a wide range of applications, including visual question answering, automated vehicle systems, and clinical decision support. Previous approaches to solving the VCR task generally rely on pre-training or exploiting memory with long dependency relationship encoded models.作者: moratorium 時間: 2025-3-29 18:42
https://doi.org/10.1007/978-1-4842-1392-6Resource Description Framework (RDF) plays a big role in modelling and linking web data and their relations. Dedicated systems (RDF stores/triple stores) were designed to store and query the RDF data. Due to the size of RDF data, a distributed RDF store may use several federated working nodes to sto作者: Friction 時間: 2025-3-29 20:38
Linux Distro Selection Criteriauted to the establishment of standards such as the SPARQL query language and the emergence of production-ready database management systems based on this data model. In this paper, we however argue that by concentrating on transaction related functionalities rather than analytical operations, most of作者: Mirage 時間: 2025-3-30 01:31
https://doi.org/10.1007/978-1-349-86084-5tention has been given to the use of various document ranking algorithms to support the maintenance of CDDs. The typical approach is to represent the update document collection using a form of word embedding and to input this into a ranking model; the resulting document rankings can then be used to 作者: RECUR 時間: 2025-3-30 07:43
Introducing Markdown and Pandoc that describes the environment and pedestrian behaviors at the pedestrian encounter scenes. The performance is compared against a baseline BiLSTM-CRF model trained for each factor separately. The evaluation results show that the proposed NLP framework outperforms the baseline model. We show that th作者: 滔滔不絕的人 時間: 2025-3-30 08:51 作者: Alveolar-Bone 時間: 2025-3-30 15:44 作者: Friction 時間: 2025-3-30 17:37
Grid Fundamentals and Helper Classes,we focus on irony detection in Turkish and we analyze the explainability of neural models using Shapley Additive Explanations (SHAP) and Local Interpretable Model-Agnostic Explanations (LIME). The analysis is conducted on a set of annotated sample sentences.作者: photophobia 時間: 2025-3-30 23:17
https://doi.org/10.1007/978-1-4842-5410-3kages for graph analytics. However, those packages are either too specific or cannot work on graphs that cannot fit into the main memory. Moreover, it is hard to handle new graph algorithms or even customize existing ones according to the analyst’s need. In this paper, we develop a general graph C++作者: Bmd955 時間: 2025-3-31 01:16 作者: 健壯 時間: 2025-3-31 06:50
