Communities and Collections

Posts

Post has attachment

**The Genetic Algorithm - Explained**

Paradigm of Evolution Every organism contains an array of characteristics - called the DNA, when 2 parents mate they create a unique child that contains a mixture of the parents DNA, depending on how fit for survival the child is, will determine if those tr...

Add a comment...

Post has attachment

**Bloom Filters - Explained**

The Bloom filter is a space efficient, probabilistic data structure, designed to test the membership of elements to a set. The trade-off for being a space efficient data structure is it may return false positives, but always returns definite negatives: Mean...

Add a comment...

Post has attachment

**Neural Network Illustrated – Step by Step**

Neural Network Illustrated – Step by Step I1 and I2 are the inputs scaled to [-1,1] or [0, 1], depending on the activation function f() =Activation Function=Tanh(), Sigmoid() or any differential-able function W =Current neurons input weights, initialized ra...

Add a comment...

Post has attachment

**Markov Chains - Explained**

Markov Chains - Explained Markov Chains is a probabilistic process, that relies on the current state to predict the next state. For Markov chains to be effective the current state has to be dependent on the previous state in some way; For instance, from exp...

Add a comment...

Post has attachment

**Bloom Filters - Explained**

Bloom Filters - Explained The Bloom filter is a space efficient, probabilistic data structure - used to test whether an item does not belong to a collection. Most people use the definition that it tests whether an item is in a collection, but I think the la...

Add a comment...

Wait while more posts are being loaded