清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

Modelling Hierarchical Structures in Networks Using Graph Theory : With Application to Knowledge Networks in Graph Curricula

作者
Emil Wengle
出处
期刊:KTH Royal Institute of Technology - KTH Publication Database DiVA [KTH Royal Institute of Technology]
摘要

Community detection is a topic in network theory that involves assigning labels to nodes based on some distance measure or centrality index. Detecting communities within a network can be useful to perform information condensation. In this thesis we explore how to use the approach for pedagogical purposes, and more precisely to condense and visualise the networks of facts, concepts and procedures (also called Knowledge Components (KCs)) that are offered in higher education programmes. In details, we consider one of the most common quantities used to evaluate the goodness of a community classification, which is the concept of modularity. Detecting communities by computing the maximum possible modularity indexes is indeed usually desired, but this approach is generally unavailable because the associated optimisation problem is NP-complete. This is why practitioners use other algorithms, that instead of computing the optimum they rely on various heuristics to find communities: some use modularity directly, some start from the entire graph and divide it repeatedly, and some contain random elements. This thesis investigates the trade-offs of using different community detection algorithms and variations of the concept of modularity first in general terms, and then for the purpose of identifying communities in knowledge graphs associated to higher education programmes, which can be modelled as directed graphs of KCs. We discover, tweaking and applying these algorithms both on synthetic but also field data that the Louvain algorithm is among the better algorithms of those that we considered, which is mostly thanks to its efficiency. It does not produce a full hierarchy, however, so we recommend Fast Newman if hierarchy is important.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
潘润朗完成签到,获得积分10
刚刚
qimoqi完成签到,获得积分10
1秒前
ln完成签到,获得积分10
1秒前
莫忘初心完成签到,获得积分10
1秒前
2秒前
2秒前
搜集达人的应助被TingtingGZ采纳,获得10
4秒前
友好语风完成签到,获得积分10
6秒前
NiaoJiang完成签到,获得积分10
6秒前
Wtony完成签到 ,获得积分0
6秒前
INC完成签到,获得积分10
8秒前
迷人的危险最值钱完成签到,获得积分10
10秒前
美好的初翠完成签到,获得积分10
11秒前
July完成签到,获得积分10
11秒前
kkdg完成签到,获得积分10
13秒前
邓大瓜完成签到,获得积分10
13秒前
脑洞疼的应助被369ninja采纳,获得10
13秒前
MaidLingYan完成签到,获得积分10
17秒前
17秒前
17秒前
DrPika完成签到,获得积分10
17秒前
KKDG完成签到,获得积分10
18秒前
熊熊熊完成签到,获得积分10
18秒前
18秒前
ZHZ完成签到,获得积分10
19秒前
20秒前
聪明的羿完成签到,获得积分10
21秒前
joker000717完成签到,获得积分10
22秒前
TingtingGZ发布了新的文献求助10
22秒前
千帆完成签到,获得积分10
22秒前
Zilaap完成签到,获得积分10
23秒前
完美世界的应助被科研通管家采纳,获得10
23秒前
花开富贵完成签到,获得积分10
23秒前
23秒前
23秒前
丁大胜完成签到,获得积分10
24秒前
24秒前
24秒前
内向的镜子完成签到,获得积分10
25秒前
shiluodeqiou完成签到,获得积分10
26秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
plantTFDB 508
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8173194
求助须知:如何正确求助?哪些是违规求助? 9565558
关于积分的说明 21780496
捐赠科研通 7767299
什么是DOI,文献DOI怎么找? 3431542
关于科研通互助平台的介绍 2555697
邀请新用户注册赠送积分活动 2476688