Skip to main content
Erschienen in: Arabian Journal for Science and Engineering 8/2022

22.05.2022 | Research Article-Computer Engineering and Computer Science

Probability Quantization Model for Sample-to-Sample Stochastic Sampling

verfasst von: Bopeng Fang, Jing Wang, Zhurong Dong, Kai Xu

Erschienen in: Arabian Journal for Science and Engineering | Ausgabe 8/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Computer-driven sampling methodology has been widely used in various application scenarios, theoretical models and data preprocessing. However, these powerful models are either based on explicit probability models or adopt data-level generation rules, which are difficult to be applied to the realistic environment that the prior distribution knowledge is missing. Inspired by the density estimation methods and quantization techniques, a method based on the quantization modeling of data density named probability quantization model (PQM) is proposed in this paper. The method quantifies the complex density estimation model through the discrete probability blocks so as to approximate the cumulative distribution and finally achieve backtracking sampling based on the roulette wheel selection and local linear regression, which avoids the indispensable prior distribution knowledge and troublesome modeling constraints in the existing stochastic sampling methods. Meanwhile, our method based on the data probability modeling is hard to be influenced by the sample features, thus avoiding over-fitting and having better data diversity than over-sampling methods. Experimental results show the advantages of the proposed method to various computer-driven sampling methods in terms of accuracy, generalization performance and data diversity.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
4.
Zurück zum Zitat Li, C.; Tian, Y.; Chen, X.; Li, J.: An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. Inf. Sci. (Ny) 546, 253–264 (2021)MathSciNetCrossRef Li, C.; Tian, Y.; Chen, X.; Li, J.: An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. Inf. Sci. (Ny) 546, 253–264 (2021)MathSciNetCrossRef
8.
Zurück zum Zitat Moka, S.B.; Kroese, D.P.: Perfect sampling for Gibbs point processes using partial rejection sampling. Bernoulli 26, 2082–2104 (2020)MathSciNetCrossRef Moka, S.B.; Kroese, D.P.: Perfect sampling for Gibbs point processes using partial rejection sampling. Bernoulli 26, 2082–2104 (2020)MathSciNetCrossRef
9.
Zurück zum Zitat Warne, D.J.; Baker, R.E.; Simpson, M.J.: Multilevel rejection sampling for approximate Bayesian computation. Comput. Stat. Data Anal. 124, 71–86 (2018)MathSciNetCrossRef Warne, D.J.; Baker, R.E.; Simpson, M.J.: Multilevel rejection sampling for approximate Bayesian computation. Comput. Stat. Data Anal. 124, 71–86 (2018)MathSciNetCrossRef
10.
Zurück zum Zitat Choe, Y.; Byon, E.; Chen, N.: Importance sampling for reliability evaluation with stochastic simulation models. Technometrics 57, 351–361 (2015)MathSciNetCrossRef Choe, Y.; Byon, E.; Chen, N.: Importance sampling for reliability evaluation with stochastic simulation models. Technometrics 57, 351–361 (2015)MathSciNetCrossRef
12.
Zurück zum Zitat Chan, T.C.Y.; Diamant, A.; Mahmood, R.: Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation. Oper. Res. Lett. 48, 744–751 (2020)MathSciNetCrossRef Chan, T.C.Y.; Diamant, A.; Mahmood, R.: Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation. Oper. Res. Lett. 48, 744–751 (2020)MathSciNetCrossRef
13.
Zurück zum Zitat Yang, X.; Kuang, Q.; Zhang, W.; Zhang, G.: AMDO: An over-sampling technique for multi-class imbalanced problems. IEEE Trans. Knowl. Data Eng. 30, 1672–1685 (2018)CrossRef Yang, X.; Kuang, Q.; Zhang, W.; Zhang, G.: AMDO: An over-sampling technique for multi-class imbalanced problems. IEEE Trans. Knowl. Data Eng. 30, 1672–1685 (2018)CrossRef
14.
Zurück zum Zitat Robert, C.P.; Casella, G.: Monte Carlo statistical methods. Springer(Chapter 2), New York (2004). Robert, C.P.; Casella, G.: Monte Carlo statistical methods. Springer(Chapter 2), New York (2004).
15.
Zurück zum Zitat Jia, G.; Taflanidis, A.A.; Beck, J.L.: A new adaptive rejection sampling method using kernel density approximations and its application to subset simulation. ASCE-ASME J. Risk Uncertain. Eng. Syst. Part A Civ. Eng. 3, 1–12 (2017). https://doi.org/10.1061/ajrua6.0000841 Jia, G.; Taflanidis, A.A.; Beck, J.L.: A new adaptive rejection sampling method using kernel density approximations and its application to subset simulation. ASCE-ASME J. Risk Uncertain. Eng. Syst. Part A Civ. Eng. 3, 1–12 (2017). https://​doi.​org/​10.​1061/​ajrua6.​0000841
17.
Zurück zum Zitat Gilks, W.R.; Wild, P.: Adaptive rejection sampling for Gibbs sampling. Appl. Stat. 41, 337–348 (1992)CrossRef Gilks, W.R.; Wild, P.: Adaptive rejection sampling for Gibbs sampling. Appl. Stat. 41, 337–348 (1992)CrossRef
20.
Zurück zum Zitat Botts, C.: A modified adaptive accept-reject algorithm for univariate densities with bounded support. J. Stat. Comput. Simul. 81, 1039–1053 (2011)MathSciNetCrossRef Botts, C.: A modified adaptive accept-reject algorithm for univariate densities with bounded support. J. Stat. Comput. Simul. 81, 1039–1053 (2011)MathSciNetCrossRef
22.
Zurück zum Zitat Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97–109 (1970)MathSciNetCrossRef Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97–109 (1970)MathSciNetCrossRef
24.
Zurück zum Zitat Li, H.; Li, J.; Chang, P.C.; Sun, J.: Parametric prediction on default risk of Chinese listed tourism companies by using random oversampling, isomap, and locally linear embeddings on imbalanced samples. Int. J. Hosp. Manag. 35, 141–151 (2013)CrossRef Li, H.; Li, J.; Chang, P.C.; Sun, J.: Parametric prediction on default risk of Chinese listed tourism companies by using random oversampling, isomap, and locally linear embeddings on imbalanced samples. Int. J. Hosp. Manag. 35, 141–151 (2013)CrossRef
26.
Zurück zum Zitat Chawla, N.V.; Bowyer, K.W.; Hall, L.O.; Kegelmeyer, W.P.: SMOTE: Synthetic minority over-sampling technique. J. Artif. Intell. Res. 16, 321–357 (2002)CrossRef Chawla, N.V.; Bowyer, K.W.; Hall, L.O.; Kegelmeyer, W.P.: SMOTE: Synthetic minority over-sampling technique. J. Artif. Intell. Res. 16, 321–357 (2002)CrossRef
28.
Zurück zum Zitat Han, H.; Wang, W.Y.; Mao, B.H.: Borderline-SMOTE: A new over-sampling method in imbalanced data sets learning. In: Proc. Int. Conf. Intell. Comput. Berlin, Germany: Springer. pp. 878–887 (2005). Han, H.; Wang, W.Y.; Mao, B.H.: Borderline-SMOTE: A new over-sampling method in imbalanced data sets learning. In: Proc. Int. Conf. Intell. Comput. Berlin, Germany: Springer. pp. 878–887 (2005).
29.
Zurück zum Zitat He, H.B.; Yang, B.; Garcia, E.A.; Li, S.: ADASYN: adaptive synthetic sampling approach for imbalanced learning. In: Proc. of the IEEE World Congress on Computational Intelligence. pp. 1322–1328 (2008). He, H.B.; Yang, B.; Garcia, E.A.; Li, S.: ADASYN: adaptive synthetic sampling approach for imbalanced learning. In: Proc. of the IEEE World Congress on Computational Intelligence. pp. 1322–1328 (2008).
31.
Zurück zum Zitat Tang, Y.; Zhang, Y.Q.; Chawla, N.V.; Krasser, S.: SVMs modeling for highly imbalanced classification. IEEE Trans. Syst. Man Cybern. B Cybern. 39, 281–288 (2009)CrossRef Tang, Y.; Zhang, Y.Q.; Chawla, N.V.; Krasser, S.: SVMs modeling for highly imbalanced classification. IEEE Trans. Syst. Man Cybern. B Cybern. 39, 281–288 (2009)CrossRef
32.
Zurück zum Zitat Ahmed, H.I.; Wei, P.; Memon, I.; Du, Y.; Xie, W.: Estimation of time difference of arrival ( TDOA ) for the source radiates BPSK signal. IJCSI Int. J. Compuer Sci. 10, 164–171 (2013) Ahmed, H.I.; Wei, P.; Memon, I.; Du, Y.; Xie, W.: Estimation of time difference of arrival ( TDOA ) for the source radiates BPSK signal. IJCSI Int. J. Compuer Sci. 10, 164–171 (2013)
34.
Zurück zum Zitat Taaffe, K.; Pearce, B.; Ritchie, G.: Using kernel density estimation to model surgical procedure duration. Int. Trans. Oper. Res. 28, 401–418 (2021)MathSciNetCrossRef Taaffe, K.; Pearce, B.; Ritchie, G.: Using kernel density estimation to model surgical procedure duration. Int. Trans. Oper. Res. 28, 401–418 (2021)MathSciNetCrossRef
35.
Zurück zum Zitat Cheng, M.; Hoang, N.D.: Slope collapse prediction using bayesian framework with K-nearest neighbor density estimation: case study in Taiwan. J. Comput. Civil Eng. 30, 04014116 (2016)CrossRef Cheng, M.; Hoang, N.D.: Slope collapse prediction using bayesian framework with K-nearest neighbor density estimation: case study in Taiwan. J. Comput. Civil Eng. 30, 04014116 (2016)CrossRef
37.
Zurück zum Zitat Qin, H.; Gong, R.; Liu, X.; Bai, X.; Song, J.; Sebe, N.: Binary neural networks: A survey. Pattern Recognit. 105, 107281 (2020)CrossRef Qin, H.; Gong, R.; Liu, X.; Bai, X.; Song, J.; Sebe, N.: Binary neural networks: A survey. Pattern Recognit. 105, 107281 (2020)CrossRef
39.
Zurück zum Zitat Ho-Huu, V.; Nguyen-Thoi, T.; Truong-Khac, T.; Le-Anh, L.; Vo-Duy, T.: An improved differential evolution based on roulette wheel selection for shape and size optimization of truss structures with frequency constraints. Neural Comput. Appl. 29, 167–185 (2018)CrossRef Ho-Huu, V.; Nguyen-Thoi, T.; Truong-Khac, T.; Le-Anh, L.; Vo-Duy, T.: An improved differential evolution based on roulette wheel selection for shape and size optimization of truss structures with frequency constraints. Neural Comput. Appl. 29, 167–185 (2018)CrossRef
41.
Zurück zum Zitat Goodfellow, I.; Pouget-Abadie, J.; Mirza, M.; Xu, B.; Warde-Farley, D.; Ozair, S.; Courville, A.; Bengio, Y.: Generative Adversarial Nets. Advances in Neural Information Processing Systems, p. 2672–2680. Springer, Berlin (2014) Goodfellow, I.; Pouget-Abadie, J.; Mirza, M.; Xu, B.; Warde-Farley, D.; Ozair, S.; Courville, A.; Bengio, Y.: Generative Adversarial Nets. Advances in Neural Information Processing Systems, p. 2672–2680. Springer, Berlin (2014)
46.
Zurück zum Zitat Krizhevsky, A.; Sutskever, I.; Hinton, G.G.: Imagenet classification with deep convolutional neural networks. NIPS. 25, 1097–1105 (2012) Krizhevsky, A.; Sutskever, I.; Hinton, G.G.: Imagenet classification with deep convolutional neural networks. NIPS. 25, 1097–1105 (2012)
48.
Zurück zum Zitat Scott, D.W.; Terrell, G.R.: Biased and unbiased cross-validation in density estimation. J. Am. Stat. Assoc. 82, 1131–1146 (1987)MathSciNetCrossRef Scott, D.W.; Terrell, G.R.: Biased and unbiased cross-validation in density estimation. J. Am. Stat. Assoc. 82, 1131–1146 (1987)MathSciNetCrossRef
49.
Zurück zum Zitat Raykar, V.C.; Duraiswami, R.; Zhao, L.H.: Fast computation of kernel estimators. J. Comput. Graph. Stat. 19, 205–220 (2010)MathSciNetCrossRef Raykar, V.C.; Duraiswami, R.; Zhao, L.H.: Fast computation of kernel estimators. J. Comput. Graph. Stat. 19, 205–220 (2010)MathSciNetCrossRef
51.
Zurück zum Zitat Wang, Z.; Huang, Y.; Lyu, S.X.: Lattice-reduction-aided Gibbs algorithm for lattice Gaussian sampling: Convergence Enhancement and Decoding Optimization. IEEE Trans. Signal Process. 67, 4342–4356 (2019)MathSciNetCrossRef Wang, Z.; Huang, Y.; Lyu, S.X.: Lattice-reduction-aided Gibbs algorithm for lattice Gaussian sampling: Convergence Enhancement and Decoding Optimization. IEEE Trans. Signal Process. 67, 4342–4356 (2019)MathSciNetCrossRef
Metadaten
Titel
Probability Quantization Model for Sample-to-Sample Stochastic Sampling
verfasst von
Bopeng Fang
Jing Wang
Zhurong Dong
Kai Xu
Publikationsdatum
22.05.2022
Verlag
Springer Berlin Heidelberg
Erschienen in
Arabian Journal for Science and Engineering / Ausgabe 8/2022
Print ISSN: 2193-567X
Elektronische ISSN: 2191-4281
DOI
https://doi.org/10.1007/s13369-022-06932-0

Weitere Artikel der Ausgabe 8/2022

Arabian Journal for Science and Engineering 8/2022 Zur Ausgabe

Research Article-Computer Engineering and Computer Science

AI-Based Mobile Edge Computing for IoT: Applications, Challenges, and Future Scope

Research Article-Computer Engineering and Computer Science

Latent Semantic Indexing-Based Hybrid Collaborative Filtering for Recommender Systems

Research Article-Computer Engineering and Computer Science

Spoken Utterance Classification Task of Arabic Numerals and Selected Isolated Words

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.