{"title":"多目标进化框架下的高阶定向群落检测","authors":"Jing Xiao;Jing Cao;Xiao-Ke Xu","doi":"10.1109/TAI.2024.3436659","DOIUrl":null,"url":null,"abstract":"Higher-order community detection in real-life networks has recently gained significant attention, because motif-based communities reflect not only higher-order mesoscale structures but also functional characteristics. However, motif-based communities detected by existing methods for directed networks often disregard edge directionality (nonreciprocal directional arcs), so they typically fail to comprehensively reveal intrinsic characteristics of higher-order topology and information flow. To address this issue, first, we model higher-order directed community detection as a biobjective optimization problem, aiming to provide high-quality and diverse compromise partitions that capture both characteristics. Second, we introduce a multiobjective genetic algorithm based on motif density and information flow (MOGA-MI) to approximate the Pareto optimal higher-order directed community partitions. On the one hand, an arc-and-motif neighbor-based genetic generator (AMN-GA) is developed to generate high-quality and diverse offspring individuals; on the other hand, a higher-order directed neighbor community modification (HD-NCM) operation is designed to further improve generated partitions by modifying easily confused nodes into more appropriate motif-neighbor communities. Finally, experimental results demonstrate that the proposed MOGA-MI outperforms state-of-the-art algorithms in terms of higher-order topology and information flow indicators while providing more diverse community information.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 12","pages":"6536-6550"},"PeriodicalIF":0.0000,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Higher-Order Directed Community Detection by A Multiobjective Evolutionary Framework\",\"authors\":\"Jing Xiao;Jing Cao;Xiao-Ke Xu\",\"doi\":\"10.1109/TAI.2024.3436659\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Higher-order community detection in real-life networks has recently gained significant attention, because motif-based communities reflect not only higher-order mesoscale structures but also functional characteristics. However, motif-based communities detected by existing methods for directed networks often disregard edge directionality (nonreciprocal directional arcs), so they typically fail to comprehensively reveal intrinsic characteristics of higher-order topology and information flow. To address this issue, first, we model higher-order directed community detection as a biobjective optimization problem, aiming to provide high-quality and diverse compromise partitions that capture both characteristics. Second, we introduce a multiobjective genetic algorithm based on motif density and information flow (MOGA-MI) to approximate the Pareto optimal higher-order directed community partitions. On the one hand, an arc-and-motif neighbor-based genetic generator (AMN-GA) is developed to generate high-quality and diverse offspring individuals; on the other hand, a higher-order directed neighbor community modification (HD-NCM) operation is designed to further improve generated partitions by modifying easily confused nodes into more appropriate motif-neighbor communities. Finally, experimental results demonstrate that the proposed MOGA-MI outperforms state-of-the-art algorithms in terms of higher-order topology and information flow indicators while providing more diverse community information.\",\"PeriodicalId\":73305,\"journal\":{\"name\":\"IEEE transactions on artificial intelligence\",\"volume\":\"5 12\",\"pages\":\"6536-6550\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on artificial intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10620004/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10620004/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Higher-Order Directed Community Detection by A Multiobjective Evolutionary Framework
Higher-order community detection in real-life networks has recently gained significant attention, because motif-based communities reflect not only higher-order mesoscale structures but also functional characteristics. However, motif-based communities detected by existing methods for directed networks often disregard edge directionality (nonreciprocal directional arcs), so they typically fail to comprehensively reveal intrinsic characteristics of higher-order topology and information flow. To address this issue, first, we model higher-order directed community detection as a biobjective optimization problem, aiming to provide high-quality and diverse compromise partitions that capture both characteristics. Second, we introduce a multiobjective genetic algorithm based on motif density and information flow (MOGA-MI) to approximate the Pareto optimal higher-order directed community partitions. On the one hand, an arc-and-motif neighbor-based genetic generator (AMN-GA) is developed to generate high-quality and diverse offspring individuals; on the other hand, a higher-order directed neighbor community modification (HD-NCM) operation is designed to further improve generated partitions by modifying easily confused nodes into more appropriate motif-neighbor communities. Finally, experimental results demonstrate that the proposed MOGA-MI outperforms state-of-the-art algorithms in terms of higher-order topology and information flow indicators while providing more diverse community information.