Machine Learning in Sensory Analysis of Mead-A Case Study: Ensembles of Classifiers

机器学习在米德酒感官分析中的应用——案例研究:分类器集成

阅读:2

Abstract

The aim was to explore using machine learning (including cluster mapping and k-means methods) to classify types of mead based on sensory analysis and aromatic compounds. Machine learning is a modern tool that helps with detailed analysis, especially because verifying aromatic compounds is challenging. In the first stage, a cluster map analysis was conducted, allowing for the exploratory identification of the most characteristic features of mead. Based on this, k-means clustering was performed to evaluate how well the identified sensory features align with logically consistent groups of observations. In the next stage, experiments were carried out to classify the type of mead using algorithms such as Random Forest (RF), adaptive boosting (AdaBoost), Bootstrap aggregation (Bagging), K-Nearest Neighbors (KNN), and Decision Tree (DT). The analysis revealed that the RF and KNN algorithms were the most effective in classifying mead based on sensory characteristics, achieving the highest accuracy. In contrast, the AdaBoost algorithm consistently produced the lowest accuracy results. However, the Decision Tree algorithm achieved the highest accuracy value (0.909), demonstrating its potential for precise classification based on aroma characteristics. The error matrix analysis also indicated that acacia mead was easier for the algorithms to identify than tilia or buckwheat mead. The results show the potential of combining an exploratory approach (cluster map with the k-means method) with machine learning. It is also important to focus on selecting and optimizing classification models used in practice because, as the results so far indicate, choosing the right algorithm greatly affects the success of mead identification.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。