| Package | Description |
|---|---|
| org.aika.network.neuron | |
| org.aika.network.neuron.lattice |
| Modifier and Type | Field and Description |
|---|---|
TreeMap<InputNode.Key,InputNode> |
Neuron.outputNodes |
| Modifier and Type | Method and Description |
|---|---|
InputNode |
Synapse.getRefinement() |
| Modifier and Type | Class and Description |
|---|---|
class |
NegativeInputNode |
class |
PositiveInputNode |
| Modifier and Type | Field and Description |
|---|---|
TreeMap<InputNode,AndNode> |
Node.andChildren |
TreeMap<InputNode,AndNode> |
Node.andChildrenWithinDocument |
SortedMap<InputNode,Node> |
AndNode.parents |
| Modifier and Type | Method and Description |
|---|---|
static InputNode |
InputNode.add(Neuron input,
boolean isNeg,
int posDelta,
Integer deactivationCount) |
| Modifier and Type | Method and Description |
|---|---|
static SortedMap<InputNode,Node> |
AndNode.computeParents(Set<InputNode> inputs) |
static Map<InputNode,Set<Synapse>> |
Node.computePredefinedInputNodes(Neuron n,
Set<Node> outputs,
Set<Synapse> inputs) |
| Modifier and Type | Method and Description |
|---|---|
static void |
AndNode.addActivationsToNextLevelPattern(Iteration t,
LatticeQueue queue,
Node firstNode,
Node secondNode,
InputNode refinement,
Activation act,
Option conflict) |
static void |
AndNode.createNextLevelPattern(Iteration t,
LatticeQueue queue,
Node firstNode,
InputNode refinement) |
static void |
AndNode.processCandidate(Iteration t,
LatticeQueue queue,
Node firstNode,
Node secondNode,
InputNode refinement,
Activation act,
Option conflict,
boolean train) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
OrNode.collectNodeAndRefinements(Set<InputNode> inputs) |
protected abstract void |
Node.collectNodeAndRefinements(Set<InputNode> inputs) |
protected void |
InputNode.collectNodeAndRefinements(Set<InputNode> inputs) |
protected void |
AndNode.collectNodeAndRefinements(Set<InputNode> inputs) |
boolean |
Node.computeAndParents(SortedSet<InputNode> inputs,
Map<InputNode,Node> parents,
Set<Node> visited) |
boolean |
Node.computeAndParents(SortedSet<InputNode> inputs,
Map<InputNode,Node> parents,
Set<Node> visited) |
static SortedMap<InputNode,Node> |
AndNode.computeParents(Set<InputNode> inputs) |
static Map<AndNode,Set<Synapse>> |
Node.computePredefinedSecondLevelAndNodes(Neuron n,
Set<Node> outputs,
Map<InputNode,Set<Synapse>> previousLevel) |
| Constructor and Description |
|---|
AndNode(int level,
SortedMap<InputNode,Node> parents) |
Copyright © 2016. All rights reserved.