Predicting grid performance based on novel reduct algorithm

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Because of the irregular characteristic of Grid environment, we are unable to predict the performance using the traditional method. In this paper, we propose a novel method for predicting the performance in Grid Computing environment. The method, based on frequencies of application attributes appeared in discernibility matrix collected during a period of time; predict the applications performance that the traditional methods can't obtain. We use the novel method in Data Ming Grid and obtain better result than traditional methods. The results of the experiment show that the use of reduct algorithm can process uncertain problem in Data Mining Grid. The theoretical foundation of ruduct provides a feasible solution to the problem of predicting Data Mining Grid. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gao, K. (2008). Predicting grid performance based on novel reduct algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5178 LNAI, pp. 289–296). Springer Verlag. https://doi.org/10.1007/978-3-540-85565-1_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free