Visual analysis framework for understanding missing links in bipartite networks
地域：
Tokyo
摘要
Example implementations described herein involve an interface for calculating and displaying missing links for data represented as a bipartite network, along with novel methods for improving link prediction algorithms in the related art. Through example implementations described herein, the accuracy of link prediction algorithms can be improved upon, thereby providing the user with a more accurate understanding of the data in the bipartite network.
說(shuō)明書(shū)
Based on the above algorithms, example implementations described herein provide a novel approach that integrates one important type of structure in bipartite networks, bicliques (a.k.a., complete bipartite graphs). Formally, a biclique is defined as a sub-network, G′=X′,Y′,E′
, where X′ ? X, Y′ ? Y, and E′ ? E, and there exists a link e=
x,y
? E′ between every pair of nodes, x ? X′ and y ? Y′. Many algorithms have been proposed to efficiently detect all bicliques in a network, and in example implementations described herein, the Maximal Biclique Enumeration Algorithm (MBEA) algorithm is tested.
意見(jiàn)反饋
使用該功能遇到問(wèn)題
該功能需要專業(yè)版企業(yè)版VIP權(quán)限，您可以：
您也可以聯(lián)系官方QQ: 2157717237 電話: 13264338900