A method of automated ontology alignment using contextual information and taxonomies.

1. Contextual Ontology Alignment of LOD with an Upper Ontology: A Case Study with Proton PrateekJain, Peter Z. Yeh, KunalVerma, Reymonrod Vasquez, Mariana Damova, Pascal Hitzler and Amit P. Sheth Kno.e.sis, Wright State University, Dayton, OH Ontotext, Sofia, Bulgaria, Accenture Technology Labs, San Jose, CA TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA

2. Outline Introduction Background Challenges Existing Approaches BLOOMS+ Approach Conclusion & Future Work References

3. Outline Introduction Background Challenges Existing Approaches BLOOMS+ Approach Conclusion & Future Work References

4. Web of Data

6. If everything is nice, why am I here.. Lack of Conceptual Description of Datasets Absence of Schema Level Links Lack of expressivity Difficulties with respect to querying using SPARQL Schema heterogeneity Entity disambiguation Ranking of results

7. What can be done? Relationships are at the heart of Semantics. LOD captures instance level relationships, but lacks class level relationships. Superclass Subclass Equivalence How to find these relationships? Perform a matching of the LOD Ontology’s using state of the art schema matching tools. Desirable Considering the size of LOD, at least have results which a human can curate.

8. Schema Matching Schema matching is the process of identifying that two objects are semantically related. In two schemas DB1.Student (Name, SSN, Level, Major, Marks) and DB2.Grad-Student (Name, ID, Major, Grades); possible matches would be: DB1.Student ≈ DB2.Grad-Student; DB1.SSN = DB2.ID etc. and possible transformations or mappings would be: DB1.Marks to DB2.Grades (100-90 A; 90-80 B..). Need for high quality data for querying and analytics in large enterprises. Schema mapping provides a way of resolving discrepancies in data.

10. Outline Introduction Background Challenges Existing Approaches BLOOMS+ Approach Conclusion & Future Work References

11. Existing Approaches A survey of approaches to automatic Ontology matching by Erhard Rahm, Philip A. Bernstein in the VLDB Journal 10: 334–350 (2001)

12. Outline Introduction Background Challenges Existing Approaches BLOOMS+ Approach Conclusion & Future Work References

13. Our Approach Use knowledge contributed by users Structured knowledge contributed by users To improve

15. Structure

16. Has a “self healing property”

18. Schema Matching on LOD using Wikipedia Categorization On Wikipedia, categories are used to organize the entire project. Wikipedia's category system consists of overlapping trees. Simple rules for categorization “If logical membership of one category implies logical membership of a second, then the first category should be made a subcategory” “Pages are not placed directly into every possible category, only into the most specific one in any branch” “Every Wikipedia article should belong to at least one category.”

21. BLOOMS+ Approach – Step 3 In the tree Ti, find n (the number of common nodes which occurs in Tj). Compute overlap Os between the source and target tree. Exponentiation of the inverse depth of common node gives less node to nodes which appear lower in the hierarchy (generic nodes) Log of tree avoids bias against large trees.

22. Contextual Similarity BLOOMS+ computes contextual similarity between a source class C and target D to further determine if they should be aligned. Information about super classes of C and D is a good source of contextual information. If the super classes agree, it is a good alignment otherwise it should be penalized. For example, Jaguar has super classes such as Car and Vehicle, and Cat has super classes such as Feline and Mammal, then the alignment should be penalized because its contextual similarity is low.

23. BLOOMS+ Approach – Step 4 BLOOMS+ retrieves all super classes of C and D up to level 2 (can be changed). The set of super classes is N( C ) and N (D). For each BLOOMS+ tree pair ( Ti, Tj) between C and D, BLOOMS+ determines the number of super classes in N(C) and N(D) in following way. A super class c ∈ N(C) is supported by Tiif either of the following conditions are satisfied:– The name of c matches a node inTj The Wikipedia article (or article category) corresponding to c based on a Wikipedia search web service call using the name of c – matches a node in Ti.

24. BLOOMS Approach – Step 5 BLOOMS+ computes the overall contextual similarity between C and D with respect to Ti and Tj using the harmonic mean, which is instantiated as: We chose the harmonic mean to emphasize super class neighborhoods that are not well supported (and hence should significantly lower the overall contextual similarity).

25. BLOOMS Approach – Step 6 BLOOMS+ computes the overall similarity between classes C and D w.r.t. BLOOMS+ trees Ti and Tj by taking the weighted average of the class and contextual similarity. BLOOMS+ defaults alpha and beta to 1 to give equal importance. BLOOMS+ then selects the tree pair (Ti,Tj) ∈ FC × FD with the highest overall similarity score and if this score is greater than the alignment threshold HA.

27. Outline Introduction Background Challenges Existing Approaches BLOOMS+ Approach Conclusion & Future Work References

28. Conclusion We have presented a system called BLOOMS+ for performing ontology alignment using contextual information. BLOOMS+ has been evaluated on alignment of three different LOD ontologies to PROTON, created manually by human experts for real world application called FactForge. To the best of our knowledge, BLOOMS+ is the only system which utilizes contextual information present in ontology and Wikipedia category hierarchy for ontology matching. BLOOMS+ significantly outperforms state of the art solutions for the task of ontology alignment.

29. Future Work Extended BLOOMS to utilize contextual information available on community generated data. New weighting mechanism for identifying matches between the concepts in the dataset. Develop a polling mechanism for identifying the best source to assist in the process of schema alignment. Allow seamless querying across datasets by utilizing the generated alignments (preliminary work LOQUS).

30. References PrateekJain,Peter Z. Yeh, KunalVerma, Reymonrod Vasquez, Mariana Damova, Pascal Hitzler and Amit P. Sheth, “Contextual Ontology Alignment of LOD with an Upper Ontology: A Case Study with Proton”. Proceedings of the 8th Extended Semantic Web Conference 2011, volume 6643 of Lecture Notes in Computer Science, Heidelberg, 2011. Springer Berlin Prateek Jain, Pascal Hitzler, Amit P. Sheth, KunalVerma, Peter Z. Yeh: Ontology Alignment for Linked Open Data. Proceedings of the 9th International Semantic Web Conference 2010, Shanghai, China, November 7th-11th, 2010. Pages 402-417. Prateek Jain, Pascal Hitzler, Peter Z. Yeh, KunalVerma, and AmitP.Sheth, Linked Data Is Merely More Data. In: Dan Brickley, Vinay K. Chaudhri, Harry Halpin, and Deborah McGuinness: Linked Data Meets Artificial Intelligence. Technical Report SS-10-07, AAAI Press, Menlo Park, California, 2010, pp. 82-86. ISBN 978-1-57735-461-1.

31. Thank You! Questions?