Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent ramnandan-krishnamurthy.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent amol-mittal.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent craig-a-knoblock.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent pedro-szekely.
- item-4 previous item-3.
- 118 creator fadi-maali.
- 118 creator stefan-decker.
- 118 creator stephane-campinas.
- 118 type InProceedings.
- 118 label "Gagg: A Graph Aggregation Operator".
- 118 sameAs 118.
- 118 abstract "There is an increasing amount of (semi)-structured data found on the Web that exhibits a graph data model. Although it provides comprehensive details about individual entities, the entities themselves are not the item of interest, but rather an aggregated view of the data. The analysis of graph data is a common task, thus, there is a need for an analytical framework that facilitates this. In this work, we propose a graph aggregation operator, called Gagg, that is flexible with regards to the data’s structure and analysis requirements. We formalise the semantics of Gagg so it can be part of a wider graph processing algebra. We believe such an operator is core to such an algebra, where several optimisations are possible. We evaluate Gagg over the BSBM and SP2B benchmarks and we find that it improves the graph aggregation performance by a factor of three.".
- 118 hasAuthorList authorList.
- 118 isPartOf proceedings.
- 118 keyword "Graph Aggregation".
- 118 keyword "Graph Analytics".
- 118 keyword "Graph Processing".
- 118 keyword "Graph Summarisation".
- 118 keyword "RDF Analytics".
- 118 keyword "SPARQL".
- 118 title "Gagg: A Graph Aggregation Operator".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent fadi-maali.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent stephane-campinas.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent stefan-decker.
- item-3 previous item-2.
- 119 creator harald-kosch.
- 119 creator mazen-alsarem.
- 119 creator pierre-edouard-portier.
- 119 creator sylvie-calabretto.
- 119 type InProceedings.
- 119 label "Ranking Entities in the Age of Two Webs, An Application to Semantic Snippets".
- 119 sameAs 119.
- 119 abstract "The advances of the Linked Open Data (LOD) initiative are giving rise to a more structured Web of data. Indeed, a few datasets act as hubs (e.g., DBpedia) connecting many other datasets. They also made possible new Web services for entity detection inside plain text (e.g., DBpedia Spotlight), thus allowing for new applications that will benefit from a combination of the Web of documents and the Web of data. To ease the emergence of these new use-cases, we propose a query-biased algorithm for the ranking of entities detected inside a Web page. Our algorithm combine link analysis with dimensionality reduction. We use crowdsourcing for building a publicly available and reusable dataset on which we compare our algorithm to the state of the art. Finally, we use this algorithm for the construction of semantic snippets for which we evaluate the usability and the usefulness with a crowdsourcing-based approach.".
- 119 hasAuthorList authorList.
- 119 isPartOf proceedings.
- 119 keyword "crowdsourcing".
- 119 keyword "pagerank".
- 119 keyword "snippets".
- 119 keyword "svd".
- 119 title "Ranking Entities in the Age of Two Webs, An Application to Semantic Snippets".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent pierre-edouard-portier.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent mazen-alsarem.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent sylvie-calabretto.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent harald-kosch.
- item-4 previous item-3.
- 125 creator christoph-lange.
- 125 creator jeremy-debattista.
- 125 creator santiago-londono.
- 125 creator soeren-auer.
- 125 type InProceedings.
- 125 label "Quality Assessment of Linked Datasets using Probabilistic Approximations".
- 125 sameAs 125.
- 125 abstract "With the increasing application of Linked Open Data, assessing the quality of datasets by computing quality metrics becomes an issue of crucial importance. For large and evolving datasets, an exact, deterministic computation of the quality metrics is too time consuming or expensive. We employ probabilistic techniques such as Reservoir Sampling, Bloom Filters and Clustering Coefficient estimation for implementing a broad set of different data quality metrics in an approximate but sufficiently accurate way. Our implementation is integrated in the comprehensive data quality assessment framework Luzzu and evaluated in terms of performance and accuracy on Linked Open Datasets of broad relevance.".
- 125 hasAuthorList authorList.
- 125 isPartOf proceedings.
- 125 keyword "Linked Data".
- 125 keyword "Probabilistic Approximations".
- 125 keyword "Quality Assessment".