Cargando…
Fast prototype selection algorithm based on adjacent neighbourhood and boundary approximation
The unceasing increase of data quantity severely limits the wide application of mature classification algorithms due to the unacceptable execution time and the insufficient memory. How to fast incrementally obtain high decision reference set and adapt to incremental data environment is urgently need...
Autores principales: | Li, Juan, Dai, Cai |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9684154/ https://www.ncbi.nlm.nih.gov/pubmed/36418375 http://dx.doi.org/10.1038/s41598-022-23036-9 |
Ejemplares similares
-
Fast algorithms for approximate circular string matching
por: Barton, Carl, et al.
Publicado: (2014) -
Approximate boundary conditions in electromagnetics
por: Senior, TBA, et al.
Publicado: (1994) -
Experimental study of bubble dynamics in the neighbourhood of a vertical incomplete boundary
por: Cui, Jie, et al.
Publicado: (2021) -
Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns
por: Meyer, Fernando, et al.
Publicado: (2013) -
Neighbourhood fast food exposure and consumption: the mediating role of neighbourhood social norms
por: van Rongen, Sofie, et al.
Publicado: (2020)