Slashing Deep Learning Speed With Hashing

An old trick Hashing taking advantage of tjr inherent sparsity in Big Data to reduce 90% time without loss of > 1% accuracy in data.

For examples : in picture recognition, many data are blanks consists of background (scenario,  lighting), only less than 10% are striking pattern data which characterise the particular objects, like zebra trait, tiger body skin lines, elephant trunk, sunflower… when search data are stored in a matrix of billion columns and rows, 90% elements are 0.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s