An Optimized K-means with Density and Distance-Based Clustering Algorithm for Multidimensional Spatial Databases

From massive and complex spatial database, the useful information and knowledge are extracted using spatial data mining. To analyze the complexity, efficient clustering algorithm for spatial database has been used in this area of research. The geographic areas containing spatial points are discovered using clustering methods in many applications. With spatial attributes, the spatial clustering problem have been designed using many approaches, but nonoverlapping constraints are not considered. Most existing data mining algorithms suffer in high dimensions. With nonoverlapping named as Non Overlapping Constraint based Optimized K-Means with Density and Distance-based Clustering (NOC-OKMDDC),a multidimensional optimization clustering is designed to solve this problem by the proposed system and the clusters with diverse shapes and densities in spatial databases are fast found. Proposed method consists of three main phases. Using weighted convolutional Neural Networks(Weighted CNN), attributes are reduced from the multidimensional dataset in this first phase. A partition-based algorithm (K-means) used by Optimized KMeans with Density and Distance-based Clustering (OKMDD) and several relatively small spherical or ball-shaped sub clusters are made by Clustering the dataset in this second phase. The optimal sub cluster count is performed with the help of Adaptive Adjustment Factor based Glowworm Swarm Optimization algorithm (AAFGSO). Then the proposed system designed an Enhanced Penalized Spatial Distance (EPSD) Measure to satisfy the non-overlapping condition. According to the spatial attribute values, the spatial distance between two points are well adjusted to achieving the EPSD. In third phase, to merge sub clusters the proposed system utilizes the Density based clustering with relative distance scheme. In terms of adjusted rand index, rand index, mirkins index and huberts index, better performance is achieved by proposed system when compared to the existing system which is shown by experimental result.

Hierarchical and K-means Clustering in the Line Drawing Data Shape Using Procrustes Analysis

One of the problems in the clustering process is that the objects under inquiry are multivariate measures containing geometrical information that requires shape clustering. Because Procrustes is a technique to obtaining the similarity measure of two shapes, it can become the solution. Therefore, this paper tried to use Procrustes as the main process in the clustering method. Several algorithms proposed for the shape clustering process using Procrustes were namely hierarchical the goodness-of-fit of Procrustes (HGoFP), k-means the goodness-of-fit of Procrustes (KMGoFP), hierarchical ordinary Procrustes analysis (HOPA), and k-means ordinary Procrustes analysis (KMOPA). Those algorithms were evaluated using Rand index, Jaccard index, F-measure, and Purity. Data used was the line drawing dataset that consisted of 180 drawings classified into six clusters. The results showed that the HGoFP, KMGoFP, HOPA and KMOPA algorithms were good enough in Rand index, F-measure, and Purity with 0.697 as a minimum value. Meanwhile, the good clustering results in the Jaccard index were only the HGoFP, KMGoFP, and HOPA algorithms with 0.561 as a minimum value. KMGoFP has the worst result in the Jaccard index that is about 0.300. In the time complexity, the fastest algorithm is the HGoFP algorithm; the time complexity is 4.733. Based on the results, the algorithms proposed in this paper particularly deserve to be proposed as new algorithms to cluster the objects in the line drawing dataset. Then, the HGoFP is suggested clustering the objects in the dataset used.

PEMILIHAN METODE SEGMENTASI PADA CITRA ULTRASONOGRAFI OVARIUM

Penelitian ini membandingkan metode segmentasi untuk mengenali folikel pada citra ultrasonografi ovarium, metode segmentasi yang paling baik akan digunakan untuk proses perhitungan jumlah folikel. Penilaian kinerja metode segmentasi active contour dan active contour without edge dievaluasi menggunakan Probabilistic Rand Index (PRI) dan Global Consistency Error (GCE). Hasil penelitian ini menunjukkan metode segmentasi yang terbaikadalah active contour without edge karena memiliki nilai PRI lebih tinggi dan pada nilai GCE lebih rendah dari pada hasil metode segmentasi active contour.

Prediction of Tetralogy of Fallot using Fuzzy Clustering

Background: Congenital Heart Disease is one of the abnormalities in your heart's structure. To predict the tetralogy of fallot in a heart is a difficult task. Cluster is the collection of data objects, which are similar to one another within the same group and are different from the objects in the other clusters. To detect the edges, the clustering mechanism improve its accuracy by using segmentation, Colour space conversion of an image implemented in Fuzzy c-Means with Edge and Local Information. Objective: To predict the tetralogy of fallot in a heart, the clustering mechanism is used. Fuzzy c-Means with Edge and Local Information gives an accuracy to detect the edges of a fallot to identify the congential heart disease in an efficient way. Methods: One of the finest image clustering methods, called as Fuzzy c-Means with Edge and Local Information which will introduce the weights for a pixel value to increase the edge detection accuracy value. It will identify the pixel value within its local neighbor windows to improve the exactness. For evaluation , the Adjusted rand index metrics used to achieve the accurate measurement. Results: The cluster metrics Adjusted rand index and jaccard index are used to evaluate the Fuzzy c- Means with Edge and Local Information. It gives an accurate results to identify the edges. By evaluating the clustering technique, the Adjusted Rand index, jaccard index gives the accurate values of 0.2, 0.6363, and 0.8333 compared to other clustering methods. Conclusion: Tetralogy of fallot accurately identified and gives the better performance to detect the edges. And also it will be useful to identify more defects in various heart diseases in a accurate manner. Fuzzy c-Means with Edge and Local Information and Gray level Co-occurrence matrix are more promising than other Clustering Techniques.

INCREASING QUALITY OF CLASSIFYING OBJECTS USING NEW METRICS OF CLUSTERING

The article touches upon one of the main problems of machine learning - clustering objects. It has been widely used in various subject areas: marketing, sociology, psychology, etc. Clusterization algorithms, as a rule, are based on a metric that reflects the distance between objects. However, in some cases it is not practical to use the distance between objects. In certain situations, it is possible to say that one object is similar to the other, the latter being not similar to the former. The original picture and its copy may serve as an example. For such cases, a measure of object similarity is proposed in the work, which shows how many features of one object are contained in another one. A similarity matrix is built on this measure, the analysis of which allows revealing clusters of mutually similar objects. When testing the proposed clustering method, the Rand index (the proportion of correctly connected or unrelated objects) made 0.93. There has been proposed an algorithm that allows to form a set of objects absolutely different from each other. A set of objects formed in this way can later become a learning set for classifiers and increase their fidelity in recognition.