densified_wta_hash

Documentation

Overview

Implementation of Densified Winner Take All (WTA) hash

Algorithm from the paper:

Densified Winner Take All (WTA) Hashing for Sparse Datasets
Beidi Chen, Anshumali Shrivastava
http://auai.org/uai2018/proceedings/papers/321.pdf

Index

• type DensifiedWtaHash
  • func New(numHashes, numOfBitsToHash int) *DensifiedWtaHash
  • func (dw *DensifiedWtaHash) GetHash(data []index_value.Pair) []int
  • func (dw *DensifiedWtaHash) GetHashEasy(data []float64, topK int) []int
  • func (dw *DensifiedWtaHash) GetRandDoubleHash(binId, count int) int

Types

type DensifiedWtaHash

type DensifiedWtaHash struct {
	// contains filtered or unexported fields
}

func New

func New(numHashes, numOfBitsToHash int) *DensifiedWtaHash

func (*DensifiedWtaHash) GetHash

func (dw *DensifiedWtaHash) GetHash(data []index_value.Pair) []int

func (*DensifiedWtaHash) GetHashEasy

func (dw *DensifiedWtaHash) GetHashEasy(data []float64, topK int) []int

func (*DensifiedWtaHash) GetRandDoubleHash

func (dw *DensifiedWtaHash) GetRandDoubleHash(binId, count int) int