混合主动社会网络聚类中先验知识的整合
Integrating Prior Knowledge in Mixed Initiative Social Network Clustering
摘要:
我们提出了一种新的方法-称为PK聚类-帮助社会科学家在社交网络中创建有意义的集群。存在许多聚类算法,但大多数社会科学家发现它们难以理解,并且工具不提供任何指导来选择算法,或考虑科学家的先验知识来评估结果。我们的工作介绍了一种新的聚类方法和一个可视化的分析用户界面,解决这个问题。它是基于一个过程,1)捕捉科学家的先验知识作为一组不完整的集群,2)运行多个聚类算法(类似于聚类集成方法),3)通过每个算法与先验知识的匹配程度来可视化所有算法的结果,4)评估用户选择的算法之间的一致性,以及5)允许用户查看细节并迭代地更新所获取的知识。我们描述了我们的方法,使用一个初始的功能原型,然后提供两个例子的使用和早期反馈的社会科学家。我们相信我们的聚类方法提供了一种新的建设性方法,迭代地构建知识,同时避免过度受经常随机选择的黑盒聚类算法的结果的影响。
英文摘要:
We propose a new approach -- called PK-clustering -- to help social scientists create meaningful clusters in social networks. Many clustering algorithms exist but most social scientists find them difficult to understand, and tools do not provide any guidance to choose algorithms, or to evaluate results taking into account the prior knowledge of the scientists. Our work introduces a new clustering approach and a visual analytics user interface that address this issue. It is based on a process that 1) captures the prior knowledge of the scientists as a set of incomplete clusters, 2) runs multiple clustering algorithms (similarly to clustering ensemble methods), 3) visualizes the results of all the algorithms ranked and summarized by how well each algorithm matches the prior knowledge, 4) evaluates the consensus between user-selected algorithms, and 5) allows users to review details and iteratively update the acquired knowledge. We describe our approach using an initial functional prototype, then provide two examples of use and early feedback from social scientists. We believe our clustering approach offers a novel constructive method to iteratively build knowledge while avoiding being overly influenced by the results of often randomly selected black-box clustering algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。