元胞自动机用于特征构建的初步研究

M. Mertik, Mykola Pechenizkiy, G. Štiglic, P. Kokol
{"title":"元胞自动机用于特征构建的初步研究","authors":"M. Mertik, Mykola Pechenizkiy, G. Štiglic, P. Kokol","doi":"10.1109/DEST.2007.372023","DOIUrl":null,"url":null,"abstract":"When first faced with a learning task, it is often not clear what a good representation of the training data should look like. We are often forced to create some set of features that appear plausible, without any strong confidence that they will yield superior learning. Beside, we often do not have any prior knowledge of what learning method is the best to apply, and thus often try multiple methods in an attempt to find the one that performs best. This paper describes a new method and its preliminary study for constructing features based on cellular automata (CA). Our approach uses self-organisation ability of cellular automata by constructing features being most efficient for making predictions. We present and compare the CA approach with standard genetic algorithm (GA) which both use genetic programming (GP) for constructing the features. We show and discuss some interesting properties of using CA approach in our preliminary experimental study by constructing features on synthetically generated dataset and benchmark datasets from the UCI machine learning repository. Based on the interesting results, we conclude with directions and orientation of the future work with ideas of applicability of CA approach in the feature.","PeriodicalId":448012,"journal":{"name":"2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using Cellular Automata for feature construction - preliminary study\",\"authors\":\"M. Mertik, Mykola Pechenizkiy, G. Štiglic, P. Kokol\",\"doi\":\"10.1109/DEST.2007.372023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When first faced with a learning task, it is often not clear what a good representation of the training data should look like. We are often forced to create some set of features that appear plausible, without any strong confidence that they will yield superior learning. Beside, we often do not have any prior knowledge of what learning method is the best to apply, and thus often try multiple methods in an attempt to find the one that performs best. This paper describes a new method and its preliminary study for constructing features based on cellular automata (CA). Our approach uses self-organisation ability of cellular automata by constructing features being most efficient for making predictions. We present and compare the CA approach with standard genetic algorithm (GA) which both use genetic programming (GP) for constructing the features. We show and discuss some interesting properties of using CA approach in our preliminary experimental study by constructing features on synthetically generated dataset and benchmark datasets from the UCI machine learning repository. Based on the interesting results, we conclude with directions and orientation of the future work with ideas of applicability of CA approach in the feature.\",\"PeriodicalId\":448012,\"journal\":{\"name\":\"2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEST.2007.372023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEST.2007.372023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

当第一次面对学习任务时,通常不清楚训练数据的良好表示应该是什么样子。我们经常被迫创造一些看似合理的特征集,却没有任何强烈的信心相信它们会产生卓越的学习效果。此外,我们通常不知道哪种学习方法是最好的,因此我们经常尝试多种方法,试图找到效果最好的一种。本文介绍了一种基于元胞自动机(CA)构造特征的新方法及其初步研究。我们的方法利用元胞自动机的自组织能力,通过构造最有效的特征来进行预测。我们提出并比较了CA方法和标准遗传算法(GA),后者都使用遗传规划(GP)来构造特征。在我们的初步实验研究中,我们通过在UCI机器学习存储库中合成生成的数据集和基准数据集上构建特征,展示并讨论了使用CA方法的一些有趣的特性。基于这些有趣的结果,我们总结了未来工作的方向和方向,以及CA方法在特征中的适用性的想法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Using Cellular Automata for feature construction - preliminary study
When first faced with a learning task, it is often not clear what a good representation of the training data should look like. We are often forced to create some set of features that appear plausible, without any strong confidence that they will yield superior learning. Beside, we often do not have any prior knowledge of what learning method is the best to apply, and thus often try multiple methods in an attempt to find the one that performs best. This paper describes a new method and its preliminary study for constructing features based on cellular automata (CA). Our approach uses self-organisation ability of cellular automata by constructing features being most efficient for making predictions. We present and compare the CA approach with standard genetic algorithm (GA) which both use genetic programming (GP) for constructing the features. We show and discuss some interesting properties of using CA approach in our preliminary experimental study by constructing features on synthetically generated dataset and benchmark datasets from the UCI machine learning repository. Based on the interesting results, we conclude with directions and orientation of the future work with ideas of applicability of CA approach in the feature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信