Trust Models for RDF Data: Semantics and Complexity
Authors: Valeria Fionda, Gianluigi Greco
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We conducted experiments on real data in order to assess the applicability of the approach and the effectiveness of the algorithmic solutions. Implementation issues and experimental results are also discussed in the paper (Section 5). |
| Researcher Affiliation | Academia | Valeria Fionda and Gianluigi Greco Department of Mathematics and Computer Science, University of Calabria, Italy |
| Pseudocode | No | The paper describes algorithms textually but does not contain structured pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | Yes | The trust framework has been implemented as an extension of the Jena API (http://jena.apache.org) and can be downloaded at http://trdfreasoner.wordpress.com. |
| Open Datasets | Yes | In our experiments, we have considered again the BTC dataset, by focusing on the 10 top publishers of blank nodes as reported in (Hogan et al. 2014) and by randomly sampling 1K RDF graphs from them. (...) Harth, A. 2012. Billion Triples Challenge data set. Downloaded from http://km.aifb.kit.edu/projects/btc-2012/. |
| Dataset Splits | No | The paper describes generating t-graphs from the sampled dataset and evaluating properties on them, but it does not provide specific dataset split information (exact percentages, sample counts, or detailed methodology) for training, validation, or testing. |
| Hardware Specification | Yes | experiments have been executed on an PC Intel Core i7 2,8 GHz, 16GB RAM. |
| Software Dependencies | No | The trust framework has been implemented as an extension of the Jena API (http://jena.apache.org) and Both algorithms for -entailment checking and core computation have been implemented by relying on the Lib TW library (http://www.treewidth.com) (No version numbers provided for Jena API or Lib TW). |
| Experiment Setup | Yes | For each RDF graph in D, we generated 5 t-graphs with random trust values, computed the -core of each of them and checked the -entailment between each pair. In addition, we computed the -core of each graph in D by considering all trust values equal to 1. (...) For each input configuration, we executed 5 runs and computed the running time as the average of the 3 running times obtained by excluding the lowest and highest ones. |