返回
Analysis of data complexity measures for classification
DOI:10.1016/j.eswa.2013.02.025.png)
摘要
En 中文
The study of data complexity metrics is an emergent area in the field of data mining and is focused on the analysis of several data set characteristics to extract knowledge from them. This information can be used to support the election of the proper classification algorithm. This paper addresses the analysis of the relationship between data complexity measures and classifiers behavior. Each one of the metrics is evaluated covering its range of values and studying the classifiers accuracy on these values. The results offer information about the usefullness of these measures, and which of them allow us to analyze the nature of the input data set and help us to decide which classification method could be the most promising one. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Data complexity
Class overlapping
Class separability
Classification
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
Addressing data complexity for imbalanced data sets: analysis of SMOTE-based oversampling and evolutionary undersampling
SOFT COMPUTING
IF2.5
On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures
PATTERN RECOGNITION
IF7.6

