An optimal search strategy based on user preferences for choice oriented databases

IF 1.8 4区 管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Rairo-Operations Research Pub Date : 1998-01-01 DOI:10.1051/RO/1998320100011
James C. Moore, William B. Richmond, Andrew Whinston
{"title":"An optimal search strategy based on user preferences for choice oriented databases","authors":"James C. Moore, William B. Richmond, Andrew Whinston","doi":"10.1051/RO/1998320100011","DOIUrl":null,"url":null,"abstract":"In many instances, when people search a database, they are searching for a best record instead of record with a particular set of characteristics. Using boolean queries to develop a search strategy to find a best record has proven too difficult, especially for novice users. We construct an optimal decision strategy for finding the best available alternative that takes into account both the expected value of continued search and the cost of search. The optimal strategy is intuitively appealing, and can be used as the basis for heuristics in more complex environments.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"70 6 1","pages":"1-32"},"PeriodicalIF":1.8000,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Rairo-Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1051/RO/1998320100011","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In many instances, when people search a database, they are searching for a best record instead of record with a particular set of characteristics. Using boolean queries to develop a search strategy to find a best record has proven too difficult, especially for novice users. We construct an optimal decision strategy for finding the best available alternative that takes into account both the expected value of continued search and the cost of search. The optimal strategy is intuitively appealing, and can be used as the basis for heuristics in more complex environments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向选择数据库的基于用户偏好的最优搜索策略
在许多情况下,当人们搜索数据库时,他们搜索的是最佳记录,而不是具有特定特征集的记录。使用布尔查询来开发搜索策略以找到最佳记录已被证明过于困难,特别是对于新手用户。我们构建了一个寻找最佳可选方案的最优决策策略,该策略同时考虑了持续搜索的期望值和搜索的成本。最优策略具有直观的吸引力,可以作为更复杂环境中启发式的基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Rairo-Operations Research
Rairo-Operations Research 管理科学-运筹学与管理科学
CiteScore
3.60
自引率
22.20%
发文量
206
审稿时长
>12 weeks
期刊介绍: RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.
期刊最新文献
Interval-valued picture fuzzy aggregation information based on Frank operators and their application in group decision making 2-power domination number for Knodel graphs and its application in communication networks An exact second order cone programming approach for traffic assignment problems Portfolio optimization based on bi-objective linear programming Analysis of a renewal arrival process subject to geometric catastrophe with random batch killing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1