Search (64 results, page 1 of 4)

0.02463997 = product of:
  0.07391991 = sum of:
    0.054115813 = weight(_text_:searching in 2768) [ClassicSimilarity], result of:
      0.054115813 = score(doc=2768,freq=12.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.38317618 = fieldWeight in 2768, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2768)
    0.019804098 = product of:
      0.039608195 = sum of:
        0.039608195 = weight(_text_:etc in 2768) [ClassicSimilarity], result of:
          0.039608195 = score(doc=2768,freq=2.0), product of:
            0.18910104 = queryWeight, product of:
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.03491209 = queryNorm
            0.20945519 = fieldWeight in 2768, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4164915 = idf(docFreq=533, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2768)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

Subject searching is the most common but also the most conflictive searching for end user. The aim of this paper is to check how users expressions match subject headings and to prove if knowledge structure used in online catalogs enhances searching effectiveness. A bibliographic revision about difficulties in subject access and proposed methods to improve it is also presented. For the empirical analysis, transaction logs from two university libraries, online catalogs (CISNE and FAMA) were collected. Results show that more than a quarter of user queries are effective due to an alphabetical subject index approach and browsing through hypertextual links. 1. Introduction Since the 1980's, online public access catalogs (OPAC's) have become usual way to access bibliographic information. During the last two decades the technological development has helped to extend their use, making feasible the access for a whole of users that is getting more and more extensive and heterogeneous, and also to incorporate information resources in electronic formats and to interconnect systems. However, technology seems to have developed faster than our knowledge about the tasks where it has been applied and than the evolution of our capacities for adapting to it. The conceptual model of OPAC has been hardly modified recently, and for interacting with them, users still need to combine the same skills and basic knowledge than at the beginning of its introduction (Borgman, 1986, 2000): a) conceptual knowledge to translate the information need into an appropriate query because of a well-designed mental model of the system, b) semantic and syntactic knowledge to be able to implement that query (access fields, searching type, Boolean logic, etc.) and c) basic technical skills in computing. At present many users have the essential technical skills to make use, with more or less expertise, of a computer. This number is substantially reduced when it is referred to the conceptual, semantic and syntactic knowledge that is necessary to achieve a moderately satisfactory search. An added difficulty arises in subject searching, as users should concrete their unknown information needs in terms that the information retrieval system can understand. Many researches have focused an unskilled searchers' difficulties to enter an effective query. The mental models influence, users assumption about characteristics, structure, contents and operation of the system they interact with have been analysed (Dillon, 2000; Dimitroff, 2000). Another issue that implies difficulties is vocabulary: how to find the right terms to implement a query and to modify it as the case may be. Terminology and expressions characteristics used in searching (Bates, 1993), the match between user terms and the subject headings from the catalog (Carlyle, 1989; Drabensttot, 1996; Drabensttot & Vizine-Goetz, 1994), the incidence of spelling errors (Drabensttot and Weller, 1996; Ferl and Millsap, 1996; Walker and Jones, 1987), users problems

0.01872119 = product of:
  0.112327136 = sum of:
    0.112327136 = sum of:
      0.07921639 = weight(_text_:etc in 1852) [ClassicSimilarity], result of:
        0.07921639 = score(doc=1852,freq=2.0), product of:
          0.18910104 = queryWeight, product of:
            5.4164915 = idf(docFreq=533, maxDocs=44218)
            0.03491209 = queryNorm
          0.41891038 = fieldWeight in 1852, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.4164915 = idf(docFreq=533, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1852)
      0.033110745 = weight(_text_:22 in 1852) [ClassicSimilarity], result of:
        0.033110745 = score(doc=1852,freq=2.0), product of:
          0.1222562 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03491209 = queryNorm
          0.2708308 = fieldWeight in 1852, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1852)
  0.16666667 = coord(1/6)

Abstract

Ontologien werden eingesetzt, um durch semantische Fundierung insbesondere für das Dokumentenretrieval eine grundlegend bessere Basis zu haben, als dies gegenwärtiger Stand der Technik ist. Vorgestellt wird eine an der FH Darmstadt entwickelte und eingesetzte Ontologie, die den Gegenstandsbereich Hochschule sowohl breit abdecken und gleichzeitig differenziert semantisch beschreiben soll. Das Problem der semantischen Suche besteht nun darin, dass sie für Informationssuchende so einfach wie bei gängigen Suchmaschinen zu nutzen sein soll, und gleichzeitig auf der Grundlage des aufwendigen Informationsmodells hochwertige Ergebnisse liefern muss. Es wird beschrieben, welche Möglichkeiten die verwendete Software K-Infinity bereitstellt und mit welchem Konzept diese Möglichkeiten für eine semantische Suche nach Dokumenten und anderen Informationseinheiten (Personen, Veranstaltungen, Projekte etc.) eingesetzt werden.

Date

11. 2.2011 18:22:58

0.01872119 = product of:
  0.112327136 = sum of:
    0.112327136 = sum of:
      0.07921639 = weight(_text_:etc in 4324) [ClassicSimilarity], result of:
        0.07921639 = score(doc=4324,freq=2.0), product of:
          0.18910104 = queryWeight, product of:
            5.4164915 = idf(docFreq=533, maxDocs=44218)
            0.03491209 = queryNorm
          0.41891038 = fieldWeight in 4324, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.4164915 = idf(docFreq=533, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4324)
      0.033110745 = weight(_text_:22 in 4324) [ClassicSimilarity], result of:
        0.033110745 = score(doc=4324,freq=2.0), product of:
          0.1222562 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03491209 = queryNorm
          0.2708308 = fieldWeight in 4324, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4324)
  0.16666667 = coord(1/6)

Abstract

Ontologien werden eingesetzt, um durch semantische Fundierung insbesondere für das Dokumentenretrieval eine grundlegend bessere Basis zu haben, als dies gegenwärtiger Stand der Technik ist. Vorgestellt wird eine an der FH Darmstadt entwickelte und eingesetzte Ontologie, die den Gegenstandsbereich Hochschule sowohl breit abdecken und gleichzeitig differenziert semantisch beschreiben soll. Das Problem der semantischen Suche besteht nun darin, dass sie für Informationssuchende so einfach wie bei gängigen Suchmaschinen zu nutzen sein soll, und gleichzeitig auf der Grundlage des aufwendigen Informationsmodells hochwertige Ergebnisse liefern muss. Es wird beschrieben, welche Möglichkeiten die verwendete Software K-Infinity bereitstellt und mit welchem Konzept diese Möglichkeiten für eine semantische Suche nach Dokumenten und anderen Informationseinheiten (Personen, Veranstaltungen, Projekte etc.) eingesetzt werden.

Date

11. 2.2011 18:22:25

0.0173545 = product of:
  0.0520635 = sum of:
    0.03787318 = weight(_text_:searching in 2419) [ClassicSimilarity], result of:
      0.03787318 = score(doc=2419,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 2419, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=2419)
    0.014190319 = product of:
      0.028380638 = sum of:
        0.028380638 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
          0.028380638 = score(doc=2419,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = queryNorm
            0.23214069 = fieldWeight in 2419, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=2419)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.

Date

16.11.2008 16:22:48

0.011762084 = product of:
  0.0705725 = sum of:
    0.0705725 = weight(_text_:searching in 5691) [ClassicSimilarity], result of:
      0.0705725 = score(doc=5691,freq=10.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.49970058 = fieldWeight in 5691, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5691)
  0.16666667 = coord(1/6)

Abstract

The second half of a 'before and after' study to evaluate the impact of an online catalogue on subject searching behaviour is reported. A holistic approach is adopted encompassing both catalogue use and browsing at the shelves for catalogue users and non-users. Verbal and non-verbal data were elicited from searchers using a combined methodology including talk-aloud technique, observation and a screen logging facility. An extensive qualitative analysis was carried out correlating expressed topics, search formulation strategies and documents retrieved at the shelves. The online catalogue environment does not appear to have increased the extent of subject searching nor the use of the bibliographic tool. The manual PRECIS index supported a contextual approach for broad and more interactive search formulations whereas the OPAC encouraged a matching approach and narrow formulations with fewer but user generated formulations. The success rate of the online catalogue was slightly better than that of the manual tools but fewer items were retrieved at the shelves. Non-users of the bibliographic tools seemed to be just as successful. To improve retrieval effectiveness it is suggested that online catalogues should cater for both matching and contextual approaches to searching. Recent research indicates that a more interactive process could be promoted by providing query expansion through a combination of searching aids for matching, for search formulation assistance and for structured contextual retrieval

0.010933045 = product of:
  0.06559827 = sum of:
    0.06559827 = weight(_text_:searching in 5698) [ClassicSimilarity], result of:
      0.06559827 = score(doc=5698,freq=6.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.46447968 = fieldWeight in 5698, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
  0.16666667 = coord(1/6)

Abstract

Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages

0.010933045 = product of:
  0.06559827 = sum of:
    0.06559827 = weight(_text_:searching in 202) [ClassicSimilarity], result of:
      0.06559827 = score(doc=202,freq=6.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.46447968 = fieldWeight in 202, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=202)
  0.16666667 = coord(1/6)

Abstract

The authors present a model of information searching in thesaurus-enhanced search systems, intended as a reference model for system developers. The model focuses on user-system interaction and charts the specific stages of searching an indexed collection with a thesaurus. It was developed based on literature, findings from empirical studies, and analysis of existing systems. The model describes in detail the entities, processes, and decisions when interacting with a search system augmented with a thesaurus. A basic search scenario illustrates this process through the model. Graphical and textual depictions of the model are complemented by a concise matrix representation for evaluation purposes. Potential problems at different stages of the search process are discussed, together with possibilities for system developers. The aim is to set out a framework of processes, decisions, and risks involved in thesaurus-based search, within which system developers can consider potential avenues for support.

0.010619024 = product of:
  0.06371414 = sum of:
    0.06371414 = product of:
      0.12742828 = sum of:
        0.12742828 = weight(_text_:manuals in 2229) [ClassicSimilarity], result of:
          0.12742828 = score(doc=2229,freq=2.0), product of:
            0.25905544 = queryWeight, product of:
              7.4202213 = idf(docFreq=71, maxDocs=44218)
              0.03491209 = queryNorm
            0.4918958 = fieldWeight in 2229, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.4202213 = idf(docFreq=71, maxDocs=44218)
              0.046875 = fieldNorm(doc=2229)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

Modern fact databses contain abundant data classified through several classifications. Typically, users msut consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little support deductive use of classifications. In this study we show how deductive data management techniques can be applied to the utilization of data value classifications. Computation of transitive class relationships is of primary importance here. We define a representation of classifications which supports transitive computation and present an operation-oriented deductive query language tailored for classification-based deductive information retrieval. The operations of this language are on the same abstraction level as relational algebra operations and can be integrated with these to form a powerful and flexible query language for deductive information retrieval. We define the integration of these operations and demonstrate the usefulness of the language in terms of several sample queries

0.010520328 = product of:
  0.06312197 = sum of:
    0.06312197 = weight(_text_:searching in 2907) [ClassicSimilarity], result of:
      0.06312197 = score(doc=2907,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.44694576 = fieldWeight in 2907, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.078125 = fieldNorm(doc=2907)
  0.16666667 = coord(1/6)

0.010123459 = product of:
  0.030370375 = sum of:
    0.022092689 = weight(_text_:searching in 1633) [ClassicSimilarity], result of:
      0.022092689 = score(doc=1633,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.15643102 = fieldWeight in 1633, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1633)
    0.008277686 = product of:
      0.016555373 = sum of:
        0.016555373 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
          0.016555373 = score(doc=1633,freq=2.0), product of:
            0.1222562 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03491209 = queryNorm
            0.1354154 = fieldWeight in 1633, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1633)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Date

20. 1.2015 18:30:22

0.008926794 = product of:
  0.053560764 = sum of:
    0.053560764 = weight(_text_:searching in 178) [ClassicSimilarity], result of:
      0.053560764 = score(doc=178,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.37924606 = fieldWeight in 178, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=178)
  0.16666667 = coord(1/6)

Abstract

This paper describes a study that explored ways in which users' subject-searching problems in a local online catalog might be reduced. On a weekly basis, the author reviewed catalog transaction logs to identify topics of subject searches retrieving no records for which appropriate information resources may actually be represented in the catalog. For topics thus identified, the author explored two potential ameliorations of the no-hits search results through the use of authority record cross-references and pathfinder records providing brief instructions on search refinement. This paper describes the study findings, discusses possible concerns regarding the amelioration methods used, outlines additional steps needed to determine whether the potential ameliorations make a difference to users' searching experiences, and suggests related areas for further research.

0.008416262 = product of:
  0.050497573 = sum of:
    0.050497573 = weight(_text_:searching in 5690) [ClassicSimilarity], result of:
      0.050497573 = score(doc=5690,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3575566 = fieldWeight in 5690, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0625 = fieldNorm(doc=5690)
  0.16666667 = coord(1/6)

Abstract

Discusses some of the methods of subject access to on-line catalohues (OPACs) and argues that none are entirley satisfactory. Describes 2 methods for improving subject access: best match searching; and automatic query expansion application and discusses their feasibility. Mentions emerging application standards for information retrieval and concludes that existing standards are incompatible with most methods for improving standards

0.007438996 = product of:
  0.044633973 = sum of:
    0.044633973 = weight(_text_:searching in 1615) [ClassicSimilarity], result of:
      0.044633973 = score(doc=1615,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3160384 = fieldWeight in 1615, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1615)
  0.16666667 = coord(1/6)

Abstract

The Medical professionals and researchers need information from reputable sources to accomplish their work. Unfortunately, the Web has a large number of documents that are irrelevant to their work, even those documents that purport to be "medically-related." This paper describes an architecture designed to integrate advanced searching and indexing algorithms, an automatic thesaurus, or "concept space," and Kohonen-based Self-Organizing Map (SOM) technologies to provide searchers with finegrained results. Initial results indicate that these systems provide complementary retrieval functionalities. HelpfulMed not only allows users to search Web pages and other online databases, but also allows them to build searches through the use of an automatic thesaurus and browse a graphical display of medical-related topics. Evaluation results for each of the different components are included. Our spidering algorithm outperformed both breadth-first search and PageRank spiders an a test collection of 100,000 Web pages. The automatically generated thesaurus performed as well as both MeSH and UMLS-systems which require human mediation for currency. Lastly, a variant of the Kohonen SOM was comparable to MeSH terms in perceived cluster precision and significantly better at perceived cluster recall.

0.007438996 = product of:
  0.044633973 = sum of:
    0.044633973 = weight(_text_:searching in 2589) [ClassicSimilarity], result of:
      0.044633973 = score(doc=2589,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3160384 = fieldWeight in 2589, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2589)
  0.16666667 = coord(1/6)

Abstract

The emergence of general audience digital libraries (GADLs) defines a context that represents a hybrid of both "traditional" IR, using primarily bibliographic resources provided by database vendors, and "popular" IR, exemplified by public search systems available on the World Wide Web. Findings of a study investigating end-user searching and response to a GADL are reported. Data collected from a Web-based end-user survey and data logs of resource usage for a Web-based GADL were analyzed for user characteristics, patterns of access and use, and user feedback. Cross-tabulations using respondent demographics revealed several key differences in how the system was used and valued by users of different age groups. Older users valued the service more than younger users and engaged in different searching and viewing behaviors. The GADL more closely resembles traditional retrieval systems in terms of content and purpose of use, but is more similar to popular IR systems in terms of user behavior and accessibility. A model that defines the dual context of the GADL environment is derived from the data analysis and existing IR models in general and other specific contexts. The authors demonstrate the distinguishing characteristics of this IR context, and discuss implications for the development and evaluation of future GADLs to accommodate a variety of user needs and expectations.

0.007438996 = product of:
  0.044633973 = sum of:
    0.044633973 = weight(_text_:searching in 4331) [ClassicSimilarity], result of:
      0.044633973 = score(doc=4331,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3160384 = fieldWeight in 4331, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4331)
  0.16666667 = coord(1/6)

Abstract

Purpose - This paper seeks to report an investigation into the ways in which end-users perceive a thesaurus-enhanced search interface, in particular thesaurus and search interface usability. Design/methodology/approach - Thirty academic users, split between staff and postgraduate students, carrying out real search requests were observed during this study. Users were asked to comment on a range of thesaurus and interface characteristics including: ease of use, ease of learning, ease of browsing and navigation, problems and difficulties encountered while interacting with the system, and the effect of browsing on search term selection. Findings - The results suggest that interface usability is a factor affecting thesaurus browsing/navigation and other information-searching behaviours. Academic staff viewed the function of a thesaurus as being useful for narrowing down a search and providing alternative search terms, while postgraduates stressed the role of the thesaurus for broadening searches and providing new terms. Originality/value - The paper provides an insight into the ways in which end-users make use of and interact with a thesaurus-enhanced search interface. This area is new since previous research has particularly focused on how professional searchers and librarians make use of thesauri and thesaurus-enhanced search interfaces. The research reported here suggests that end-users with varying levels of domain knowledge are able to use thesauri that are integrated into search interfaces. It also provides design implications for search interface developers as well as information professionals who are involved in teaching online searching.

0.007438996 = product of:
  0.044633973 = sum of:
    0.044633973 = weight(_text_:searching in 2696) [ClassicSimilarity], result of:
      0.044633973 = score(doc=2696,freq=4.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.3160384 = fieldWeight in 2696, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2696)
  0.16666667 = coord(1/6)

Abstract

Search Engines have become an integral part of our day to day life. Our reliance on search engines increases with every passing day. With the amount of data available on Internet increasing exponentially, it becomes important to develop new methods and tools that help to return results relevant to the queries and reduce the time spent on searching. The results should be diverse but at the same time should return results focused on the queries asked. Relation Based Page Rank [4] algorithms are considered to be the next frontier in improvement of Semantic Web Search. The probability of finding relevance in the search results as posited by the user while entering the query is used to measure the relevance. However, its application is limited by the complexity of determining relation between the terms and assigning explicit meaning to each term. Trust Rank is one of the most widely used ranking algorithms for semantic web search. Few other ranking algorithms like HITS algorithm, PageRank algorithm are also used for Semantic Web Searching. In this paper, we will provide a comparison of few ranking approaches.

0.0073642298 = product of:
  0.044185378 = sum of:
    0.044185378 = weight(_text_:searching in 2731) [ClassicSimilarity], result of:
      0.044185378 = score(doc=2731,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.31286204 = fieldWeight in 2731, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2731)
  0.16666667 = coord(1/6)

Abstract

An automatic query expansion (AQE) facility in anonline catalogue was evaluated in an operational library setting. The OKAPI experimental system had other features including: ranked output 'best match' keyword searching, automatic stemming, spelling normalisation and cross referencing as well as relevance feedback. A combination of transaction log analysis, search replays, questionnaires and interviews was used for data collection. Findings show that contrary to previous results, AQE was beneficial in a substantial number of searches. Use intentions, the effectiveness of the 'best match' search and user interaction were identified as the main factors affecting the take-up of the query expansion facility

0.0073642298 = product of:
  0.044185378 = sum of:
    0.044185378 = weight(_text_:searching in 5694) [ClassicSimilarity], result of:
      0.044185378 = score(doc=5694,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.31286204 = fieldWeight in 5694, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5694)
  0.16666667 = coord(1/6)

Abstract

Reports text information retrieval experiments performed as part of the 3 rd round of Text Retrieval Conferences (TREC) using the Okapi online catalogue system at City University, UK. The emphasis in TREC-3 was: further refinement of term weighting functions; an investigation of run time passage determination and searching; expansion of ad hoc queries by terms extracted from the top documents retrieved by a trial search; new methods for choosing query expansion terms after relevance feedback, now split into methods of ranking terms prior to selection and subsequent selection procedures; and the development of a user interface procedure within the new TREC interactive search framework

0.0073642298 = product of:
  0.044185378 = sum of:
    0.044185378 = weight(_text_:searching in 430) [ClassicSimilarity], result of:
      0.044185378 = score(doc=430,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.31286204 = fieldWeight in 430, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.0546875 = fieldNorm(doc=430)
  0.16666667 = coord(1/6)

0.0063121966 = product of:
  0.03787318 = sum of:
    0.03787318 = weight(_text_:searching in 5695) [ClassicSimilarity], result of:
      0.03787318 = score(doc=5695,freq=2.0), product of:
        0.14122958 = queryWeight, product of:
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.03491209 = queryNorm
        0.26816747 = fieldWeight in 5695, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0452914 = idf(docFreq=2103, maxDocs=44218)
          0.046875 = fieldNorm(doc=5695)
  0.16666667 = coord(1/6)

Abstract

To provide advice for online searching about term selection and query expansion, an intermediary expert system should indicate a terminological knowledge structure. Terminological attributes could provide the foundation of a knowledge base, and knowledge acquisition could rely on knowledge base techniques coupled with statistical techniques. The strategies of expert searchers would provide 1 source of knowledge. The knowledge structure would include 3 constructs for each term: frequency data, a hedge, and a position in a classification scheme. Switching vocabularies could provide a meta-scheme and facilitate the interoperability of databases in similar subjects. To develop such knowledge structure, research should focus on terminological attributes, word and phrase disambiguation, automated text processing, and the role of thesauri and classification schemes in indexing and retrieval. It should develop techniques that combine knowledge base and statistical methods and that consider user preferences