Extract interesting skyline points in high dimension

Fung, Gabriel Pui Cheong, Lu, Wei, Yang, Jing, Du, Xiaoyong and Zhou, Xiaofang (2010). Extract interesting skyline points in high dimension. In: Hiroyuki Kitagawa, Yoshiharu Ishikawa, Qing Li and Chiemi Watanabe, Database Systems for Advanced Applications, Proceedings, Part 2. 15th International Conference on Database Systems for Advanced Applications (DASFAA 2010), Tsukuba, Japan, (94-108). 1-4 April 2010. doi:10.1007/978-3-642-12098-5

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
uq207381_combined_full_record.pdf HERDC combined - Not publicly available application/pdf 472.49KB 10

Author Fung, Gabriel Pui Cheong
Lu, Wei
Yang, Jing
Du, Xiaoyong
Zhou, Xiaofang
Title of paper Extract interesting skyline points in high dimension
Conference name 15th International Conference on Database Systems for Advanced Applications (DASFAA 2010)
Conference location Tsukuba, Japan
Conference dates 1-4 April 2010
Proceedings title Database Systems for Advanced Applications, Proceedings, Part 2   Check publisher's open access policy
Journal name Lecture Notes in Computer Science   Check publisher's open access policy
Place of Publication Berlin, Germany
Publisher Springer-Verlag
Publication Year 2010
Sub-type Fully published paper
DOI 10.1007/978-3-642-12098-5
Open Access Status
ISBN 9783642120978
ISSN 0302-9743
Editor Hiroyuki Kitagawa
Yoshiharu Ishikawa
Qing Li
Chiemi Watanabe
Volume 5982
Start page 94
End page 108
Total pages 14
Collection year 2011
Language eng
Formatted Abstract/Summary
When the dimensionality of dataset increases slightly, the number of skyline points increases dramatically as it is usually unlikely for a point to perform equally good in all dimensions. When the dimensionality is very high, almost all points are skyline points. Extract interesting skyline points in high dimensional space automatically is therefore necessary. From our experiences, in order to decide whether a point is an interesting one or not, we seldom base our decision on only comparing two points pairwisely (as in the situation of skyline identification) but further study how good a point can perform in each dimension. For example, in scholarship assignment problem, the students who are selected for scholarships should never be those who simply perform better than the weakest subjects of some other students (as in the situation of skyline). We should select students whose performance on some subjects are better than a reasonable number of students. In the extreme case, even though a student performs outstanding in just one subject, we may still give her scholarship if she can demonstrate she is extraordinary in that area. In this paper, we formalize this idea and propose a novel concept called k-dominate p-core skyline (Ck p). Ck p is a subset of skyline. In order to identify Ck p efficiently, we propose an effective tree structure called Linked Multiple B’-tree (LMB). With LMB, we can identify Ck p within a few seconds from a dataset containing 100,000 points and 15 dimensions.
Subjects E1
0906 Electrical and Electronic Engineering
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Sun, 11 Jul 2010, 00:06:04 EST