.png){kind=icon}
返回
Supervised classification using graph-based space partitioning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2019.07.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the paper we consider the supervised classification problem using space partitioning into multidimensional rectangular boxes. We show that the problem at hand can be reduced to computational geometry problem involving heuristic minimum clique cover problem satisfying the k-nearest neighbor rule. We first apply heuristic algorithm for partitioning a graph into a minimal number of maximal cardinality cliques inscribed into the smallest (in volume) rectangular parallelepipeds called boxes. The main advantage of the new classifier called Box algorithm which optimally utilizes the geometrical structure of the training set is decomposition of the l-class problem (1> 2) into l binary classification problems. We discuss computational complexity of the proposed method and the resulting classification rules. The extensive experiments performed on the real and simulated data show that in almost all cases the Box algorithm performs significantly better than k-NN, SVM and decision trees. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Supervised classification
Feature space partitioning
Graph partitioning
Nearest neighbor rule
Box algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
分享收藏 没有更多内容
没有更多内容