MultiDecisionMetropolisHastings

Type Members

type ProposalMakerType = (Universe, Element[_]) ⇒ ProposalScheme

Type that defines how to create a proposal in a multi-decision MH algorithm.
Type that defines how to create a proposal in a multi-decision MH algorithm. This is simply a function from a universe and element (a decision) to a proposal scheme.

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(numSamples: Int, proposalMaker: ProposalMakerType, burnIn: Int, interval: Int, utilityNodes: List[Element[_]], targets: Decision[_, _]*)(implicit universe: Universe): OneTimeMultiDecisionMetropolisHastings

Create a OneTime multi-decision Metropolis-Hastings sampler using the given number of samples, proposal maker, burn in time, interval, given target utilities, and target decisions.
Create a OneTime multi-decision Metropolis-Hastings sampler using the given number of samples, proposal maker, burn in time, interval, given target utilities, and target decisions.
proposalMaker
A function that specifies how to create a proposal for each decision in the target list
def apply(numSamples: Int, proposalMaker: ProposalMakerType, burnIn: Int, utilityNodes: List[Element[_]], targets: Decision[_, _]*)(implicit universe: Universe): OneTimeMultiDecisionMetropolisHastings

Create a OneTime multi-decision Metropolis-Hastings sampler using the given number of samples, proposal maker, burn in time, given target utilities, and target decisions.
Create a OneTime multi-decision Metropolis-Hastings sampler using the given number of samples, proposal maker, burn in time, given target utilities, and target decisions.
proposalMaker
A function that specifies how to create a proposal for each decision in the target list
def apply(numSamples: Int, proposalMaker: ProposalMakerType, utilityNodes: List[Element[_]], targets: Decision[_, _]*)(implicit universe: Universe): OneTimeMultiDecisionMetropolisHastings

Create a OneTime multi-decision Metropolis-Hastings sampler using the given number of samples, proposal maker, given target utilities, and target decisions.
Create a OneTime multi-decision Metropolis-Hastings sampler using the given number of samples, proposal maker, given target utilities, and target decisions.
proposalMaker
A function that specifies how to create a proposal for each decision in the target list
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package decision

object MultiDecisionMetropolisHastings

Type Members

type ProposalMakerType = (Universe, Element[_]) ⇒ ProposalScheme

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(numSamples: Int, proposalMaker: ProposalMakerType, burnIn: Int, interval: Int, utilityNodes: List[Element[_]], targets: Decision[_, _]*)(implicit universe: Universe): OneTimeMultiDecisionMetropolisHastings

def apply(numSamples: Int, proposalMaker: ProposalMakerType, burnIn: Int, utilityNodes: List[Element[_]], targets: Decision[_, _]*)(implicit universe: Universe): OneTimeMultiDecisionMetropolisHastings

def apply(numSamples: Int, proposalMaker: ProposalMakerType, utilityNodes: List[Element[_]], targets: Decision[_, _]*)(implicit universe: Universe): OneTimeMultiDecisionMetropolisHastings

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped