1. How To Make Linked Data More than Data Semantic Technology Conference 2010, June 23, 2010, San Francisco Prateek Jain, Pascal Hitzler, Amit Sheth Kno.e.sis: Ohio Center of Excellence onKnowledge-enabled Computing Wright State University, Dayton, OH http://www.knoesis.org Peter Z. Yeh, KunalVerma Accenture Technology Labs San Jose, CA
2. What is Semantic Web Semantics? Semantic Web Semantics:shareable (independent of your particular software)declarative (not dependent on imperative algorithms)computable (otherwise we don’t gain much) meaning You can do Mashups without Semantic Web semantics. You can do information integration without Semantic Web semantics. You can do most things without Semantic Web semantics. But then it will be one-off, less scalable, less reusable.
3. What Is Semantic Web Semantics? Semantic Web requires a shareable, declarative and computablesemantics. I.e., the semantics must be a formal entity which is clearly defined and automatically computable. Ontology languages provide this by means of their formal semantics. Semantic Web Semantics is given by a relation – the logical consequence relation. Note: This is considerably more than saying that the semantics of an ontology is the set of its logical consequences!
4. In other words We capture the meaning of information not by specifying its meaning directly (which is impossible) but by specifying, precisely, how information interacts with other information. We describe the meaning indirectly through its effects. - An example (from LoD) of unintended errors when adequate semantics is not used: Linked MDB links to Dbpedia URI for Hollywood for country
7. Example: GovTrack “Nancy Pelosi voted in favor of the Health Care Bill.” Vote: 2009-887 vote:hasOption Votes:2009-887/+ vote:vote vote:votedBy rdfs:label Aye vote:hasAction people/P000197 Where is the semantics? H.R. 3962: Affordable Health Care for America Act dc:title name On Passage: H R 3962 Affordable Health Care for America Act Nancy Pelosi dc:title Bills:h3962
8. Don’t get us wrong Linked Open Data is great, useful, cool, and a very important step. But if we stay semantics-free, Linked Open Data will be of limited usefulness!
9. The Semantic Data Web Layer Cake To leverage LoD, we require schema knowledge application-type driven (reusable for same kind of application) less messy than LoD(as required by application) overarching several LoD datasets (as required by application) ... Application Application Application Application Application Application Application Application Application Application Application Application Application Application Application Application ... Schema Schema Schema Schema less messy Linked Open Data messy humaneyes only Traditional Web content
11. Schema on top of the LOD Cloud Obvious solution to create an ontology capturing the relationships on top of the LOD Schema datasets. Perform a matching of the LOD Schemas using state of the art ontology matching tools. The datasets can be mapped to an upper level ontology which can capture the relationships. Considering the size, heterogeneity and complexity of LOD, at least have results which can be curated by a human being.
15. They are tuned to perform on the established benchmarks, but do not seem to work well in more unconstrained/preselected cases. Most current systems excel on Ontology Alignment Evaluation Initiative Benchmark.
18. LOD has so far emphasized number of instances, not number of meaningful relationships.
19.
20. Step 1: Enrich SchemasBLOOMS – Bootstrapping based Linked Open Data Ontology Matching Systems.
21. Step 1: Semantic Enrichment BLOOMS – Bootstrapping based Linked Open Data Ontology Matching Systems. At the highest level of abstraction our approach takes in two different ontologies and tries to match them using the following steps (1) Using Alignment API to identify direct correspondences. (2) Using the categorization of concepts using Wikipedia. (3) Running a reasoner on the results found using step (2) and directly on the ontologies.
22. Creation Wikipedia Category Hierarchy Utilizes the Wikipedia Web service to identify the matching concepts. Thus for the term Conductor the following definitions are obtained Electrical Conductor Conducting Conductor_(album) Conductor (architecture) Mr. Conductor Conductor (ring theory) These terms correspond to articles on Wikipedia for the concepts in the ontology.
23. Build Category Tree Next step utilize the Web service for identifying Wikipedia categories for building the Wikipedia category tree. Conductor Electrical conductor Conducting Conductor (album) cat:Occupations_in_music cat:Musical_Terminology cat:Musical_Notation cat:Music performance
24. For each different sense of concept c, match it with the different possible senses of the c’. Artist Conductor cat: Arts occupations Conducting cat:Occupations_in_music cat:Music performance cat: Arts_occupations
25. Connected Classes Using the position of the categories identify the relationships. Conductor Is-a Conducting Artist cat:Music performance cat:Occupations_in_music cat: Arts_occupations Ponzetto & Strube, 2007 Thus this helps in identifying approximately the relationship between the various concepts.
26. Disconnected Classes Some senses do not relate to each other Conductor Artist Conductor_(transportation) cat:Occupations_in_music cat:Bus_Transport cat: :Transportation occupations cat: Arts_occupations cat: Transportation Thus this helps in identifying disconnected relationships.
27. Equivalent Classes Some senses are identical to each other Lady_Finger Okra cat: Abelmoschus Okra cat: Hibisceae cat: Abelmoschus cat: Hibisceae cat: Malvoideae Thus this helps in identifyingequivalence relationships.
28. LOD Schema Alignment using BLOOMS Testing done on 10 different pairs of LOD schemas
29. Linked Schema’s DBpedia Ontology Music Ontology Schema Jamendo Music Brainz DBTunes Geonames SWC Pisa IEEE BBC Program ACM FOAF SIOC AKT Portal Ontology
30.
31. Step 2: Integrated Access/Federated QueryingLOQUS: Linked Open Data SPARQL Querying System (LOQUS)
32. Federated Querying Transform a query and broadcast it to a group of disparate and relevant datasets with the appropriate syntax. Merging the results collected from the datasets. Presenting them succinctly and unified format with least duplication. Automatically sort the merged result set.
33. Federated Querying Challenges User is required to have intimate knowledge about the domain of datasets. User needs to understand the exact structure of datasets. For each relevant dataset user needs to form separate queries. Entity disambiguation has to be performed on similar entities. Retrieved results have to be processed and merged.
34. Querying Federated Sources Identify artists, whose albums have been tagged as punk and the population of the places they are based near.
36. Querying the Datasets Music Ontology Give me artists with punk as genre and their locations? Geonames Data Give me the identifier used by Census Bureau for geographic locations? Census Data Give me population figures of geographical entities?
37. LOQUS Linked Open Data SPARQL Querying System. User can pose federated queries without having to know the exact structure and links between the different datasets. Automatically maps user’s query to the relevant datasets using mapping repository created using BLOOMS. Executes individual queries and merges the results into a single, complete answer.
38. Traditionally to Retrieve Results User has to …. Music Data Geographic Data Census Data Perform disambiguation Perform Union and Join Process Results
39. LOQUS Architecture A single source of reference consisting of mapping to the specific LOD datasets. Module to identify concepts contained in the query and perform the translations to the LOD cloud datasets. Module to split the query mapped to LOD datasets concepts into sub-queries corresponding to different datasets. Module to execute the queries remotely and process the results and deliver the final result to the user.
40. Querying using LOQUS Give me artists with punk as genre and their locations? Identify artists, whose albums have been tagged as punk and the population of the places they are based near. Music Data Give me artists with punk as genre and their locations? Give me the identifier used by Census Bureau for geographic locations? LOQUS Give me the identifier used by Census Bureau for geographic locations? Query is decomposed into sub-queries User looks up mapping repository to identify concepts of interest and formulates query Query is routed to the appropriate dataset Geographic Data Give me population figures of geographical entities? Census Data Give me population figures of geographical entities? Mapping Repository
41. Querying Using LOQUS Music Data Results are returned for the sub-queries. LOQUS Geographic Data Census Data
42. LOQUS Processes Partial Results Partial results are processed for union, join and disambiguation by LOQUS. LOQUS
43. Results are Returned to User LOQUS combines the results and presents them back to the user.
48. Conclusions…. continued BLOOMS is one approach for semi-automatically linking different ontologies A new approach for ontology mapping that leverages knowledge in DBPedia A more semantic LOD cloud can enable more intelligent applications such as open question answering LOQUS shows how enriched schemas can enable automatic federated queries, making LOD significantly more useful
49. References Prateek Jain, Pascal Hitzler, Peter Z. Yeh, KunalVerma, Amit P. Sheth, Linked Data is Merely More Data , AAAI Spring Symposium "Linked Data Meets Artificial Intelligence",March 22-24, 2010 Prateek Jain, KunalVerma, Pascal Hitzler, Peter Z. Yeh, Amit P. Sheth, “LOQUS: Linked Open Data SPARQL Querying System”
50. Thanks! This work is funded primarily by NSF Award:IIS-0842129, titled ''III-SGER: Spatio-Temporal-Thematic Queries of Semantic Web Data: a Study of Expressivity and Efficiency''. More at Kno.e.sis – Ohio Center of Excellence on Knowledge-enabled Computing: http://knoesis.org
Notes de l'éditeur
For each concept in the ontology , do a text search using Wikipedia webservice. Using that try to identify the articles which are related to these terms. Once these different terms are identified, build their category trees. The category trees are built upto level 4, since after that, the category tree is too abstract and not much useful for this particular purpose of Ontology Matching.
Take the category of each of these senses and compare them. For example for Conductor, its different senses would be Conducting, Conducting_Album and so on. Try to compare each of these senses to each other. Thus the sense Conducting is being matched here to the term Artist.
Wikipedia categorization has been demonstrated as a taxonomy in the work of : Ponzetto, S.P., Strube, M.: Deriving a large scale taxonomy from Wikipedia. In: AAAI’07: Proceedings of the 22nd national conference on Artificial intelligence, AAAI Press (2007) 1440–1445.The overlap of the two categorization trees helps us in determining the relationship between the trees. The overlap is a numerical amount (threshold) which can be specified by the user. The numerical amount depends on a rough heuristics: (1) If the two ontologies to be matched are of similar domains such as AKT Reference Ontology and Semantic Web Ontology (Publication Domain), then use a higher threshold. It means terms require a tighter integration. (2) If utilizing an upper level ontology, then terms will be abstract. Hence utilize a lower threshold for that. It depends on the kind of results user wants to obtain. To want a High Precision & Low Recall, choose a high threshold. To want a Low Precision & High Recall, choose a low threshold.
Some senses do not related to each other at all. They do not share any common categories or instances.
Wikipedia since its rich in language and terms, can help in identifying things which can’t be matched using normal syntactic tools.
System-1: Alignment APISystem-2: OMViaUO – Our approach outperforms actually 5 different state of the art systems published in the recent past.
1.Linked Open Data Cloud isn’t complete in terms of its linkage2. Possibility to add lot more meaningful connections which are motivated from the direction of Schema to Instance (Common-Sense) then the other way round. Unfortunately, as of now the other way round dominates.3. Using common reasoning, made possible through distributed and approximate reasoning, its possible to identify and clean the LOD Cloud. A lot of the messiness can be thrown away.