IEICE TRANSACTIONS on transactions
Conjunctive Cases of Simple Binary-Valued Retrieval Problems for the Trade-offs Evaluation Model
Summary :
Trade-offs between storage and error in the simple binary-valued retrieval problems are analyzed by using the rate distortion theoretic method from the viewpoint of the trade-offs evaluation model. These problems, the table lookup question, the exact match question, and the set of all binary-valued questions, have been proposed as the typical basic model of the information retrieval systems to evaluate the memory cost, the access cost, the state cost, the logic cost, and their relationships. The evaluation critera of memory-error trade-offs are the elastic condition and the excess of information. The former means that drastic savings of the amount of storage with a small error tolerance is feasible. The latter means the measure to evaluate the degree of the possibility for the system to achieve elastic condition. As a result, although the set of all binary-valued questions admits the possible highest excess of information, its statistical property is almost equivalent to that of the table lookup question, and only the exact match question satisfies the elastic condition. Furthermore, considering the conjunctive model which means the combination of each questions for the basic model, the property of elasticity or inelasticity for the basic model is changed from that of the basic model in accordance with the degree of the combination of the questions.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E72-E No.5 pp.471-478
- Publication Date
- 1989/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Information Theory and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroshige INAZUMI, Shigeichi HIRASAWA, "Conjunctive Cases of Simple Binary-Valued Retrieval Problems for the Trade-offs Evaluation Model" in IEICE TRANSACTIONS on transactions,
vol. E72-E, no. 5, pp. 471-478, May 1989, doi: .
Abstract: Trade-offs between storage and error in the simple binary-valued retrieval problems are analyzed by using the rate distortion theoretic method from the viewpoint of the trade-offs evaluation model. These problems, the table lookup question, the exact match question, and the set of all binary-valued questions, have been proposed as the typical basic model of the information retrieval systems to evaluate the memory cost, the access cost, the state cost, the logic cost, and their relationships. The evaluation critera of memory-error trade-offs are the elastic condition and the excess of information. The former means that drastic savings of the amount of storage with a small error tolerance is feasible. The latter means the measure to evaluate the degree of the possibility for the system to achieve elastic condition. As a result, although the set of all binary-valued questions admits the possible highest excess of information, its statistical property is almost equivalent to that of the table lookup question, and only the exact match question satisfies the elastic condition. Furthermore, considering the conjunctive model which means the combination of each questions for the basic model, the property of elasticity or inelasticity for the basic model is changed from that of the basic model in accordance with the degree of the combination of the questions.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_5_471/_p
Copy
@ARTICLE{e72-e_5_471,
author={Hiroshige INAZUMI, Shigeichi HIRASAWA, },
journal={IEICE TRANSACTIONS on transactions},
title={Conjunctive Cases of Simple Binary-Valued Retrieval Problems for the Trade-offs Evaluation Model},
year={1989},
volume={E72-E},
number={5},
pages={471-478},
abstract={Trade-offs between storage and error in the simple binary-valued retrieval problems are analyzed by using the rate distortion theoretic method from the viewpoint of the trade-offs evaluation model. These problems, the table lookup question, the exact match question, and the set of all binary-valued questions, have been proposed as the typical basic model of the information retrieval systems to evaluate the memory cost, the access cost, the state cost, the logic cost, and their relationships. The evaluation critera of memory-error trade-offs are the elastic condition and the excess of information. The former means that drastic savings of the amount of storage with a small error tolerance is feasible. The latter means the measure to evaluate the degree of the possibility for the system to achieve elastic condition. As a result, although the set of all binary-valued questions admits the possible highest excess of information, its statistical property is almost equivalent to that of the table lookup question, and only the exact match question satisfies the elastic condition. Furthermore, considering the conjunctive model which means the combination of each questions for the basic model, the property of elasticity or inelasticity for the basic model is changed from that of the basic model in accordance with the degree of the combination of the questions.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Conjunctive Cases of Simple Binary-Valued Retrieval Problems for the Trade-offs Evaluation Model
T2 - IEICE TRANSACTIONS on transactions
SP - 471
EP - 478
AU - Hiroshige INAZUMI
AU - Shigeichi HIRASAWA
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 5
JA - IEICE TRANSACTIONS on transactions
Y1 - May 1989
AB - Trade-offs between storage and error in the simple binary-valued retrieval problems are analyzed by using the rate distortion theoretic method from the viewpoint of the trade-offs evaluation model. These problems, the table lookup question, the exact match question, and the set of all binary-valued questions, have been proposed as the typical basic model of the information retrieval systems to evaluate the memory cost, the access cost, the state cost, the logic cost, and their relationships. The evaluation critera of memory-error trade-offs are the elastic condition and the excess of information. The former means that drastic savings of the amount of storage with a small error tolerance is feasible. The latter means the measure to evaluate the degree of the possibility for the system to achieve elastic condition. As a result, although the set of all binary-valued questions admits the possible highest excess of information, its statistical property is almost equivalent to that of the table lookup question, and only the exact match question satisfies the elastic condition. Furthermore, considering the conjunctive model which means the combination of each questions for the basic model, the property of elasticity or inelasticity for the basic model is changed from that of the basic model in accordance with the degree of the combination of the questions.
ER -
English
