Transactions on Large-Scale Data- and Knowledge-Centered Systems LII

✍ Scribed by Abdelkader Hameurlain; A Min Tjoa

• Publisher: Springer Nature
• Year: 2022
• Tongue: English
• Leaves: 157
• Category: Library

✦ Synopsis

The LNCS journal Transactions on Large-Scale Data and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which are core and hot topics in computer science. Since the 1990s, the Internet has become the main driving force behind application development in all domains. An increase in the demand for resource sharing (e.g., computing resources, services, metadata, data sources) across different sites connected through networks has led to an evolution of data- and knowledge-management systems from centralized systems to decentralized systems enabling large-scale distributed applications providing high scalability. This, the 52nd issue of Transactions on Large-Scale Data and Knowledge-Centered Systems, contains 6 fully revised selected regular papers.

✦ Table of Contents

Preface
Organization
Contents
Mutida: A Rights Management Protocol for Distributed Storage Systems Without Fully Trusted Nodes
1 Introduction
2 Related Work
3 Usage Scenarios and Assumptions
4 Mutida Model
4.1 Protocol Description
4.2 Storage of the Global ACL
4.3 ACL Management
5 Methodology
5.1 Classical Cryptography
5.2 The Base Comparison Method - Shamir's Secret Sharing
6 Results Evaluation
6.1 Method Calculation Performance
6.2 Scenario I: No Data Sharing
6.3 Scenario II: Sharing Data with a Single User
6.4 Scenario III: Real-World Use Case
6.5 Discussion of Results
7 Conclusion
References
OpenCEMS: An Open Solution for Easy Data Management in Connected Environments
1 Introduction
2 Related Works
2.1 Research/Academic Works
2.2 Industrial Solutions
3 Proposal: OpenCEMS
3.1 Technical Overview
3.2 Data Management Services
3.3 Services Execution Modalities
3.4 Ontology-Based Web Form Generation
3.5 Ongoing Developments
4 Illustration Example
4.1 Environment Setup and Data Acquisition
4.2 Services Usage
5 Conclusion and Future Works
References
Knowledge Graph Augmentation for Increased Question Answering Accuracy
1 Introduction
2 Related Works
2.1 Question Answering
2.2 Question Answering over Knowledge Graphs
2.3 Insufficiency of Solutions for Query Expansion
2.4 Data Augmentation
2.5 Differences Between KG Augmentation and KG Auto-Completion
2.6 Positioning in the State-of-the-Art
3 Automatic Knowledge Graph Augmentation
3.1 Character-Level Augmentation
3.2 Item-Level Augmentation
3.3 Component-Level Augmentation
3.4 An Efficient Combination of All of Them
4 Results
4.1 Datasets
4.2 Setup
4.3 Empirical Evaluation
4.4 Discussion
5 Conclusions
References
Online Optimized Product Quantization for ANN Queries over Dynamic Database using SVD-Updating
1 Introduction
2 Preliminaries
2.1 Approximate K-Nearest Neighbor Search
2.2 Vector Quantization (VQ)
2.3 Product Quantization (PQ)
2.4 Optimized PQ
2.5 Online PQ
3 Related Work
3.1 Approximate Nearest-Neighbor (ANN) Search
3.2 Quantization Methods
4 Proposed Method
4.1 Updating Codebook
4.2 Update Rotation Matrix using SVD-Updating
4.3 Online Optimized PQ Using SVD-Updating
4.4 Computational Complexity
4.5 Applying Sliding Window
5 Experiments
5.1 Experimental Setting
5.2 Effects of Low-Rank Approximation
5.3 Comparison with Non-online Methods
5.4 Comparison with Online Methods
5.5 Performance with Sliding Windows
6 Conclusion
References
Empirical Study of the Model Generalization for Argument Mining in Cross-Domain and Cross-Topic Settings
1 Introduction
2 Related Work
3 Method
3.1 Problem Statement
3.2 Data Description
3.3 Models of Our Ensemble Learning Approach
4 Experiments
4.1 Feature Analysis and Model Selection
4.2 Single-Dataset Learning (SDL) Vs. Multi-dataset Learning (MDL)
4.3 Cross-Domain Settings: Testing on a Completely Unseen Dataset
4.4 Cross-Topic Settings: Testing on Unseen Topics from the Same Dataset(s)
5 Conclusion
References
A Pattern Mining Framework for Improving Billboard Advertising Revenue
1 Introduction
2 Related Work and Background
2.1 Related Work
2.2 Background About Coverage Patterns
3 Proposed Framework of the Problem
4 Proposed Billboard Allocation Scheme
4.1 Basic Idea
4.2 Proposed BAF
4.3 Illustrative Example
4.4 Time and Space Complexity
5 Performance Evaluation
5.1 Effect of Varying the Number of Clients
5.2 Effect of Varying the Number of Available Billboards
5.3 Effect of Varying maxOR
5.4 Discussion on Setting the Parameters of BAF
6 Conclusion
References
Author Index