排序方式： 共有75条查询结果，搜索用时 15 毫秒
1.
Eero Sormunen 《Information Retrieval》2001,4(3-4):257-273
The STAIRS study conducted by Blair and Maron in the mid-80's is a milestone in the history of IR evaluation. Blair and Maron made strong conclusion about the inadequacy of free-text searching large databases, and their study has been widely referred in the literature to justify the problems of effectiveness in IR systems. However, some critics of the study have plausibly pointed out that the ineffectiveness conclusions were not solidly based on empirical data.This paper introduces a new theoretical and empirical approach to study the problems of high recall searching in large databases and reports the results of a case experiment. The findings verify some of the hypothetical conclusions introduced in the STAIRS study, and expands the picture of falling performance. It is shown that low precision in high recall searching is unavoidable in exact-match Boolean searching since even major concepts are often expressed implicitly in relevant documents. The author suggests that the problem could be reduced in facet-based best-match searching. 相似文献
2.
近几年来国外信息检索模型研究进展 总被引：2，自引：0，他引：2
信息检索模型是信息检索的核心.近几年来国外对于布尔模型的研究主要表现在对布尔模型的改进及对扩展布尔模型的进一步优化.对向量空间模型的研究,主要集中在对向量空间模型的扩展研究及对向量空间模型的应用方面.概率模型的发展主要集中在继续对概率模型进一步的研究,其与其它信息检索模型的结合,以及语言模型的研究和发展.近年来对于新兴的基于本体的信息检索模型的研究,主要集中在对基于本体的信息检索模型理论的研究,与其它检索模型的融合,以及基于本体检索模型的应用.国外信息检索模型研究的最新成果,为国内此方面的研究提供了前沿性的参考信息. 相似文献
3.
本文讨论了二进数所成的布尔代数以及它与X幂集P(X)所成的布尔代数之间的同构关系，利用其解决关于子集的交集、并集的计数问题，关于交错k-子集的计数问题和关于交错R-子集的计数定理。 相似文献
4.
王保社 《咸阳师范学院学报》2004,19(4):11-13
研究了每一个元都是布尔元的R0代数，用等式刻划了其特征，证明了如下结果：R0代数M的每一个元都是布尔元的充要条件是M为布尔代数。并给出一个反例说明：R0代数的所有布尔元一般不能构成MP滤子。 相似文献
5.
The Inductive Query By Example (IQBE) paradigm allows a system to automatically derive queries for a specific Information Retrieval System (IRS). Classic IRSs based on this paradigm [Smith, M., & Smith, M. (1997). The use of genetic programming to build Boolean queries for text retrieval through relevance feedback. Journal of Information Science, 23(6), 423–431] generate a single solution (Boolean query) in each run, that with the best fitness value, which is usually based on a weighted combination of the basic performance criteria, precision and recall. 相似文献
6.
针对密码学中布尔函数的代数免疫性,从代数攻击中超定义代数方程的构造出发,利用线性反馈移位寄存器和超定义方程的特点,分析了布尔函数f(x)的代数免疫性和h(x)的代数免疫性之间的关系,提出了布尔函数代数免疫的新特征和衡量布尔函数代数免疫稳定性的新指标。 相似文献
7.
Trivium密码算法是欧洲流密码计划(eSTREAM)的最终入选算法之一.由于其结构简洁、优美、软硬件实现快速、安全性好等特点,倍受学术界和工业界的广泛关注.针对Trivium密码算法实际教学中存在的问题及信息专业高年级学生的特点,分析了Trivium算法的结构,提出从布尔函数的角度来进行教学设计,包括算法部件分析、加解密过程、性能及安全性等环节,为同行提供有价值的教学思路. 相似文献
8.
Ronald Rousseau 《情报学报》2006,25(5):580-586
网络信息检索中,逻辑运算符AND连接检索词的顺序很大程度上会影响检索效率.论文首先分析、介绍了the Staceys测度方法在改善AND检索效率中发挥的作用,并在此基础上提出简化了的测度算法,最后通过实例说明其实现步骤. 相似文献
9.
高元明 《温州职业技术学院学报》2013,(2):58-61
概率布尔网络是布尔网络的拓展。布尔网络和概率布尔网络已经广泛应用于生物系统模拟中。运用马尔科夫链模拟概率布尔网络的动态行为及采用消除趋势波动分析（DFA）方法,分析概率布尔网络的长程相关性特性发现,概率布尔网络的动态行为具有长程相关性,大部分概率布尔网络能呈现1/f波动,且产生1/f波动的噪声值和范围比布尔网络的大。 相似文献
10.
Tony Russell-Rose Jon Chamberlain Leif Azzopardi 《Information processing & management》2018,54(6):1042-1057
Legal researchers, recruitment professionals, healthcare information professionals, and patent analysts all undertake work tasks where search forms a core part of their duties. In these instances, the search task is often complex and time-consuming and requires specialist expertise to identify relevant documents and insights within large domain-specific repositories and collections. Several studies have been made investigating the search practices of professionals such as these, but few have attempted to directly compare their professional practices and so it remains unclear to what extent insights and approaches from one domain can be applied to another. In this paper we describe the results of a survey of a purposive sample of 108 legal researchers, 64 recruitment professionals and 107 healthcare information professionals. Their responses are compared with results from a previous survey of 81 patent analysts. The survey investigated their search practices and preferences, the types of functionality they value, and their requirements for future information retrieval systems. The results reveal that these professions share many fundamental needs and face similar challenges. In particular a continuing preference to formulate queries as Boolean expressions, the need to manage, organise and re-use search strategies and results and an ambivalence toward the use of relevance ranking. The results stress the importance of recall and coverage for the healthcare and patent professionals, while precision and recency were more important to the legal and recruitment professionals. The results also highlight the need to ensure that search systems give confidence to the professional searcher and so trust, explainability and accountability remains a significant challenge when developing such systems. The findings suggest that translational research between the different areas could benefit professionals across domains. 相似文献