Rough set based computation times estimation on knowledge grid

Authors:
Kun Gao;Youquan Ji;Meiqun Liu;Jiaxun Chen
Affiliations:
Information Science and Technology College, Donghua University, P.R.C;Geo-Exploration Science and Technology College, Jilin University, P.R.C;Administration of Radio Film and Television of Jilin Province, P.R.C;Information Science and Technology College, Donghua University, P.R.C
Venue:
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Year:
2005

Citing 7
Cited 11

Knowledge discovery in databases: an attribute-oriented rough set approach

Knowledge discovery in databases: an attribute-oriented rough set approach
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Predicting Queue Times on Space-Sharing Parallel Computers

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Historical Application Profiler for Use by Parallel Schedulers

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Predicting Application Run Times Using Historical Information

IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance

IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Scheduling High Performance Data Mining Tasks on a Data Grid Environment

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

A Uniform Parallel Optimization Method for Knowledge Discovery Grid

KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
A novel architecture for data mining grid scheduler

WSEAS TRANSACTIONS on SYSTEMS
Solving terminal allocation problem using simulated annealing arithmetic

WSEAS TRANSACTIONS on SYSTEMS
A new simulated annealing algorithm for terminal allocation

CISST'09 Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications
A sampling-based scheduling method for distributed computing

CISST'09 Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications
High efficient scheduling mechanism for distributed knowledge discovery platform

WSEAS Transactions on Information Science and Applications
A sampling-based method for dynamic scheduling in distributed data mining environment

WSEAS Transactions on Computers
A uniform parallel optimization method for data mining grid

First International Workshop on Artificial Intelligence in Grid Computing
A parallel optimization framework in grid environment

SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Sampling-based tasks scheduling in dynamic grid environment

SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Workflow-based tasks scheduling on grid

SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient estimating the application computation times of data mining is a key component of successful scheduling on Knowledge Grid. In this paper, we present a holistic approach to estimation that uses rough sets theory to determine a reduct and then compute a runtime estimate. The heuristic reduct algorithm is based on frequencies of attributes appeared in discernibility matrix. We also present to add dynamic information about the performances of various data mining tools over specific data sources to the Knowledge Grid service for supporting the estimation. This information can be added as additional metadata stored in Knowledge Metadata Repository of Grid. Experimental result validates our solution that rough sets provide a formal framework for the problem of application run times estimation in Grid environment.