Applications of Autonomous Data Partitioning

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

Abstract

In this chapter, the algorithm summaries of both, the offline and evolving versions of the proposed autonomous data partitioning (ADP) algorithm described in chapter 7 are provided. Numerical examples based on well-known benchmark datasets are presented for evaluating the performance of the ADP algorithm on data partitioning. Furthermore, numerical examples on semi-supervised classification are also conducted as a potential application of the ADP algorithm. The state-of-the-art approaches are used for comparison. Numerical experiments demonstrate that the ADP algorithm is able to perform high quality data partitioning results in a highly efficient, objective manner. The ADP algorithm can also be used for classification even when there is very little supervision available. The pseudo-code of the main procedure of the ADP algorithm and the MATLAB implementations can be found in appendices B.2 and C.2, respectively.

Cite

CITATION STYLE

APA

Angelov, P. P., & Gu, X. (2019). Applications of Autonomous Data Partitioning. In Studies in Computational Intelligence (Vol. 800, pp. 261–276). Springer Verlag. https://doi.org/10.1007/978-3-030-02384-3_11

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