All
 
|
 
 


Randomized algorithm for the problem of two-cluster sequence splitting
 
PIIS004446690003560-7-1
DOI10.31857/S004446690003560-7
Publication type Article
Status Published
Authors
Alexander Kel'manov 
Affiliation:
Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences
Novosibirsk State University
Address: Russian Federation
S. Khamidullin
Affiliation: Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences
Address: Russian Federation
V. Khandeev
Affiliation: Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences
Address: Russian Federation
Journal nameZhurnal vychislitelnoi matematiki i matematicheskoi fiziki
EditionVolume 58 Issue 12
Pages2169-2178
Abstract

  

Keywords
AcknowledgmentThe work is executed at financial support of RGNF (project No. 16-11-10041).
Received23.01.2019
Publication date23.01.2019
Cite   Download pdf To download PDF you should sign in
Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

views: 1156

Readers community rating: votes 0 

1. Kel'manov A.V., Khamidullin S.A. Aposteriornoe obnaruzhenie zadannogo chisla odinakovykh podposledovatel'nostej v kvaziperiodicheskoj posledovatel'nosti // Zhurn. vychisl. matematiki i mat. fiziki. 2001. T. 41, 5. S. 807–820.
2. Kel’manov A.V., Jeon B. A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train // IEEE Trans. on Signal Processing. 2004. Vol. 52, 3. P. 645–656.
3. Agol E., Carter J.A., et all. Kepler-36: A Pair of Planets with Neighboring Orbits and Dissimilar Densities //
Science. 2012. Vol. 337. 6094. P. 556–559.
4. Bishop M.C. Pattern Recognition and Machine Learning. New York: Springer Science+Business Media,
LLC, 2006.
5. Kel'manov A.V., Khamidullin S.A. Priblizhyonnyj polinomial'nyj algoritm dlya odnoj zadachi biklasterizatsii posledovatel'nosti // Zhurn. vychisl. matematiki i mat. fiziki. 2015. T. 55, 6. S. 1076–1085.
6. Tak-chung Fu. A review on time series data mining // Engineering Applications of Artificial Intelligence. 2011. Vol. 24, 1. P. 164–181.
7. Gimadi Eh.Kh., Kel'manov A.V., Kel'manova M.A., Khamidullin S.A. Aposteriornoe obnaruzhenie v chislovoj posledovatel'nosti kvaziperiodicheskogo fragmenta pri zadannom chisle povtorov // Sib. zhurn. industr. matematiki. 2006. T. 9, 1(25). S. 55–74.
8. Gimadi E. Kh., Kel’manov A.V., Kel’manova M.A., Khamidullin S.A. A Posteriori Detecting a Quasiperiodic Fragment in a Numerical Sequence // Pattern Recognition and Image Analysis. 2008. Vol. 18, 1. P. 30–42.
9. Kel'manov A.V. Problema off-line obnaruzheniya povtoryayuschegosya fragmenta v chislovoj posledovatel'nosti // Trudy Instituta matematiki i mekhaniki UrO RAN. 2008. T. 14, 2. S. 81–88.
10. Kel'manov A.V., Pyatkin A.V. O slozhnosti nekotorykh zadach poiska podmnozhestv vektorov i klasternogo analiza // Zhurn. vychisl. matematiki i mat. fiziki. 2009. T. 49, 11. S. 2059–2065.
11. Kel'manov A.V., Pyatkin A.V. O slozhnosti nekotorykh zadach klasternogo analiza vektornykh posledovatel'nostej // Diskret. analiz i issled. operatsij. 2013. T. 20, 2. S. 47–57.
12. Kel'manov A.V., Khamidullin S.A. Priblizhyonnyj polinomial'nyj algoritm dlya odnoj zadachi razbieniya posledovatel'nosti // Diskret. analiz i issled. operatsij. 2014. T. 21, 1. S. 53–66.
13. Rajeev Motwani, Prabhakar Raghavan. Randomized algorithms. New York: Cambridge University Press,
1995.
14. Kel'manov A.V., Khamidullin S.A., Khandeev V.I. Tochnyj psevdopolinomial'nyj algoritm dlya odnoj
zadachi razbieniya posledovatel'nosti // Avtomatika i telemekhanika. 2017. № 1. S. 80–90. 
15. Kel'manov A.V., Khamidullin S.A., Khandeev V.I. Polnost'yu polinomial'naya approksimatsionnaya skhema dlya odnoj zadachi dvukhklasternogo razbieniya posledovatel'nosti // Diskret. analiz i issled.
operatsij. 2016. T. 23. № 2. S. 21–40.
16. Kel'manov A.V., Khandeev V.I. Polnost'yu polinomial'naya approksimatsionnaya skhema dlya spetsial'nogo sluchaya odnoj kvadratichnoj evklidovoj zadachi 2-klasterizatsii // Zh. vychisl.matem. i matem.
fiz. 2016, T. 56. № 2. S. 332–340.
17. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San
Francisco: Freeman, 1979.
18. Kel'manov A.V., Khandeev V.I. Randomizirovannyj algoritm dlya odnoj zadachi dvukhklasternogo razbieniya mnozhestva vektorov // Zh. vychisl.matem. i matem. fiz. 2015, T. 55. № 2. S. 335–344.
19. Wirth N. Algorithms + Data Structures = Programs. New Jersey: Prentice Hall, 1976.

Система Orphus

Loading...
Up