Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/27997
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGottron, Thomasen_UK
dc.contributor.authorScherp, Ansgaren_UK
dc.contributor.authorScheglmann, Stefanen_UK
dc.contributor.editorPresutti, Ven_UK
dc.contributor.editord’Amato, Cen_UK
dc.contributor.editorGandon, Fen_UK
dc.contributor.editord’Aquin, Men_UK
dc.contributor.editorStaab, Sen_UK
dc.contributor.editorTordai, Aen_UK
dc.date.accessioned2018-10-18T00:04:58Z-
dc.date.available2018-10-18T00:04:58Z-
dc.date.issued2014-12-31en_UK
dc.identifier.urihttp://hdl.handle.net/1893/27997-
dc.description.abstractWe propose an approach for modifying a declarative description of a set of entities (e.g., a SPARQL query) for the purpose of finding alternative declarative descriptions for the entities. Such a shift in representation can help to get new insights into the data, to discover related attributes, or to find a more concise description of the entities of interest. Allowing the alternative descriptions furthermore to be close approximations of the original entity set leads to more flexibility in finding such insights. Our approach is based on the construction of parallel formal concept lattices over different sets of attributes for the same entities. Between the formal concepts in the parallel lattices, we define mappings which constitute approximations of the extent of the concepts. In this paper, we formalise the idea of two types of mappings between parallel concept lattices, provide an implementation of these mappings and evaluate their ability to find alternative descriptions in a scenario of several real-world RDF data sets. In this scenario we use descriptions for entities based on RDF classes and seek for alternative representations based on properties associated with the entities.en_UK
dc.language.isoenen_UK
dc.publisherSpringer Verlagen_UK
dc.relationGottron T, Scherp A & Scheglmann S (2014) Providing alternative declarative descriptions for entity sets using parallel concept lattices. In: Presutti V, d’Amato C, Gandon F, d’Aquin M, Staab S & Tordai A (eds.) The Semantic Web: Trends and Challenges. ESWC 2014. Lecture Notes in Computer Sciences, 8465. 11th International Conference, European Semantic Web Conference (ESWC) 2014, Anissaras, Greece, 25.05.2014-29.05.2014. Cham, Switzerland: Springer Verlag, pp. 364-379. https://doi.org/10.1007/978-3-319-07443-6_25en_UK
dc.relation.ispartofseriesLecture Notes in Computer Sciences, 8465en_UK
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
dc.subject#eswc2014Gottronen_UK
dc.titleProviding alternative declarative descriptions for entity sets using parallel concept latticesen_UK
dc.typeConference Paperen_UK
dc.rights.embargodate2999-12-31en_UK
dc.rights.embargoreason[Gottron et al 2014.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1007/978-3-319-07443-6_25en_UK
dc.citation.jtitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_UK
dc.citation.issn1611-3349en_UK
dc.citation.spage364en_UK
dc.citation.epage379en_UK
dc.citation.publicationstatusPublisheden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.funderEuropean Commissionen_UK
dc.author.emailansgar.scherp@stir.ac.uken_UK
dc.citation.btitleThe Semantic Web: Trends and Challenges. ESWC 2014en_UK
dc.citation.conferencedates2014-05-25 - 2014-05-29en_UK
dc.citation.conferencelocationAnissaras, Greeceen_UK
dc.citation.conferencename11th International Conference, European Semantic Web Conference (ESWC) 2014en_UK
dc.citation.isbn9783319074429en_UK
dc.publisher.addressCham, Switzerlanden_UK
dc.contributor.affiliationUniversity of Koblenz-Landauen_UK
dc.contributor.affiliationUniversity of Kielen_UK
dc.contributor.affiliationUniversity of Koblenz-Landauen_UK
dc.identifier.scopusid2-s2.0-84902578895en_UK
dc.identifier.wtid1007477en_UK
dc.contributor.orcid0000-0002-2653-9245en_UK
dcterms.dateAccepted2014-12-31en_UK
dc.date.filedepositdate2018-10-04en_UK
rioxxterms.apcnot requireden_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorGottron, Thomas|en_UK
local.rioxx.authorScherp, Ansgar|0000-0002-2653-9245en_UK
local.rioxx.authorScheglmann, Stefan|en_UK
local.rioxx.projectProject ID unknown|European Commission (Horizon 2020)|en_UK
local.rioxx.contributorPresutti, V|en_UK
local.rioxx.contributord’Amato, C|en_UK
local.rioxx.contributorGandon, F|en_UK
local.rioxx.contributord’Aquin, M|en_UK
local.rioxx.contributorStaab, S|en_UK
local.rioxx.contributorTordai, A|en_UK
local.rioxx.freetoreaddate2264-12-01en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameGottron et al 2014.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source9783319074429en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
Gottron et al 2014.pdfFulltext - Published Version350.76 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.