模式识别与人工智能
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.9, Published 2022-09-25

Researches and Applications    Surveys and Reviews    Granular Computing and Knowledge Acquisition   
   
Surveys and Reviews
767 Hall for Workshop of Metasynthetic Engineering Based on Man-Machine Integration
ZHENG Nan, ZHANG Song, DAI Ruwei
Hall for workshop of metasynthetic engineering (HWME) belongs to the basic theoretical level of system science, which is a methodology of open complex giant systems (OCGSs). It is also an application technology of noetic science, which belongs to the engineering application level of noetic science, and is an original result of the cross development of system science and noetic science. This paper expounds the theoretical background of HWME from the aspects of system science and noetic science. From the perspective of the evolution of noetic and intelligence, three levels of man-machine integration are proposed. From the perspective of noetic science, this paper explores the ways to improve the thinking ability of HWME and realize the enhancement of human-machine intelligence, and tries to enlighten the complex problem solving and man-machine integration intelligence. Group thinking, machine intelligence and knowledge system are applied in HWME to stimulate the evolution process of individual thinking → individual wisdom → group wisdom → social wisdom. From the intelligent science that combines noetic science, information science and technology, and network technology to the social intelligent science that reflects the intersection and integration of humanities and natural science, Mr. Qian Xuesen's forward-looking scientific thoughts and broad and profound wisdom permeate this process.
2022 Vol. 35 (9): 767-773 [Abstract] ( 584 ) [HTML 1KB] [ PDF 703KB] ( 648 )
Granular Computing and Knowledge Acquisition
774 A Layer-by-Layer Attribute Reduction Algorithm for Fuzzy Linguistic Attribute Partial Order Structure Diagram
PANG Kuo, ZHOU Ai, YANG Xinran, LI Nan, ZOU Li, LU Mingyu
As a data visualization tool, attribute partial order structure diagram can solve the problem of user cognitive overload in formal concept analysis effectively. People often express preference information through fuzzy linguistic values in real life,and thus a large amount of fuzzy linguistic-valued data is generated. To solve the problem of attribute reduction in fuzzy linguistic environment, a layer-by-layer attribute reduction algorithm for fuzzy linguistic attribute partial order structure diagram is proposed in this paper. Firstly, the fuzzy linguistic attribute partial order structure diagram is constructed based on the fuzzy linguistic-valued formal context, and the fuzzy linguistic-valued data is embedded into the attribute partial order structure diagram. The order relation and the incomparable relation between fuzzy linguistic values are expressed by the linguistic truth-valued lattice implication algebra acting as the representation model of the fuzzy linguistic values. Secondly, the fuzzy linguistic attribute partial order structure diagram is employed and the nodes that do not form edges with the underlying nodes are searched to obtain the minimum attribute subset with the fuzzy linguistic-valued formal context discrimination ability unchanged. On the premise of ensuring the class equivalence of the fuzzy linguistic attribute partial order structure diagram, the difference attribute between the node and its child nodes is calculated, and the corresponding layer-by-layer attribute reduction model is constructed. Finally, examples and comparative experiments verify the effectiveness and practicability of the proposed method.
2022 Vol. 35 (9): 774-788 [Abstract] ( 364 ) [HTML 1KB] [ PDF 970KB] ( 214 )
789 Knowledge Acquisition for Consistent Generalized Decision Multi-scale Ordered InforMation SysteMs
ZHANG Jiaru, WU Weizhi, YANG Ye
A decision Multi-scale inforMation systeM is a sPecial tyPe of Multi-scale data set and each object under each attribute in the systeM froM either the condition attribute set or the decision attribute is rePresented by different scales at different levels of the granulations, holding a granular inforMation transforMation froM a finer to a coarser labelled value. To solve the ProbleM of knowledge acquisition in generalized decision Multi-scale ordered inforMation systeMs, the concePt of scale selection is firstly defined. Each scale selection is linked with a single-scale ordered decision systeM. DoMinance relations are also introduced into decision Multi-scale inforMation systeMs, rePresentations of inforMation granules as well as lower and uPPer aPProxiMations of sets under different scale selections are Presented, and their relationshiPs are exaMined. Then, five tyPes of oPtiMal scale selections in consistent generalized decision Multi-scale ordered inforMation systeMs are defined. It is Proved that there are indeed two different tyPes of oPtiMal scale selections. The notions of oPtiMal scale selection, lower aPProxiMation oPtiMal scale selection and belief oPtiMal scale selection are all equivalent, and a scale selection is uPPer aPProxiMation oPtiMal if and only if it is Plausibly oPtiMal. Finally, based on oPtiMal scale selections, a Method of discernibility Matrix attribute reduction and ordered decision rules hidden in consistent generalized decision Multi-scale ordered inforMation systeMs are exPlored.
2022 Vol. 35 (9): 789-804 [Abstract] ( 490 ) [HTML 1KB] [ PDF 730KB] ( 698 )
805 Multi-label Feature Selection Based on Fuzzy Neighborhood Similarity Relations in Double Spaces
XU Jiucheng, SHEN Kaili
In most of the current rough set based multi-label feature selection algorithms, sample fuzziness and neighborhood relationship are ignored, the neighborhood radius needs setting manually, and attribute importance is measured in a single space. To overcome the defects of classical rough set algorithms, an algorithm of multi-label feature selection based on fuzzy neighborhood similarity in double spaces is proposed from the perspectives of feature space and label space. Firstly, an adaptive neighborhood radius calculation method is proposed and fuzzy neighborhood similarity matrix of samples in feature space is constructed. Secondly, similarities of sample in feature space and label space are obtained according to fuzzy neighborhood similarity relations. Then, the sample similarities in feature space and label space are fused by introducing weights and the attribute importance is calculated based on the fused measures. Finally, a multi-label feature selection algorithm is constructed via the forward greedy algorithm. The effectiveness of the proposed algorithm is confirmed on twelve multi-label datasets.
2022 Vol. 35 (9): 805-815 [Abstract] ( 352 ) [HTML 1KB] [ PDF 567KB] ( 321 )
816 Concept-Cognitive Learning Model Based on Decision Significance
WANG Qijun, LIN Yidong, LIN Menglei, KOU Yi

Concept-cognitive learning is a concept learning method that simulates human cognitive process based on formal concept analysis. Most of the current concept-cognitive learning methods only consider conceptual similarity and ignore the influence of prior decision information, resulting in the loss of practical details. To solve this problem, a concept-cognitive learning model based on decision significance is put forward for concept classification in a dynamic environment by extracting prior decision information to describe the significance of decision making. The neighborhood granule is constructed by cosine similarity, and the progressive process of concept cognition is discussed. For the dynamic environment, the decision significance and confidence degree are proposed to design the computational method of concept classification with the consideration of the validity of the a priori decision information. The effectiveness and superiority of the proposed method are verified by simulation experiments.

2022 Vol. 35 (9): 816-826 [Abstract] ( 441 ) [HTML 1KB] [ PDF 708KB] ( 226 )
827 Graph Convolutional Neural Network Algorithm Based on Rough Graphs
PAN Bairu, DING Weiping, JU Hengrong, HUANG Jiashuang, CHENG Chun, SHEN Xinjie, GENG Yu
A topology graph is utilized to portray the relationship between nodes and node features are updated on the basis of the topology graph, when the graph convolutional neural network is applied for solving node classification problems. However, traditional topology graph can only portray definite relationships between nodes, i.e. fixed values of connected edge weights, ignoring the widespread uncertainty in the real world. The uncertainty affects not only the relationship between nodes, but also the final classification performance of the model. To overcome this defect, a graph convolutional neural network algorithm based on rough graphs is proposed. Firstly, the rough edges are constructed via the upper-lower approximation theory and the edge theory of traditional topology graph, and the uncertain relationships between nodes are inscribed in rough edges using maximum-minimum relationship values coming in pairs to construct a rough graph. Then, an end-to-end trainable neural network architecture based on rough graphs is designed, the rough graphs trained with rough weight coefficients are fed into the graph convolutional neural network, and the node features are updated based on the uncertain information. Finally, nodes are classified according to the learned node features. The experiments on real dataset show that the proposed algorithm improves the accuracy of node classification.
2022 Vol. 35 (9): 827-838 [Abstract] ( 468 ) [HTML 1KB] [ PDF 1040KB] ( 391 )
Researches and Applications
839 News Recommendation Model Based on Transformer and Heterogenous Graph Neural Network
ZHANG Yupeng, LI Xiangju, LI Chao, ZHAO Zhongying
In most of the existing news recommendation models, it is assumed that there is strong temporal dependence among the news items browsed by users. However, noise may be introduced into temporal modeling due to the rapidity of news updates and the freedom for users to read. To solve the problem, a news recommendation model based on Transformer and heterogenous graph neural network is proposed. Different from the neural network model based on time series, Transformer is employed to model the users’ short-term interests from the recent reading history. Using heterogenous graph neural networks, users’ long-term interests and candidate news representations are modeled by capturing the high-order relationship information between users and news. Meanwhile, a long and short-term interests aware mechanism is designed to adaptively adjust the importance of users’ long-term and short-term interests in news recommendation. Experiments on a real-world dataset demonstrate the effectiveness of the proposed model.
2022 Vol. 35 (9): 839-848 [Abstract] ( 568 ) [HTML 1KB] [ PDF 813KB] ( 476 )
849 Citation Intent Classification Method Based on MPNet Pretraining and Multi-head Attention Feature Fusion
QI Ruihua, SHAO Zhen, GUAN Jinghua, GUO Xu

Automatic citation intent classification is one of hot issues in the field of bibliometrics.The existing citation intention classification models engender the limitations in extracting textual features and fusing citation contextual features and citation external features. Therefore, a citation intent classification method based on MPNet pretraining and multi-head attention feature fusion is proposed. The position compensation structure is introduced to improve the masked language model and permuted Language model.The syntactic word-frequency features and structure features of citations are combined. A feature extraction method is proposed for citation intent classification task. The multi-head attention mechanism is introduced for feature fusion to improve the classification accuracy. The experimental results on ACL-ARC datasets demonstrate that the proposed method achieves better performance in citation intent classification task with robustness on the unbalanced data.

2022 Vol. 35 (9): 849-857 [Abstract] ( 440 ) [HTML 1KB] [ PDF 714KB] ( 270 )
858
2022 Vol. 35 (9): 858-862 [Abstract] ( 207 ) [HTML 1KB] [ PDF 275KB] ( 220 )
模式识别与人工智能
 

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