Skip to main content

Algorithm to compress sparse binary data

Project description

Compression Techniques for sparse binary data

In Development



from BinHash import hasher
corpus = 'path_to_the_folder_containing_documents'
d = 10000
k = 500
myhasher = hasher(corpus, d, k)
sample_text = "this is a sample text"
sample_hash = myhasher.hash_text(sample_text)


Please cite these papers in your publications if it helps your research

  author    = {Rameshwar Pratap and
               Ishan Sohony and
               Raghav Kulkarni},
  title     = {Efficient Compression Technique for Sparse Sets},
  booktitle = {Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia
               Conference, {PAKDD} 2018, Melbourne, VIC, Australia, June 3-6, 2018,
               Proceedings, Part {III}},
  pages     = {164--176},
  year      = {2018},
  crossref  = {DBLP:conf/pakdd/2018-3},
  url       = {\_14},
  doi       = {10.1007/978-3-319-93040-4\_14},
  timestamp = {Tue, 19 Jun 2018 09:13:55 +0200},
  biburl    = {},
  bibsource = {dblp computer science bibliography,}

 author    = {Rameshwar Pratap and
               Raghav Kulkarni and
		Ishan Sohony},
  title     = {Efficient Dimensionality Reduction for Sparse Binary Data},
  booktitle = {IEEE International Conference on BIG DATA, Accepted},
  year      = {2018}

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

binhash-0.2.3.tar.gz (2.9 kB view hashes)

Uploaded source

Built Distribution

binhash-0.2.3-py3-none-any.whl (4.1 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page