arXivDaily arXiv每日学术速递 周一至周五更新
arXiv physics/0601118physics.soc-phcond-mat.dis-nncs.NEphysics.comp-ph
收藏

关于知识的学习:复杂网络方法

Learning about knowledge: A complex network approach

Luciano da Fontoura Costa

摘要:

本文描述了一种方法来建模知识获取的复杂网络中行走。知识的每个子集被表示为节点,并且这些知识之间的关系被表示为边。被认为是两种类型的边缘,对应于自由和条件的过渡。后一种情况意味着节点只能在访问之前的一组节点(所需条件)后才能到达。知识获取的过程可以通过考虑单个代理沿着网络移动时访问的节点数量来模拟,从最低层开始。它表明,分层网络,即网络连续互连层组成,自然出现的结果,组成的先决条件之间的关系的节点。为了避免死锁,即不可达节点,假设每一层中的子网络是连通的组件。这种层次知识网络的几种配置进行了模拟和量化的移动代理的性能在每次运动后访问的节点的百分比。考虑层和互连子网络的Barabási-Albert和随机模型。虽然在每个实现中的所有子网络具有相同数量的节点,几个互连,定义的互连网络的平均节点度,已被认为是。研究了两种访问策略:随机选择已有的边和优先选择迄今未跟踪的边。获得了一系列有趣的结果,包括一系列高原的知识停滞的情况下,在存在条件的边缘的优惠运动策略的识别。

英文摘要:

This article describes an approach to modeling knowledge acquisition in terms of walks along complex networks. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks, i.e. networks composed of successive interconnected layers, arise naturally as a consequence of compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks, i.e. unreachable nodes, the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barabási-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaux of knowledge stagnation in the case of the preferential movements strategy in presence of conditional edges.

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

↑