Skip to main content

Advertisement

Springer Nature Link
Log in

Quickly Finding the Smallest Numerical Subset with Its Sum above a Threshold

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Given a set of numerical values and a threshold, finding the minimum subset from the set such that its sum is not less than the threshold value, is termed as SelectSum problem which is widely applicable in data compression and image processing. In this article, we provide two new linear-time algorithms for the problem. Different from the current approaches that directly calling the Selection algorithms for partitioning on median elements, our proposed algorithms embed the Selection process and use cheap pivot elements for partitioning. The experimental tests indicate these two new algorithms are significant faster than the current existing algorithms on larger data sets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Jiang, Y., Pang, C., & Zhang, H. (2013). Finding the minimum number of elements with sum above a threshold. Information Sciences, 238(7), 205–211.

    Article  MathSciNet  Google Scholar 

  2. Chang, X. (2013). An intelligent noise reduction method for chaotic signals based on genetic algorithms and lifting wavelet transforms. Information Sciences, 218(1), 103–118.

    MathSciNet  Google Scholar 

  3. Zhao, H., Dong, Z., Li, T., et al. (2016). Segmenting time series with connected lines under maximum error bound. Information Sciences, 345(C), 1–8.

    Article  Google Scholar 

  4. Peng, M., Gao, W., Wang, H., Zhang, Y., Huang, J., Xie, Q., et al. (2017). Parallelization of massive textstream compression based on compressed sensing. ACM Transactions on Information Systems, 36(2), 17:1–17:18.

    Article  Google Scholar 

  5. Pang, C., Zhang, Q., Zhou, X., Hansen, D. P., Wang, S., & Maeder, A. J. (2013). Computing unrestricted synopses under maximum error bound. Algorithmica, 65(1), 1–42.

    Article  MathSciNet  Google Scholar 

  6. Hatam, M., & Masnadi-Shirazi, M. A. (2015). Optimum nonnegative integer bit allocation for wavelet based signal compression and coding. Information Sciences, 297(C), 332–344.

    Article  MathSciNet  Google Scholar 

  7. Pang, C., Zhang, R., Zhang, Q., & Wang, J. (2010). Dominating sets in directed graphs. Information Sciences, 180(19), 3647–3652.

    Article  MathSciNet  Google Scholar 

  8. Zhang, Q., Pang, C., & Hansen, D. (2009). On multidimensional wavelet synopses under maximum error bounds. In DASFAA2009 (pp. 646–661).

  9. Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973). Time bounds for selection. Journal of Computer and System Sciences, 7(4), 448–461.

    Article  MathSciNet  Google Scholar 

  10. Chan, T. M. (2010). Comparison-based time-space lower bounds for selection. ACM Transaction on Algorithms, 6(2), 1–16.

    Article  MathSciNet  Google Scholar 

  11. Li, H., Wang, Y., Wang, H., & Zhou, B. (2017). Multi-window based ensemble learning for classification of imbalanced streaming data. World Wide Web, 20(6), 1507–1525.

    Article  Google Scholar 

Download references

Acknowledgements

The authors acknowledge National Science Foundation Project of Zhejiang of China (Grant: LY16G010010, LY18F020001), and Ningbo Innovative Team: The intelligent big data engineering application for life and health (Grant: 2016C11024).

Author information

Authors and Affiliations

  1. The Sino-Aus Joint Center for Social Computing and Data Management, Ningbo Institute of Technology, Zhejiang University (NIT), Ningbo, China

    Libo Xu, Chaoyi Pang & Xingsen Li

  2. Hebei University of Economics and Business, Shijiazhuang, Hebei, China

    Chaoyi Pang

Authors
  1. Libo Xu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chaoyi Pang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xingsen Li
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Chaoyi Pang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, L., Pang, C. & Li, X. Quickly Finding the Smallest Numerical Subset with Its Sum above a Threshold. Wireless Pers Commun 103, 427–436 (2018). https://doi.org/10.1007/s11277-018-5452-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-018-5452-8

Keywords