Name
Abstract | ||
|---|---|---|
Skyline, aiming at finding a Pareto optimal subset of points in a multi-dimensional dataset, has gained great interest due to its extensive use for multi-criteria analysis and decision making. Skyline consists of all points that are not dominated by, or not worse than other points. It is a candidate set of optimal solution, which depends on a specific evaluation criterion for optimum. However, conventional skyline queries, which return individual points, are inadequate in group querying case since optimal combinations are required. To address this gap, we study the skyline computation in group case and propose fast methods to find the group-based skyline (G-skyline), which contains Pareto optimal groups. For computing the front k skyline layers, we lay out an efficient approach that does the search concurrently on each dimension and investigates each point in subspace. After that, we present a novel structure to construct the G-skyline with a queue of combinations of the first-layer points. Experimental results show that our algorithms are several orders of magnitude faster than the previous work.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3132847.3132950 | CIKM |
Keywords | Field | DocType |
Group skyline, multiple skyline layers, concurrent search, subspace skyline, combination queue | Skyline,Data mining,Subspace topology,Computer science,Queue,Algorithm,Pareto optimal,Skyline computation | Conference |
ISBN | Citations | PageRank |
978-1-4503-4918-5 | 5 | 0.41 |
References | Authors | |
17 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhui Yu | 1 | 18 | 2.98 |
| Zheng Qin | 2 | 471 | 57.29 |
| Jinfei Liu | 3 | 91 | 11.12 |
| Li Xiong | 4 | 2335 | 142.42 |
| Xu Chen | 5 | 361 | 24.88 |
| Huidi Zhang | 6 | 21 | 2.00 |