模式识别与人工智能
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....
 
 
2018 Vol.31 Issue.3, Published 2018-03-25

Papers and Reports    Researches and Applications   
   
Papers and Reports
197 Classification Approach by Mining Betweenness Information beyond Data Points Themselves
GU Suhang, WANG Shitong
Mining useful information beyond data points themselves to guide and improve the accuracy of data classification is a subject worthy of study. In this paper, a network is firstly built to characterize the whole dataset, and the side information about the betweenness information between every pair of data points is mined in the network, and then the efficiency of subnetworks and the influence value of each network node are computed in an iterative way with the concept of density. With the mined inside information, a classification approach by mining betweenness information beyond data points themselves(CA-MBI) is developed. CA-MBI exhibits low time complexity with a high accuracy of data classification.The experimental results on synthetic and real-world datasets demonstrate the superior performance of CA-MBI compared with several benchmarking classification algorithms.
2018 Vol. 31 (3): 197-207 [Abstract] ( 605 ) [HTML 1KB] [ PDF 1177KB] ( 457 )
208 Fuzzy Soft Set Semantics of Propositional Logic Formulas and Its Application to Decision Analysis
WU Xia, ZHANG Jialu, WANG Luda
Soft propositional logic formulas based on a fuzzy soft set S=(F,A) of domain U are introduced, and the fuzzy soft semantics interpretation of soft propositional logic formulas is provided. A decision fuzzy information system is transformed into a decision fuzzy soft set, and a soft decision rule is expressed as an implication logic formula composed of some atomic formulas. The concepts of basic truth degree, condition truth and absolute truth are introduced. The availability and the rationality of soft decision rule are evaluated from different aspects, such as sufficiency and necessity. An extraction algorithm of typical decision rules based on the decision soft set and a recommendation algorithm based on soft decision analysis are proposed, and the practical examples and numerical experiment verify the effectiveness of the proposed algorithms.
2018 Vol. 31 (3): 208-218 [Abstract] ( 494 ) [HTML 1KB] [ PDF 756KB] ( 353 )
219 Perspective Level Microblog Sentiment Classification Based on Convolutional Memory Network
LIAO Xiangwen, XIE Yuanyuan, WEI Jingjing, GUI Lin, CHENG Xueqi, CHEN Guolong
In the current memory network model, the words of the context are independent of each other, and the influence of word order information on microblog sentiment is not taken into account. Therefore, a perspective level microblog sentiment classification method based on convolutional memory network is proposed. In the method, memory network can effectively model the semantic relation between the query and the text. Consequently, the view and the text are abstracted via this property. Furthermore, the word order in context is extended by convolutional operation. Then, the result is utilized to capture the attention signals of different terms in context for the weighted representation of text. Experimental results on three public datasets indicate that the proposed method achieves higher accuracies and Macro-F1 values compared with other methods.
2018 Vol. 31 (3): 219-229 [Abstract] ( 628 ) [HTML 1KB] [ PDF 1009KB] ( 589 )
230 Attribute Reduction for Entire-Granulation Rough Sets
DENG Dayong
Entire-granulation rough sets is a kind of dynamic and static combining rough set model. They can partly express complexity,diversity and uncertainty of human cognition. The entire-granulation attribute reducts for a single concept are defined and the definitions of attribute reducts for entire-granulation rough sets are completed. The properties of entire-granulation attribute reducts, including entire-granulation attribute reducts for a single concept, entire-granulation absolute attribute reducts and entire-granulation Pawlak reducts, are investigated.Moreover, the relationships among various kinds of entire-granulation attribute reducts are studied. The obtained results contribute to practical applications and the generation of heuristic algorithms of entire-granulation attribute reducts.
2018 Vol. 31 (3): 230-235 [Abstract] ( 527 ) [HTML 1KB] [ PDF 1335KB] ( 336 )
236 Recommendation Algorithm with Social Relations and Content Information in Social Networks
LIU Huiting, YANG Liangquan, LING Chao, ZHAO Peng
Collaborative filtering is a widely adopted approach in recommendation. However, sparse data remain the main obstacle to provide high quality recommendations. To address this issue, a method is proposed to improve the performance of collaborative filtering recommendations by integrating sparse action records data generated by users, the social information among items and the content information of these items. Matrix factorization technique is adopted to map the user action matrix and item social relations into the low-dimensional latent feature space to provide an explicit interpretation of factorization on item social relations and analyze the influence of social relations of item on user action preferences. Meanwhile, to learn more effective features from the item content, a social factor regularized stacked denoising autoencoder model is utilized and it is an extension of conventional deep learning model. Experimental results on the Tencent blog and Twitter datasets show that the proposed model outperforms several traditional methods in terms of recall and average precision, and it improves the recommendation efficiency effectively.
2018 Vol. 31 (3): 236-244 [Abstract] ( 599 ) [HTML 1KB] [ PDF 845KB] ( 424 )
Researches and Applications
245 Object Tracking Algorithm Based on Feature Selection and Temporal Consistency Sparse Appearance Model
ZHANG Weidong, ZHAO Jianwei, ZHOU Zhenghua, CAO Feilong

To improve the tracking accuracy and the robustness of object tracking by exploiting discriminative features of a tracking target effectively, an object tracking algorithm is proposed in the framework of particle filter tracking based on the feature selection and temporal consistency sparse appearance model. Firstly,some positive templates,negative templates,and candidate targets are sampled, and their corresponding features are selected according to the feature selection model. The redundant interferential information is deleted, and the key feature information is obtained. Secondly, a multi-task sparse representation model containing a temporal consistency regular term is established via the features of positive templates,negative templates, and candidate targets. It induces more candidate targets to have sparse representation similarities with the previous tracking results. Thirdly,the multi-task sparse representation model is solved to gain the discriminative sparse similarity map, and the discriminative score is obtained for each candidate target. Finally, the positive templates and the negative templates are updated according to the tracking results. Experiments demonstrate that the proposed tracking algorithm produces better accuracy than some tracking methods,even under the complex environments.

2018 Vol. 31 (3): 245-255 [Abstract] ( 546 ) [HTML 1KB] [ PDF 4518KB] ( 391 )
256 Weighted Dependence of Neighborhood Rough Sets and Its Heuristic Reduction Algorithm
XU Bo, ZHANG Xianyong, FENG Shan
Neighborhood rough sets act as an effective tool for data processing of numeric attributes. According to neighborhood rough sets, the traditional dependency and its reduction rarely take the absolute structure of neighborhood covering into account. Therefore the weighted dependence and its heuristic reduction algorithm are established in this paper. Firstly, the weighted dependence is proposed to gain its measure improvement and granulation monotonicity, and its relevant attribute reduction is defined. Secondly, the self-adapting valuing of the neighborhood radius is analyzed, and the neighborhood weighted dependence reduction(NWDR algorithm) is constructed. Finally, contrast experiments on UCI datasets are implemented, and both the monotonicity of the weighted dependence and the effectiveness of NWDR are verified. The weighted dependence improves the uncertainty representation ability of the classical dependence, and the relevant NWDR exhibits higher classification accuracy and stronger application applicability.
2018 Vol. 31 (3): 256-264 [Abstract] ( 580 ) [HTML 1KB] [ PDF 839KB] ( 426 )
265 Interval Type-2 Fuzzy Measure Based Rough K-means Clustering
LU Ruiqiang, MA Fumin, ZHANG Tengfei

The rough k-means algorithm and its derivatives focus on the description of data objects in uncertain boundary areas. However, the influence of imbalanced sizes between clusters on the clustering result is ignored. The interval type-2 fuzzy measure is introduced in this paper for measuring the boundary objects and an improved rough K-means clustering algorithm is developed. Firstly, the membership degree interval of the boundary object is calculated according to the data distribution of clusters and thus the spatial distribution of clusters is described. Then, the data sample size of the cluster is taken into account to adaptively adjust the influence coefficient of boundary objects on overlapping clusters. The experimental results on both synthetic and UCI datasets show that the adverse impact of the boundary objects on the means iterative calculations of small sample size clusters is mitigated and the clustering accuracy is improved.

2018 Vol. 31 (3): 265-274 [Abstract] ( 555 ) [HTML 1KB] [ PDF 823KB] ( 385 )
275 Word Embedding Based Chinese News Event Detection and Representation
ZHANG Bin, HU Linmei, HOU Lei, LI Juanzi
Existing methods of event detection are mainly based on traditional TF-IDF document representation with high dimension and sparse semantics, leading to low efficiency and accuracy. Thus, they are not suitable for large-scale online news event detection. A document representation method based on word embedding is proposed in this paper. By the document representation method, the document representation dimension is reduced, the semantic sparse problem is alleviated and the efficiency and accuracy of document similarity calculation are enhanced. Based on the document representation method, a dynamic online clustering method is proposed for online news event detection. Based on the dynamic online clustering method, both the accuracy and the recall of event detection are improved. Experiments on the standard dataset TDT4 and a real dataset show that the proposed adaptive online event detection method significantly improves the performance of event detection in both efficiency and accuracy compared with the state-of-the-art methods.

2018 Vol. 31 (3): 275-282 [Abstract] ( 700 ) [HTML 1KB] [ PDF 790KB] ( 615 )
283 Motor Vehicle Driver Detection Framework Based on Multi-detected Region Fusion
HUO Xing, TAN Jieqing, ZHAO Feng, JING Yongjun, SHAO Kun
Features of motor vehicle driver are difficult to be acquired in motor vehicle driver detection due to the various illumination conditions, image noise and complex backgrounds. Therefore, an accurate driver location detection framework based on multi-detected region fusion is proposed in this paper to promote the driver identification rate. In the detection process, license plate location is obtained firstly by the algorithm based on image gradient features. Then, the window area of the vehicle is determined by an adaptive method. Finally, the multi-detected region fusion strategy is introduced to obtain the accurate driver region. Experiments on the testing image library verify the high identification rate of the proposed algorithm.
2018 Vol. 31 (3): 283-292 [Abstract] ( 482 ) [HTML 1KB] [ PDF 1604KB] ( 583 )
模式识别与人工智能
 

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