Info-clustering: An efficient algorithm by network information flow
2017 Information Theory and Applications Workshop (ITA)(2017)
摘要
Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data.
更多查看译文
关键词
network information flow,social network,biological system,info-clustering algorithm,parametric max-flow algorithm,dependency structure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要