Tobias Hecking, Laura Steinert, Tilman Göhnert, H. Hoppe
{"title":"动态二部网络的增量聚类","authors":"Tobias Hecking, Laura Steinert, Tilman Göhnert, H. Hoppe","doi":"10.1109/ENIC.2014.15","DOIUrl":null,"url":null,"abstract":"This paper deals with the problem of identifying clusters in evolving bipartite networks over time. In bipartite networks there exist two types of nodes while ties can only occur between nodes of different types. Hence, a cluster in a bipartite network consists of two node sets for the two node types each. A major challenge regarding the evolution of those clusters over time is that the two parts of a bipartite cluster may evolve independently. While there is already an increasing amount of research on the identification of clusters in dynamic unipartite networks, the bipartite case is still underrepresented. After a clear motivation of the problem, an adaptation of an existing method for optimising modularity in unipartite networks is extended to dynamic bipartite networks. The method is evaluated on computer generated as well as real world networks.","PeriodicalId":185148,"journal":{"name":"2014 European Network Intelligence Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Incremental Clustering of Dynamic Bipartite Networks\",\"authors\":\"Tobias Hecking, Laura Steinert, Tilman Göhnert, H. Hoppe\",\"doi\":\"10.1109/ENIC.2014.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the problem of identifying clusters in evolving bipartite networks over time. In bipartite networks there exist two types of nodes while ties can only occur between nodes of different types. Hence, a cluster in a bipartite network consists of two node sets for the two node types each. A major challenge regarding the evolution of those clusters over time is that the two parts of a bipartite cluster may evolve independently. While there is already an increasing amount of research on the identification of clusters in dynamic unipartite networks, the bipartite case is still underrepresented. After a clear motivation of the problem, an adaptation of an existing method for optimising modularity in unipartite networks is extended to dynamic bipartite networks. The method is evaluated on computer generated as well as real world networks.\",\"PeriodicalId\":185148,\"journal\":{\"name\":\"2014 European Network Intelligence Conference\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 European Network Intelligence Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENIC.2014.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 European Network Intelligence Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENIC.2014.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Incremental Clustering of Dynamic Bipartite Networks
This paper deals with the problem of identifying clusters in evolving bipartite networks over time. In bipartite networks there exist two types of nodes while ties can only occur between nodes of different types. Hence, a cluster in a bipartite network consists of two node sets for the two node types each. A major challenge regarding the evolution of those clusters over time is that the two parts of a bipartite cluster may evolve independently. While there is already an increasing amount of research on the identification of clusters in dynamic unipartite networks, the bipartite case is still underrepresented. After a clear motivation of the problem, an adaptation of an existing method for optimising modularity in unipartite networks is extended to dynamic bipartite networks. The method is evaluated on computer generated as well as real world networks.