寻找离散化箱数的组合技术

2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI:10.1109/SCCC.2013.11

Miguel A. Alvarez-Carmona, J. A. Carrasco-Ochoa, J. Martínez-Trinidad

{"title":"寻找离散化箱数的组合技术","authors":"Miguel A. Alvarez-Carmona, J. A. Carrasco-Ochoa, J. Martínez-Trinidad","doi":"10.1109/SCCC.2013.11","DOIUrl":null,"url":null,"abstract":"In different problems and for different reasons, it is necessary to work with fully discretized domains. Commonly, continuous attributes are discretized in bins, but determining a suitable number of bins is a difficult task. In this paper, some ways for combining different techniques to estimate the number of bins for discretization are proposed and evaluated for both clustering and supervised classification tasks.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Combining Techniques to Find the Number of Bins for Discretization\",\"authors\":\"Miguel A. Alvarez-Carmona, J. A. Carrasco-Ochoa, J. Martínez-Trinidad\",\"doi\":\"10.1109/SCCC.2013.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In different problems and for different reasons, it is necessary to work with fully discretized domains. Commonly, continuous attributes are discretized in bins, but determining a suitable number of bins is a difficult task. In this paper, some ways for combining different techniques to estimate the number of bins for discretization are proposed and evaluated for both clustering and supervised classification tasks.\",\"PeriodicalId\":182181,\"journal\":{\"name\":\"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2013.11\",\"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 32nd International Conference of the Chilean Computer Science Society (SCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2013.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在不同的问题中，由于不同的原因，有必要使用完全离散的域。通常，连续属性在箱子中离散化，但确定合适的箱子数量是一项困难的任务。本文提出了几种结合不同技术估计离散化箱数的方法，并对聚类和监督分类任务进行了评估。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Combining Techniques to Find the Number of Bins for Discretization

In different problems and for different reasons, it is necessary to work with fully discretized domains. Commonly, continuous attributes are discretized in bins, but determining a suitable number of bins is a difficult task. In this paper, some ways for combining different techniques to estimate the number of bins for discretization are proposed and evaluated for both clustering and supervised classification tasks.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 32nd International Conference of the Chilean Computer Science Society (SCCC)

自引率

0.00%

发文量