Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Multi-level neighborhood contrastive attribute graph clustering based on adaptive learning
Jinghong WANG, Xiao CHEN, Yingmei MA, Bi LI, Jusheng MI, Wei WANG
Journal of Computer Applications    2026, 46 (6): 1836-1843.   DOI: 10.11772/j.issn.1001-9081.2025050647
Abstract22)   HTML0)    PDF (873KB)(5)       Save

Recently, deep graph clustering methods have outstanding performance in graph clustering studies. However, most existing deep graph clustering methods are based on the auto-encoder framework, and are vulnerable to reconstruction strategies and graph enhancement strategies. Therefore, a deep graph clustering method based on contrastive learning was proposed, namely Multi-level Neighborhood Contrastive attribute Graph Clustering based on adaptive learning (MNCGC). Firstly, a dual masking strategy was designed to generate an adaptive augmented graph, which combined the node importance to generate edge weights, that is, edge masking probabilities, and a fixed masking probability was set for node features for node feature masking, so as to remove redundant information in the graph and provide rich sample pairs for neighborhood contrastive learning. Then, the edge weights were introduced into the neighborhood contrastive learning, so that the enhanced neighborhood contrastive learning was used to the original graph and the augmented graph at coding level and projection level, thereby emphasizing the local information learning and the global high-level semantic information learning. Finally, self-supervised clustering and code level representation were used to promote each other, thereby further improving the clustering effect. Experimental results on three benchmark datasets including Cora, CiteSeer and PubMed show that compared with fourteen advanced methods, MNCGC method achieves optimal values in most cases across four indicators: accuracy, Normalized Mutual Information (NMI), Adjusted Rand Index (ARI) and F1-score, fully verifying the effectiveness of the proposed method.

Table and Figures | Reference | Related Articles | Metrics
Improved algorithm of audio-video synchronization coding based on variable code length
ZENG Bi LIN Jianhao XIAO Hong HE Yuanlie
Journal of Computer Applications    2014, 34 (5): 1467-1472.   DOI: 10.11772/j.issn.1001-9081.2014.05.1467
Abstract436)      PDF (934KB)(485)       Save

To solve the synchronization problem of audio and video, an improved algorithm of audio-video synchronization coding based on H.264 inter-frame prediction was proposed. The algorithm introduced the concept of variable code length. The audio encoding data was divided into several code groups, and each code group had 2 or 3 bits of embedded data. In the stage of H.264 inter-frame prediction, the mappings between various variable size blocks and the data of code groups were based on formula. The coding method was dynamically determined for the macro block modes coding according to embedded data, and a proposed decoding method could extract the corresponding data according to the mapping relationship. Finally, the 4×4 macro block mode was used to indicate the end of the audio data.The experimental results show that the proposed algorithm enables the Peak Signal-to-Noise Ratio (PSNR) of video samples to reduce by 0.031dB, the bit rate to increase by 5.16% and the overhead to increase by 1.97%, but the embedded audio data can be correctly and completely extracted. Therefore,the algorithm can implement the synchronization of audio and video coding while increasing the data embedding capacity, maintaining the quality of video, ensuring the correctness and completeness of the data.

Reference | Related Articles | Metrics