Ensemble Methods in Environmental Data Mining

Goksu Tuysuzoglu, Derya Birant, A. Pala
{"title":"Ensemble Methods in Environmental Data Mining","authors":"Goksu Tuysuzoglu, Derya Birant, A. Pala","doi":"10.5772/INTECHOPEN.74393","DOIUrl":null,"url":null,"abstract":"Environmental data mining is the nontrivial process of identifying valid, novel, and potentially useful patterns in data from environmental sciences. This chapter proposes ensemble methods in environmental data mining that combines the outputs from multiple classification models to obtain better results than the outputs that could be obtained by an individual model. The study presented in this chapter focuses on several ensemble strategies in addition to the standard single classifiers such as decision tree, naive Bayes, support vector machine, and k-nearest neighbor (KNN), popularly used in literature. This is the first study that compares four ensemble strategies for envi ronmental data mining: (i) bagging , (ii) bagging combined with random feature subset selection (the random forest algorithm), (iii) boosting (the AdaBoost algorithm), and (iv) voting of different algorithms. In the experimental studies, ensemble methods are tested on different real-world environmental datasets in various subjects such as air, ecology, rainfall, and soil. methods are majority voting, performance weighting, Bayesian combination, and vogging. Meta-learning methods learn from new training data created from the predictions of a set of base classifiers. The most well-known meta-learning methods are stacking strategies for environmental data mining: (i) bagging, (ii) bagging combined with random feature subset selection, (iii) boosting, and (iv) voting. In the experimental studies, ensemble methods are tested on different real-world environmental datasets.","PeriodicalId":91437,"journal":{"name":"Advances in data mining. Industrial Conference on Data Mining","volume":"42 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in data mining. Industrial Conference on Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5772/INTECHOPEN.74393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Environmental data mining is the nontrivial process of identifying valid, novel, and potentially useful patterns in data from environmental sciences. This chapter proposes ensemble methods in environmental data mining that combines the outputs from multiple classification models to obtain better results than the outputs that could be obtained by an individual model. The study presented in this chapter focuses on several ensemble strategies in addition to the standard single classifiers such as decision tree, naive Bayes, support vector machine, and k-nearest neighbor (KNN), popularly used in literature. This is the first study that compares four ensemble strategies for envi ronmental data mining: (i) bagging , (ii) bagging combined with random feature subset selection (the random forest algorithm), (iii) boosting (the AdaBoost algorithm), and (iv) voting of different algorithms. In the experimental studies, ensemble methods are tested on different real-world environmental datasets in various subjects such as air, ecology, rainfall, and soil. methods are majority voting, performance weighting, Bayesian combination, and vogging. Meta-learning methods learn from new training data created from the predictions of a set of base classifiers. The most well-known meta-learning methods are stacking strategies for environmental data mining: (i) bagging, (ii) bagging combined with random feature subset selection, (iii) boosting, and (iv) voting. In the experimental studies, ensemble methods are tested on different real-world environmental datasets.
环境数据挖掘中的集成方法
环境数据挖掘是在环境科学数据中识别有效、新颖和潜在有用模式的重要过程。本章提出了环境数据挖掘中的集成方法,该方法将多个分类模型的输出组合在一起,以获得比单个模型更好的结果。除了文献中常用的标准单一分类器,如决策树、朴素贝叶斯、支持向量机和k近邻(KNN),本章中提出的研究重点是几种集成策略。这是第一个比较环境数据挖掘的四种集成策略的研究:(i) bagging, (ii) bagging与随机特征子集选择相结合(随机森林算法),(iii) boosting (AdaBoost算法),以及(iv)不同算法的投票。在实验研究中,集合方法在不同的现实世界环境数据集上进行了测试,这些数据集包括空气、生态、降雨和土壤。方法有多数投票法、性能加权法、贝叶斯组合法和vogging法。元学习方法从一组基本分类器的预测中创建的新训练数据中学习。最著名的元学习方法是环境数据挖掘的堆叠策略:(i)套袋,(ii)套袋与随机特征子集选择相结合,(iii)提升,(iv)投票。在实验研究中,集成方法在不同的真实环境数据集上进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信