Abstract
Skyline queries have caused much attention for it helps users make intelligent decisions over complex data. Unfortunately, too many or too few skyline objects are not desirable for users to choose. Practically, users may be interested in the skylines in the subspaces of numerous candidate attributes. In this paper, we address the important problem of recommending skyline objects as well as their neighbors in the arbitrary subspaces of high dimensional space. We define a new concept, subspace skyline cluster, which is a compact and meaningful structure to combine the advantages of skyline computation and data mining. Two algorithms Sorted-based Subspace Skyline Clusters Mining, and Threshold-based Subspace Skyline Clusters Mining are developed to progressively identify the skyline clusters. Our experiments show that our proposed approaches are both efficient and effective.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. In: VLDB, Hong Kong, China, pp. 275–286 (2002)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proc. of ACM Symposium on Principles of Database Systems (PODS 2001), Santa Barbara, CA (2001)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. Journal of the ACM 22, 469–476 (1975)
Preparata, P.F., Shamos, M.I.: Computational geometry: an introduction. Springer, Heidelberg (1985)
Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: IEEE Conf. on Data Engineering, Heidelberg, Germany, pp. 421–430 (2001)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient Computation of the Skyline Cube. In: International Conference on Very Large Data Bases (VLDB), Trondheim, Norway, pp. 241–252 (2005)
Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: a semantic approach based on decisive subspaces. In: Proceedings of the 31st international conference on Very large data bases, Trondheim, Norway, pp. 253–264 (2005)
Jin, W., Han, J., Ester, M.: Mining Thick Skylines over Large Databases. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 255–266. Springer, Heidelberg (2004)
Balke, W.-T., Zheng, J.X., Güntzer, U.: Approaching the Efficient Frontier: Cooperative Database Retrieval Using High-Dimensional Skylines. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, Springer, Heidelberg (2005)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with Presorting. In: Proceedings of the 19th ICDE, Bangalore, India, pp. 717–719 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, R., Lu, Y., Zou, L., Zhou, C. (2007). Progressive Subspace Skyline Clusters Mining on High Dimensional Data. In: Washio, T., et al. Emerging Technologies in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77018-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-77018-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77016-9
Online ISBN: 978-3-540-77018-3
eBook Packages: Computer ScienceComputer Science (R0)