Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Revision d313e454f0f03d26eb1ecbd8885ebda4bc87f231 authored by Kevin R. Coombes on 13 July 2017, 14:35:59 UTC, committed by cran-robot on 13 July 2017, 14:35:59 UTC
version 2.1.3
0 parent
  • Files
  • Changes
  • 5a5353d
  • /
  • man
  • /
  • genalg-class.Rd
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • revision
  • directory
  • content
revision badge
swh:1:rev:d313e454f0f03d26eb1ecbd8885ebda4bc87f231
directory badge Iframe embedding
swh:1:dir:58b83137a1f79af2f5eb4b93873551e6d65f07bd
content badge Iframe embedding
swh:1:cnt:30b787b9a4410dda1cd365e7ec5730a4aba17a49

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • revision
  • directory
  • content
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
genalg-class.Rd
\name{GenAlg-class}
\alias{GenAlg-class}
\alias{as.data.frame,GenAlg-method}
\alias{as.matrix,GenAlg-method}
\alias{summary,GenAlg-method}
\docType{class}
\title{Class "GenAlg"}
\description{
  Objects of the \code{GenAlg} class represent one step (population) in the
  evolution of a genetic algorithm. This algorithm has been customized to
  perform feature selection for the class prediction problem.
}
\usage{
\S4method{as.data.frame}{GenAlg}(x, row.names=NULL, optional=FALSE, \dots)
\S4method{as.matrix}{GenAlg}(x, \dots)
\S4method{summary}{GenAlg}(object, \dots)
}
\arguments{
  \item{object}{object of class \code{GenAlg}}
  \item{x}{object of class \code{GenAlg}}
  \item{row.names}{character vector giving the row names for the data frame,
    or \code{NULL}}
  \item{optional}{logical scalar. If \code{TRUE}, setting row names and
    converting column names to syntactic names is optional.}
  \item{\dots}{extra arguments for generic routines}
} 
\section{Objects from the Class}{
  Objects should be created by calls to the \code{\link{GenAlg}} generator;
  they will also be created automatically as a result of applying the function
  \code{\link{newGeneration}} to an existing \code{GenAlg} object.
}
\section{Slots}{
  \describe{
    \item{\code{data}:}{The initial population of potential solutions,
      in the form of a data matrix with one individual per row.}
    \item{\code{fitfun}:}{A function to compute the fitness of an
      individual solution. Must take two input arguments: a vector of
      indices into the rows of the population matrix, and a \code{context}
      list within which any other items required by the function can be
      resolved. Must return a real number; higher values indicate better
      fitness, with the maximum fitness occurring at the optimal solution
      to the underlying numerical problem.} 
    \item{\code{mutfun}:}{A function to mutate individual alleles in the
      population. Must take two arguments: the starting allele and a
      \code{context} list as in the fitness function.}
    \item{\code{p.mutation}:}{numeric scalar between \code{0} and \code{1},
      representing the probability that an individual allele will be mutated.}
    \item{\code{p.crossover}:}{numeric scalar between \code{0} and \code{1},
      representing the probability that crossover will occur during
      reproduction.}
    \item{\code{generation}:}{integer scalar identifying the current
      generation.}
    \item{\code{fitness}:}{numeric vector containing the fitness of
      all individuals in the population.}
    \item{\code{best.fit}:}{A numeric value; the maximum fitness.}
     \item{\code{best.individual}:}{A matrix (often with one row)
       containing the individual(s) achieving the maximum fitness. }
    \item{\code{context}:}{A list of additional data required to perform
      mutation or to compute fitness. This list is passed along as the
      second argument when \code{fitfun} and \code{mutfun} are called.}
  }
}
\section{Methods}{
  \describe{
    \item{as.data.frame}{\code{signature(x = "GenAlg")}: Converts the
      \code{GenAlg} object into a data frame.  The first column contains
      the fitness ; remaining columns contain three selected features,
      given as integer indices into the rows of the original data matrix. }
    \item{as.matrix}{\code{signature(x = "GenAlg")}: Converts the GenAlg
      object into a matrix, following the conventions of \code{as.data.frame}.}
    \item{summary}{\code{signature(object = "GenAlg")}: Print a summary
      of the GenAlg object.}
  }
}
\author{
  Kevin R. Coombes \email{krc@silicovore.com},
  P. Roebuck \email{proebuck@mdanderson.org}
}
\references{
  David Goldberg.\cr
  "Genetic Algorithms in Search, Optimization and Machine Learning."\cr
  Addison-Wesley, 1989.
}
\seealso{
  \code{\link{GenAlg}},
  \code{\link{GenAlg-tools}},
  \code{\link{maha}}.
}
\examples{
showClass("GenAlg")
}
\keyword{classes}
\keyword{optimize}
\keyword{classif}

The diff you're trying to view is too large. Only the first 1000 changed files have been loaded.
Showing with 0 additions and 0 deletions (0 / 0 diffs computed)
swh spinner

Computing file changes ...

back to top

Software Heritage — Copyright (C) 2015–2025, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API