Quality-Aware Subgraph Matching Over Inconsistent Probabilistic Graph Databases
Rs4,500.00
10000 in stock
SupportDescription
Resource Description Framework (RDF) has been widely used in the SemanticWeb to describe resources and their relationships. The RDF graph is one of the most commonly used representations for RDF data. However, in many real applications such as the data extraction/integration, RDF graphs integrated from different data sources may often contain uncertain and inconsistent information (e.g., uncertain labels or that violate facts/rules), due to the unreliability of data sources. In this paper, we formalize the RDF data by inconsistent probabilistic RDF graphs, which contain both inconsistencies and uncertainty.
Only logged in customers who have purchased this product may leave a review.
Reviews
There are no reviews yet.