USE KUNCHENKO POLYNOMIALS FOR THE ANALYSIS OF THE STATISTICAL DATA

Authors

  • О.Р. Чертов Кафедра прикладної математики Національний технічний університет України «Київський політехнічний інститут», Ukraine
  • Д.Ю. Тавров Кафедра прикладної математики Національний технічний університет України «Київський політехнічний інститут», Ukraine

DOI:

https://doi.org/10.15587/1729-4061.2010.2970

Keywords:

template matching, space with a generative element, Kunchenko polynomial, microfile

Abstract

In the paper, we discuss theoretical basics and practical aspects of applying approximation polynomials in a space with a generative element (Kunchenko space) to statistical data analysis. In particular, we set and, with help of Kunchenko polynomials, solve the task of recognizing a predefined template in the statistical dataset.

Author Biographies

О.Р. Чертов, Кафедра прикладної математики Національний технічний університет України «Київський політехнічний інститут»

Кандидат технічних наук, доцент

Д.Ю. Тавров, Кафедра прикладної математики Національний технічний університет України «Київський політехнічний інститут»

Аспірант

References

  1. Горелик А.Л. Методы распознавания / А.Л. Горелик, В.А. Скрипкин. – М.: Высшая школа, 1989. – 232 с.
  2. Theodoridis S. Pattern Recognition / S. Theodoridis, K. Koutroumbas. – Academic Press, 2008. – 984 p.
  3. Lin Y.-H. Template matching using the parametric template vector with translation, rotation and scale invariance / Y.- H. Lin, C.-H. Chen // Pattern Recognition. – 2008. – V.41, No.7. – P. 2413-2421.
  4. Bellman R.E. Dynamic Programming / R.E. Bellman. – Princeton: University Press, 1957. – 366 p.
  5. Damerau F.J. A technique for computer detection and correction of spelling errors / F.J. Damerau // Communications of the ACM. – 1964. – Vol. 7(3). – P. 171–176.
  6. Briechle K. Template Matching Using Fast Normalized Cross Correlation / K. Briechle, U.D. Hanebeck // Proceedings of SPIE: Optical Pattern Recognition XII. – 2001. – Vol. 4387. – P. 95-102.
  7. Lewis J.P. Fast Template Matching / J.P. Lewis // Vision Interface. – 1995. – P. 120-123.
  8. Bhatia N. Survey of Nearest Neighbor Techniques / N. Bhatia, A. Vandana // International Journal of Computer Science and Information Security. – 2010. – Vol. 8, No. 2. – P. 302-305.
  9. Кунченко Ю.П. Полиномы приближения в пространстве с порождающим элементом / Ю.П. Кунченко. – К.: Наукова думка, 2003. – 243 с.
  10. Chertov O. Group Anonymity / O. Chertov, D. Tavrov // IPMU-2010 [(eds.) E. Hullermeier., R. Kruse, and F. Hoffmann]. – Heidelberg: Springer, 2010. – Communications in Computer and Information Science, vol. 81. – P. 592-601.
  11. Чертов О.Р. Групова анонімність даних / O.Р. Чертов // Зб. наук. праць Військового інституту телекомунікацій та інформатизації НТУУ «КПІ». – К.: ВІТІ НТУУ «КПІ», 2010. – Вип. 1. – С. 130-139.
  12. U.S. Census 2000. 5-Percent Public Use Microdata Sample Files [Електронний ресурс]. – Режим доступу:http:// www.census.gov/Press-Release/www/2003/PUMS5.html.

Downloads

Published

2010-07-30

How to Cite

Чертов, О., & Тавров, Д. (2010). USE KUNCHENKO POLYNOMIALS FOR THE ANALYSIS OF THE STATISTICAL DATA. Eastern-European Journal of Enterprise Technologies, 4(4(46), 70–75. https://doi.org/10.15587/1729-4061.2010.2970

Issue

Vol. 4 No. 4(46) (2010): Mathematics and cybernetics - fundamental and applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2014 О.Р. Чертов, Д.Ю. Тавров

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.