An Update Algorithm for Restricted Random Walk Clusters
This book presents the dynamic extension of the Restricted Random Walk Cluster Algorithm by Schöll and Schöll-Paschinger. The dynamic variant allows to quickly integrate changes in the underlying object set or the similarity matrix into the clusters; the results are indistinguishable from the rene...
Збережено в:
Автор: | |
---|---|
Формат: | Електронний ресурс Частина з книги |
Мова: | Англійська |
Опубліковано: |
KIT Scientific Publishing
2007
|
Предмети: | |
Онлайн доступ: | DOAB: download the publication DOAB: description of the publication |
Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Резюме: | This book presents the dynamic extension of the Restricted Random Walk Cluster Algorithm by Schöll and Schöll-Paschinger. The dynamic variant allows to quickly integrate changes in the underlying object set or the similarity matrix into the clusters; the results are indistinguishable from the renewed execution of the original algorithm on the updated data set. |
---|---|
Фізичний опис: | 1 electronic resource (II, 152 p. p.) |
ISBN: | KSP/1000007179 9783866441835 |
Доступ: | Open Access |