Search Results - (( java representation using algorithm ) OR ( program solution clustering algorithm ))

An integrated model of automated elementary programming feedback using assisted and recommendation approach by Safei, Suhailan

“…Meanwhile, similar difficulty groups of the computer programs were generated using a K-Means clustering algorithm that was enhanced with ranking consideration. …”
Get full text
Get full text
Get full text

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The thesis outlines the two different implementation techniques of the existing FLEX algorithm using java based parsers and using a query language for XML. …”
Get full text
Get full text

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…For this kind of problem, researchers believe that it will be better to find an approximate solution that can be delivered by a stochastic algorithm than waiting for an exact solution from the deterministic algorithm. …”
Get full text
Get full text
Get full text

Handling Words Duplication and Memory Management for Digital Quran Based on Hexadecimal Representation and Sparse Matrix by Ashraf Al-Omoush, Norita Md Norwawi, Ahmad Akmalludin Mazlan

Linear programming approach for scheduling sports league problems in Malaysia by Ahmad Rosdi, Muhammad Ifwat

“…In order to solve the formulated LP model, we proposed several solution methods such as simplex and genetics algorithm. …”
Get full text
Get full text
Get full text

Software metrics selection model for predicting maintainability of object-oriented software using genetic algorithms by Bakar, Abubakar Diwani

“…The study proposes the use of software metric thresholds in the classification process during the GA representation. …”
Get full text
Get full text

K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

“…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
Get full text
Get full text
Get full text

A Framework for Green Energy Resources Identification and Integration Supported by Real-Time Monitoring, Control, and Automation Applications by Far Chen, Jong

“…To address these challenges, a novel Geographical Information System-based fuzzy Technique for Order Preference by Similarity to Ideal Solution coupled with filtration algorithms was proposed. …”
Get full text
Get full text
Get full text
Get full text

Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

Constrained clustering approach to aid in remodularisation of object-oriented software systems / Chong Chun Yong by Chong, Chun Yong

“…Guided by the explicit and implicit clustering constraints, sets of cohesive clusters are progressively derived to act as a high-level semantic representation of the software design. This research follows an empirical research methodology, where the proposed approach is validated using 40 object-oriented open-source software systems written in Java. …”
Get full text
Get full text

Dynamic force-directed graph with weighted nodes for scholar network visualization by Mohd. Aris, Khalid Al-Walid, Ramasamy, Chitra, Mohd Aris, Teh Noranis, Zolkepli, Maslina

“…The approach is realized by creating a web-based interface using D3 JavaScript algorithm that allows the visualization to focus on how data are connected to each other more accurately than the conventional lines of data seen in traditional data representation. …”
Get full text
Get full text

Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

“…There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). …”
Get full text
Get full text
Get full text
Get full text

4E analysis of a two-stage refrigeration system through surrogate models based on response surface methods and hybrid grey wolf optimizer by Ahmed, R., Mahadzir, S., Mota-Babiloni, A., Al-Amin, M., Usmani, A.Y., Ashraf Rana, Z., Yassin, H., Shaik, S., Hussain, F.

“…Finally, the K-means clustering technique is applied for Pareto characterization. …”
Get full text
Get full text