|
|
|
|
LEADER |
02240nmm a2200349 u 4500 |
001 |
EB000892710 |
003 |
EBX01000000000000000689830 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
140801 ||| eng |
020 |
|
|
|a 9783642547867
|
100 |
1 |
|
|a Granichin, Oleg
|
245 |
0 |
0 |
|a Randomized Algorithms in Automatic Control and Data Mining
|h Elektronische Ressource
|c by Oleg Granichin, Zeev (Vladimir) Volkovich, Dvora Toledano-Kitai
|
250 |
|
|
|a 1st ed. 2015
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2015, 2015
|
300 |
|
|
|a XXIV, 251 p. 99 illus., 19 illus. in color
|b online resource
|
505 |
0 |
|
|a Randomized algorithms -- Randomization in estimation, identification and filtering problems under arbitrary external noises -- Data mining
|
653 |
|
|
|a Computational intelligence
|
653 |
|
|
|a Control and Systems Theory
|
653 |
|
|
|a Data mining
|
653 |
|
|
|a Computational Intelligence
|
653 |
|
|
|a Control engineering
|
653 |
|
|
|a Data Mining and Knowledge Discovery
|
700 |
1 |
|
|a Volkovich, Zeev (Vladimir)
|e [author]
|
700 |
1 |
|
|a Toledano-Kitai, Dvora
|e [author]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Intelligent Systems Reference Library
|
028 |
5 |
0 |
|a 10.1007/978-3-642-54786-7
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-54786-7?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 006.3
|
520 |
|
|
|a In the fields of data mining and control, the huge amount of unstructured data and the presence of uncertainty in system descriptions have always been critical issues. The book Randomized Algorithms in Automatic Control and Data Mining introduces the readers to the fundamentals of randomized algorithm applications in data mining (especially clustering) and in automatic control synthesis. The methods proposed in this book guarantee that the computational complexity of classical algorithms and the conservativeness of standard robust control techniques will be reduced. It is shown that when a problem requires "brute force" in selecting among options, algorithms based on random selection of alternatives offer good results with certain probability for a restricted time and significantly reduce the volume of operations
|