A1 Refereed original research article in a scientific journal
Information retrieval and the average number of input clues
Authors: Laihonen T
Publisher: AMER INST MATHEMATICAL SCIENCES-AIMS
Publication year: 2017
Journal: Advances in Mathematics of Communications
Journal name in source: ADVANCES IN MATHEMATICS OF COMMUNICATIONS
Journal acronym: ADV MATH COMMUN
Volume: 11
Issue: 1
First page : 203
Last page: 223
Number of pages: 21
ISSN: 1930-5346
eISSN: 1930-5338
DOI: https://doi.org/10.3934/amc.2017013
Abstract
Information retrieval in an associative memory was introduced in a recent paper by Yaakobi and Bruck. The associative memory is represented by a graph where the vertices correspond to the stored information units and the edges to associations between them. The goal is to find a stored information unit in the memory using input clues. In this paper, we study the minimum average number of input clues needed to find the sought information unit in the infinite king grid. We provide a geometric approach to determine the minimum number of input clues. Using this approach we are able to find optimal results and bounds on the number of input clues. The model by Yaakobi and Bruck has also applications to sensor networks monitoring and Levenshtein's sequence reconstruction problem.
Information retrieval in an associative memory was introduced in a recent paper by Yaakobi and Bruck. The associative memory is represented by a graph where the vertices correspond to the stored information units and the edges to associations between them. The goal is to find a stored information unit in the memory using input clues. In this paper, we study the minimum average number of input clues needed to find the sought information unit in the infinite king grid. We provide a geometric approach to determine the minimum number of input clues. Using this approach we are able to find optimal results and bounds on the number of input clues. The model by Yaakobi and Bruck has also applications to sensor networks monitoring and Levenshtein's sequence reconstruction problem.
UTU Research Portal