A clustering density-based sample reduction method

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

Abstract

In this paper, we propose a new cluster-based sample reduction method which is unsupervised, geometric, and density-based. The original data is initially divided into clusters, and each cluster is divided into "portions" defined as the areas between two concentric circles. Then, using the proposed geometric-based formulas, the membership value of each sample belonging to a specific portion is calculated. Samples are then selected from the original data according to the corresponding calculated membership value. We conduct various experiments on the NSL-KDD and KDDCup99 datasets. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Mohammadi, M., Raahemi, B., & Akbari, A. (2014). A clustering density-based sample reduction method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8436 LNAI, pp. 319–325). Springer Verlag. https://doi.org/10.1007/978-3-319-06483-3_32

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