Dimension Reduction of Health Data Clustering

by rahmatws on October 18, 2011

The current data tends to be more complex than conventional data and need dimension reduction. Dimension reduction is important in cluster analysis and creates a smaller data in volume and has the same analytical results as the original representation. A clustering process needs data reduction to obtain an efficient processing time while clustering and mitigate curse of dimensionality. This paper proposes a model for extracting multidimensional data clustering of health database. We implemented four dimension reduction techniques such as Singular Value Decomposition (SVD), Principal Component Analysis (PCA), Self Organizing Map (SOM) and FastICA. The results show that dimension reductions significantly reduce dimension and shorten processing time and also increased performance of cluster in several health datasets. (more)

{ 0 comments }

The Design of Pre-Processing Multidimensional Data Based on Component Analysis

August 5, 2011

Rahmat Widia Sembiring, Jasni Mohamad Zain Abstract Increased implementation of new databases related to multidimensional data involving techniques to support efficient query process, create opportunities for more extensive research. Pre-processing is required because of lack of data attribute values, noisy data, errors, inconsistencies or outliers and differences in coding. Several types of pre-processing based on [...]

Read the full article →

Alternative Model for Extracting Multidimensional Data Based-On Comparative Dimension Reduction

August 5, 2011

Abstract In line with the technological developments, the current data tends to be multidimensional and high dimensional, which is more complex than conventional data and need dimension reduction. Dimension reduction is important in cluster analysis and creates a new representation for the data that is smaller in volume and has the same analytical results as [...]

Read the full article →

Cluster Evaluation of Density Based Subspace Clustering

July 12, 2011

Abstract – Clustering real world data often faced with curse of dimensionality, where real world data often consist of many dimensions. Multidimensional data clustering evaluation can be done through a density-based approach. Density approaches based on the paradigm introduced by DBSCAN clustering. In this approach, density of each object neighbours with MinPoints will be calculated. [...]

Read the full article →

Assessing the Suitability of the Curriculum With Industrial Needs by Using Data Mining Techniques

November 25, 2010

Abstract – Higher education institution has made the Knowledge Management (KM) as a strategy to create value, increase the effectiveness and organizational productivity, and competitive advantage of organizations. In the environment that changed very quickly, the obsolescence of knowledge will therefore need to continue to update through the learning process.

Read the full article →

Clustering High Dimensional Data Using Subspace and Projected Clustering Algorithms

October 19, 2010

Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerates clusters of objects in all subspaces of a dataset. It tends to produce many over lapping clusters. Approach: Subspace clustering and projected clustering are research areas for clustering in high dimensional spaces. In this research we experiment three clustering oriented algorithms, PROCLUS, P3C and STATPC. Results: In general, PROCLUS performs better in terms of time of calculation and produced the least number of unclustered data while STATPC outperforms PROCLUS and P3C in the accuracy of both cluster points and relevant attributes found. Conclusions/Recommendations: In this study, we analyze in detail the properties of different data clustering method.

Read the full article →

A Comparative Agglomerative Hierarchical Method to Cluster Implemented Courses

October 17, 2010

There are many clustering methods, such as hierarchical clustering method. Most of the approaches to the clustering of variables encountered in the literature are of hierarchical type. The great majority of hierarchical approaches to the clustering of variables are of agglomerative nature. The agglomerative hierarchical approach to clustering starts with each observation as its own cluster and then continually groups the observations into increasingly larger groups. Higher Learning Institution (HLI) provides training to introduce final-year students to the real working environment. In this research will use Euclidean single linkage and complete linkage. MATLAB and HCE 3.5 software will used to train data and cluster course implemented during industrial training.

Read the full article →