Search Results - (( initial generation clustering algorithm ) OR ( java application optimisation algorithm ))

MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Herawan, Tutut, Fazley Rabbi, Khandakar

“…MaxD K-Means algorithm auto generates initial k (the desired number of cluster) without asking for input from the user. …”
Get full text
Get full text
Get full text

Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

“…Firstly, an architecture for the clustering ensemble based on incremental genetic-based algorithms is proposed consisting of two phases: (i) to produce cluster partitions as initial populations, (ii) to combine cluster partitions and to generate final clustering solution by incremental genetic based clustering ensemble learning algorithm. …”
Get full text
Get full text

Autonomous and deterministic supervised fuzzy clustering by Lim, K.M., Loo, C.K., Lim, W.S.

“…However, the main drawbacks of this approach are that the number of clusters is unknown and the initial positions of clusters are randomly generated. …”
Get full text
Get full text

Improved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Herawan, Tutut, Noraziah, Ahmad

“…This paper presents an improved version of K-means algorithm with auto-generate an initial number of clusters (k) and a new approach of defining initial Centroid for effective and efficient clustering process. …”
Get full text
Get full text
Get full text

Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi

“…MaxD K-Means algorithm auto generates initial k (the desired number of cluster) without asking for input from the user. …”
Get full text
Get full text
Get full text

Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring by Sameer, Fadhaa Othman, Abu Bakar, Mohd Rizam

“…A good clustering analysis implemented by good Initial Centres of clusters should be selected. …”
Get full text
Get full text
Get full text

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

“…Many algorithms for clustering categorical data have been proposed, in which attribute-oriented hierarchical divisive clustering algorithm Min-Min Roughness (MMR) has the highest efficiency among these algorithms with low clustering accuracy, conversely, genetic clustering algorithm Genetic-Average Normalized Mutual Information (G-ANMI) has the highest clustering accuracy among these algorithms with low clustering efficiency. …”
Get full text
Get full text

Social media mining: a genetic based multiobjective clustering approach to topic modelling by Alfred, Rayner, Loo, Yew Jie, Obit, Joe Henry, Lim, Yuto, Haviluddin, Haviluddin, Azman, Azreen

“…Although effective, the performance of the k-means clustering algorithm depends heavily on the initial centroids and the number of clusters, k. …”
Get full text
Get full text

Biological-based semi-supervised clustering algorithm to improve gene function prediction by Kasim, Shahreen, Deris, Safaai, M. Othman, Razib, Hashim, Rathiah

“…However, commonclustering algorithms do not provide a comprehensive approach that look into the three categories of annotations; biologicalprocess, molecular function, and cellular component, and were not tested with different functional annotation database formats.Furthermore, the traditional clustering algorithms use random initialization which causes inconsistent cluster generation and areunable to determine the number of clusters involved. …”
Get full text
Get full text

An initial state of design and development of intelligent knowledge discovery system for stock exchange database by Che Mat @ Mohd Shukor, Zamzarina, Khokhar, Rashid Hafeez, Md Sap, Mohd Noor

“…We divide our problem in two modules.In first module we define Fuzzy Rule Base System to determined vague information in stock exchange databases.After normalizing massive amount of data we will apply our proposed approach, Mining Frequent Patterns with Neural Networks.Future prediction (e.g., political condition, corporation factors, macro economy factors, and psychological factors of investors) perform an important rule in Stock Exchange, so in our prediction model we will be able to predict results more precisely.In second module we will generate clustering algorithm. Generally our clustering algorithm consists of two steps including training and running steps.The training step is conducted for generating the neural network knowledge based on clustering.In running step, neural network knowledge based is used for supporting the Module in order to generate learned complete data, transformed data and interesting clusters that will help to generate interesting rules.…”
Get full text
Get full text
Get full text

Social media mining: a genetic based multiobjective clustering approach to topic modelling by Rayner Alfred, Loo Yew Jie, Joe Henry Obit, Yuto Lim, Haviluddin Haviluddin, Azreen Azman

“…Although effective, the performance of the k-means clustering algorithm depends heavily on the initial centroids and the number of clusters, k. …”
Get full text
Get full text
Get full text
Get full text

An ensemble data summarization approach based on feature transformation to learning relational data by Chung, Seng Kheau

“…A genetic algorithm (GA) is also used to find the best centroids for all the clusters generated cluster centroids. …”
Get full text
Get full text
Get full text

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

“…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
Get full text
Get full text

Balancing exploration and exploitation in ACS algorithms for data clustering by Jabbar, Ayad Mohammed, Sagban, Rafid, Ku-Mahamud, Ku Ruhana

“…The ACOC performs clustering based on random initial centroids, which are generated iteratively during the algorithm run. …”
Get full text
Get full text
Get full text

A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

“…The initial clusters formation in a method are subjected to route optimization. …”
Get full text
Get full text
Get full text
Get full text

Incremental interval type-2 fuzzy clustering of data streams using single pass method by Qaiyum, S., Aziz, I., Hasan, M.H., Khan, A.I., Almalawi, A.

“…Therefore, to encounter the challenges of a large data stream environment we propose improvising IT2FCM-ACO to generate clusters incrementally. The proposed algorithm produces clusters by determining appropriate cluster centers on a certain percentage of available datasets and then the obtained cluster centroids are combined with new incoming data points to generate another set of cluster centers. …”
Get full text
Get full text

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
Get full text
Get full text
Get full text

Determining number of clusters using firefly algorithm with cluster merging for text clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…Such a scenario requires a dynamic text clustering method that operates without initial knowledge on a data collection.In this paper, a dynamic text clustering that utilizes Firefly algorithm is introduced.The proposed, aFAmerge, clustering algorithm automatically groups text documents into the appropriate number of clusters based on the behavior of firefly and cluster merging process. …”
Get full text
Get full text

A new variant of black hole algorithm based on multi population and levy flight for clustering problem by Haneen Abdul Wahab, Abdul Raheem

“…Different initial partitions can result in different final clusters. …”
Get full text
Get full text

Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

“…The preprocessing phase utilizes Canopy clustering to expedite the initial partitioning of data points, which are subsequently refined by K-means to enhance clustering performance. …”