On Locality Sensitive Hashing for Sampling Extent Generators

In this article we introduce a method for sampling formal concepts using locality sensitive hashing (LSH). LSH is a technique used for finding approximate nearest neighbours given a set of hashing functions. Through our approach, we are able to predict the probability of an extent in the concept lattice given set of objects and their similarity index, a generalization of the Jaccard similarity between sets. Our approach allows defining a lattice-based amplification construction to design arbitrarily discriminative sampling settings.

[1]  Víctor Codocedo,et al.  A Proposition for Combining Pattern Structures and Relational Concept Analysis , 2014, ICFCA.

[2]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

[3]  Sergei O. Kuznetsov,et al.  On stability of a formal concept , 2007, Annals of Mathematics and Artificial Intelligence.

[4]  Aleksey Buzmakov,et al.  Revisiting Pattern Structure Projections , 2015, ICFCA.

[5]  Anand Rajaraman,et al.  Mining of Massive Datasets , 2011 .

[6]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[7]  Jiawei Han,et al.  Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[8]  Andrei Z. Broder,et al.  On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[9]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .