arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.0764cs.AI
收藏

无路径描述的有序数据概念链聚类

Clustering Concept Chains from Ordered Data without Path Descriptions

Distributed Computing Systems(分布式计算系统公司)

Kieran Greer

摘要:

本文描述了一个过程,聚类的概念链从数据随机提供给一个评估系统。有许多规则或指导方针可以帮助系统更准确地确定哪些概念属于特定的链,哪些不属于,但是应该可以以通用的方式编写这些规则或指导方针。该机制还使用没有任何分层路径信息的平面结构,其中两个概念之间的链接在概念本身的级别上进行。它不需要相关的元数据,而是使用一种简单的计数机制。关键是对概念本身以及它所属的组或链进行计数。为了测试该机制的可能成功性,从较大本体中随机抽取的概念链部分被呈现给系统,但每次仅以2个概念的深度呈现。也就是-根概念加上一个与之相关联的概念。结果表明,这仍然可以导致非常可变的结构正在形成,也可以容纳一定程度的随机性。

英文摘要:

This paper describes a process for clustering concepts into chains from data presented randomly to an evaluating system. There are a number of rules or guidelines that help the system to determine more accurately what concepts belong to a particular chain and what ones do not, but it should be possible to write these in a generic way. This mechanism also uses a flat structure without any hierarchical path information, where the link between two concepts is made at the level of the concept itself. It does not require related metadata, but instead, a simple counting mechanism is used. Key to this is a count for both the concept itself and also the group or chain that it belongs to. To test the possible success of the mechanism, concept chain parts taken randomly from a larger ontology were presented to the system, but only at a depth of 2 concepts each time. That is - root concept plus a concept that it is linked to. The results show that this can still lead to very variable structures being formed and can also accommodate some level of randomness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑