Feedback

X
An Update Algorithm for Restricted Random Walk Clusters

An Update Algorithm for Restricted Random Walk Clusters

en

0 Ungluers have Faved this Work
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.

This book is included in DOAB.

Why read this book? Have your say.

You must be logged in to comment.

Rights Information

Are you the author or publisher of this work? If so, you can claim it as yours by registering as an Unglue.it rights holder.

Downloads

This work has been downloaded 50 times via unglue.it ebook links.
  1. 50 - pdf (CC BY-NC-ND) at Unglue.it.

Keywords

  • Cluster <Datenanalyse>
  • dynamic clustering
  • Dynamische Datenanalyse
  • dynamisches Clustering
  • Empfehlungssystem
  • Klassifikation

Links

DOI: 10.5445/KSP/1000007179

Editions

edition cover

Share

Copy/paste this into your site: