【24h】

Automated Metadata Hierarchy Derivation

机译:自动元数据层次派生

获取原文

摘要

This paper presents an automated approach for building a metadata hierarchy of a set of web sites without the use of any predefined external hierarchies, and then merging and comparing them. The nodes of the hierarchy are the keywords of the specified web sites, and the links between these keywords are the weak subsumption relationships. We apply this method in the RTGI project [8] on clusters of web sites already defined. The hierarchies can show how homogeneous each cluster is and permit to outline the contents of each corresponding cluster effectively. Moreover, we construct the common hierarchy of multiple clusters so that we check if their individual hierarchies are well distinguished and separated in the common one, which in turn indicates the correctness of clustering. At the end, we build the Semantic-Hypertextual graph of the sites which explains the semantic contents along with the topological structure of the sites.
机译:本文介绍了一种自动化方法,用于构建一组网站的元数据层次结构,而无需使用任何预定义的外部层次结构,然后合并和比较它们。层次结构的节点是指定网站的关键字,这些关键字之间的链接是弱的归档关系。我们在RTGI项目[8]中应用此方法在已定义的网站集群上。层次结构可以显示每个群集的同类均匀和允许有效地概述每个相应集群的内容。此外,我们构建了多个集群的公共层次结构,以便检查各个层次结构是否在公共层中良好区分并分开,又指示集群的正确性。最后,我们构建了地点的语义超文本图,该图案解释了语义内容以及网站的拓扑结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号