返回
Matrixized learning machine with modified pairwise constraints
DOI:10.1016/j.patcog.2015.05.023.png)
摘要
En 中文
Matrix-pattern-oriented Classifier Design (MatCD) has been demonstrated to be effective in terms of the classification performance since it utilizes two-sided weight vectors to constrain the matrix-based patterns. However, the existing MatCD might not be able to acquire the prior distribution knowledge, such as the relationship between two patterns. Inspired by the Pairwise Constraints (PC) method, i.e., must-links and cannot-links between the patterns, this paper introduces a new regularization term named R-p with a modified PC method into MatCD. The new classifier design strategy is expected to not only learn the structural information of each pattern itself, but also acquire the prior distribution knowledge about each constrained pair with both the discrimination metric from the traditional PC and the spatial distance measure from the heat kernel method. In practice, this paper selects one typical matrixized classifier named MatMHKS as the basic building block and introduces the term Rp into it. The newly-proposed classifier is named MLMMPC and the subsequent experiments validate the effectiveness of it. Two major contributions of this paper can be concluded as (1) improving the existing matrix-pattern-oriented classifier design techniques and (2) modifying the traditional PC method by combining the discrimination metric and the distance measure together. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Matrixized classifier
Regularized learning
Modified pairwise constraints
Pattern recognition
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Temperature sensing in Tb3+/Eu3+-based tetranuclear silsesquioxane cages with tunable emission
RSC Advances
IF0
Pairwise constraints based multiview features fusion for scene classification
PATTERN RECOGNITION
IF7.6

