正文之前
這篇文章還是我看前幾天那個(gè)基于框架進(jìn)行本體匹配的一個(gè)Previous Work里面的一個(gè)Previous Work岁经。可以說有點(diǎn)菜蛇券，但是還是比較有參考意義的缀壤， 所以我把源碼下載了下來，然后準(zhǔn)備把對(duì)應(yīng)的文章讀一讀纠亚，然后我個(gè)人比較喜歡中英對(duì)照塘慕，直接看中文的時(shí)候略過一些不重要的地方，在關(guān)鍵部位看原文蒂胞。所以就有了這么多的翻譯版本了图呢。。
引用如下：Cruz I F, Antonelli F P, Stroe C. AgreementMaker: efficient matching for large real-world schemas and ontologies[J]. Proceedings of the VLDB Endowment, 2009, 2(2): 1586-1589.
正文
Abstract
摘要
We present the AgreementMaker system for matching real world schemas and ontologies, which may consist of hundreds or even thousands of concepts. The end users of the system are sophisticated domain experts whose needs have driven the design and implementation of the system: they require a responsive, powerful, and extensible framework to perform, evaluate, and compare matching methods. The system comprises a wide range of matching methods addressing di?erent levels of granularity of the components being matched (conceptual vs. structural), the amount of user intervention that they require (manual vs. automatic), their usage (stand-alone vs. composed), and the types of components to consider (schema only or schema and instances). Performance measurements (recall, precision, and runtime) are supported by the system, along with the weighted combination of the results provided by those methods. The AgreementMaker has been used and tested in practical applications and in the Ontology Alignment Evaluation Initiative (OAEI) competition. We report here on some of its most advanced features, including its extensible architecture that facilitates the integration and performance tuning of a variety of matching methods, its capability to evaluate, compare, and combine matching results, and its user interface with a control panel that drives all the matching methods and evaluation strategies.
我們提出了AgreementMaker系統(tǒng)骗随，用于匹配真實(shí)世界模式和本體蛤织，可能包含數(shù)百甚至數(shù)千個(gè)概念。系統(tǒng)的最終用戶是復(fù)雜的領(lǐng)域?qū)＜液枞荆麄兊男枨笸苿?dòng)了系統(tǒng)的設(shè)計(jì)和實(shí)現(xiàn)：他們需要一個(gè)響應(yīng)迅速指蚜，功能強(qiáng)大且可擴(kuò)展的框架來執(zhí)行，評(píng)估和比較匹配方法涨椒。該系統(tǒng)包含多種匹配方法摊鸡，可以解決匹配的組件（概念與結(jié)構(gòu)）的不同粒度級(jí)別，他們需要的用戶干預(yù)量（手動(dòng)與自動(dòng)）丢烘，它們的使用（獨(dú)立與組合）柱宦，以及要考慮的組件類型（僅架構(gòu)或架構(gòu)和實(shí)例）。系統(tǒng)支持性能測(cè)量（召回率播瞳，準(zhǔn)確率和運(yùn)行時(shí)性能）掸刊，以及這些方法提供的結(jié)果的加權(quán)組合。 AgreementMaker已在實(shí)際應(yīng)用和Ontology Alignment Evaluation Initiative（OAEI）競(jìng)賽中使用和測(cè)試赢乓。我們?cè)诖藞?bào)告其一些最先進(jìn)的功能忧侧，包括其可擴(kuò)展的體系結(jié)構(gòu)，有助于各種匹配方法的集成和性能調(diào)整牌芋，評(píng)估蚓炬，比較和組合匹配結(jié)果的能力，以及控制所有匹配方法和評(píng)估策略的用戶界面和控制面板躺屁。
1. Introduction
1. 介紹
The issue of schema matching in databases [11], which has been investigated since the early 80’s, is fundamental to data integration, as is the closely-related issue of ontology alignment or matching [12]. The matching problem consists of defining mappings among schema or ontology elements that are semantically related. Such mappings are typically defined between two schemas or two ontologies at a time one being called the source and the other being called the target.
自80年代早期以來一直在研究的數(shù)據(jù)庫(kù)[11]中的模式匹配問題是數(shù)據(jù)集成的基礎(chǔ)肯夏，與本體對(duì)齊或匹配密切相關(guān)的問題也是如此[12]。匹配問題包括定義在語義上相關(guān)的 模式或本體元素之間 的映射。這種映射通常在兩個(gè)模式或兩個(gè)本體之間定義驯击，一個(gè)被稱為源本體烁兰，另一個(gè)被稱為目標(biāo)本體。
We have been developing the AgreementMaker matching system, whose name takes after agreement, the encoding of a mapping. The capabilities of our system have been driven by the real-world problems of end users who are sophisticated domain experts. We have considered a variety of domains and applications, including: geospatial [2], environmental [4], and biomedical [13]. The conceptual information for these applications is stored in the form of ontologies. However, as demonstrated by others, the same approach can be used for schema matching [1, 10]. To validate our approach, we competed against seven other systems in the biomedical track of the 2007 Ontology Alignment Evaluation Initiative (OAEI), to match ontologies describing the mouse adult anatomy of the Mouse Gene Expression Database Project (2744 classes) and the human anatomy of the National Cancer Institute (3304 classes). We came in third in terms of accuracy (F-measure) [5].
我們一直在開發(fā)AgreementMaker匹配系統(tǒng)徊都，其名稱取決于協(xié)議（映射的編碼）沪斟。我們系統(tǒng)的功能受到最終用戶的現(xiàn)實(shí)問題的驅(qū)動(dòng)，這些最終用戶是非常復(fù)雜的領(lǐng)域?qū)＜蚁窘谩Ｎ覀円呀?jīng)考慮了各種領(lǐng)域和應(yīng)用主之，包括：地理空間[2]，環(huán)境[4]和生物醫(yī)學(xué)[13]李根。這些應(yīng)用程序的概念信息以本體的形式存儲(chǔ)槽奕。但是，正如其他人所證明的那樣朱巨，相同的方法可以用于模式匹配[1,10]史翘。為了驗(yàn)證我們的方法，我們與2007年本體校準(zhǔn)評(píng)估計(jì)劃（OAEI）的生物醫(yī)學(xué)行業(yè)中的其他七個(gè)系統(tǒng)進(jìn)行了競(jìng)爭(zhēng)冀续，以匹配描述小鼠基因表達(dá)數(shù)據(jù)庫(kù)項(xiàng)目（2744類）的成年小鼠解剖學(xué)的本體和國(guó)家癌癥研究所（3304類）的人體解剖學(xué)分類本體琼讽。我們?cè)跍?zhǔn)確性方面排名第三（F-measure）[5]。
The AgreementMaker, which is currently in its third version, has been evolving to accommodate: (1) user requirements, as expressed by domain experts; (2) a wide range of input (ontology) and output (agreement file) formats; (3) a large choice of matching methods depending on the di?erent granularity of the set of components being matched (local vs. global), on di?erent features considered in the comparison (conceptual vs. structural), on the amount of intervention that they require from users (manual vs. automatic), on usage (stand-alone vs. composed), and on the types of components to consider (schema only or schema and instances); (4) improved performance, that is, accuracy (precision, recall, F-measure) and e?ciency (execution time) for the automatic methods; (5) an extensible architecture to incorporate new methods easily and to tune their performance; (6) the capability to evaluate, compare, and combine di?erent strategies and matching results; (7) a comprehensive user interface supporting both advanced visualization techniques and a control panel that drives all the matching methods and evaluation strategies.
目前處于第三版的AgreementMaker正在不斷發(fā)展以適應(yīng)：（1）領(lǐng)域?qū)＜冶磉_(dá)的用戶需求; （2）廣泛的輸入（本體）和輸出（協(xié)議文件）格式; （3）根據(jù)不同粒度的組件集的匹配選項(xiàng)（本地與全局）洪唐，在比較中考慮的不同特征（概念與結(jié)構(gòu)）钻蹬，他們需要的來自用戶的干預(yù)量（手動(dòng)與自動(dòng)），使用（獨(dú)立與組合）凭需，以及要考慮的組件類型（僅架構(gòu)或架構(gòu)和實(shí)例）; （4）改進(jìn)性能问欠，即自動(dòng)方法的準(zhǔn)確度（精確度，召回率粒蜈，F(xiàn)測(cè)量值）和效率（執(zhí)行時(shí)間）; （5）可擴(kuò)展的架構(gòu)顺献，可以輕松地整合新方法并調(diào)整其性能; （6）評(píng)估，比較和組合不同策略和匹配結(jié)果的能力; （7）全面的用戶界面枯怖，支持高級(jí)可視化技術(shù)和控制面板注整，驅(qū)動(dòng)所有匹配方法和評(píng)估策略。
In this demo paper, we focus on the most recent developments of the system, which has been almost completely redesigned in the last year. In particular, we describe: (1) the user interface with particular emphasis on the control panel and improved visualization and interaction capabilities; (2) the automatic matching methods and execution capabilities; and (3) the evaluation strategies for determining the e?ciency of the matching methods and for performing the combination of results.
在本演示文章中度硝，我們將重點(diǎn)介紹該系統(tǒng)的最新發(fā)展肿轨，該系統(tǒng)在去年幾乎完全重新設(shè)計(jì)。特別是蕊程，我們描述：（1）用戶界面椒袍，特別強(qiáng)調(diào)控制面板和改進(jìn)的可視化和交互功能; （2）自動(dòng)匹配方法和執(zhí)行能力; （3）用于確定匹配方法的效率和執(zhí)行結(jié)果組合的評(píng)估策略。
2. RELATED WORK
2.相關(guān)工作
There are several notable systems related to ours, including Clio [6], COMA++ [1], Falcon-AO [7], and Ri MOM [14] (just to mention a few). Clio stands apart because of its single focus on database-specific constraints and operators (e.g., foreign keys, joins) to infer the mappings whereas constraints in ontologies (as implemented in the other three systems and in AgreementMaker) are of a di?erent nature [12]. This di?erent emphasis also permeates the remaining components of the various systems, as those that also support ontology matching implement a rich tool box of stringsimilarity and structural-based techniques and focus on performance. Consequently, some of these systems do not focus on user interaction: for example, Falcon-AO and Ri MOM provide simple interfaces that o?er limited user interaction (e.g., no manual manipulation of the ontologies). However, what separates AgreementMaker from these other systems (including from COMA++, which has a more sophisticated user interface than the other two) is the degree to which it integrates the evaluation of the quality of the obtained mappings with the graphical user interface and therefore with the iterative matching process. This tight integration emerged from our work with domain experts, who required that the evaluation be an integral part of the matching process, not an “add on” capability.
有幾個(gè)與我們相關(guān)的著名系統(tǒng)藻茂，包括Clio [6]驹暑，COMA ++ [1]玫恳，F(xiàn)alcon-AO [7]和Ri MOM [14]（僅舉幾例）。 Clio之所以與眾不同优俘，是因?yàn)樗鼘Ｗ⒂谔囟ㄓ跀?shù)據(jù)庫(kù)的約束和運(yùn)算符（例如纽窟，外鍵，連接）來推斷映射兼吓，而本體中的約束（在其他三個(gè)系統(tǒng)和AgreementMaker中實(shí)現(xiàn)）具有不同的性質(zhì)[12 ]。這種不同的重點(diǎn)也滲透到各種系統(tǒng)的其余組件中森枪，因?yàn)槟切┲С直倔w匹配的組件實(shí)現(xiàn)了豐富的相似性和基于結(jié)構(gòu)的技術(shù)工具箱视搏，并專注于性能。因此县袱，這些系統(tǒng)中的一些不關(guān)注用戶交互：例如浑娜，F(xiàn)alcon-AO和Ri MOM提供了限制用戶交互的簡(jiǎn)單接口（例如，沒有對(duì)本體的手動(dòng)操縱）式散。然而筋遭，將AgreementMaker與其他系統(tǒng)（包括COMA ++，其具有比其他兩個(gè)更復(fù)雜的用戶界面）區(qū)別開來的是它將獲得的映射的質(zhì)量評(píng)估與圖形用戶界面集成的程度暴拄，因此迭代匹配過程（大意是可以直接看到評(píng)估結(jié)果的改進(jìn)漓滔？）。這種緊密集成源于我們與領(lǐng)域?qū)＜业暮献鞴耘瘢麄円笤u(píng)估是匹配過程中不可或缺的一部分响驴，而不是“附加”功能。
3. ARCHITECTURE
3.架構(gòu)
The AgreementMaker supports a wide variety of methods or matchers. Our architecture (see Figure 1) allows for serial and parallel composition where, respectively, the output of one or more methods can be used as input to another one, or several methods can be used on the same input and then combined. A set of mappings may therefore be the result of a sequence of steps, called layers.
AgreementMaker支持各種方法或匹配器撕蔼。我們的體系結(jié)構(gòu)（參見圖1）允許串行和并行組合豁鲤，其中一個(gè)或多個(gè)方法的輸出可以分別用作另一個(gè)方法的輸入，或者可以在同一輸入上使用多個(gè)方法然后組合鲸沮。因此琳骡，一組映射可能是一系列步驟的結(jié)果，稱為層讼溺。
The matching process of a generic matcher (see Figure 2), can be divided into two main modules: (1) similarity computation in which each concept of the source ontology is compared with all the concepts of the target ontology, thus producing two similarity matrices (one for classes and the other one for properties), which contain a value for each pair of concepts; (2) mappings selection in which the matrix is scanned to select only the best mappings according to a given threshold and to the cardinality of the correspondences, for example, 1-1, 1-N, N-1, M-N
通用匹配器的匹配過程（見圖2）可以分為兩個(gè)主要模塊：（1）相似度計(jì)算楣号，其中源本體的每個(gè)概念與目標(biāo)本體的所有概念進(jìn)行比較，從而產(chǎn)生兩個(gè)相似性矩陣（一個(gè)用于類肾胯，另一個(gè)用于屬性）竖席，其中包含每對(duì)概念的值; （2）映射選擇，掃描矩陣以根據(jù)給定閾值和對(duì)應(yīng)關(guān)系的基數(shù)僅選擇最佳映射敬肚，例如1-1,1-N毕荐，N-1，M-N
To enable extensibility, we adopted the object-oriented template pattern by defining the skeleton of the matching process in a generic matcher, which defers only a few operations to the concrete matcher extensions (see Figure 3). This abstraction minimizes development e?ort by completely decoupling the structure of a single method from the architecture of the whole system, thus allowing reuse or any possible composition of matching modules.
為了實(shí)現(xiàn)可擴(kuò)展性艳馒，我們通過在通用匹配器中定義匹配過程的框架來實(shí)現(xiàn)面向?qū)ο蟮哪０迥Ｊ剑ㄔ餮牵吭笨埽浚坎欢┑诿溃撃Ｊ絻H將少數(shù)操作推遲到具體的匹配器擴(kuò)展（參見圖3）蝶锋。這種抽象通過將單個(gè)方法的結(jié)構(gòu)與整個(gè)系統(tǒng)的體系結(jié)構(gòu)完全解耦來最小化開發(fā)效率，從而允許重用或任何可能的匹配模塊組合什往。
A first layer matcher produces the similarity matrices, while the second and third layer matchers extend the first layer matchers. In particular, a second layer matcher improves on the results of a first layer matcher using conceptual or structural information, depending on whether it considers one concept alone or a concept and its neighbors. Finally, a third layer matcher combines the results of two or more matchers from the previous layers, in order to obtain a final matching or alignment, that is, a set of mappings.
第一層匹配器產(chǎn)生相似性矩陣扳缕，而第二和第三層匹配器擴(kuò)展第一層匹配器。特別地别威，第二層匹配器使用概念或結(jié)構(gòu)信息改進(jìn)第一層匹配器的結(jié)果躯舔，這取決于它是單獨(dú)考慮一個(gè)概念還是概念及其鄰居。最后省古，第三層匹配器組合來自先前層的兩個(gè)或更多個(gè)匹配器的結(jié)果粥庄，以便獲得最終匹配或?qū)R，即一組映射豺妓。
4. USER INTERFACE
4.用戶界面
The source and target ontologies (in XML, RDFS, OWL, or N3) are visualized side by side using the familiar outline tree paradigm (see Figure 4). Agreements can be exported in di?erent formats (e.g., XML, Excel). Because all the matching operations and their results are managed by this interface, we gave special consideration to its design [4]. We describe next two new features of the interface: the control panel and the visualization of non-hierarchical ontologies (e.g., due to multiple inheritance in OWL). The latter feature allows for specific subtrees to be visually duplicated. Because we adopt the Model-View-Control pattern, this duplication does not a?ect the underlying data structures. The control panel (see Figure 5) allows users to run and manage matching methods and their results. Users can select parameters common to all methods (such as threshold and cardinality) and method-specific parameters. When a method has run, a new row is dynamically added to the table that is part of the control panel at the same time that lines depicting the mappings between the concepts are added (see Figure 4). Each row is color coded and allows for its selection so that the corresponding mappings (of the same color) can be compared visually. Each row also displays the performance values for the associated methods, thus allowing for the comparison with those of other rows. In addition, users can modify at runtime the method parameters by changing directly their values in the table or by selecting previously calculated matchings as input to the methods to be applied next. Multiple matchings can also be combined manually or with an automatic combination matcher.
源和目標(biāo)本體（在XML惜互，RDFS，OWL或N3中）使用熟悉的大綱樹范例并排顯示（參見圖4）琳拭。匹配結(jié)果可以以不同的格式導(dǎo)出（例如训堆，XML，Excel）臀栈。由于所有匹配操作及其結(jié)果均由此接口管理蔫慧，因此我們特別考慮了其設(shè)計(jì)[4]。我們將介紹接口的下兩個(gè)新功能：控制面板和非分層結(jié)構(gòu)的可視化（例如权薯，由于OWL中的多重繼承）姑躲。后一特征允許在視覺上復(fù)制特定的子樹。因?yàn)槲覀儾捎媚Ｐ?視圖-控制模式盟蚣，所以這種應(yīng)用不會(huì)影響基礎(chǔ)數(shù)據(jù)結(jié)構(gòu)黍析。控制面板（參見圖5）允許用戶運(yùn)行和管理匹配方法及其結(jié)果屎开。用戶可以選擇所有方法共有的參數(shù)（例如閾值和基數(shù)）和特定于方法的參數(shù)阐枣。當(dāng)一個(gè)方法運(yùn)行時(shí)，一個(gè)新行被動(dòng)態(tài)地添加到作為控制面板一部分的表中奄抽，同時(shí)添加了描述概念之間映射的行（參見圖4）蔼两。每行都是彩色編碼的，并允許其選擇逞度，以便可以在視覺上比較相應(yīng)的映射（相同顏色）额划。每行還顯示相關(guān)方法的性能值，從而允許與其他行的性能值進(jìn)行比較档泽。此外俊戳，用戶可以在運(yùn)行時(shí)通過直接更改表中的值或通過選擇先前計(jì)算的匹配結(jié)果作為下一個(gè)要應(yīng)用的方法的輸入來修改這個(gè)方法的參數(shù)揖赴。多個(gè)匹配也可以手動(dòng)組合或與自動(dòng)組合匹配器組合。
5. MATCHING METHODS
5.匹配方法
First layer matchers compare concept features (e.g., label, comments, annotations, and instances) and use a variety of methods including syntactic and lexical comparison algorithms as well as the use of a lexicon like Word Net. Of those methods some were proposed by others (e.g., edit distance, Jaro-Winkler) and some devised by us, including a substring-based comparison that favors the length of the common substrings and a concept document-based comparison containing a wide range of features. Those features are represented as TF-IDF vectors and use a cosine similarity metric (see Figure 6).
第一層匹配器比較概念特征（例如抑胎，標(biāo)簽燥滑，注釋，注釋和實(shí)例）并使用各種方法阿逃，包括句法和詞匯比較算法以及Word Net等詞典的使用铭拧。其中一些方法是由其他人提出的（例如，編輯距離恃锉，Jaro-Winkler）和我們?cè)O(shè)計(jì)的一些方法羽历，包括基于子串的比較，這有利于公共子串的長(zhǎng)度和基于文件的概念等方面進(jìn)行廣泛特征上的比較淡喜。這些特征表示為TF-IDF向量并使用余弦相似性度量（參見圖6）。
Second layer matchers use structural properties of the ontologies. Our own methods include the Descendant’s Similarity Inheritance (DSI) and the Sibling’s Similarity Contribution (SSC) matchers [3].
第二層匹配器使用本體的結(jié)構(gòu)屬性诵闭。我們自己的方法包括后代的相似性遺傳（DSI）和兄弟姐妹的相似性貢獻(xiàn)（SSC）匹配[3]炼团。
Finally, third layer matchers combine the results of two or more matchers so as to obtain a unique final matching in two steps. In the first step, a similarity matrix is built for each pair of concepts, using our Linear Weighted Combination (LWC) matcher, which processes the weighted average for the di?erent similarity results (see Figure 7). Weights can be assigned manually or automatically, the latter assignment being determined using our evaluation methods. The second step uses that similarity matrix and takes into account a threshold value and the desired cardinality. When the cardinality is 1-1, we adopt the Shortest Augmenting Path algorithm [9] to find the optimal solution for this optimization problem (namely the assignment problem reduced to the maximum weight matching in a bipartite graph) in polynomial time.
最后，第三層匹配器組合兩個(gè)或更多匹配器的結(jié)果疏尿，以便在兩個(gè)步驟中獲得唯一的最終匹配瘟芝。在第一步中，使用我們的線性加權(quán)組合（LWC）匹配器為每對(duì)概念建立相似性矩陣褥琐，該匹配器處理不同相似性結(jié)果的加權(quán)平均值（參見圖7）锌俱。可以手動(dòng)或自動(dòng)分配權(quán)重敌呈，后者分配使用我們的評(píng)估方法確定贸宏。第二步使用該相似性矩陣并考慮閾值和期望的基數(shù)。當(dāng)基數(shù)為1-1時(shí)磕洪，我們采用最短增廣路徑算法[9]吭练，在多項(xiàng)式時(shí)間內(nèi)找到該優(yōu)化問題的最優(yōu)解（即，將分配問題降級(jí)到二分圖中的最大權(quán)重匹配）析显。
6. EVALUATION
6.評(píng)估
The design of optimal methods to find correct and complete mappings between real-world ontologies is a hard task for several reasons. First of all, an algorithm may be effective for a given scenario, but not for others. Even within the same scenario, the use of di?erent parameters can change significantly the outcome. Moreover, in interviewing domain experts in the geospatial domain, we discovered that they do not trust automatic methods unless quality metrics are associated with the matching results. These observations have motivated a variety of evaluation techniques, that determine runtime and accuracy (precision, recall, and F-measure).
由于幾個(gè)原因鲫咽，設(shè)計(jì)在現(xiàn)實(shí)世界本體之間找到正確和完整映射的最佳方法是一項(xiàng)艱巨的任務(wù)。首先谷异，算法可能對(duì)給定場(chǎng)景有效分尸，但對(duì)其他場(chǎng)景則無效。即使在相同的情況下歹嘹，使用不同的參數(shù)也可以顯著改變結(jié)果箩绍。此外，在訪問地理空間域中的域?qū)＜視r(shí)荞下，我們發(fā)現(xiàn)他們不信任自動(dòng)方法伶选，除非質(zhì)量度量與匹配結(jié)果相關(guān)聯(lián)史飞。這些觀察結(jié)果激發(fā)了各種評(píng)估技術(shù)，這些技術(shù)決定了運(yùn)行時(shí)間和準(zhǔn)確性（精確度仰税，召回率和F測(cè)量值）构资。
The most e?ective evaluation technique compares the mappings found by the system between the two ontologies with a reference matching or “gold standard,” which is a set of correct and complete mappings as built by domain experts. When a reference matching is available, the AgreementMaker can determine the quality of the found matching analytically or visually. A reference matching can also be used to tune algorithms by using a feedback mechanism provided by a succession of runs.
最有效的評(píng)估技術(shù)將系統(tǒng)在兩個(gè)本體之間發(fā)現(xiàn)的映射與參考匹配或“黃金標(biāo)準(zhǔn)”進(jìn)行比較，后者是由領(lǐng)域?qū)＜覙?gòu)建的一組正確和完整的映射陨簇。當(dāng)參考匹配可用時(shí)吐绵，AgreementMaker可以分析或直觀地確定找到的匹配的質(zhì)量。參考匹配也可以用于通過使用由一系列運(yùn)行提供的反饋機(jī)制來調(diào)整算法河绽。
When a gold standard is not available, “inherent” quality measures need to be considered. Quality measures can be defined at two levels as associated with the two main modules of a matcher (see Figure 2): similarity or selection level. We can consider local quality as associated with a correspondence at the similarity level (or mapping at the selection level) or global quality as associated with all the correspondences at the similarity level (or with all possible mappings at the selection level). We have incorporated in our system a global-selection quality measure proposed by others [8] and a local-similarity quality measure that we have devised. Experiments have shown that our quality measure is usually e?ective in defining weights for the LWC matcher.
如果沒有黃金標(biāo)準(zhǔn)己单，則需要考慮“固有的”質(zhì)量措施。質(zhì)量測(cè)量可以在兩個(gè)級(jí)別定義耙饰，與匹配器的兩個(gè)主要模塊相關(guān)聯(lián)（參見圖2）：相似性或選擇級(jí)別纹笼。我們可以將與相似性級(jí)別（或選擇級(jí)別的映射）的對(duì)應(yīng)關(guān)聯(lián)的本地質(zhì)量或與相似性級(jí)別（或選擇級(jí)別的所有可能映射）的所有對(duì)應(yīng)關(guān)聯(lián)的全局質(zhì)量相關(guān)聯(lián)【PS這什么鬼！９豆颉廷痘！】。我們已經(jīng)在我們的系統(tǒng)中納入了其他人提出的全球選擇質(zhì)量測(cè)量[8]以及我們?cè)O(shè)計(jì)的局部相似性質(zhì)量測(cè)量件已。實(shí)驗(yàn)表明笋额，我們的質(zhì)量測(cè)量通常在定義LWC匹配器的權(quán)重方面是有效的。
7. DEMONSTRATION
7.演示
Our demo focuses on the matching methods and evaluation strategies for determining the e?ciency of ontology matching methods. Due to the tight integration of the evaluation strategies with the graphical user interface, a unique feature of our system, all the steps will be performed through the interface. Users will start by uploading their own ontologies, load our own, or download ontologies from the web, thus taking advantage of the several standard formats supported. Users can then explore the interface freely or follow a walk-through, consisting of browsing the ontologies, expanding and contracting nodes, and customizing the display. They have access to the information associated with each concept to be aligned, including descriptions, annotations, and (context) relations, and they can use them to visually detect mappings.
我們的演示側(cè)重于確定本體匹配方法的效率的匹配方法和評(píng)估策略篷扩。由于評(píng)估策略與圖形用戶界面（我們系統(tǒng)的獨(dú)特功能）的緊密集成兄猩，所有步驟都將通過界面執(zhí)行。用戶將首先上傳他們自己的本體（加載我們提供的本體鉴未，或從網(wǎng)上下載的本體）從而利用支持的幾種標(biāo)準(zhǔn)格式枢冤。然后铜秆，用戶可以自由地瀏覽界面或按照演練進(jìn)行瀏覽掏导，包括瀏覽本體，擴(kuò)展和收縮節(jié)點(diǎn)以及自定義顯示羽峰。他們可以訪問與要對(duì)齊的每個(gè)概念相關(guān)的信息趟咆，包括描述，注釋和（上下文）關(guān)系梅屉，他們可以使用它們來直觀地檢測(cè)映射值纱。
正文之后
初版是直接CAJViewer文字識(shí)別，然后用python進(jìn)行清洗坯汤，然后谷歌文件直接翻譯虐唠，最后整合起來的。所以估摸著友好度比較低惰聂，等我看完之后慢慢一點(diǎn)點(diǎn)的改正吧疆偿。咱筛。
