Search Results - (( its application mining algorithm ) OR ( job application ((max algorithm) OR (bee algorithm)) ))*
Search alternatives:
- application mining »
- mining algorithm »
- its application »
- job application »
- max algorithm »
- bee algorithm »
-
1
Multi objective bee colony optimization framework for grid job scheduling
Published 2013“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
2
-
3
Bee foraging behaviour techniques for grid scheduling problem
Published 2013“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
Get full text
Get full text
Get full text
Article -
4
Ant colony algorithm for job scheduling in grid computing
Published 2010Get full text
Get full text
Get full text
Conference or Workshop Item -
5
-
6
An optimal tasks scheduling algorithm based on QoS in cloud computing network
Published 2017“…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. Our proposed algorithm isolates the resources into two different groups where the first group contains the resources with maximum execution time while the second group contains the resources with minimum execution time. …”
Get full text
Get full text
Thesis -
7
Modifying iEclat algorithm for infrequent patterns mining
Published 2018“…Pattern ruining has been extensively studied in research due to its successful application in several data mining scenarios. …”
Get full text
Get full text
Conference or Workshop Item -
8
Enhanced ant colony optimization for grid resource scheduling
Published 2010Get full text
Get full text
Conference or Workshop Item -
9
-
10
Modifying iEclat algo ithm for infrequent patterns mining
Published 2018“…Pattern ruining has been extensively studied in research due to its successful application in several data mining scenarios. …”
Get full text
Get full text
Conference or Workshop Item -
11
A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
Published 2023“…In this thesis, first a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs get access to the required resources at optimal times. …”
Get full text
Get full text
Thesis -
12
-
13
Efficient prime-based method for interactive mining of frequent patterns.
Published 2011“…Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. …”
Get full text
Get full text
Article -
14
Web Usage Mining Using GSP Algorithm: A Study on Sultanah Bahiyah Library Online Databases
Published 2008“…Application of data mining to the World Wide Web referred as Web mining is at the cross road of research from several research communities which can be divided into three branches: Web Content Mining, Web Structure Mining and Web Usage Mining. …”
Get full text
Get full text
Get full text
Thesis -
15
-
16
-
17
Prime-based method for interactive mining of frequent patterns
Published 2010“…Moreover, this study introduces a mining algorithm called PC-miner to mine the mining model frequently with various values of minsup. …”
Get full text
Get full text
Thesis -
18
Data Classification and Its Application in Credit Card Approval
Published 2004“…The result of this application using the sample credit card approval dataset includes a decision tree, a set of rules derived from the decision tree and its accuracy. …”
Get full text
Get full text
Final Year Project -
19
-
20
Combining object-based classification and data mining algorithm to classify urban surface materials from worldview-2 satellite image
Published 2014Get full text
Conference or Workshop Item