Pub Date : 2024-03-12DOI: 10.1109/TETCI.2024.3369849
Qian Tang;Yiji Zhao;Hao Wu;Lei Zhang
Contrastive representation learning has been widely employed in attributed graph clustering and has demonstrated significant success. However, these methods have two problems: 1)According to an assumption that clusters are formed around a minority of central anchor nodes, the contrastive relationships between these anchors are not explored in previous works. 2)They fail to deal with biased sample pairs, which may degrade the representation quality and cause poor clustering performance. To solve the problems, we propose a framework termed GE-S-D for both node representation learning and clustering, which consists of an anchor sampling strategy, a low-pass graph encoder, and a debiasing strategy. Specifically, to reveal the contrastive relationships between anchors, we design a sampling strategy to select a small number of anchors and then construct a training set of positive and negative sample pairs for contrastive learning. Then, we introduce a low-pass graph encoder to propagate contrastive messages to all nodes and learn cluster-friendly node representations. Furthermore, to alleviate the interference of biased sample pairs, we design a debiasing strategy using K-Means on the node representations to obtain the clustering information and remove the false positive and false negative sample pairs in the training set for improving contrastive learning. The clustering performance is verified on five benchmark datasets, and our method is superior to many state-of-the-art methods according to quantitive and qualitative analysis.
{"title":"Node Clustering on Attributed Graph Using Anchor Sampling Strategy and Debiasing Strategy","authors":"Qian Tang;Yiji Zhao;Hao Wu;Lei Zhang","doi":"10.1109/TETCI.2024.3369849","DOIUrl":"https://doi.org/10.1109/TETCI.2024.3369849","url":null,"abstract":"Contrastive representation learning has been widely employed in attributed graph clustering and has demonstrated significant success. However, these methods have two problems: 1)According to an assumption that clusters are formed around a minority of central anchor nodes, the contrastive relationships between these anchors are not explored in previous works. 2)They fail to deal with biased sample pairs, which may degrade the representation quality and cause poor clustering performance. To solve the problems, we propose a framework termed GE-S-D for both node representation learning and clustering, which consists of an anchor sampling strategy, a low-pass graph encoder, and a debiasing strategy. Specifically, to reveal the contrastive relationships between anchors, we design a sampling strategy to select a small number of anchors and then construct a training set of positive and negative sample pairs for contrastive learning. Then, we introduce a low-pass graph encoder to propagate contrastive messages to all nodes and learn cluster-friendly node representations. Furthermore, to alleviate the interference of biased sample pairs, we design a debiasing strategy using K-Means on the node representations to obtain the clustering information and remove the false positive and false negative sample pairs in the training set for improving contrastive learning. The clustering performance is verified on five benchmark datasets, and our method is superior to many state-of-the-art methods according to quantitive and qualitative analysis.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141964860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-12DOI: 10.1109/TETCI.2024.3369321
Kui Jiang;Qiong Wang;Zhaoyi An;Zheng Wang;Cong Zhang;Chia-Wen Lin
Images captured in low-light or underwater environments are often accompanied by significant degradation, which can negatively impact the quality and performance of downstream tasks. While convolutional neural networks (CNNs) and Transformer architectures have made significant progress in computer vision tasks, there are few efforts to harmonize them into a more concise framework for enhancing such images. To this end, this study proposes to aggregate the individual capability of self-attention (SA) and CNNs for accurate perturbation removal while preserving background contents. Based on this, we carry forward a Retinex-based framework, dubbed as Mutual Retinex, where a two-branch structure is designed to characterize the specific knowledge of reflectance and illumination components while removing the perturbation. To maximize its potential, Mutual Retinex is equipped with a new mutual learning mechanism, involving an elaborately designed mutual representation module (MRM). In MRM, the complementary information between reflectance and illumination components are encoded and used to refine each other. Through the complementary learning via the mutual representation, the enhanced results generated by our model exhibit superior color consistency and naturalness. Extensive experiments have shown the significant superiority of our mutual learning based method over thirteen competitors on the low-light task and ten methods on the underwater image enhancement task. In particular, our proposed Mutual Retinex respectively surpasses the state-of-the-art method MIRNet-v2 by 0.90 dB and 2.46 dB in PSNR on the LOL 1000 and FIVEK datasets, while with only 19.8% model parameters.
{"title":"Mutual Retinex: Combining Transformer and CNN for Image Enhancement","authors":"Kui Jiang;Qiong Wang;Zhaoyi An;Zheng Wang;Cong Zhang;Chia-Wen Lin","doi":"10.1109/TETCI.2024.3369321","DOIUrl":"https://doi.org/10.1109/TETCI.2024.3369321","url":null,"abstract":"Images captured in low-light or underwater environments are often accompanied by significant degradation, which can negatively impact the quality and performance of downstream tasks. While convolutional neural networks (CNNs) and Transformer architectures have made significant progress in computer vision tasks, there are few efforts to harmonize them into a more concise framework for enhancing such images. To this end, this study proposes to aggregate the individual capability of self-attention (SA) and CNNs for accurate perturbation removal while preserving background contents. Based on this, we carry forward a Retinex-based framework, dubbed as Mutual Retinex, where a two-branch structure is designed to characterize the specific knowledge of reflectance and illumination components while removing the perturbation. To maximize its potential, Mutual Retinex is equipped with a new mutual learning mechanism, involving an elaborately designed mutual representation module (MRM). In MRM, the complementary information between reflectance and illumination components are encoded and used to refine each other. Through the complementary learning via the mutual representation, the enhanced results generated by our model exhibit superior color consistency and naturalness. Extensive experiments have shown the significant superiority of our mutual learning based method over thirteen competitors on the low-light task and ten methods on the underwater image enhancement task. In particular, our proposed Mutual Retinex respectively surpasses the state-of-the-art method MIRNet-v2 by 0.90 dB and 2.46 dB in PSNR on the LOL 1000 and FIVEK datasets, while with only 19.8% model parameters.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Unmanned aerial vehicles (UAVs) have been widely used in urban missions, and proper planning of UAV paths can improve mission efficiency while reducing the risk of potential third-party impact. Existing work has considered all efficiency and safety objectives for a single decision-maker (DM) and regarded this as a multiobjective optimization problem (MOP). However, there is usually not a single DM but two DMs, i.e., an efficiency DM and a safety DM, and the DMs are only concerned with their respective objectives. The final decision is made based on the solutions of both DMs. In this paper, for the first time, biparty multiobjective UAV path planning (BPMO-UAVPP) problems involving both efficiency and safety departments are modeled. The existing multiobjective immune algorithm with nondominated neighbor-based selection (NNIA), the hybrid evolutionary framework for the multiobjective immune algorithm (HEIA), and the adaptive immune-inspired multiobjective algorithm (AIMA) are modified for solving the BPMO-UAVPP problem, and then biparty multiobjective optimization algorithms, including the BPNNIA, BPHEIA, and BPAIMA, are proposed and comprehensively compared with traditional multiobjective evolutionary algorithms and typical multiparty multiobjective evolutionary algorithms (i.e., OptMPNDS and OptMPNDS2). The experimental results show that BPAIMA performs better than ordinary multiobjective evolutionary algorithms such as NSGA-II and multiparty multiobjective evolutionary algorithms such as OptMPNDS, OptMPNDS2, BPNNIA and BPHEIA.
{"title":"Evolutionary Biparty Multiobjective UAV Path Planning: Problems and Empirical Comparisons","authors":"Kesheng Chen;Wenjian Luo;Xin Lin;Zhen Song;Yatong Chang","doi":"10.1109/TETCI.2024.3361755","DOIUrl":"https://doi.org/10.1109/TETCI.2024.3361755","url":null,"abstract":"Unmanned aerial vehicles (UAVs) have been widely used in urban missions, and proper planning of UAV paths can improve mission efficiency while reducing the risk of potential third-party impact. Existing work has considered all efficiency and safety objectives for a single decision-maker (DM) and regarded this as a multiobjective optimization problem (MOP). However, there is usually not a single DM but two DMs, i.e., an efficiency DM and a safety DM, and the DMs are only concerned with their respective objectives. The final decision is made based on the solutions of both DMs. In this paper, for the first time, biparty multiobjective UAV path planning (BPMO-UAVPP) problems involving both efficiency and safety departments are modeled. The existing multiobjective immune algorithm with nondominated neighbor-based selection (NNIA), the hybrid evolutionary framework for the multiobjective immune algorithm (HEIA), and the adaptive immune-inspired multiobjective algorithm (AIMA) are modified for solving the BPMO-UAVPP problem, and then biparty multiobjective optimization algorithms, including the BPNNIA, BPHEIA, and BPAIMA, are proposed and comprehensively compared with traditional multiobjective evolutionary algorithms and typical multiparty multiobjective evolutionary algorithms (i.e., OptMPNDS and OptMPNDS2). The experimental results show that BPAIMA performs better than ordinary multiobjective evolutionary algorithms such as NSGA-II and multiparty multiobjective evolutionary algorithms such as OptMPNDS, OptMPNDS2, BPNNIA and BPHEIA.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":5.3,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141096323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-12DOI: 10.1109/TETCI.2024.3369976
Guangliang He;Zhen Zhang;Hanrui Wu;Sanchuan Luo;Yudong Liu
Knowledge graph (KG) is increasingly important in improving recommendation performance and handling item cold-start. A recent research hotspot is designing end-to-end models based on information propagation schemes. However, existing these methods do not highlight key collaborative signals hidden in user-item bipartite graphs, which leads to two problems: (1) the collaborative signal of user collaborative neighbors is not modeled and (2) the incompleteness of KG and the behavioral similarity of item collaborative neighbors are not considered. In this paper, we design a new model called Knowledge Graph Collaborative Neighbor Awareness network