Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 type ListItem.
- item-2 hasContent xing-niu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent evan-wei-xiang.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent haofen-wang.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent qiang-yang.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent yong-yu.
- item-6 previous item-5.
- paper-23 type InProceedings.
- paper-23 label "Instance-Based Matching of Large Ontologies Using Locality-Sensitive Hashing".
- paper-23 sameAs paper-23.
- paper-23 abstract "In this paper, we describe a mechanism for ontology alignment using instance based matching of types (or classes). Instance-based matching is known to be a useful technique for matching ontologies that have different names and different structures. A key problem in instance matching of types, however, is scaling the matching algorithm to (a) handle types with a large number of instances, and (b) efficiently match a large number of type pairs. We propose the use of state-of-the art locality-sensitive hashing (LSH) techniques to vastly improve the scalability of instance matching across multiple types. We show the feasibility of our approach with DBpedia and Freebase, two different type systems with hundreds and thousands of types, respectively. We describe how these techniques can be used to estimate containment or equivalence relations between two type systems, and we compare two different LSH techniques for computing instance similarity.".
- paper-23 hasAuthorList authorList.
- paper-23 isPartOf proceedings-2.
- paper-23 title "Instance-Based Matching of Large Ontologies Using Locality-Sensitive Hashing".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent songyun-duan.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent achille-fokoue.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent oktie-hassanzadeh.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent anastasios-kementsietsidis.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent kavitha-srinivas.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent michael-ward.
- item-6 previous item-5.
- paper-24 type InProceedings.
- paper-24 label "Blank Node Matching and RDF/S Comparison Functions".
- paper-24 sameAs paper-24.
- paper-24 abstract "In RDF, a blank node (or anonymous resource or bnode) is a node in an RDF graph which is not identified by a URI and is not a literal. Several RDF/S Knowledge Bases (KBs) rely heavily on blank nodes as they are convenient for representing complex attributes or resources whose identity is unknown but their attributes (either literals or associations with other resources) are known. In this paper we show how we can exploit blank nodes anonymity in order to reduce the delta (diff) size when comparing such KBs. The main idea of the proposed method is to build a mapping between the bnodes of the compared KBs for reducing the delta size. We prove that finding the optimal mapping is NP-Hard in the general case, and polynomial in case there are not directly connected bnodes. Subsequently we present various polynomial algorithms returning approximate solutions for the general case. For making the application of our method feasible also to large KBs we present a signature-based mapping algorithm with n logn complexity. Finally, we report experimental results over real and synthetic datasets that demonstrate significant reductions in the sizes of the computed deltas. For the proposed algorithms we also provide comparative results regarding delta reduction, equivalence detection and time efficiency.".
- paper-24 hasAuthorList authorList.
- paper-24 isPartOf proceedings-2.
- paper-24 title "Blank Node Matching and RDF/S Comparison Functions".
- 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 yannis-tzitzikas.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent christina-lantzaki.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dimitris-zeginis.
- item-3 previous item-2.
- paper-25 type InProceedings.
- paper-25 label "Strabon: A Semantic Geospatial DBMS".
- paper-25 sameAs paper-25.
- paper-25 abstract "We present Strabon, a new RDF store that supports the state of the art semantic geospatial query languages stSPARQL and GeoSPARQL. To illustrate the expressive power offered by these query languages and their implementation in Strabon, we concentrate on the new version of the data model stRDF and the query language stSPARQL that we have developed ourselves. Like GeoSPARQL, these new versions use OGC standards to represent geometries where the original versions used linear constraints. We study the performance of Strabon experimentally and show that it scales to very large data volumes and performs, most of the times, better than all other geospatial RDF stores it has been compared with.".
- paper-25 hasAuthorList authorList.
- paper-25 isPartOf proceedings-2.
- paper-25 title "Strabon: A Semantic Geospatial DBMS".
- 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 kostis-kyzirakos.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent manos-karpathiotakis.
- item-2 next item-3.
- item-2 previous item-1.