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...
Saved in:
Main Authors: | Zheng Wang, Shian-Shyong Tseng |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/960348 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Rotation-Invariant Convolution With Point Sort and Curvature Radius for Point Cloud Classification and Segmentation
by: Zhao Shen, et al.
Published: (2025-01-01) -
‘A sort of breviary’: Arthur Symons, J. K. Huysmans and British Decadence
by: Matthew Creasy
Published: (2019-12-01) -
Semantic-Aware Top-k Multirequest Optimal Route
by: Shuang Wang, et al.
Published: (2019-01-01) -
SA Sorting: A Novel Sorting Technique for Large-Scale Data
by: Mohammad Shabaz, et al.
Published: (2019-01-01) -
Cascadable Current-Mode First-Order All-Pass Filter Based on Minimal Components
by: Jitendra Mohan, et al.
Published: (2013-01-01)