東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Randomized algorithms in automatic c...

Granichin, Oleg.

FindBook

Google Book

Amazon

博客來

Randomized algorithms in automatic control and data mining

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Randomized algorithms in automatic control and data mining/ by Oleg Granichin, Zeev (Vladimir) Volkovich, Dvora Toledano-Kitai.
作者:	Granichin, Oleg.
其他作者:	Volkovich, Zeev (Vladimir)
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2015.,
面頁冊數:	xxiv, 251 p. :ill. (some col.), digital ;24 cm.
內容註:	Randomized algorithms -- Randomization in estimation, identification and filtering problems under arbitrary external noises -- Data mining.
Contained By:	Springer eBooks
標題:	Computer algorithms. -
電子資源:	http://dx.doi.org/10.1007/978-3-642-54786-7
ISBN:	9783642547867 (electronic bk.)

Randomized algorithms in automatic control and data mining
Granichin, Oleg.

Randomized algorithms in automatic control and data mining[electronic resource] /by Oleg Granichin, Zeev (Vladimir) Volkovich, Dvora Toledano-Kitai. - Berlin, Heidelberg :Springer Berlin Heidelberg :2015. - xxiv, 251 p. :ill. (some col.), digital ;24 cm. - Intelligent systems reference library,v.671868-4394 ;. - Intelligent systems reference library ;v.24..

Randomized algorithms -- Randomization in estimation, identification and filtering problems under arbitrary external noises -- Data mining.

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.

ISBN: 9783642547867 (electronic bk.)

Standard No.: 10.1007/978-3-642-54786-7doiSubjects--Topical Terms:

523872
Computer algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Randomized algorithms in automatic control and data mining
LDR:02040nmm a2200325 a 4500 001 1993980
003 DE-He213
005 20150513133623.0
006 m d
007 cr nn 008maaau
008 151019s2015 gw s 0 eng d
020 $a 9783642547867 (electronic bk.)
020 $a 9783642547850 (paper)
024 7 $a 10.1007/978-3-642-54786-7 $2 doi
035 $a 978-3-642-54786-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b G759 2015
100 1 $a Granichin, Oleg. $3 2132569
245 1 0 $a Randomized algorithms in automatic control and data mining $h [electronic resource] / $c by Oleg Granichin, Zeev (Vladimir) Volkovich, Dvora Toledano-Kitai.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a xxiv, 251 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Intelligent systems reference library, $x 1868-4394 ; $v v.67
505 0 $a Randomized algorithms -- Randomization in estimation, identification and filtering problems under arbitrary external noises -- Data mining.
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.
650 0 $a Computer algorithms. $3 523872
650 0 $a Automatic control. $3 535879
650 0 $a Data mining. $3 562972
650 1 4 $a Engineering. $3 586835
650 2 4 $a Computational Intelligence. $3 1001631
650 2 4 $a Control. $3 1006321
650 2 4 $a Data Mining and Knowledge Discovery. $3 898250
700 1 $a Volkovich, Zeev (Vladimir) $3 2132570
700 1 $a Toledano-Kitai, Dvora. $3 2132571
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Intelligent systems reference library ; $v v.24. $3 1566491
856 4 0 $u http://dx.doi.org/10.1007/978-3-642-54786-7
950 $a Engineering (Springer-11647)