基于属性的多类数据分类决策图

J. R. Bertini, M. C. Nicoletti, Liang Zhao
{"title":"基于属性的多类数据分类决策图","authors":"J. R. Bertini, M. C. Nicoletti, Liang Zhao","doi":"10.1109/CEC.2013.6557776","DOIUrl":null,"url":null,"abstract":"Graph-based representation has been successfully used to support various machine learning and data mining algorithms. The learning algorithms strongly rely on the algorithm employed for constructing the graph from input data, given as a set of vector-based patterns. A popular way to build such graphs is to treat each data pattern as a vertex; vertices are then connected according to some similarity measure, resulting in an structure known as data graph. In this paper we propose a new type of data graph, focused on data attributes, named Attribute-based Decision Graph - AbDG, suitable for supervised multiclass classification tasks. The input data for constructing an AbDG is a set of data-vectors (patterns), that can be described by either type of attributes (numeric, categorical or both). Also, algorithms for constructing such graphs and using them in classification tasks are described. An AbDG can be associated to a classifying procedure approached as a graph matching process, where the sub-graph representing a new pattern is matched against the AbDG. The proposed approach has been experimentally evaluated on classification tasks in twenty knowledge domains and the results are competitive when compared to those of two well-known classification methods (C4.5 and Multi-Interval ID3).","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":"14 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Attribute-based Decision Graphs for multiclass data classification\",\"authors\":\"J. R. Bertini, M. C. Nicoletti, Liang Zhao\",\"doi\":\"10.1109/CEC.2013.6557776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph-based representation has been successfully used to support various machine learning and data mining algorithms. The learning algorithms strongly rely on the algorithm employed for constructing the graph from input data, given as a set of vector-based patterns. A popular way to build such graphs is to treat each data pattern as a vertex; vertices are then connected according to some similarity measure, resulting in an structure known as data graph. In this paper we propose a new type of data graph, focused on data attributes, named Attribute-based Decision Graph - AbDG, suitable for supervised multiclass classification tasks. The input data for constructing an AbDG is a set of data-vectors (patterns), that can be described by either type of attributes (numeric, categorical or both). Also, algorithms for constructing such graphs and using them in classification tasks are described. An AbDG can be associated to a classifying procedure approached as a graph matching process, where the sub-graph representing a new pattern is matched against the AbDG. The proposed approach has been experimentally evaluated on classification tasks in twenty knowledge domains and the results are competitive when compared to those of two well-known classification methods (C4.5 and Multi-Interval ID3).\",\"PeriodicalId\":211988,\"journal\":{\"name\":\"2013 IEEE Congress on Evolutionary Computation\",\"volume\":\"14 6\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2013.6557776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2013.6557776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

基于图的表示已经成功地用于支持各种机器学习和数据挖掘算法。学习算法强烈依赖于从输入数据中构造图的算法,输入数据是一组基于向量的模式。构建此类图的一种流行方法是将每个数据模式视为一个顶点;然后,根据一些相似度度量将顶点连接起来,形成一个称为数据图的结构。本文提出了一种新的以数据属性为中心的数据图,称为基于属性的决策图(Attribute-based Decision graph, AbDG),适用于有监督的多类分类任务。用于构造AbDG的输入数据是一组数据向量(模式),可以用任意一种属性类型(数字、分类或两者)来描述。此外,还描述了构造此类图并在分类任务中使用它们的算法。一个AbDG可以与一个分类过程相关联,作为一个图匹配过程,其中表示新模式的子图与AbDG相匹配。该方法已在20个知识领域的分类任务上进行了实验评估,结果与两种知名的分类方法(C4.5和Multi-Interval ID3)相比具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Attribute-based Decision Graphs for multiclass data classification
Graph-based representation has been successfully used to support various machine learning and data mining algorithms. The learning algorithms strongly rely on the algorithm employed for constructing the graph from input data, given as a set of vector-based patterns. A popular way to build such graphs is to treat each data pattern as a vertex; vertices are then connected according to some similarity measure, resulting in an structure known as data graph. In this paper we propose a new type of data graph, focused on data attributes, named Attribute-based Decision Graph - AbDG, suitable for supervised multiclass classification tasks. The input data for constructing an AbDG is a set of data-vectors (patterns), that can be described by either type of attributes (numeric, categorical or both). Also, algorithms for constructing such graphs and using them in classification tasks are described. An AbDG can be associated to a classifying procedure approached as a graph matching process, where the sub-graph representing a new pattern is matched against the AbDG. The proposed approach has been experimentally evaluated on classification tasks in twenty knowledge domains and the results are competitive when compared to those of two well-known classification methods (C4.5 and Multi-Interval ID3).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信