Space efficient mining of multigraph streams

155 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) (2014, neutral): “1Initially submitted in Feb. 2014.”
Asymmetric Minwise Hashing for Indexing Binary Inner Products and Set Containment (2015, background): “Later, because of its locality sensitive property [22], minhash became a widely used hash function for creating hash buckets leading to efficient algorithms for numerous applications including spam detection [6], collaborative filtering [4], news personalization [15], compressing social networks [13”
Asymmetric Minwise Hashing (2014, background): “…for creating hash buckets leading to efﬁcient algorithms for numerous applications including spam detection [6], collaborative ﬁltering [4], news personalization [15], compressing social networks [13], graph sampling [14], record linkage [24], duplicate detection [20], all pair similarity [5], etc.”
Graph stream algorithms: a survey (2014, background): “Other problems such as estimating the number of triangles or distinct paths of length two require new ideas when edges have multiplicity [21, 38].”
Min-Max Kernels (2015, methodology): “In contrast, the resemblance kernel (2) has been widely used in practice on binary (or binarized) data [4, 5, 28, 9, 26, 7, 6, 11, 8, 16, 13, 1].”