Efficient Computation of Top-K Skyline Objects in Data Set With Uncertain Preferences
Nitesh Sukhwani,
Venkateswara Rao Kagita,
Vikas Kumar and
Sanjaya Kumar Panda
Additional contact information
Nitesh Sukhwani: Central University of Rajasthan, India
Venkateswara Rao Kagita: National Institute of Technology, Warangal, India
Vikas Kumar: University of Delhi, India & Central University of Rajasthan, India
Sanjaya Kumar Panda: National Institute of Technology, Warangal, India
International Journal of Data Warehousing and Mining (IJDWM), 2021, vol. 17, issue 3, 68-80
Abstract:
Skyline recommendation with uncertain preferences has drawn AI researchers' attention in recent years due to its wide range of applications. The naive approach of skyline recommendation computes the skyline probability of all objects and ranks them accordingly. However, in many applications, the interest is in determining top-k objects rather than their ranking. The most efficient algorithm to determine an object's skyline probability employs the concepts of zero-contributing set and prefix-based k-level absorption. The authors show that the performance of these methods highly depends on the arrangement of objects in the database. In this paper, the authors propose a method for determining top-k skyline objects without computing the skyline probability of all the objects. They also propose and analyze different methods of ordering the objects in the database. Finally, they empirically show the efficacy of the proposed approaches on several synthetic and real-world data sets.
Date: 2021
References: Add references at CitEc
Citations:
Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJDWM.2021070104 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:igg:jdwm00:v:17:y:2021:i:3:p:68-80
Access Statistics for this article
International Journal of Data Warehousing and Mining (IJDWM) is currently edited by Eric Pardede
More articles in International Journal of Data Warehousing and Mining (IJDWM) from IGI Global
Bibliographic data for series maintained by Journal Editor ().