Skip to main content

Algorithmic Decomposition of Tasks with a Large Amount of Data

  • Conference paper
  • First Online:
  • 389 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 889))

Abstract

The transformation of models and data to the form that allows their decomposition is called algorithmic decomposition. It is a necessary preparatory stage in many applications, allowing us to present data and object models in a form convenient for dividing the processes of solving problems into parallel or sequential stages with significantly less volumes of data. The paper deals with three problems of modeling objects of different nature, in which algorithmic decomposition is an effective tool for reducing the amount of the data being processed and for flexible adjustment of object models performed to improve the accuracy and reliability of the results of computer simulation. The discussion is accompanied by simple examples that allow the reader to offers a clearer view of the essence of the methods presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press (2014)

    Google Scholar 

  2. Weste, N., Harris, D.: CMOS VLSI Design. Addison-Wesley (2004)

    Google Scholar 

  3. Tikhonov, A.N.: Systems of differential equations containing small parameters in the derivatives. Mat. sb. 73(3), 575–586 (1952)

    MathSciNet  Google Scholar 

  4. Rogoza, W.: Adaptive simulation of separable dynamical systems in the neural network basis. In: Pejas, J., Piegat, A. (eds.) Enhanced Methods in Computer Security, Biometrcic and Artificial Intelligence Systems, pp. 371–386. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. The MIT Press, Cambridge (2017)

    MATH  Google Scholar 

  6. Rogoza, W.: Some models of problem adaptive systems. Pol. J. Environ. Stud. 16(#5B), 212–218 (2006)

    Google Scholar 

  7. Sze, S.M.: Physics of Semiconductor Devices, 2nd edn. Wiley (WIE), New York (1981)

    Google Scholar 

  8. Box, G., Jenkins, G.: Time Series Analysis: Forecasting and Control. Holden-Day, San Francisco (1970)

    MATH  Google Scholar 

  9. Madala, H.R., Ivakhnenko, A.G.: Inductive Learning Algorithms for Complex Systems Modeling. CRC Press, Boca Raton (1994)

    MATH  Google Scholar 

  10. Rogoza, W.: Deterministic method for the prediction of time series. In: Kobayashi, S., Piegat, A., Pejaś, J., El Fray, I., Kacprzyk, J (eds.) ACS 2016. AISC, vol. 534, pp. 68–80. Springer, Heidelberg (2017)

    Google Scholar 

  11. Miller, G.: Numerical Analysis for Engineers and Scientists. Cambridge University Press, Cambridge (2014)

    MATH  Google Scholar 

  12. Rogoza, W., Zabłocki, M.: A feather forecasting system using intelligent BDI multiagent-based group method of data handling. In: Kobayashi, S., Piegat, A., Pejaś, J., El Fray, I., Kacprzyk, J (eds.) Hard and Soft Computing for Artificial Intelligence, Multimedia and Security. AISC, vol. 534, pp. 37–48. Springer, Heidelberg (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Walery Rogoza or Ann Ishchenko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rogoza, W., Ishchenko, A. (2019). Algorithmic Decomposition of Tasks with a Large Amount of Data. In: Pejaś, J., El Fray, I., Hyla, T., Kacprzyk, J. (eds) Advances in Soft and Hard Computing. ACS 2018. Advances in Intelligent Systems and Computing, vol 889. Springer, Cham. https://doi.org/10.1007/978-3-030-03314-9_21

Download citation

Publish with us

Policies and ethics