Search Results - ((((matching algorithm) OR (scheduling algorithm))) OR (mining algorithm))

Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan by Abdul Motok@Mohd Ridzuan, Hafeezur Syakir

“…The organizer of sports events often fronting problems such as the incorrect allocation of matches as well as tough to create a good and reliable schedule. …”
Get full text
Get full text

Automated Student Timetable Scheduling System based on Genetic Algorithm by Amirul Azuani, Romlee, Noor Ain, Rosly, Meng, Chuan Haw

“…These factors lead to several major problems identified during the enrollment period such as timetable clashing between students, continuous hours of lecture and difficulty to find a matching slot for the clashed courses. In order to solve these problems, automated timetable scheduling system based on genetic algorithm is proposed which is estimated to reduce the chances of class clashing and prevent continuous lecture time. …”
Get full text
Get full text
Get full text

Hybrid dynamic scheduling model for flexible manufacturing system with machine availability and new job arrivals by Paslar, Shahla

“…The performance of the schedules as produced by the scheduling/rescheduling algorithms were investigated and compared. …”
Get full text
Get full text

A new text-based w-distance metric to find the perfect match between words by Ali, M., Jung, L.T., Hosam, O., Wagan, A.A., Shah, R.A., Khayyat, M.

“…The k-NN algorithm is an instance-based learning algorithm which is widely used in the data mining applications. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text

A prototype for context identification of scientific papers via agent-based text mining by Mahmoud M.A., Ahmad M.S.

A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem by Teoh, Chong Keat, Haron, Habibollah, Wibowo, Antoni, Ngadiman, Mohd Salihin

“…The University Course Timetabling Problem (UCTP) such as the curriculum-based course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution.The Curriculum-Based University Course Timetabling Problem (CB-UCTP) has a high conflict-density and searching for an improved solution is not trivial.In this study, the authors propose a heuristic room matching algorithm which improves the seed of the CB-UCTP.The objective is to provide a reasonable search point to carry out any improvement phase and the results obtained indicate that the matching algorithm is able to provide very promising results as the fitness score of the solution is significantly enhanced in a very short period of time.…”
Get full text
Get full text
Get full text

Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources by Abed, Munther Hameed, Mohd Nizam Mohmad, Kahar

“…Results show that the GGA outperforms the simple genetic algorithm (SGA), but it still didn't match the results in the literature. …”
Get full text
Get full text
Get full text

Context identification of scientific papers via agent-based model for text mining (ABM-TM) by Mahmoud M.A., Ahmad M.S., Yusoff M.Z.M., Mustapha A.

“…In this paper, we propose an agent-based text mining algorithm to extract potential context of papers published in the WWW. …”

Position score weighting technique for mining web content outliers. by Mustapha, Norwati, Mustapha, Aida

“…The existing mining web content outlier methods used stemming algorithm to preprocess the web documents and leave the domain dictionary in their root words. …”
Get full text
Get full text
Get full text

Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

“…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
Get full text
Get full text
Get full text

Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text

Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

“…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

The development of integrated planning and scheduling framework for dynamic and reactive environment of complex manufacturing problem by Zakaria, Zalmiyah, Deris, Safaai, Mat Yatim, Safie, Othman, Muhamad Razib

“…Lastly, in Chapter 5, we investigate the problem of integrating new rush orders into the current schedule of a real world FMS. The aim is to introduce match up strategy with genetic algorithms (GA) that modify only part of the schedule in order to accommodate new arriving jobs.…”
Get full text
Get full text
Get full text

Automatic document clustering and indexing of multiple documents using KNMF for feature extraction through Hadoop and lucene on big data by Laxmi Lydia E., Sharmili N., Nguyen P.T., Hashim W., Maseleno A.

“…Automatic indexing; Big data; Cluster analysis; Extraction; Factorization; Indexing (of information); Information retrieval; K-means clustering; Natural language processing systems; Open source software; Open systems; Pattern matching; Software quality; Software testing; Text mining; Hadoop; Key phrase extractions; Map-reduce; Pattern-matching technique; Porters; Pre-processing algorithms; Software environments; Unlabeled; Matrix algebra…”

Improving sentiment reviews classification performance using support vector machine-fuzzy matching algorithm by Nurcahyawati, Vivine, Mustaffa, Zuriani

“…Many of these dimensionalities have a major impact on the complexity and performance of the algorithms used for classification. Various challenges were encountered, including how to determine the optimal combination of pre-processing techniques, how to clean the dataset, and determine the best classification algorithm. …”
Get full text
Get full text
Get full text

A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining by Jalali, Mehrdad

“…The approach in the offline phase is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining. …”
Get full text
Get full text

Concept Based Lattice Mining (CBLM) using Formal Concept Analysis (FCA) for text mining by Mumtazimah, Mohamad, Hassan, H., Mohd Saman, M.Y, Abdullah, Z.

“…The deployment of FCA concept lattices ensures that the matching is done based on extracted concepts; not just mere keywords matching hence producing more relevant results. …”
Get full text
Get full text

Pattern Discovery Using K-Means Algorithm by Ahmed, AM, Norwawi, NM, Ishak, WHW, Alkilany, A

“…The pattern extracted gave information on the previous matching process done by the university.…”

CONTEXT AWARE TRAFFIC SCHEDULING ALGORITHM FOR COMMUNICATION SYSTEM IN POWER DISTRIBUTION NETWORK by NURSHAZLINA SUHAIMY

“…It proves that the contextual aware ranking of each traffic are correctly matched to one another. In order to verify the advantages of the proposed algorithm, it is compared with simulation results without contextual aware algorithm. …”