Matches in ScholarlyData for { ?s ?p ?o. }
- item-3 hasContent sebastian-krause.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent feiyu-xu.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent roberto-navigli.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent hans-uszkoreit.
- item-6 previous item-5.
- paper-23 type InProceedings.
- paper-23 label "Semantic Message Passing for Generating Linked Data from Tables".
- paper-23 sameAs paper-23.
- paper-23 abstract "We describe work on automatically inferring the intended meaning of tables and representing it as RDF linked data, making it available for improving search, interoperability and integration. We present implementation details of a joint inference module that uses knowledge from the linked open data (LOD) cloud to jointly infer the semantics of column headers, table cell values (e.g., strings and numbers) and relations between columns. We also implement a novel Semantic Message Passing algorithm which uses LOD knowledge to improve existing message passing schemes. We evaluate our implemented techniques on tables from the Web and Wikipedia.".
- paper-23 hasAuthorList authorList.
- paper-23 isPartOf proceedings-1.
- paper-23 title "Semantic Message Passing for Generating Linked Data from Tables".
- 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 varish-mulwad.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent tim-finin.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent anupam-joshi.
- item-3 previous item-2.
- paper-24 type InProceedings.
- paper-24 label "Bringing Math to LOD: A Semantic Publishing Platform Prototype for Scientific Collections in Mathematics".
- paper-24 sameAs paper-24.
- paper-24 abstract "We present our work on developing a software platform for mining mathematical scholarly papers to obtain a Linked Data representation. Currently, the Linking Open Data (LOD) cloud lacks up-to-date and detailed information on professional level mathematics. To our mind, the main reason for that is the absence of appropriate tools that could analyze the underlying semantics in mathematical papers and effectively build their consolidated representation. We have developed a holistic approach to analysis of mathematical documents, including ontology based extraction, conversion of the article body as well as its metadata into RDF, integration with some existing LOD data sets, and semantic search. We argue that the platform may be helpful for enriching user experience on modern online scientific collections.".
- paper-24 hasAuthorList authorList.
- paper-24 isPartOf proceedings-1.
- paper-24 title "Bringing Math to LOD: A Semantic Publishing Platform Prototype for Scientific Collections in Mathematics".
- 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 hasItem item-7.
- authorList hasLastItem item-7.
- item-1 type ListItem.
- item-1 hasContent olga-nevzorova.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent nikita-zhiltsov.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent danila-zaikin.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent olga-zhibrik.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent alexander-kirillovich.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent vladimir-nevzorov.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent evgeniy-birialtsev.
- item-7 previous item-6.
- paper-25 type InProceedings.
- paper-25 label "ORCHID – Reduction-Ratio-Optimal Computation of Geo-Spatial Distances for Link Discovery".
- paper-25 sameAs paper-25.
- paper-25 abstract "The discovery of links between resources within knowledge bases is of crucial importance to realize the vision of the Semantic Web. Addressing this task is especially challenging when dealing with geo-spatial datasets due to their sheer size and the potential complexity of single geo-spatial objects. Yet, so far, little attention has been paid to the characteristics of geo-spatial data within the context of link discovery. In this paper, we address this gap by presenting Orchid, a reduction-ratio-optimal link discovery approach designed especially for geo-spatial data. Orchid relies on a combination of the Hausdorff and orthodromic metrics to compute the distance between geo-spatial objects. We first present two novel approaches for the efficient computation of Hausdorff distances. Then, we present the space tiling approach implemented by Orchid and prove that it is optimal with respect to the reduction ratio that it can achieve. The evaluation of our approaches is carried out on three real datasets of different size and complexity. Our results suggest that our approaches to the computation of Hausdorff distances require two orders of magnitude less orthodromic distances computations to compare geographical data. Moreover, they require two orders of magnitude less time than a naive approach to achieve this goal. Finally, our results indicate that Orchid scales to large datasets while outperforming the state of the art significantly.".
- paper-25 hasAuthorList authorList.
- paper-25 isPartOf proceedings-1.
- paper-25 title "ORCHID – Reduction-Ratio-Optimal Computation of Geo-Spatial Distances for Link Discovery".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent axel-cyrille-ngonga-ngomo.
- paper-26 type InProceedings.
- paper-26 label "Simplifying Description Logic Ontologies".
- paper-26 sameAs paper-26.
- paper-26 abstract "We discuss the problem of minimizing TBoxes expressed in the light-weight description logic E L, which forms a basis of some large ontologies like SNOMED, Gene Ontology, NCI and Galen. We show that the minimization of TBoxes is intractable (NP-complete). While this looks like a bad news result, we also provide a heuristic technique for minimizing TBoxes. We prove the correctness of the heuristics and show that it provides optimal results for a class of ontologies, which we define through an acyclicity constraint over a reference relation between equivalence classes of concepts. To establish the feasibility of our approach, we have implemented the algorithm and evaluated its effectiveness on a small suite of benchmarks.".
- paper-26 hasAuthorList authorList.
- paper-26 isPartOf proceedings-1.
- paper-26 title "Simplifying Description Logic Ontologies".