Information retrieval in the workplace: A comparison of professional search practices     

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.  相似文献   

A study of results overlap and uniqueness among major Web search engines     

Amanda Spink  Bernard J. Jansen  Chris Blakely  Sherry Koshman 《Information processing & management》2006

The performance and capabilities of Web search engines is an important and significant area of research. Millions of people world wide use Web search engines very day. This paper reports the results of a major study examining the overlap among results retrieved by multiple Web search engines for a large set of more than 10,000 queries. Previous smaller studies have discussed a lack of overlap in results returned by Web search engines for the same queries. The goal of the current study was to conduct a large-scale study to measure the overlap of search results on the first result page (both non-sponsored and sponsored) across the four most popular Web search engines, at specific points in time using a large number of queries. The Web search engines included in the study were MSN Search, Google, Yahoo! and Ask Jeeves. Our study then compares these results with the first page results retrieved for the same queries by the metasearch engine Dogpile.com. Two sets of randomly selected user-entered queries, one set was 10,316 queries and the other 12,570 queries, from Infospace’s Dogpile.com search engine (the first set was from Dogpile, the second was from across the Infospace Network of search properties were submitted to the four single Web search engines). Findings show that the percent of total results unique to only one of the four Web search engines was 84.9%, shared by two of the three Web search engines was 11.4%, shared by three of the Web search engines was 2.6%, and shared by all four Web search engines was 1.1%. This small degree of overlap shows the significant difference in the way major Web search engines retrieve and rank results in response to given queries. Results point to the value of metasearch engines in Web retrieval to overcome the biases of individual search engines.  相似文献   

四种搜索引擎的比较研究   总被引：12，自引：0，他引：12  

陈继红  青晓 《情报科学》2003,21(10):1084-1087

本文对目前常用的4种中文搜索引擎：Google、百度、天网、Openfind的索引数据库收录范围、检索功能、检索结果显示格式、用户界面等方面进行了比较分析，并指出它们各自的优势与不足。  相似文献   

基于数据可重用的运动估计低功耗VLSI实现     

伊蔚  金文光  沈建民  周斌 《科技通报》2006,22(6):855-859

块匹配全局搜索算法(FSBM)是效果最好的运动估计算法,但是由于它庞大的运算量限制了它的应用,特别是在数字多媒体终端等对实时性和功耗要求比较高的应用场合。针对这种情况,作者提出的处理结构结合了数据重用和低功耗技术,使得该结构的功耗比传统的全局搜索结构降低50%的功耗,数据可重用性大为提高,确保了每个数据只需被读取一次,这样就确保了较少的I/O端口数和片上内存,同时实现100%的硬件资源利用率。  相似文献   

网络计量学   总被引：19，自引：0，他引：19  

徐久龄  许莲莲 《情报科学》2002,20(1):62-65

本文回顾了计量学的产生和发展的历程，指出在网络环境下网络计量学产生的必然性。并着重探讨了网络计量学的主要特征、研究方法、研究对象范围和在网络环境中的应用。  相似文献   

Comparing rankings of search results on the Web   总被引：1，自引：0，他引：1  

Judit Bar-Ilan   《Information processing & management》2005,41(6):1511-1519

The Web has become an information source for professional data gathering. Because of the vast amounts of information on almost all topics, one cannot systematically go over the whole set of results, and therefore must rely on the ordering of the results by the search engine. It is well known that search engines on the Web have low overlap in terms of coverage. In this study we measure how similar are the rankings of search engines on the overlapping results.We compare rankings of results for identical queries retrieved from several search engines. The method is based only on the set of URLs that appear in the answer sets of the engines being compared. For comparing the similarity of rankings of two search engines, the Spearman correlation coefficient is computed. When comparing more than two sets Kendall’s W is used. These are well-known measures and the statistical significance of the results can be computed. The methods are demonstrated on a set of 15 queries that were submitted to four large Web search engines. The findings indicate that the large public search engines on the Web employ considerably different ranking algorithms.  相似文献   

利用网络日志分析提高搜索引擎的检准率   总被引：2，自引：0，他引：2  

葛蓉 《情报科学》2004,22(10):1250-1253

本文详细介绍了搜索引擎的发展现状和网络日志分析技术。在此基础上。探讨了如何利用网络日志分析提高搜索引擎的检准率。  相似文献   

Facing and bridging gaps in Web searching     

Reijo Savolainen  Jarkko Kari 《Information processing & management》2006

Drawing on the ideas of the Sense-Making approach, the ways in which people face and bridge gaps in Web searching are analyzed. The empirical study is based on videotaped Web searches conducted by seven participants. Altogether 11 gaps and 13 search tactics of various types were identified. The gaps faced by the searchers originated from three major factors: problematic content of information, insufficient search competence and problems caused by the search environment. Of individual gaps, no relevant material available, inaccessible content and confusion were most frequent. Of the search tactics used in gap-bridging, following links and activating the Back button were most popular. Gaps related to the problematic content of information led the informants to redirect the search to find Web pages that focus better on the search topic. If the movement was stopped by insufficient search competence, the searchers tended to return to material that was familiar from earlier use contexts in order to regain control of the search process. Alternatively, they tried to specify the search terms. In cases where the search was interrupted by technical problems or other factors originating from the search system, gap-bridging aimed at returning to familiar and technically reliable links. The Sense-Making theory provides relevant conceptual tools to approach the dynamic and discontinuous nature of Web searching in terms of gap-facing and gap-bridging. The concept of gap-facing enables a context-sensitive analysis of the ways in which Web search processes may be stopped. Gap-bridging indicates a general level motive to find alternative ways to continue searching.  相似文献   

搜索引擎的选择与检索策略   总被引：8，自引：0，他引：8  

卢晓勤 《情报科学》2002,20(4):418-420

本文根据目前国内外搜索引擎研究状况，针对搜索引擎中出现的问题，提出了搜索引擎的选择方法，及利用技巧和策略。  相似文献   

Automated Latent Growth Curve Model Fitting: A Segmentation and Knot Selection Approach     

Katerina M. Marcoulides 《Structural equation modeling》2018,25(5):687-699

Latent growth curve models are widely used in the social and behavioral sciences to study complex developmental patterns of change over time. The trajectories of these developmental patterns frequently exhibit distinct segments in the studied variables. Latent growth models with piecewise functions for repeated measurements of variables have become increasingly popular for modeling such developmental trajectories. A major problem with using piecewise models is determining the precise location of the point where the change in the process has occurred and uncovering the related number of segments. The purpose of this paper is to introduce an optimization procedure that can be used to determine both the segments and location of the knots in piecewise linear latent growth models. The procedure is illustrated using empirical data in order to detect the number of segments and change points. The results demonstrate the capabilities of the procedure for fitting latent growth curve models.  相似文献