Search (7 results, page 1 of 1)

0.018976543 = product of:
  0.047441356 = sum of:
    0.023788773 = product of:
      0.047577545 = sum of:
        0.047577545 = weight(_text_:problems in 607) [ClassicSimilarity], result of:
          0.047577545 = score(doc=607,freq=6.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.31594402 = fieldWeight in 607, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.03125 = fieldNorm(doc=607)
      0.5 = coord(1/2)
    0.023652581 = product of:
      0.047305163 = sum of:
        0.047305163 = weight(_text_:etc in 607) [ClassicSimilarity], result of:
          0.047305163 = score(doc=607,freq=2.0), product of:
            0.19761753 = queryWeight, product of:
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.036484417 = queryNorm
            0.23937736 = fieldWeight in 607, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.03125 = fieldNorm(doc=607)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Purpose Belkin and Robertson (1976a) reflected on the ethical implications of theoretical research in information science and warned that there was potential for abuse of knowledge gained by undertaking such research and applying it to information systems. In particular, they identified the domains of advertising and political propaganda that posed particular problems. The purpose of this literature review is to revisit these ideas in the light of recent events in global information systems that demonstrate that their fears were justified. Design/methodology/approach The authors revisit the theory in information science that Belkin and Robertson used to build their argument, together with the discussion on ethics that resulted from this work in the late 1970s and early 1980s. The authors then review recent literature in the field of information systems, specifically information retrieval, social media and recommendation systems that highlight the problems identified by Belkin and Robertson. Findings Information science theories have been used in conjunction with empirical evidence gathered from user interactions that have been detrimental to both individuals and society. It is argued in the paper that the information science and systems communities should find ways to return control to the user wherever possible, and the ways to achieve this are considered. Research limitations/implications The ethical issues identified require a multidisciplinary approach with research in information science, computer science, information systems, business, sociology, psychology, journalism, government and politics, etc. required. This is too large a scope to deal with in a literature review, and we focus only on the design and implementation of information systems (Zimmer, 2008a) through an information science and information systems perspective. Practical implications The authors argue that information systems such as search technologies, social media applications and recommendation systems should be designed with the recipient of the information in mind (Paisley and Parker, 1965), not the sender of that information. Social implications Information systems designed ethically and with users in mind will go some way to addressing the ill effects typified by the problems for individuals and society evident in global information systems. Originality/value The authors synthesize the evidence from the literature to provide potential technological solutions to the ethical issues identified, with a set of recommendations to information systems designers and implementers.

0.008240673 = product of:
  0.04120336 = sum of:
    0.04120336 = product of:
      0.08240672 = sum of:
        0.08240672 = weight(_text_:problems in 2457) [ClassicSimilarity], result of:
          0.08240672 = score(doc=2457,freq=8.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.5472311 = fieldWeight in 2457, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.046875 = fieldNorm(doc=2457)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

There are a number of combinatorial optimisation problems in information retrieval in which the use of local search methods are worthwhile. The purpose of this paper is to show how local search can be used to solve some well known tasks in information retrieval (IR), how previous research in the field is piecemeal, bereft of a structure and methodologically flawed, and to suggest more rigorous ways of applying local search methods to solve IR problems. We provide a query based taxonomy for analysing the use of local search in IR tasks and an overview of issues such as fitness functions, statistical significance and test collections when conducting experiments on combinatorial optimisation problems. The paper gives a guide on the pitfalls and problems for IR practitioners who wish to use local search to solve their research issues, and gives practical advice on the use of such methods. The query based taxonomy is a novel structure which can be used by the IR practitioner in order to examine the use of local search in IR.

0.007095774 = product of:
  0.03547887 = sum of:
    0.03547887 = product of:
      0.07095774 = sum of:
        0.07095774 = weight(_text_:etc in 817) [ClassicSimilarity], result of:
          0.07095774 = score(doc=817,freq=2.0), product of:
            0.19761753 = queryWeight, product of:
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.036484417 = queryNorm
            0.35906604 = fieldWeight in 817, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.046875 = fieldNorm(doc=817)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

Purpose - The aim of the paper is to put forward a structured mechanism for web search evaluation. The paper seeks to point to useful scientific research and show how information practitioners can use these methods in evaluation of search on the web for their users. Design/methodology/approach - The paper puts forward an approach which utilizes traditional laboratory-based evaluation measures such as average precision/precision at N documents, augmented with diagnostic measures such as link broken, etc., which are used to show why precision measures are depressed as well as the quality of the search engines crawling mechanism. Findings - The paper shows how to use diagnostic measures in conjunction with precision in order to evaluate web search. Practical implications - The methodology presented in this paper will be useful to any information professional who regularly uses web search as part of their information seeking and needs to evaluate web search services. Originality/value - The paper argues that the use of diagnostic measures is essential in web search, as precision measures on their own do not allow a searcher to understand why search results differ between search engines.

0.0059471927 = product of:
  0.029735964 = sum of:
    0.029735964 = product of:
      0.059471928 = sum of:
        0.059471928 = weight(_text_:problems in 5732) [ClassicSimilarity], result of:
          0.059471928 = score(doc=5732,freq=6.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.39493 = fieldWeight in 5732, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5732)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

Recent technological developments have increased the use of machine learning to solve many problems, including many in information retrieval. Multimedia information retrieval as a problem represents a significant challenge to machine learning as a technological solution, but some problems can still be addressed by using appropriate AI techniques. We review the technological developments and provide a perspective on the use of machine learning in conjunction with knowledge organization to address multimedia IR needs. The semantic gap in multimedia IR remains a significant problem in the field, and solutions to them are many years off. However, new technological developments allow the use of knowledge organization and machine learning in multimedia search systems and services. Specifically, we argue that, the improvement of detection of some classes of lowlevel features in images music and video can be used in conjunction with knowledge organization to tag or label multimedia content for better retrieval performance. We provide an overview of the use of knowledge organization schemes in machine learning and make recommendations to information professionals on the use of this technology with knowledge organization techniques to solve multimedia IR problems. We introduce a five-step process model that extracts features from multimedia objects (Step 1) from both knowledge organization (Step 1a) and machine learning (Step 1b), merging them together (Step 2) to create an index of those multimedia objects (Step 3). We also overview further steps in creating an application to utilize the multimedia objects (Step 4) and maintaining and updating the database of features on those objects (Step 5).

0.0059131454 = product of:
  0.029565725 = sum of:
    0.029565725 = product of:
      0.05913145 = sum of:
        0.05913145 = weight(_text_:etc in 3624) [ClassicSimilarity], result of:
          0.05913145 = score(doc=3624,freq=2.0), product of:
            0.19761753 = queryWeight, product of:
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.036484417 = queryNorm
            0.2992217 = fieldWeight in 3624, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3624)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

Purpose - The purpose of this paper is to resolve a gap in the knowledge of how people with dyslexia interact with information retrieval (IR) systems, specifically an understanding of their information-searching behaviour. Design/methodology/approach - The dyslexia cognitive profile is used to design a logging system, recording the difference between two sets of participants: dyslexic and control users. A standard Okapi interface is used - together with two standard TREC topics - in order to record the information searching behaviour of these users. Findings - Using the log data, the differences in information-searching behaviour of control and dyslexic users, i.e. in the way the two groups interact with Okapi, are established and it also established that qualitative information collected (such as experience etc.) may not be able to account for these differences. Evidence from query variables was unable to distinguish between groups, but differences on topic for the same variables were recorded. Users who view more documents tended to judge more documents as being relevant, in terms of either the user group or topic. Session data indicated that there may be an important difference between the number of iterations used in a search between the user groups, as there may be little effect from the topic on this variable. Originality/value - This is the first study of the effect of dyslexia on information search behaviour, and it provides some evidence to take the field forward.

0.0054937815 = product of:
  0.027468907 = sum of:
    0.027468907 = product of:
      0.054937813 = sum of:
        0.054937813 = weight(_text_:problems in 2010) [ClassicSimilarity], result of:
          0.054937813 = score(doc=2010,freq=2.0), product of:
            0.15058853 = queryWeight, product of:
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.036484417 = queryNorm
            0.36482072 = fieldWeight in 2010, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1274753 = idf(docFreq=1937, maxDocs=44218)
              0.0625 = fieldNorm(doc=2010)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Abstract

Open source software development is becoming increasingly popular as a way of producing software, due to a number of factors. It is argued in this paper that these factors may have a significant impact on the future of information retrieval (IR) systems, and that it is desirable that these systems are made open to all. Some problems are outlined that may prevent the uptake of open source IR systems and a number of open source IR systems are described.

0.003954508 = product of:
  0.019772539 = sum of:
    0.019772539 = product of:
      0.039545078 = sum of:
        0.039545078 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
          0.039545078 = score(doc=5108,freq=2.0), product of:
            0.12776221 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.036484417 = queryNorm
            0.30952093 = fieldWeight in 5108, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=5108)
      0.5 = coord(1/2)
  0.2 = coord(1/5)

Date

20. 1.2007 18:30:22