A Bootstrap Aggregating Technique on Link-Based Cluster Ensemble Approach for Categorical Data Clustering
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 10, Issue 8
Abstract
Although attempts have been made to solve the problem of clustering categorical data via cluster ensembles, with the results being competitive to conventional algorithms, it is observed that these techniques unfortunately generate a final data partition based on incomplete information. The underlying ensemble-information matrix presents only cluster-data point relations, with many entries being left unknown. The paper presents an analysis that suggests this problem degrades the quality of the clustering result, and it presents a BSA (Bootstrap Aggregation) is a machine learning ensemble meta-algorithm designed to improve the stability and accuracy along with a new link-based approach, which improves the conventional matrix by discovering unknown entries through similarity between clusters in an ensemble. In particular, an efficient BSA and link-based algorithm is proposed for the underlying similarity assessment. Afterward, to obtain the final clustering result, a graph partitioning technique is applied to a weighted bipartite graph that is formulated from the refined matrix. Experimental results on multiple real data sets suggest that the proposed link-based method almost always outperforms both conventional clustering algorithms for categorical data and well-known cluster ensemble techniques.
Authors and Affiliations
S Pavan Kumar Reddy, U Sesadri
Keywords
Related Articles
- EP ID EP650241
- DOI 10.24297/ijct.v10i8.1468
- Views 95
- Downloads 0
Application Of Signed Graph In Decision Making
A signed graph may be defined as an ordered pair (G, σ) where G= (V, E) is the graph and σ is a function called signature or sign mapping from E to the sign group {+, -}. People or friends are considered as the vertice...
Factors Affecting the Segmentation of the Heart Ventricles in Short Axis Cardiac Perfusion MRI Images
Cardiovascular diseases (CVDs) cause 31% of the death rate globally. Automatic accurate segmentation is needed for CVDs early detection. In this paper, we study the effect of the registration and initialization of the le...
SIMULATED ANNEALING ALGORITHM FOR FEATURE SELECTION
In the process of physical annealing, a solid is heated until all particles randomly arrange themselves forming the liquid state. A slow cooling process is then used to crystallize the liquid. This process is known as si...
RANKING of the E-TRUST FACTORS in ELECTRONIC TRANSACTIONS in the CONTEXT of B2C E-COMMERCE (from the consumers point of view and by using Friedmans ranking method)
Today, a considerable amount of commercial transactions have appertained to the electronic transactions and electronic markets, aside from or versus the traditional markets, have attracted and collected a large number of...
A New Method on Data Clustering Based on Hybrid K-Harmonic Means and Imperialist Competitive Algorithm
Data clustering is one of the commonest data mining techniques. The K-means algorithm is one of the most wellknown clustering algorithms thatare increasingly popular due to the simplicity of implementation and speed of o...