|| TrustGeekOne ||

Tag: python

  • Simple Neural Network for absolute beginners

    This is my first post regarding artificial intelligence (AI). But I promise to include as much as I can from understanding Simple Neural Network (NN) to deep learning through little theoretical but lots of practical implementations. I will also include simple projects where possible. Lets begin building then.

    I like Python a lot so most of the works will be done in Python. Later on I am hoping to develop them in Java and Scala.

    To learn NN we will not be using any NN libraries but some mathematical libraries, ie. numpy.

    Learn basics of Numpy HERE .

    To begin building NN which is supposed to mimic how our brain works, we have to understand little bit of our own Brain.

    An averaged sized Brain includes of 100 billion neurons connected by synapses. Neurons are the basic unit of brain which plays major role for all the tasks done by brain.  Blah blah blah… its better you go through this well written article (A Basic Introduction To Neural Networks).

    This tutorial we will be building a Artificial unit of this very Neuron. I consider you know matrices which we will be using as mathematical foundation for building NN with numpy.

    Our simple ANN will include three inputs and a output. (Input: 3, Output: 1). This neuron we will build should classify a basic problem of classification. We will use various different training algorithms to train our neuron for classification.

    So our neuron will have very small dataset for training (a deeplearning model will need very very large dataset for better performance) which will be enough in this problem.

    Example#Input AInput BInput COutput Y
    10010
    21111
    31011
    40110
    5100??? (1 expected)

    So what will be the output for the last data row (Row #5)?.

    (more…)

  • Bloom filter – Python

    A Bloom Filter is a space-efficient probabilistic data structure, to test whether an element is a member of a set. This algorithm for data representation ensures the element is in the dataset or not. This may have false positive matches but not false negative result.

    The most common use of Bloom Filter Algorithm is to see if an elements is in the disk before performing any operations. This reduces the I/O for lookups dramatically over large datasets.

    Consider we have to check a email address to search from large dataset of emails of millions. Searching all the emails in memory definitely is very inefficient and takes lots of time. We can create bloom filter bit array, which is very small compared to the original dataset and has almost same required result. This is what used in Yahoo Mail. When you log into Yahoo mail, the browser page requests a bloom filter representing your contact list from Yahoo servers. The Bloom Filter is compact and easily fits in your browser cache. In Yahoo, email is verified if it is in existed in your contact list.

    Another scenario, consider we have to get unique counts in the dataset, then we can use bloom filter to test if certain pattern or element has already been seen or not in the dataset. Of course this creates some false positives, but this might be much efficient than to compare everything from the memory.

    Apache HBase uses bloom filter to boost read speed by filtering out unnecessary disk reads of HFile blocks which do not contain a particular row or column.

    Quora implemented a sharded bloom filter in the feed backend to filter out stories that people have seen before. It is much faster and more memory efficient than previous solutions (Redis, Tokyo Cabinet and DB) and saves hundreds of ms on certain types of requests.(Tao Xu, Engineer at Quora)

    Transactional Memory (TM) has recently applied Bloom filters to detect memory access conflicts among threads.(Mark Jeffrey, modeled Bloom filters for concurrency conflict detection).

    Not to mention Facebook ( Typeahead Search Tech Talk (6/15/2010) ),, LinkedIn ( Cleo: the open source technology behind LinkedIn’s typeahead search | LinkedIn Engineering),  Bit.ly (dablooms – an open source, scalable, counting bloom filter library ) have implemented their own Bloom Filter.

    More examples ? Go here https://en.wikipedia.org/wiki/Bloom_filter#Examples

    Ok then, enough of the usage of Bloom Filter. We will be developing our own for searching email address from a list in Python.

    (more…)