Commit cafc3966 authored by Matthias Carnein's avatar Matthias Carnein

Improved Documentation

parent 68cdfc7c
......@@ -9,8 +9,7 @@
#' Since the evolutionary algorithm is incremental, it is possible to apply it between observations, e.g. in the idle time of the stream.
#' Whenever there is idle time, we can call the \code{recluster} function of the reference class to improve the macro-clusters (see example).
#' Alternatively, the evolutionary algorithm can be applied as a traditional reclustering step, or a combination of both.
#' For simplicity, this implementation allows to evaluate a fixed number of generations after each observation and during reclustering.
#' Alternatively, the \code{recluster} function can be called explicitly based on the available time.
#' For simplicity, this implementation also allows to evaluate a fixed number of generations after each observation and during reclustering.
#'
#' @param r radius threshold for micro-cluster assignment
#' @param lambda decay rate
......
......@@ -39,8 +39,7 @@ By iteratively selecting better solutions, an evolutionary pressure is created w
Since the evolutionary algorithm is incremental, it is possible to apply it between observations, e.g. in the idle time of the stream.
Whenever there is idle time, we can call the \code{recluster} function of the reference class to improve the macro-clusters (see example).
Alternatively, the evolutionary algorithm can be applied as a traditional reclustering step, or a combination of both.
For simplicity, this implementation allows to evaluate a fixed number of generations after each observation and during reclustering.
Alternatively, the \code{recluster} function can be called explicitly based on the available time.
For simplicity, this implementation also allows to evaluate a fixed number of generations after each observation and during reclustering.
}
\examples{
stream <- DSD_Memory(DSD_Gaussians(k = 3, d = 2), 1000)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment