Ensemble clustering based dimensional reduction

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Distance metric over a given space of data should reflect the precise comparison among objects. The Euclidean distance of data points represented by a large number of features is not capturing the actual relationship between those points. However, objects of similar cluster both often have some common attributes despite the fact that their geometrical distance could be somewhat large. In this study, we proposed a new method that replaced the given data space to categorical space based on ensemble clustering (EC). The EC space is defined by tracking the membership of the points over multiple runs of clustering algorithms. To assess our suggested method, it was integrated within the framework of the Decision Trees, K Nearest Neighbors, and the Random Forest classifiers. The results obtained by applying EC on 10 datasets confirmed that our hypotheses embedding the EC space as a distance metric, would improve the performance and reduce the feature space dramatically.

Cite

CITATION STYLE

APA

Abddallah, L., & Yousef, M. (2018). Ensemble clustering based dimensional reduction. In Communications in Computer and Information Science (Vol. 903, pp. 115–125). Springer Verlag. https://doi.org/10.1007/978-3-319-99133-7_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free