Please use this identifier to cite or link to this item:
|Title:||Discovering strong skyline points in high dimensional spaces||Authors:||Zhang, Z.
|Keywords:||High Dimensional Space
|Issue Date:||2005||Citation:||Zhang, Z.,Guo, X.,Lu, H.,Tung, A.K.H.,Wang, N. (2005). Discovering strong skyline points in high dimensional spaces. International Conference on Information and Knowledge Management, Proceedings : 247-248. ScholarBank@NUS Repository.||Abstract:||Current interests in skyline computation arise due to their relation to preference queries. Since it is guaraneed that a skyline point will not lose out in all dimensions when compared to any other point in the data set, this means that for each skyline point, there exists a set of weight assignments to the dimensions such that the point will become the top user preference. We believe that the usefulness of skyline points is not limited to such application and can be extended to data analysis and knowledge discovery as well. However, since the skyline of high dimensional datasets (which are common in data analysis applications) can contain too many points, various means must be developed to filter off the less interesting skyline points in high dimensions. In this paper, we will propose algorithms to find a set of interesting skyline points called strong skyline points. Extensive experiments show that our proposal is both effective and efficient.||Source Title:||International Conference on Information and Knowledge Management, Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/40676||ISBN:||1595931406|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 19, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.