Search Results - (( java implementation modified algorithm ) OR ( using while clustering algorithm ))

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

“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text

MGR: An Information Theory Based Hierarchical Divisive Clustering Algorithm for Categorical Data by Hongwu, Qin, Ma, Xiuqin, Herawan, Tutut, Jasni, Mohamad Zain

“…While many algorithms for clustering categorical data have been proposed, some have low clustering accuracy while others have high computational complexity. …”
Get full text
Get full text
Get full text

An adaptive density-based method for clustering evolving data streams / Amineh Amini by Amini, Amineh

“…This study proposes a density-based algorithm for clustering evolving data streams. The proposed method, which is called MuDi-Stream (Multi Density clustering algorithm for evolving data Stream), is an online-offline algorithm with four main components. …”
Get full text
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”

Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

“…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
Get full text
Get full text
Get full text
Get full text

The new efficient and accurate attribute-oriented clustering algorithms for categorical data by Qin, Hongwu

“…MGR can be run with or without specifying the number of clusters while few existing clustering algorithms for categorical data can be run without specifying the number of clusters. …”
Get full text
Get full text

A novel hierarchical clustering algorithm for the analysis of 3D anthropometric data of the human head by Ellena, Thierry, Subic, Aleksandar, Mustafaa, Helmy, Yen, Pang Toh

“…In recent years, the use of 3D anthropometry for product design has become more appealing because of advances in mesh parameterisation, multivariate analyses and clustering algorithms. …”
Get full text
Get full text

Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

“…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
Get full text
Get full text

Cluster optimization in VANET using MFO algorithm and K-Means clustering by Ramlee, Sham Rizal, Hasan, Sazlinah, K. Subramaniam, Shamala

“…Overall, the MFO Algorithm and K-Means algorithm can be used in combination to optimize the clustering in VANET, leading to better network performance, more reliable communication, and improved efficiency.…”
Get full text
Get full text

Determining the preprocessing clustering algorithm in radial basis function neural network by S.L. Ang, H.C. Ong, H.C. Law

“…Three types of method used in this study to find the centres include random selections, K-means clustering algorithm and also K-median clustering algorithm. …”
Get full text
Get full text

A novel clustering based genetic algorithm for route optimization by Aibinu, Abiodun Musa, Salau, Habeeb Bello, Najeeb, Athaur Rahman, Nwohu, Mark Ndubuka, Akachukwu, Chichebe

“…It was also observed that the introduction of clustering based selection algorithm guaranteed the selection of cluster with the optimal solution in every generation. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Clustering High Dimensional Data Using Subspace And Projected Clustering Algorithms by Sembiring, Rahmat Widia, Jasni, Mohamad Zain, Abdullah, Embong

Get full text
Get full text
Get full text

Modified archive update mechanism of multi-objective particle swarm optimization in fuzzy classification and clustering by Rashed, Alwatben Batoul

“…Moreover, interpretability also recorded better results on testing problems, where most of the number of rules were fewer than 33. A clustering algorithm based on MOPSO-CD with a modified archive update mechanism (MCPSO-CD) was used to estimate the optimal number of clusters. …”
Get full text
Get full text

Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

“…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
Get full text
Get full text

GF-CLUST: A nature-inspired algorithm for automatic text clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…Text clustering is a task of grouping similar documents into a cluster while assigning the dissimilar ones in other clusters.A well-known clustering method which is the K-means algorithm is extensively employed in many disciplines.However, there is a big challenge to determine the number of clusters using K-means. …”
Get full text
Get full text
Get full text

Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman by Seman, Ali

“…Six Y-STR data sets were used as a benchmark to evaluate the performances of the algorithm against the other eight partitional clustering algorithms. …”
Get full text
Get full text

Expectation maximization clustering algorithm for user modeling in web usage mining system by Mustapha, Norwati, Jalali, Manijeh, Jalali, Mehrdad

“…The experimental results represent that by decreasing the number of clusters, the log likelihood converges toward lower values and probability of the largest cluster will be decreased while the number of the clusters increases in each treatment. …”
Get full text
Get full text

Adaptive grid-meshed-buffer clustering algorithm for outlier detection in evolving data stream by Abdulateef, Alaa Fareed

“…The AGMB algorithm is built upon three algorithms: 1) Grid-Multi-Buffer Stream Clustering (GMBSC), 2) Cautious Grid-Multi-Buffer Stream Clustering (C-GMBSC) and 3) Adaptive-Grid-Multi-Buffer Stream Clustering (A-GMBSC). …”
Get full text
Get full text
Get full text
Get full text

Density based subspace clustering: a case study on perception of the required skill by Rahmat Widia, Sembiring

“…Each dimension will be tested to investigate whether having a relationship with the data on another cluster, using proposed subspace clustering algorithms. …”
Get full text
Get full text

Density subspace clustering: a case study on perception of the required skill by Sembiring, Rahmat Widia

“…Each dimension will be tested to investigate whether having a relationship with the data on another cluster, using proposed subspace clustering algorithms. …”
Get full text
Get full text