In this paper,we propose a Rough Set assisted Meta-Learning method on how to select the most-suited machine-learning algorithms with minimal effort for a new given dataset. A k-Nearest Neighbor (k-NN) algorithm is use...In this paper,we propose a Rough Set assisted Meta-Learning method on how to select the most-suited machine-learning algorithms with minimal effort for a new given dataset. A k-Nearest Neighbor (k-NN) algorithm is used to recognize the most similar datasets that have been performed by all of the candidate algorithms.By matching the most similar datasets we found,the corresponding performance of the candidate algorithms is used to generate recommendation to the user.The performance derives from a multi-criteria evaluation measure-ARR,which contains both accuracy and time.Furthermore,after applying Rough Set theory,we can find the redundant properties of the dataset.Thus,we can speed up the ranking process and increase the accuracy by using the reduct of the meta attributes.展开更多
文摘In this paper,we propose a Rough Set assisted Meta-Learning method on how to select the most-suited machine-learning algorithms with minimal effort for a new given dataset. A k-Nearest Neighbor (k-NN) algorithm is used to recognize the most similar datasets that have been performed by all of the candidate algorithms.By matching the most similar datasets we found,the corresponding performance of the candidate algorithms is used to generate recommendation to the user.The performance derives from a multi-criteria evaluation measure-ARR,which contains both accuracy and time.Furthermore,after applying Rough Set theory,we can find the redundant properties of the dataset.Thus,we can speed up the ranking process and increase the accuracy by using the reduct of the meta attributes.
