Vincent Gripon's Homepage

Research and Teaching Blog

Finding All Matches in a Database using Binary Neural Networks

G. B. Hacene, V. Gripon, N. Farrugia, M. Arzel and M. Jezequel, "Finding All Matches in a Database using Binary Neural Networks," in Proceedings of Cognitive, pp. 59--64, February 2017.

The most efficient architectures of associative memories are based on binary neural networks. As example, Sparse Clustered Networks (SCNs) are able to achieve almost optimal memory efficiency while providing robust indexation of pieces of information through cliques in a neural network. In the canonical formulation of the associative memory problem, the unique stored message matching a given input probe is to be retrieved. In this paper, we focus on the more general problem of finding all messages matching the given probe. We consider real datasets from which many different messages can match given probes, which cannot be done with uniformly distributed messages due to their unlikelyhood of sharing large common parts with one another. Namely, we implement a crossword dictionary containing 8-letter english words, and a chess endgame dataset using associative memories based on binary neural networks. We explain how to adapt SCNs’ architecture to this challenging dataset and introduce a backtracking procedure to retrieve all completions of the given input. We stress the performance of the proposed method using different measures and discuss the importance of parameters.

Download manuscript.

Bibtex
@inproceedings{HacGriFarArzJez201702,
  author = {Ghouthi Boukli Hacene and Vincent Gripon
and Nicolas Farrugia and Matthieu Arzel and Michel
Jezequel},
  title = {Finding All Matches in a Database using
Binary Neural Networks},
  booktitle = {Proceedings of Cognitive},
  year = {2017},
  pages = {59--64},
  month = {February},
}




You are the 531278th visitor

Vincent Gripon's Homepage