A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimate...A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimated from its own instances. Then, the similarity of two concepts from different ontologies is measured by the KL distance between the corresponding distributions. Finally, the concept-mapping relationship between different ontologies is obtained. Compared with other traditional instance-based algorithms, the computing complexity of the proposed algorithm is largely reduced. Moreover, because it proposes different estimation and smoothing methods of the concept distribution for different data types, it is suitable for various concepts mapping with different data types. The experimental results on real-world ontology mapping illustrate the effectiveness of the proposed algorithm.展开更多
讨论了串联系统在具有多源验前信息的情形下的可靠性评估问题,运用K u llback信息作为分布之间距离的度量,在K u llback信息的融合准则下对多个先验分布进行融合.并以融合后的先验分布作为系统的最终验前分布,对串联系统的可靠性指标进...讨论了串联系统在具有多源验前信息的情形下的可靠性评估问题,运用K u llback信息作为分布之间距离的度量,在K u llback信息的融合准则下对多个先验分布进行融合.并以融合后的先验分布作为系统的最终验前分布,对串联系统的可靠性指标进行Bayes估计.最后进行的计算机随机模拟结果表明,文中所提出的方法合理且便于应用.展开更多
文摘A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimated from its own instances. Then, the similarity of two concepts from different ontologies is measured by the KL distance between the corresponding distributions. Finally, the concept-mapping relationship between different ontologies is obtained. Compared with other traditional instance-based algorithms, the computing complexity of the proposed algorithm is largely reduced. Moreover, because it proposes different estimation and smoothing methods of the concept distribution for different data types, it is suitable for various concepts mapping with different data types. The experimental results on real-world ontology mapping illustrate the effectiveness of the proposed algorithm.
文摘讨论了串联系统在具有多源验前信息的情形下的可靠性评估问题,运用K u llback信息作为分布之间距离的度量,在K u llback信息的融合准则下对多个先验分布进行融合.并以融合后的先验分布作为系统的最终验前分布,对串联系统的可靠性指标进行Bayes估计.最后进行的计算机随机模拟结果表明,文中所提出的方法合理且便于应用.