This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Enriching One Taxonomy Using Another
October 2010 (vol. 22 no. 10)
pp. 1415-1427
L. Venkata Subramaniam, IBM India Research Laboratory, New Delhi
Amit Anil Nanavati, IBM India Research Laboratory, New Delhi
Sougata Mukherjea, IBM India Research Laboratory, New Delhi
Taxonomies, representing hierarchical data, are a key knowledge source in multiple disciplines. Information processing across taxonomies is not possible unless they are appropriately merged for commonalities and differences. For taxonomy merging, the first task is to identify common concepts between the taxonomies. Then, these common concepts along with their associated concepts in the two taxonomies need to be integrated. Doing this in a conflict-free manner is a challenging task and generally requires human intervention. In this paper, we explore the possibility of asymmetrically merging one taxonomy into another automatically. Given one or more source taxonomies and a destination taxonomy, modeled as directed acyclic graphs, we present intuitive algorithms that merge relevant portions of the source taxonomies into the destination taxonomy. We prove that our algorithms are conflict-free, information lossless, and scalable. We also define precision and recall measures for evaluating enriched taxonomies, such as {\rm T_A}, the result of merging two taxonomies, with {\rm T_I}, the ideal merger. Our experiments indicate the effectiveness of our approach.

[1] T. Berners-Lee, J. Hendler, and O. Lasilla, "The Semantic Web," Scientific Am., vol. 284, no. 5, pp. 34-43, May 2001.
[2] "Gene Ontology," http:/www.geneontology.org/, 2010.
[3] UMLS, http:/umlsks.nlm.nih.gov, 2010.
[4] Swiss-Prot, http://www.ebi.ac.ukuniprot/, 2010.
[5] "Suggested Upper Merged Ontology (SUMO)," http:/www. ontologyportal.org/, 2010.
[6] "CALO Computer Ontology," http://userweb.cs.utexas.edu/users/mfkb/ RKFclib.html, 2010.
[7] I. Sarkar, M. Cantor, R. Gelman, F. Hartel, and Y. Lussier, "Linking Biomedical Language Information and Knowledge Sources: GO and UMLS," Proc. Pacific Symp. Biocomputing, pp. 439-450, 2003.
[8] M. Klein, "Combining and Relating Ontologies: An Analysis of Problems and Solutions," Proc. IJCAI Workshop Ontologies and Information Sharing, Aug. 2001.
[9] D. Kim, J. Kim, and S. Lee, "Catalog Integration for Electronic Commerce through Category-Hierarchy Merging Technique," Proc. 12th Int'l Workshop Research Issues in Data Eng.: Eng. e-Commerce/e-Business Systems (RIDE), 2002.
[10] H. Ossher and W. Harrison, "Combination of Inheritance Hierarchies," Proc. Conf. Object Oriented Programming Systems Languages and Applications (OOPSLA), 1992.
[11] WordNet 2.1, http:/wordnet.princeton.edu/, 2008.
[12] P. Senellart and V. Blondel, "Automatic Discovery of Similar Words," A Comprehensive Survey of Text Mining, M. Berry, ed., Springer-Verlag, Aug. 2003.
[13] N. Noy and M. Musen, "Anchor-PROMPT: Using Non-Local Context for Semantic Matching," Proc. IJCAI Workshop Ontologies and Information Sharing, 2000.
[14] N. Noy and M. Musen, "SMART: Automated Support for Ontology Merging and Alignment," Proc. Seventh Nat'l Conf. Artificial Intelligence, pp. 450-455, 2000.
[15] D. McGuiness, R. Fikes, J. Rice, and S. Wilder, "An Environment for Merging and Testing Large Ontologies," Proc. Seventh Int'l Conf. Principles of Knowledge Representation and Reasoning, pp. 483-493, 2000.
[16] A. Doan, J. Madhavan, P. Domingos, and A. Halvey, "Learning to Map between Ontologies on the Semantic Web," Proc. 11th Int'l World-Wide Web Conf., May 2002.
[17] Protégé, http:/protege.stanford.edu, 2010.
[18] Chimaera, http://ksl.stanford.edu/softwarechimaera , 2010.
[19] P. Lambrix and A. Edberg, "Evaluation of Ontology Merging Tools in Bioinformatics," Proc. Pacific Symp. Biocomputing, 2003.
[20] W. Li and C. Clifton, "Semantic Integration in Heterogeneous Data Bases Using Neural Networks," Proc. Very Large Data Bases Conf. (VLDB), pp. 1-12, 1994.
[21] A. Doan, P. Domingos, and A. Halvey, "Reconciling Schemas of Disparate Data Sources: A Machine Learning Approach," Proc. ACM SIGMOD, pp. 509-520, 2001.
[22] J. Madhavan, P. Bernstein, and E. Rahm, "Generic Schema Matching with Cupid," Proc. Very Large Data Bases Conf. (VLDB), pp. 49-58, 2001.
[23] E. Rahm and P. Bernstein, "A Survey of Approaches to Automatic Schema Matching," VLDB J., vol. 10, no. 4, pp. 334-350, Dec. 2001.
[24] J. Henrard, J.-M. Hick, P. Thiran, and J.-L. Hainaut, "Strategies for Data Reengineering," Proc. Ninth Working Conf. Reverse Eng. (WCRE '02), pp. 211-220, 2002.
[25] N. Noy and M. Musen, "PromptDiff: A Fixed-Point Algorithm for Comparing Ontology Versions," Proc. 18th Nat'l Conf. Artificial Intelligence, 2002.
[26] N. Noy and M. Musen, "Evaluating Ontology-Mapping Tools: Requirements and Experience," Proc. Workshop Evaluation of Ontology Tools at EKAW '02, 2002.
[27] R. La Fontaine, "Merging XML Files: A New Approach Providing Intelligent Merge of XML Data Sets," Proc. XML Europe Conf. 2002, 2002.
[28] S. Kundu and N. Gwee, "A Formal Approach to Designing a Class-Subclass Structure Using a Partial Order on the Functions," Proc. 29th Ann. IEEE Int'l Computer Software and Applications Conf., 2005.
[29] N. Gwee and S. Kundu, "A Software Tool for Optimal Class-Hierarchy Design Based on the Use-Relationship among Functions and Variables," Proc. 16th Int'l Conf. Software Eng. and Data Eng. (SEDE '07), 2007.

Index Terms:
Taxonomy merging, graph merging algorithms.
Citation:
L. Venkata Subramaniam, Amit Anil Nanavati, Sougata Mukherjea, "Enriching One Taxonomy Using Another," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 10, pp. 1415-1427, Oct. 2010, doi:10.1109/TKDE.2009.189
Usage of this product signifies your acceptance of the Terms of Use.