Data Warehouse Algorithm Study with a Novel Mutation Operator

Article Preview

Abstract:

Focused on the issue of establishing data warehouse in data mining study, the study also considered the current situation of researches into dynamic plan recognition. This paper aims to enhance the performance of PSO in complex optimization problems and proposes an improved PSO variant by incorporating a novel mutation operator. The results obtained extend and improve the corresponding theorem for independent identically distributed random variables sequence.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3388-3391

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] E. L. Lehmann, Some concepts of dependence, Ann. Math. Statist. vol. 37, p.1137–1153, October (1966).

DOI: 10.1214/aoms/1177699260

Google Scholar

[2] P. Matula, A note on the almost sure convergence of sums of negatively dependent random variables, Statist. Probab. Lett. vol. 15, p.209–213, October (2012).

DOI: 10.1016/0167-7152(92)90191-7

Google Scholar

[3] Q.Y. Wu, Convergence properties of pairwise NQD random sequences, Acta Math. Sin. vol. 45, p.617–624, June (2012).

Google Scholar

[4] C.G. Wan, Law of large numbers and complete convergence for pairwise NQD random sequences, Acta Math. Appl. Sin. vol. 28, p.253–261, June (2005).

Google Scholar

[5] L.X. Zhang, J.F. Wang, A note on complete convergence of pairwise NQD random sequences, Appl. Math. J. Chinese Univ. Ser. A. vol. 19, p.203–208, June (2004).

Google Scholar

[6] Y.P. Chen, On the strong law of large numbers for pairwise NQD random variables, Acta Math. Sin. vol. 25, p.386–392, June (2005).

Google Scholar

[7] Fernando Bellas, Standards for Second-Generation Portals, IEEE Internet Computing, vol. 8, pp.54-60, February (2004).

DOI: 10.1109/mic.2004.1273486

Google Scholar