<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Alignment Results of SOBOM for OAEI 2010</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Peigang</forename><surname>Xu</surname></persName>
							<email>peigang.xu@gmail.com</email>
						</author>
						<author>
							<persName><forename type="first">Yadong</forename><surname>Wang</surname></persName>
							<email>ydwang@hit.edu.cn</email>
						</author>
						<author>
							<persName><forename type="first">Liang</forename><surname>Cheng</surname></persName>
						</author>
						<author>
							<persName><forename type="first">Tianyi</forename><surname>Zang</surname></persName>
							<email>tianyi.zang@gmail.com</email>
						</author>
						<author>
							<affiliation key="aff0">
								<orgName type="department">School of Computer Science</orgName>
								<orgName type="institution">Technology</orgName>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="institution">Harbin Institute of Technology</orgName>
								<address>
									<settlement>Harbin</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Alignment Results of SOBOM for OAEI 2010</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">5B41080978C466B5BA4217BF522A014E</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T05:50+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>In this paper we give a brief explanation of how Sub-Ontology based Ontology Matching (SOBOM) method gets the alignment results at OAEI2010. SOBOM deal with an ontology from two different views: an ontology with is-a hierarchical structure O' and an ontology with other relationships O''. Firstly, from the O' view, SOBOM starts with a set of anchors provided by a linguistic matcher. And then it extracts sub-ontologies based on the anchors and ranks these sub-ontologies according to their depths. Secondly, SOBOM utilizes Semantic Inductive Similarity Flooding algorithm to compute the similarity of concepts between different sub-ontologies derived from the two ontologies according the depth of sub-ontologies to get concept alignments. Finally, from the O'' view, SOBOM gets relationship alignments by using the concept alignment results in O'' . The experiment results show SOBOM can find more alignment results than other compared relevant methods.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">System presentation</head><p>Currently more and more ontologies are distributedly built and used by different organizations. And these ontologies are usually light-weighted <ref type="bibr" target="#b0">[1]</ref> containing lots of concepts especially in biomedicine, such as anatomy taxonomy NCI Thesaurus. The Sub-ontology based Ontology Matching (SOBOM) is designed for matching lightweight ontologies that has is-a hierarchy as their backbones. It matches an ontology from two views: O' and O'' that are depicted in Fig. <ref type="figure">1</ref>. The unique feature of our method is combining sub-ontology extraction with ontology matching.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.1">State, purpose, general statement</head><p>SOBOM is developed to match ontology automatically for general purpose. Based on two different views, we design three elementary matchers in current version. The first one is a anchor generator which is used to find anchors; the second one is a structure matcher SISF (Semantic Inductive Similarity Flooding) which is inspired by Anchor-Prompt <ref type="bibr" target="#b2">[3]</ref> and SF <ref type="bibr" target="#b3">[4]</ref> algorithms and is exploited to flood similarity among concepts.</p><p>The last one is a relationship matcher which utilizes the results of SISF to get relationship alignments. In addition, a Sub-ontology Extractor (SoE) is integrated into SOBOM to extract sub-ontologies according to the anchors got by linguistic matcher and rank them by their depths descendingly. Overall SOBOM is a sequential method, so it does not care how to combine the results of different matchers. The overview of the method is illustrated in Fig. <ref type="figure">2</ref>. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>∈ =</head><p>Anchor: An anchor is defined as a pair of assumed equivalent non-leaf concepts across ontologies. Given two ontologies 1  O , 2 O ,</p><formula xml:id="formula_0">1 1 O c ∈ , 2 2 O c ∈ , if 2 1 c c ≡ (</formula><p>means that c1 is identical with c2),and c1, c2 are both not leaf nodes in the hierarchies of O1 and O2 respectively, then an anchor, X is defined as a pair of concepts</p><formula xml:id="formula_1">&gt; &lt; 2 1 ,c c .</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Sub-Ontology:</head><formula xml:id="formula_2">Let ontology O = (C,R, H C ,H R ,). A sub-ontology O x is a subset of O whose elements all come from O, called O x = (C 1 ,H 1 C</formula><p>), where</p><formula xml:id="formula_3">C C H H C C ⊆ ⊆ 1 1 , ,</formula><p>x is the root of H C . Indeed, a sub-ontology in our method is a hierarchical taxonomy, and its root is an anchor concept.</p><p>Sub-ontology Depth. The depth of sub-ontology O x is the maximal length of path from the anchor x to the root r i of the taxonomy H i C which contains it in the original ontology O.</p><p>(</p><p>)</p><formula xml:id="formula_4">O H H r r x Max O Depth C i C i i i x ∈ ∈ → → = , , ..., ) (</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.2">Specific techniques used</head><p>SOBOM aims to provide high quality of 1:1 alignments between concept and property pairs. We have implemented SOBOM algorithm in java and integrated three distinguishing constitutional matchers. They are independent components in core matcher library of SOBOM. Due to the space limitation, we only describe the key features of them. The details can be found in the related paper <ref type="bibr" target="#b7">[8]</ref>.</p><p>Our anchor generator is based on the local context of an entity in ontology. In details, the local context of an entity including the following aspects: the textual information (label, id, comments and so on), the structure information (the number of super or sub concepts, the number of constraints) and the individual information (the number of individual if existing). We consider that the local context of an entity can express the meaning of it. Consequently, we get three similarity matrixes respectively, and we choose the maximal of them as the final results. More importantly, SoE is integrated into SOBOM and extracts sub-ontologies according to the anchors <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b5">6]</ref>. SoE ranks extracted sub-ontologies according to their depths. As we extract sub-ontologies for ontology matching, the rules of extracting sub-ontology in SoE are as following: only sub-concepts of anchor are included in the sub-ontology. In other words, a sub-ontology is a taxonomy which has anchor as root.</p><p>If one of the two concepts in an anchor is a leaf node in the original ontology, we do not use SISF to deal with it actually. Because this phenomenon just represents a one-to-many mapping. After extracting sub-ontologies, SOBOM will match these sub-ontologies according to their depth in original ontology. We first match the subontologies with larger depth value. By using SoE, SOBOM can reduce the scale of ontology and make it easy to operate sub-ontologies in SISF.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.3">Adaptations made for the evaluation</head><p>We don't make any specific adaptation for the tests in the OAEI 2010 campaign. All the alignments outputted by SOBOM are based on the same set of parameters.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.4">Link to the system and parameters file</head><p>The current version of SOBOM is available at:</p><p>http://mlg.hit.edu.cn:8080/Ontology/Download.jsp, and the parameters setting is illustrated in the reading me file.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.5">Link to the set of provided alignments (in align format)</head><p>We deploy our matcher as a web service, our web service name is: eu.sealsproject.omt.ws.matcher.AlignmentWSImpl. The endpoint of our web service can be found at: http://mlg.hit.edu.cn:8080/SOBOMService/SOBOMMatcher?wsdl.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Results</head><p>In this section, we describe the results of SOBOM algorithm against the benchmark, directory and anatomy ontologies provided by the OAEI 2010 campaign. We use Jena-API to parse the RDF and OWL files. The experiments were carried out on a PC running Windows vista ultimate with Core 2 Duo processors and 4-gigabyte memory.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1">Benchmark</head><p>On the basis of the nature, we can divide the benchmark dataset into five groups:</p><p>#101-104, #201-210, #221-247, #248-266 and #301-304. SOBOM is a sequential matcher. If the linguistic matcher gets no results, SOBOM will produce no result. We described the performance of our SOBOM algorithm over each group and overall performance on the benchmark test set in Table <ref type="table" target="#tab_0">1</ref>.</p><p>#101-104 SOBOM plays well for these test cases.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>#201-210</head><p>In this group, some linguistic features of candidate ontologies are discarded or modified, their structures are quite similar. SOBOM is a sequential matcher, our anchor generator matches concepts based on their local context not only the linguistic information. So, although without linguistic information SOBOM also gets relatively high precision and recall.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>#221-247</head><p>The structures of the candidate ontologies are altered in these tests.</p><p>However, SOBOM discovers most of the alignments from the linguistic perspective via our anchor generator, and both the precision and recall are pretty good.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>#248-266</head><p>Both the linguistic and structural characteristics of the candidate ontologies are changed heavily, so the tests in this group might be the most difficult ones in all the benchmark tests. So, SOBOM does not very well.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>#301-304</head><p>This test group are four real-life ontologies of bibliographic references. SOBOM can only find equivalence alignment relations. Compared to our previous results (OAEI2009), the recall of every group is highly improved. This is enhanced by our redesigned anchor generator.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2">Anatomy</head><p>The </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">General comments</head><p>In this section, we want to introduce comments on the results of SOBOM algorithm and the way to improve it.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Comments on the results</head><p>Strengths SOBOM deals with ontology from two different views and combines results of every step in a sequential way. If the ontologies have regular literals and hierarchical structures, SOBOM can achieve satisfactory alignments. And it can avoid missing alignment in many partitioning matching methods as illustrated in <ref type="bibr" target="#b6">[7]</ref>.</p><p>Weaknesses SOBOM needs anchors to extract sub-ontologies. So it depends on the precision of anchors. In current version, we use a linguistic matcher to get anchor concept, if the literals of concept missed, SOBOM will get bad results.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Discussions on the way to improve the proposed system</head><p>SOBOM can be viewed as a frame of ontology matching. So many independent matchers can be integrated into it. Now, we have enhanced the anchor generator by not considering the textual information but also the structure information. Our next plan is to integrate a more powerful matcher to produce anchor concepts or develop a new method to get anchor concepts. Meanwhile, we plan to develop a mapping debugging method to refine the results of SOBOM.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Conclusion</head><p>Ontology matching is very important part of establishing interoperability among semantic applications. This paper reports our participation in OAEI2010 campaign.</p><p>We present the alignment process of SOBOM and describe the specific techniques for ontology matching. We also show the performance in different alignment tasks. The strengths and the weaknesses of our proposed approach are summarized and the possible improvement will be made for the system in the future. We propose a brand new algorithm to match ontologies. The unique feature of our method is combining sub-ontology extraction with ontology matching based on two different views of an ontology.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 .Fig. 2 .</head><label>12</label><figDesc>Fig. 1. Two views of an ontology in SOBOM ' O ' O ' ' O</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>SISF uses the RDF statement to represent the ontology and utilizes the anchors to inducting the construction of similarity propagation graph for the sub-ontologies. SISF handles the ontology from the view O' and only generate concept-concept alignment. R-matcher is a relationship matcher base on the definition of the ontology. It combines the linguistic and semantic information of a relation. From the O'' view, it utilizes the is-a hierarchy to extend the domain and range of a relationship and uses the result of SISF to generate the alignment between relationships.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 .</head><label>1</label><figDesc>The performance on the benchmark</figDesc><table><row><cell></cell><cell>101-104</cell><cell>201-210</cell><cell>221-247</cell><cell>248-266</cell><cell>301-304</cell></row><row><cell>Precision</cell><cell>1.0</cell><cell>0.99</cell><cell>0.99</cell><cell>0.87</cell><cell>0.77</cell></row><row><cell>Recall</cell><cell>1.0</cell><cell>0.85</cell><cell>0.99</cell><cell>0.57</cell><cell>0.70</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2 .</head><label>2</label><figDesc>anatomy real world test bed covers the domain of body anatomy and consist of two ontologies, Adult Mouse Anatomy (2247 classes) and NCI Thesaurus (3304 classes). These are relatively large compared to benchmark ontologies. This type ontologies is what SOBOM suitable for handling, it generated 268 sub-ontologies and 1249 alignments between MA and NCI, consumed 19min3s to complete the matching task. It is obvious that most of the alignment appears in the leaf nodes in ontologies (834 leaf node alignments). The experiment result shows in Table2. The performance of SOBOM on the anatomy test</figDesc><table><row><cell>Leaf node</cell><cell>Sub-</cell><cell>Total</cell><cell>Time</cell></row><row><cell>alignments</cell><cell>ontologies</cell><cell>Alignments</cell><cell>consuming</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Lightweight Ontologies</title>
		<author>
			<persName><forename type="first">Fausto</forename><surname>Giunchiglia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ilya</forename><surname>Aihrayeu</surname></persName>
		</author>
		<idno>DIT-07-071</idno>
		<imprint>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A string metric for ontology alignment</title>
		<author>
			<persName><forename type="first">G</forename><surname>Stoilos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Stamou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kollias</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. Of the 4 th International Semantic Web Conference(ISWC&apos;05)</title>
				<meeting>Of the 4 th International Semantic Web Conference(ISWC&apos;05)</meeting>
		<imprint>
			<date type="published" when="2005">2005</date>
			<biblScope unit="page" from="623" to="637" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Anchor-PROMPT: using non-local context for semantic matching</title>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">F</forename><surname>Noy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Musen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. Of IJCAI2001 Workshop on Ontology and Information Sharing</title>
				<meeting>Of IJCAI2001 Workshop on Ontology and Information Sharing</meeting>
		<imprint>
			<date type="published" when="2001">2001</date>
			<biblScope unit="page" from="63" to="70" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Similarity Flooding: A Versatile Graph Matching Algorithm</title>
		<author>
			<persName><forename type="first">S</forename><surname>Melnik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">G</forename><surname>Molina</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Rahm</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc 18 th Int&apos;l Conf. Data Eng. (ECDE&apos;02)</title>
				<meeting>18 th Int&apos;l Conf. Data Eng. (ECDE&apos;02)</meeting>
		<imprint>
			<date type="published" when="2002">2002</date>
			<biblScope unit="page" from="117" to="128" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<author>
			<persName><forename type="first">Julian</forename><surname>Seidenberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Alan</forename><surname>Rector</surname></persName>
		</author>
		<title level="m">Web Ontology Segmentation: Analysis, Classification and Use</title>
				<meeting><address><addrLine>WWW2006</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Structure-Based Partitioning of Large Class Hierarchies</title>
		<author>
			<persName><forename type="first">H</forename><surname>Stuckenschmidt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Klein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc of the 3 rd International Semantic Web Conference</title>
				<meeting>of the 3 rd International Semantic Web Conference</meeting>
		<imprint>
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Block matching for ontologies</title>
		<author>
			<persName><forename type="first">W</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Qu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc of the 5 th International Semantic Web Conference, LNCS</title>
				<meeting>of the 5 th International Semantic Web Conference, LNCS</meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2006">2006</date>
			<biblScope unit="volume">4273</biblScope>
			<biblScope unit="page" from="300" to="313" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">SOBOM: Sub-ontology based Ontology Matching</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">G</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">J</forename><surname>Tao</surname></persName>
		</author>
		<imprint/>
	</monogr>
	<note>To be appear</note>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
