模式识别与人工智能
Saturday, May. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
Pattern Recognition and Artificial Intelligence
22 Judgement and Disposal of Academic Misconduct Article
22 Copyright Transfer Agreement
22 Proof of Confidentiality
22 Requirements for Electronic Version
More....
22 Chinese Association of Automation
22 National ResearchCenter for Intelligent Computing System
22 Institute of Intelligent Machines,Chinese Academy of Sciences
More....
 
 
2022 Vol.35 Issue.11, Published 2022-11-25

Papers and Reports    Researches and Applications    Surveys and Reviews   
   
Papers and Reports
955 Imbalanced Node Classification Algorithm Based on Self-Supervised Learning
CUI Caixia, WANG Jie, PANG Tianjie, LIANG Jiye
In real-world node classification scenarios, only a few nodes are labeled and their class labels are imbalanced. In most of the existing methods, the lack of the supervision information and the imbalance of node classes are not taken into account at the same time, and the improvement of node classification performance cannot be guaranteed. Therefore, an imbalanced node classification algorithm based on self-supervised learning is proposed. Firstly, different views of the original graph are generated through graph data augmentation. Then, node representations are learned by maximizing the consistency of node representations across views using self-supervised learning. The supervised information is expanded and the expressive ability of nodes is enhanced by self-supervised learning. In addition, a semantic constraint loss is designed to ensure semantic consistency in graph data augmentation along with cross-entropy loss and self-supervised contrastive loss. Experimental results on three real graph datasets show that the proposed algorithm achieves better performance on solving the imbalanced node classification problem.
2022 Vol. 35 (11): 955-964 [Abstract] ( 513 ) [HTML 1KB] [ PDF 2813KB] ( 626 )
965 Adaptive Weighted Multi-view Subspace Clustering Guided by Manifold Regularization
LIN Yanming, CHEN Xiaoyun
In most of the existing multi-view subspace clustering methods, the consistent shared information of the multi-view data is learned, and the contribution of each view is regarded as equally important to integrate the difference information of multiple views. However, possible noise or redundancy between different views is ignored due to the idea of treating each view as equally important, resulting in poor final clustering performance. Therefore, an algorithm of adaptive weighted multi-view subspace clustering guided by manifold regularization(MR-AWMSC) is proposed in this paper. The consistent global low-rank representation information for each view is learned by nuclear norm, and difference information from different views is described by group effect. According to the concept of manifold regularization, the weight of each view is adaptively learned, and the contribution degree to the difference information of each view is automatically assigned. The difference information is integrated by the adaptive weight and the consistent information is fused to obtain the final consensus representation. The consensus representation is constructed for clustering multi-view data. Experimental results on six public datasets demonstrate that MR-AWMSC effectively improves the multi-view clustering performance.
2022 Vol. 35 (11): 965-976 [Abstract] ( 398 ) [HTML 1KB] [ PDF 2103KB] ( 477 )
977 Neighborhood Recommendation Algorithm Based on Causality Force under Network Formal Decision Context
FAN Min, GUO Ruixin, LI Jinhai
Concept cognition and knowledge discovery under network data are hot research directions in the field of network data analysis, and they are applied in the field of recommendation system. However, how to construct a reasonable set of weaken-concepts to improve the effectiveness of neighborhood recommendation is still a difficult problem. To solve this problem, a set of variable precision weaken-concepts is proposed to induce neighborhoods with more information, and then a neighborhood recommendation algorithm is developed based on causality force. Firstly, the aggregation centrality degree of similarity network is defined to determine expert nodes, and a set of variable precision weaken-concepts is obtained to divide neighborhoods. Secondly, the variable precision common operators are employed in each neighborhood to obtain the weaken-concepts of conditional attributes and decision attributes of objects. Finally, a neighborhood recommendation algorithm is given based on the principle of causality force and related properties. Experimental results on MovieLens and Filmtrust datasets show that the accuracy, recall, F1 and running time of the proposed algorithm are greatly improved.
2022 Vol. 35 (11): 977-988 [Abstract] ( 438 ) [HTML 1KB] [ PDF 721KB] ( 734 )
989 Near Neighborhood Classifier with Adaptive Radius Selection
ZHANG Qinghua, XIAO Jiayu, AI Zhihua, WANG Guoyin

In neighborhood rough sets, the neighborhood classifier is an intuitive and effective classification method in data mining. However, the neighborhood radius, as a key factor to determine the classification performance of the neighborhood classifier, has some defects in construction. The construction of the neighborhood radius is not universal due to the lack of the training stage. When the data samples are not uniformly distributed and then empty neighborhoods appear, the classifier fails. Aiming at these problems, a near neighborhood classifier with adaptive radius selection(NNC-AR) is proposed. Firstly, for training samples, a training neighborhood radius based on K-nearest neighbor is defined. For test samples, an adaptive neighborhood radius is defined to overcome the subjectivity of the artificial parameter in the traditional neighborhood radius. Finally, for the test samples with classifier failure, an approximate neighborhood radius is defined to improve the generalization ability of the classifier. The experimental results show that the F1 score and classification accuracy of NNC-AR model are significantly improved.

2022 Vol. 35 (11): 989-998 [Abstract] ( 542 ) [HTML 1KB] [ PDF 738KB] ( 447 )
Surveys and Reviews
999 Research Progress of Deep Clustering Based on Unsupervised Representation Learning
HOU Haiwei, DING Shifei, XU Xiao
In the era of big data, data usually has the characteristics of large scale, high dimension and complex structure. Deep learning is utilized to combine representation learning and clustering tasks in deep clustering. Therefore, the performance of deep clustering for large-scale and high-dimensional data is greatly improved. The development of deep clustering is rarely summarized from the perspective of representation learning. The difference between traditional and deep clustering algorithms and the heterogeneity of deep clustering algorithms are seldom analyzed. Firstly, common clustering algorithms in deep clustering are summarized. Deep clustering algorithms are divided into generative and discriminative models based deep clustering algorithms, and representation learning process of deep models in clustering tasks is analyzed. Secondly, the comparative analysis of multiple types of algorithms is carried out through experiments. And the advantages and disadvantages of different algorithms are summarized to select models for specific tasks. Finally, application scenarios are described and the future development trend of deep clustering is discussed.
2022 Vol. 35 (11): 999-1014 [Abstract] ( 785 ) [HTML 1KB] [ PDF 865KB] ( 1401 )
Researches and Applications
1015 Discovery of Time-Sensitive Thematic Patterns in Urban Functional Areas
LIU Junling, DING Sibo, SUN Huanliang, YU Ge, XU Jingke
The analysis of urban spatial function structure is a hot research direction in the field of urban geographic information. Correct analysis of spatial function can reasonably plan resources and facilitate residents to utilize urban space. Therefore, a model for discovery of time-sensitive thematic patterns in urban functional areas is proposed to analyze the dynamic urban functional area structure changing with time. In the model, the urban space is gridded into multiple spatial units, and the spatial units are embedded and represented by combining user access data and point of interest data. After clustering the theme feature vectors in the time dimension, the feature distribution matrix with differences is obtained to complete the period division. In the spatial dimension, the adjacent areas with similar feature distribution are merged to obtain a time-sensitive urban function theme model. Based on the shared bicycle trajectory data of Beijing and Baidu map query data, the objective dynamic functional areas are divided, the rationality of functional area division is visualized, and the effectiveness of the proposed model is verified via clustering evaluation measures.
2022 Vol. 35 (11): 1015-1024 [Abstract] ( 351 ) [HTML 1KB] [ PDF 957KB] ( 416 )
1025 Multi-hop Inference Model for Knowledge Graphs Incorporating Semantic Information
LI Fengying, HE Xiaodie, DONG Rongsheng
In multi-hop inference models, path information is formed by fully mining and utilizing multi-step relationships between entities in the knowledge graph to accomplish knowledge inference. To solve the problems of sparse data and low reliability of inference paths in most of the existing sparse knowledge graph multi-hop inference models, a multi-hop inference model for knowledge graphs incorporating semantic information is proposed. Firstly, entities and relations in the knowledge graph are embedded into the vector space as the external environment for reinforcement learning training. Then, the semantic information of query relations and inference paths is employed to select the (relation, entity) pair with the highest similarity to expand the action space for path search by the agent, and thus the lack of sparse data in the inference process is compensated. Finally, the semantic similarity between the inference path and the query relation is utilized to evaluate the reliability of the inference path and it is fed back to the agent as a reward function. Experiments on several publicly available sparse datasets show that the inference performance of the proposed model is significantly improved.
2022 Vol. 35 (11): 1025-1032 [Abstract] ( 554 ) [HTML 1KB] [ PDF 720KB] ( 779 )
1033 Implicit Knowledge Graph Collaborative Filtering Model
XUE Feng, SHENG Yicheng, LIU Kang, SANG Sheng
In the existing recommendation methods based on knowledge graphs, graph neural networks are utilized to capture the correlation between user preferences and knowledge entities to achieve optimal recommendation results. However, certain limitations occur in this kind of relevance modeling methods due to its dependence on the explicit relationship between nodes(users, items or entities). To address these problems, an implicit knowledge graph collaborative filtering model(IKGCF) is proposed. Firstly, the implicit collaborative knowledge graph is constructed to eliminate the interference of explicit relationship on implicit interaction in recommendations and remove the limitation of explicit relationship on semantic relevance in the graph. Then, an enhanced graph neural network module is adopted to perform neighbor aggregation and message propagation to better capture the higher-order relevance on the implicit collaborative knowledge graph. Finally, a layer selection mechanism is employed to obtain the final node embedding vectors and predict and optimize the model. Experiments on three public datasets show that IKGCF achieves better performance. The full code of IKGCF is open-sourced at https://github.com/hfutmars/IKGCF.
2022 Vol. 35 (11): 1033-1041 [Abstract] ( 290 ) [HTML 1KB] [ PDF 707KB] ( 1180 )
1042
2022 Vol. 35 (11): 1042-1044 [Abstract] ( 280 ) [HTML 1KB] [ PDF 282KB] ( 583 )
1045
2022 Vol. 35 (11): 1045-1046 [Abstract] ( 145 ) [HTML 1KB] [ PDF 256KB] ( 424 )
模式识别与人工智能
 

Supervised by
China Association for Science and Technology
Sponsored by
Chinese Association of Automation
NationalResearchCenter for Intelligent Computing System
Institute of Intelligent Machines, Chinese Academy of Sciences
Published by
Science Press
 
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn