2022
DOI: 10.46338/ijetae0722_03
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of the Performance of Several Regression Algorithms in Predicting the Quality of White Wine in WEKA

Abstract: The goal of the study was to examine the efficacy of multiple regression algorithms in predicting white wine quality. The white wine dataset from the UCI Machine Learning Repository was used. The Waikato Environment for Knowledge Analysis uses and implements regression methods. The correlation coefficient reveals that the result of performance is that the According to the results of the experiment, the Random Forest (r = 0.7459) ranked first, followed by k-Nearest Neighbor (r = 0.6225), Decision Tree (r= 0.550… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(3 citation statements)
references
References 11 publications
0
1
0
Order By: Relevance
“…The K-means algorithm (Sharma et al, 2012) is applied, using Manhattan distances, available in WEKA software, which is the sum of the absolute differences between points in all dimensions (Kubat, 2017). In this regard, the K-means algorithm performs the following steps: (i) K points are located in space representing the objects to be grouped.…”
Section: Methodsmentioning
confidence: 99%
“…The K-means algorithm (Sharma et al, 2012) is applied, using Manhattan distances, available in WEKA software, which is the sum of the absolute differences between points in all dimensions (Kubat, 2017). In this regard, the K-means algorithm performs the following steps: (i) K points are located in space representing the objects to be grouped.…”
Section: Methodsmentioning
confidence: 99%
“…Farthest-point heuristicbased method has the time complexity of O(nk), where n denotes the number of data objects in the dataset and k represent the number of desired clusters. The farthest-point clustering technique is particularly suitable and fast for data mining applications in large scale (Sharma, Bajpai, & Litoriya, 2012).…”
Section: 3mentioning
confidence: 99%
“…The goal is that objects in a group are similar (or related) to each other and different (or unrelated) from objects in other groups. The greater the similarity within a group and the greater the disparity between groups, the better the clustering [26]. However, K-means is the essential and fundamental technique through which data centres are analysed.…”
Section: Introductionmentioning
confidence: 99%