What are the problems addressed by Linked Open Graph and Social Graph
Try Linked Open Graph http://log.disit.org/Version 3.0 also added a number of features such as save, embedd, discovering OD/LOD, controlling single links, etc. GET THE PAPER.
LOG is accessible at source code on GITHUB
Since Version 2.0, LOG.disit.org works on Europeana, dbPedia, British Museum, Sii-Mobility smart city, OSIM knowledge and competence, ICARO cloud, Getty, Senato and Camera linked open data, IEEE video stanford, linked go data, all sparql 1.1
Linked Open Graph, LOG LOD, relazioni a click, volantino
LOG.DISIT.ORG is a unified solution for problems and cases such as:
1) Linked Open Data, linked data are complex structures to be understood if you just access to them for their exploitation and reuse.
A tool for browsing LD/LOD selecting relationships among URI elements and their attributes can be a solution for developer for data and knowledge engineers. Therefore, services that allow you to insert URI of LOD to navigate on their structure are very important. And the graph may bring you to other connected RDF stores via their definitions in terms of LD.
2) portals and services need to cope with relationships among Users, Contents and external sources (see for example Social Graph). Thus the users need to have a clear view about the relations among these entities to better understand context at a glance, such as:
Who has provided a given content: group, user, etc.; How a given content has been used by other users: promoted, played, uploaded, updated, etc.; Which are the geographical locations mentioned by a content, and where is located, may be connected with external geoname, and GPS coordinates; Which are the person names cited into a content: vip names related to dbPedia, users of the portals, other person names cited in many other content; Who has been contact with how, what they have done, etc. The users need to discover and navigate among these relations by selecting those of interest for each specific case.
3) Multiple SPARQL entry points. The access and browse to a RDF store via the SPARQL entry point is a way to understand the knowledge base and the relationships among the included entities. In some cases, the entities/URIs (URI(a), URI(b) ) of different RDF stores (accessible via different SPARQL entry points: URL(a) and URL(b)) may be connected each other. Typically the connection can be via URI representing classes of common ontologies and definitions. The visualization of graphs associated with URL(a),URI(a) and URL(b),URI(b) on the same screen may allow to put in evidence the relationships among these two graphs. They may be the basis for (i) integrating the two ontologies, for federating RDF storage, (ii) understand differences and relationships, and/or (iii) for creating additional connections. For example, by creating an owl:sameAsrelationship among two entities that represent the same concept in the two models. In some cases, they have not been intentionally defined by using the same vocabulary since they are different for somehow, while in other context they should be the same, otherwise deductions in the knowledge base would not take into account all needed facts.
How it has been solved
The Linked Open Graph allows to display and browse the structure and relations among the RDF entities. The graph is made of two kinds of nodes, rectangular shaped nodes represent entities (content, terms, users, etc.) while circular shaped nodes represent relations. Directed edges connect an entity node to a relation node and a relation node to an entity node. Examples of relations are shown in Figure.
 |
Regarding the user interactions the User is able to: Expand an entity node with its relations adding them to the graph; Focus on an entity, in this case the graph is cleared and only the focused node is shown with its relations; Open, that is the play of the page or content associated with the node; use the Back button to go back to previous states of the graph (e.g. after a focus); Zoom/Pan the view; Hide/show types of relations to reduce the complexity of the graph. Search, this allow you to search your preferred entities and URI into a set of SPARQL databases. A special node is the 'More' node that is presented when in a relation are present many nodes (e.g., the content associated with a group). Save and share graphs and share with other colleagues, avoid cuplicated links, explore inbound and outbound relatiojnships, navigating on OD and LOD in a transparent manner. Work on relatioshhips you prefer. |
The following figure reports an example of a Search for your preferred entities and URI into a set of SPARQL databases with billions and billions of triples.
Who is using it
The Linked Open Graph is presently used as Social Graph on the Home page of http://www.ECLAP.EUand in the Sentient Multimedia Network portal. The Social Graph is also used as administrator tool in APREToscana.org. it is mentioned as a valuable tool by Europeana ThoughtLab page on new ways of searching and browsing (http://pro.europeana.eu/web/guest/thoughtlab/new-ways-of-searching-and-browsing#SocialGraph). LOG can be embedded into your WEB pages. On this regard you can customize the buttons and the actions you allow at your users on the ebedded version of the LOG.disit.org tool instance and on which segement of graph starting.According to the user’s interaction analysis of the social graph and of the whole portal, the 5.8% of the unique users interacted with the social graph. The most requested operation has been to Open a node (43%, for example to access at a recommendation, to see the content of other users), then to Expand a node (29%, mainly a media object 17%) and then to see the More related content (18%), the Focus operation is at about 10% on the operations requested since the social graph was activated (2013-01-29) until the mid of September 2013.
See: http://www.eclap.eu, http://www.eclap.eu/116088, http://www.eclap.eu/177623, http://www.apretoscana.org
On what it works
Try Linked Open Graph http://log.disit.org/
it works on Europeana, dbPedia, British Museum, Sii-Mobility smart city, OSIM knowledge and competence, ICARO cloud, Getty, Senato and Camera linked open data, IEEE video stanford, linked go data, all sparql 1.1
Embedding
LOG can be embedded into your WEB pages. On this regard you can customize the buttons and the actions you allow at your users on the ebedded version of the LOG.disit.org tool instance and on which segement of graph starting.
Features of LOG
| Access and Query |
| Access and rendering of LD |
| Access and rendering URI from SPARQL entry point |
| Managing Entry Points with different URL in URI. |
| Multiple SPARQL entry points |
| Making keyword based query |
| Inspecting entry point for searching classes |
| Relationships vs entities |
| Showing relationships, turning on/off, singularly or globally |
| Representing relationships (managing complexity) |
| Discovering inbound/outbound relationships, URI and queries |
| Expand all relationships |
| Close all relationships |
| Counting number of elements |
| “sameAs” management |
| Blank nodes rendering |
| General Manipulation |
| Undo actions performed, “back” |
| Save and Load LOD graphs |
| Share and collaborative LOD graphs |
| Re-layouting the graph |
| Focusing on an URI |
| Zooming the graph |
| Centering the graph |
| Panning the graph with mouse/finger |
| URI Details |
| URI attributes (showing info or an URI) |
| Map allocation of URI |
| URL to resources |
| Open play resources |
| Representing entities |
| Non Functional |
| Web based tool |
| Embed in web pages of third party service: ECLAP |
| Graph Invoked by URL |
Contact and licensing
Paolo Nesi, paolo.nesi@unifi.it The LOG.disit.org tools is provided under dual lincense. Free of charge and open source for no profit organizations and under a license agreement for profit companies. You can embedd in your tools and web pages, you can customize according to your needs. In any case, we can improve and customize the LOG for you, according to your needs. The formal definition of the license is reported in the LOG and below
Linked Open Graph
Free of charge usage for non commercial purpose for no profit institutions and for research.