20 February 2018 Application of a fast skyline computation algorithm for serendipitous searching problems
Author Affiliations +
Abstract
Skyline computation is a method of extracting interesting entries from a large population with multiple attributes. These entries, called skyline or Pareto optimal entries, are known to have extreme characteristics that cannot be found by outlier detection methods. Skyline computation is an important task for characterizing large amounts of data and selecting interesting entries with extreme features. When the population changes dynamically, the task of calculating a sequence of skyline sets is called continuous skyline computation. This task is known to be difficult to perform for the following reasons: (1) information of non-skyline entries must be stored since they may join the skyline in the future; (2) the appearance or disappearance of even a single entry can change the skyline drastically; (3) it is difficult to adopt a geometric acceleration algorithm for skyline computation tasks with high-dimensional datasets. Our new algorithm called jointed rooted-tree (JR-tree) manages entries using a rooted tree structure. JR-tree delays extend the tree to deep levels to accelerate tree construction and traversal. In this study, we presented the difficulties in extracting entries tagged with a rare label in high-dimensional space and the potential of fast skyline computation in low-latency cell identification technology.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kenichi Koizumi, Kei Hiraki, Mary Inaba, "Application of a fast skyline computation algorithm for serendipitous searching problems", Proc. SPIE 10505, High-Speed Biomedical Imaging and Spectroscopy III: Toward Big Data Instrumentation and Management, 1050514 (20 February 2018); doi: 10.1117/12.2288156; https://doi.org/10.1117/12.2288156
PROCEEDINGS
5 PAGES


SHARE
Back to Top