KXKun Xu

Kun Xu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kun Xu has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • An Efficient Framework for Processing Range Skyline Queries over Incomplete Database

    by Xiaowei Zhang, Siti Nurulain Mohd Rum, Fatin Izzati Ramli, Xu Ding, Haibin Zhong, Kun Xu, Mudathir Ahmed Mohamud

    Skyline queries retrieve objects that are not dominated by any other object in the database, playing a key role in preference analysis and multi-criteria decision-making system. As an important variant, range skyline queries retrieve skyline results within a database defined by the range value across one or more dimensions. The presence of incomplete data is inevitable in large-scale, multidimensional databases, introducing new challenges in processing range skyline queries. To address this challenge, an efficient framework named Optimized Incomplete Range Skyline (OIRS) is proposed to optimize range skyline query execution by incorporating a range pruning strategy and a bucket metadata reuse technique. The OIRS framework takes precomputed buckets and their metadata as input and consists of three phases: pruning objects with range query, computing bucket skylines, and deriving final skyline results. First, a range pruning algorithm prunes irrelevant objects based on bucket metadata. Next, a bucket skyline computation algorithm efficiently computes bucket skylines for the remaining objects by leveraging a bucket skyline reuse technique. Finally, the final skyline results are derived from the candidate objects across the bucket skylines. Extensive experiments conducted on both synthetic and real-world NBA datasets demonstrate that OIRS significantly outperforms the naïve scan-and-compute approach across three key metrics: the number of object scans in the range pruning phase, the number of pairwise comparisons in computing bucket skylines, and the number of pairwise comparisons for deriving final incomplete skylines.

  • Exploring Uncertainty and Representativeness for Deep Active Learning

    by Hao Li, Yanchao Li, Pengfei Li, Ge Zhang, Wei Wang, Kun Xu

    Albeit the considerable advances that are achieved by convolutional neural networks (CNN) in active learning, simultaneously investing multiple criteria such as uncertainty and representativeness when sampling informative images still remains a challenging issue. In this work, we develop and evaluate an active learning method called Exploring Uncertainty and Representativeness in Deep Active Learning (EURDAL), to iteratively boost the generalization capacity of the CNN backbone for image classification. To be specific, we introduce two adversarial image classifiers appended to the CNN backbone, and the uncertainty is expounded by the prediction discrepancy of the two adversarial classifiers. Besides, the ([ ])-tuplet loss, which was developed in deep metric learning, is imposed on the CNN backbone, to force CNN to extract discriminative features of unlabeled images. After that, the representativeness is defined by the distance proportion between the given example to its own centroid and the given example to all cluster centroids. With the integration of the learned uncertainty and representativeness, the most informative images will be selected while the noisy ones will be suppressed at each iteration of active supervision. Intensive image classification experiments are conducted on three benchmark datasets, and the encouraging results demonstrate the superiority and effectiveness of our proposed EURDAL network compared with some current competitive active learning methods.