Incremental Hypersphere Classifier (IHC)

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

Abstract

In the previous chapters we have presented batch learning algorithms, which are designed under the assumptions that data is static and its volume is small (and manageable). Faced with a myriad of high-throughput data usually presenting uncertainty, high dimensionality and large complexity, the batch methods are no longer useful. Using a different approach, incremental algorithms are designed to rapidly update their models to incorporate new information on a sampleby- sample basis. In this chapter we present a novel incremental instance-based learning algorithm, which presents good properties in terms of multi-class support, complexity, scalability and interpretability. The Incremental Hypersphere Classifier (IHC) is tested in well-known benchmarks yielding good classification performance results. Additionally, it can be used as an instance selection method since it preserves class boundary samples.

Cite

CITATION STYLE

APA

Lopes, N., & Ribeiro, B. (2015). Incremental Hypersphere Classifier (IHC). In Studies in Big Data (Vol. 7, pp. 107–123). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-06938-8_6

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