Cargando…
Knee Point Search Using Cascading Top-k Sorting with Minimized Time Complexity
Anomaly detection systems and many other applications are frequently confronted with the problem of finding the largest knee point in the sorted curve for a set of unsorted points. This paper proposes an efficient knee point search algorithm with minimized time complexity using the cascading top-k s...
Autores principales: | Wang, Zheng, Tseng, Shian-Shyong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3771435/ https://www.ncbi.nlm.nih.gov/pubmed/24068888 http://dx.doi.org/10.1155/2013/960348 |
Ejemplares similares
-
Where to search top-K biomedical ontologies?
por: Oliveira, Daniela, et al.
Publicado: (2018) -
Spike sorting based on shape, phase, and distribution features, and K-TOPS clustering with validity and error indices
por: Caro-Martín, Carmen Rocío, et al.
Publicado: (2018) -
Searches for vector-like quarks with top quarks
por: Tseng, Jeffrey
Publicado: (2016) -
Search and insight processes in card sorting games
por: Öllinger, Michael, et al.
Publicado: (2023) -
Protein sorting in the Golgi complex
por: Füllekrug, Joachim, et al.
Publicado: (1998)