Skip to main content

Individual Skyline Subspace on User Annotated Tags

Resource type
Thesis type
(Thesis) M.Sc.
Date created
2015-06-02
Authors/Contributors
Abstract
Skyline computation is important in applications that involve multi-criteria decision making. In this thesis, we consider the following problem: given a query point, find the subspaces where the query point is in the subspace skyline. Although efficient algorithms for subspace skyline computation were developed in many existing studies, finding skyline subspaces for one certain query point is still an open problem. We develop an algorithm based on bottom-up set enumeration to compute the skyline subspace efficiently. We formulate the problem of identifying the uniqueness of a given vertex to skyline subspace queries problem on graph and proposed effective pruning methods to tackle this problem. We further conduct experiments on both real world datasets and synthetic datasets to verify the efficiency of our methods.
Document
Identifier
etd9052
Copyright statement
Copyright is held by the author.
Permissions
This thesis may be printed or downloaded for non-commercial research and scholarly purposes.
Scholarly level
Supervisor or Senior Supervisor
Thesis advisor: Pei, Jian
Member of collection
Download file Size
etd9052_JLiang.pdf 1.02 MB

Views & downloads - as of June 2023

Views: 0
Downloads: 0