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...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Zheng, Tseng, Shian-Shyong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2013
Materias:
Research Article
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

Internet

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