作者: Marie Destandau , Caroline Appert , Emmanuel Pietriga
DOI: 10.3233/SW-200383
关键词: Computer science 、 Information retrieval 、 Forcing (recursion theory) 、 Resource (project management) 、 RDF 、 Graph (abstract data type) 、 Context (language use) 、 Linked data 、 Drill down 、 Set (abstract data type)
摘要: Meaningful information about an RDF resource can be obtained not only by looking at its properties, but putting it in the broader context of similar resources. Classic navigation paradigms on Web Data that employ a follow-your-nose strategy fail to provide such context, and put strong emphasis first-level forcing users drill down graph one step time. We introduce concept semantic paths: starting from set resources, we follow analyse chains triples characterize sets values their end. investigate based aggregation, relying path characteristics determine most readable representation. implement this approach S-Paths, browsing tool for linked datasets systematically identifies best rated view given set, leaving free switch another or get different perspective same selecting other paths visualize.