Search (97 results, page 2 of 5)

  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  • × year_i:[2000 TO 2010}
  1. Johnson, J.D.: On contexts of information seeking (2003) 0.00 
    0.0024128247 = product of:
  0.0048256493 = sum of:
    0.0048256493 = product of:
      0.009651299 = sum of:
        0.009651299 = weight(_text_:a in 1082) [ClassicSimilarity], result of:
          0.009651299 = score(doc=1082,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20223314 = fieldWeight in 1082, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=1082)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    While surprisingly little has been written about context at a meaningful level, context is central to most theoretical approaches to information seeking. In this essay I explore in more detail three senses of context. First, I look at context as equivalent to the situation in which a process is immersed. Second, I discuss contingency approaches that detail active ingredients of the situation that have specific, predictable effects. Third, I examine major frameworks for meaning systems. Then, I discuss how a deeper appreciation of context can enhance our understanding of the process of information seeking by examining two vastly different contexts in which it occurs: organizational and cancer-related, an exemplar of everyday life information seeking. This essay concludes with a discussion of the value that can be added to information seeking research and theory as a result of a deeper appreciation of context, particularly in terms of our current multi-contextual environment and individuals taking an active role in contextualizing.
    Type
    a
  2. Wolfram, D.; Xie, H.I.: Traditional IR for web users : a context for general audience digital libraries (2002) 0.00 
    0.0024032309 = product of:
  0.0048064617 = sum of:
    0.0048064617 = product of:
      0.0096129235 = sum of:
        0.0096129235 = weight(_text_:a in 2589) [ClassicSimilarity], result of:
          0.0096129235 = score(doc=2589,freq=20.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20142901 = fieldWeight in 2589, product of:
              4.472136 = tf(freq=20.0), with freq of:
                20.0 = termFreq=20.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2589)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    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.
    Type
    a
  3. Bhogal, J.; Macfarlane, A.; Smith, P.: ¬A review of ontology based query expansion (2007) 0.00 
    0.0023790773 = product of:
  0.0047581545 = sum of:
    0.0047581545 = product of:
      0.009516309 = sum of:
        0.009516309 = weight(_text_:a in 919) [ClassicSimilarity], result of:
          0.009516309 = score(doc=919,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.19940455 = fieldWeight in 919, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=919)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This paper examines the meaning of context in relation to ontology based query expansion and contains a review of query expansion approaches. The various query expansion approaches include relevance feedback, corpus dependent knowledge models and corpus independent knowledge models. Case studies detailing query expansion using domain-specific and domain-independent ontologies are also included. The penultimate section attempts to synthesise the information obtained from the review and provide success factors in using an ontology for query expansion. Finally the area of further research in applying context from an ontology to query expansion within a newswire domain is described.
    Type
    a
  4. Shiri, A.; Revie, C.: Usability and user perceptions of a thesaurus-enhanced search interface (2005) 0.00 
    0.002279905 = product of:
  0.00455981 = sum of:
    0.00455981 = product of:
      0.00911962 = sum of:
        0.00911962 = weight(_text_:a in 4331) [ClassicSimilarity], result of:
          0.00911962 = score(doc=4331,freq=18.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.19109234 = fieldWeight in 4331, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4331)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    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.
    Type
    a
  5. Jun, W.: ¬A knowledge network constructed by integrating classification, thesaurus and metadata in a digital library (2003) 0.00 
    0.0022748327 = product of:
  0.0045496654 = sum of:
    0.0045496654 = product of:
      0.009099331 = sum of:
        0.009099331 = weight(_text_:a in 1254) [ClassicSimilarity], result of:
          0.009099331 = score(doc=1254,freq=28.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.19066721 = fieldWeight in 1254, product of:
              5.2915025 = tf(freq=28.0), with freq of:
                28.0 = termFreq=28.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.03125 = fieldNorm(doc=1254)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Knowledge management in digital libraries is a universal problem. Keyword-based searching is applied everywhere no matter whether the resources are indexed databases or full-text Web pages. In keyword matching, the valuable content description and indexing of the metadata, such as the subject descriptors and the classification notations, are merely treated as common keywords to be matched with the user query. Without the support of vocabulary control tools, such as classification systems and thesauri, the intelligent labor of content analysis, description and indexing in metadata production are seriously wasted. New retrieval paradigms are needed to exploit the potential of the metadata resources. Could classification and thesauri, which contain the condensed intelligence of generations of librarians, be used in a digital library to organize the networked information, especially metadata, to facilitate their usability and change the digital library into a knowledge management environment? To examine that question, we designed and implemented a new paradigm that incorporates a classification system, a thesaurus and metadata. The classification and the thesaurus are merged into a concept network, and the metadata are distributed into the nodes of the concept network according to their subjects. The abstract concept node instantiated with the related metadata records becomes a knowledge node. A coherent and consistent knowledge network is thus formed. It is not only a framework for resource organization but also a structure for knowledge navigation, retrieval and learning. We have built an experimental system based on the Chinese Classification and Thesaurus, which is the most comprehensive and authoritative in China, and we have incorporated more than 5000 bibliographic records in the computing domain from the Peking University Library. The result is encouraging. In this article, we review the tools, the architecture and the implementation of our experimental system, which is called Vision.
    Type
    a
  6. Shiri, A.A.; Revie, C.; Chowdhury, G.: Thesaurus-assisted search term selection and query expansion : a review of user-centred studies (2002) 0.00 
    0.0022338415 = product of:
  0.004467683 = sum of:
    0.004467683 = product of:
      0.008935366 = sum of:
        0.008935366 = weight(_text_:a in 1330) [ClassicSimilarity], result of:
          0.008935366 = score(doc=1330,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18723148 = fieldWeight in 1330, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=1330)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This paper provides a review of the literature related to the application of domain-specific thesauri in the search and retrieval process. Focusing an studies that adopt a user-centred approach, the review presents a survey of the methodologies and results from empirical studies undertaken an the use of thesauri as sources of term selection for query formulation and expansion during the search process. It summarises the ways in which domain-specific thesauri from different disciplines have been used by various types of users and how these tools aid users in the selection of search terms. The review consists of two main sections: first, studies an thesaurus-aided search term selection; and second, studies dealing with query expansion using thesauri. Both sections are illustrated with case studies that have adopted a user-centred approach.
    Type
    a
  7. Khan, M.S.; Khor, S.: Enhanced Web document retrieval using automatic query expansion (2004) 0.00 
    0.0022338415 = product of:
  0.004467683 = sum of:
    0.004467683 = product of:
      0.008935366 = sum of:
        0.008935366 = weight(_text_:a in 2091) [ClassicSimilarity], result of:
          0.008935366 = score(doc=2091,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18723148 = fieldWeight in 2091, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=2091)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The ever growing popularity of the Internet as a source of information, coupled with the accompanying growth in the number of documents made available through the World Wide Web, is leading to an increasing demand for more efficient and accurate information retrieval tools. Numerous techniques have been proposed and tried for improving the effectiveness of searching the World Wide Web for documents relevant to a given topic of interest. The specification of appropriate keywords and phrases by the user is crucial for the successful execution of a query as measured by the relevance of documents retrieved. Lack of users' knowledge an the search topic and their changing information needs often make it difficult for them to find suitable keywords or phrases for a query. This results in searches that fail to cover all likely aspects of the topic of interest. We describe a scheme that attempts to remedy this situation by automatically expanding the user query through the analysis of initially retrieved documents. Experimental results to demonstrate the effectiveness of the query expansion scheure are presented.
    Type
    a
  8. Hovy, E.: Comparing sets of semantic relations in ontologies (2002) 0.00 
    0.0022338415 = product of:
  0.004467683 = sum of:
    0.004467683 = product of:
      0.008935366 = sum of:
        0.008935366 = weight(_text_:a in 2178) [ClassicSimilarity], result of:
          0.008935366 = score(doc=2178,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18723148 = fieldWeight in 2178, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=2178)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    A set of semantic relations is created every time a domain modeler wants to solve some complex problem computationally. These relations are usually organized into ontologies. But three is little standardization of ontologies today, and almost no discussion an ways of comparing relations, of determining a general approach to creating relations, or of modeling in general. This chapter outlines an approach to establishing a general methodology for comparing and justifying sets of relations (and ontologies in general). It first provides several dozen characteristics of ontologies, organized into three taxonomies of increasingly detailed features, by which many essential characteristics of ontologies can be described. These features enable one to compare ontologies at a general level, without studying every concept they contain. But sometimes it is necessary to make detailed comparisons of content. The chapter then illustrates one method for determining salient points for comparison, using algorithms that semi-automatically identify similarities and differences between ontologies.
    Type
    a
  9. Tudhope, D.; Binding, C.; Blocks, D.; Cunliffe, D.: FACET: thesaurus retrieval with semantic term expansion (2002) 0.00 
    0.0021920837 = product of:
  0.0043841675 = sum of:
    0.0043841675 = product of:
      0.008768335 = sum of:
        0.008768335 = weight(_text_:a in 175) [ClassicSimilarity], result of:
          0.008768335 = score(doc=175,freq=26.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18373153 = fieldWeight in 175, product of:
              5.0990195 = tf(freq=26.0), with freq of:
                26.0 = termFreq=26.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.03125 = fieldNorm(doc=175)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This demonstration of a research prototype illustrates a matching function for compound descriptors, or multi-concept subject headings, that does not rely on exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based on a measure of semantic closeness between terms.The work is part of the EPSRC funded FACET project in collaboration with the UK National Museum of Science and Industry (NMSI) which includes the National Railway Museum. An export of NMSI's Collections Database is used as the dataset for the research. The J. Paul Getty Trust's Art and Architecture Thesaurus (AAT) is the main thesaurus in the project. The AAT is a widely used thesaurus (over 120,000 terms). Descriptors are organised in 7 facets representing separate conceptual classes of terms.The FACET application is a multi tiered architecture accessing a SQL Server database, with an OLE DB connection. The thesauri are stored as relational tables in the Server's database. However, a key component of the system is a parallel representation of the underlying semantic network as an in-memory structure of thesaurus concepts (corresponding to preferred terms). The structure models the hierarchical and associative interrelationships of thesaurus concepts via weighted poly-hierarchical links. Its primary purpose is real-time semantic expansion of query terms, achieved by a spreading activation semantic closeness algorithm. Queries with associated results are stored persistently using XML format data. A Visual Basic interface combines a thesaurus browser and an initial term search facility that takes into account equivalence relationships. Terms are dragged to a direct manipulation Query Builder which maintains the facet structure.
    Type
    a
  10. Greenberg, J.: Automatic query expansion via lexical-semantic relationships (2001) 0.00 
    0.002149515 = product of:
  0.00429903 = sum of:
    0.00429903 = product of:
      0.00859806 = sum of:
        0.00859806 = weight(_text_:a in 5703) [ClassicSimilarity], result of:
          0.00859806 = score(doc=5703,freq=16.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18016359 = fieldWeight in 5703, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5703)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Structured thesauri encode equivalent, hierarchical, and associative relationships and have been developed as indexing/retrieval tools. Despite the fact that these tools provide a rich semantic network of vocabulary terms, they are seldom employed for automatic query expansion (QE) activities. This article reports on an experiment that examined whether thesaurus terms, related to query in a specified semantic way (as synonyms and partial-synonyms (SYNs), narrower terms (NTs), related terms (RTs), and broader terms (BTs)), could be identified as having a more positive impact on retrieval effectiveness when added to a query through automatic QE. The research found that automatic QE via SYNs and NTs increased relative recall with a decline in precision that was not statistically significant, and that automatic QE via RTs and BTs increased relative recall with a decline in precision that was statistically significant. Recallbased and a precision-based ranking orders for automatic QE via semantically encoded thesauri terminology were identified. Mapping results found between enduser query terms and the ProQuest Controlled Vocabulary (1997) (the thesaurus used in this study) are reported, and future research foci related to the investigation are discussed
    Type
    a
  11. Kelly, D.: Measuring online information seeking context : Part 1: background and method (2006) 0.00 
    0.002149515 = product of:
  0.00429903 = sum of:
    0.00429903 = product of:
      0.00859806 = sum of:
        0.00859806 = weight(_text_:a in 206) [ClassicSimilarity], result of:
          0.00859806 = score(doc=206,freq=16.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18016359 = fieldWeight in 206, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=206)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Context is one of the most important concepts in information seeking and retrieval research. However, the challenges of studying context are great; thus, it is more common for researchers to use context as a post hoc explanatory factor, rather than as a concept that drives inquiry. The purposes of this study were to develop a method for collecting data about information seeking context in natural online environments, and identify which aspects of context should be considered when studying online information seeking. The study is reported in two parts. In this, the first part, the background and method are presented. Results and implications of this research are presented in Part 2 (Kelly, in press). Part 1 discusses previous literature on information seeking context and behavior and situates the current work within this literature. This part further describes the naturalistic, longitudinal research design that was used to examine and measure the online information seeking contexts of users during a 14-week period. In this design, information seeking context was characterized by a user's self-identified tasks and topics, and several attributes of these, such as the length of time the user expected to work on a task and the user's familiarity with a topic. At weekly intervals, users evaluated the usefulness of the documents that they viewed, and classified these documents according to their tasks and topics. At the end of the study, users provided feedback about the study method.
    Type
    a
  12. Li, D.; Kwong, C.-P.; Lee, D.L.: Unified linear subspace approach to semantic analysis (2009) 0.00 
    0.002149515 = product of:
  0.00429903 = sum of:
    0.00429903 = product of:
      0.00859806 = sum of:
        0.00859806 = weight(_text_:a in 3321) [ClassicSimilarity], result of:
          0.00859806 = score(doc=3321,freq=16.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.18016359 = fieldWeight in 3321, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3321)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The Basic Vector Space Model (BVSM) is well known in information retrieval. Unfortunately, its retrieval effectiveness is limited because it is based on literal term matching. The Generalized Vector Space Model (GVSM) and Latent Semantic Indexing (LSI) are two prominent semantic retrieval methods, both of which assume there is some underlying latent semantic structure in a dataset that can be used to improve retrieval performance. However, while this structure may be derived from both the term space and the document space, GVSM exploits only the former and LSI the latter. In this article, the latent semantic structure of a dataset is examined from a dual perspective; namely, we consider the term space and the document space simultaneously. This new viewpoint has a natural connection to the notion of kernels. Specifically, a unified kernel function can be derived for a class of vector space models. The dual perspective provides a deeper understanding of the semantic space and makes transparent the geometrical meaning of the unified kernel function. New semantic analysis methods based on the unified kernel function are developed, which combine the advantages of LSI and GVSM. We also prove that the new methods are stable because although the selected rank of the truncated Singular Value Decomposition (SVD) is far from the optimum, the retrieval performance will not be degraded significantly. Experiments performed on standard test collections show that our methods are promising.
    Type
    a
  13. Kulyukin, V.A.; Settle, A.: Ranked retrieval with semantic networks and vector spaces (2001) 0.00 
    0.0021060861 = product of:
  0.0042121722 = sum of:
    0.0042121722 = product of:
      0.0084243445 = sum of:
        0.0084243445 = weight(_text_:a in 6934) [ClassicSimilarity], result of:
          0.0084243445 = score(doc=6934,freq=6.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.17652355 = fieldWeight in 6934, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=6934)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The equivalence of semantic networks with spreading activation and vector spaces with dot product is investigated under ranked retrieval. Semantic networks are viewed as networks of concepts organized in terms of abstraction and packaging relations. It is shown that the two models can be effectively constructed from each other. A formal method is suggested to analyze the models in terms of their relative performance in the same universe of objects
    Type
    a
  14. Nie, J.-Y.: Query expansion and query translation as logical inference (2003) 0.00 
    0.0020392092 = product of:
  0.0040784185 = sum of:
    0.0040784185 = product of:
      0.008156837 = sum of:
        0.008156837 = weight(_text_:a in 1425) [ClassicSimilarity], result of:
          0.008156837 = score(doc=1425,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1709182 = fieldWeight in 1425, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=1425)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    A number of studies have examined the problems of query expansion in monolingual Information Retrieval (IR), and query translation for crosslanguage IR. However, no link has been made between them. This article first shows that query translation is a special case of query expansion. There is also another set of studies an inferential IR. Again, there is no relationship established with query translation or query expansion. The second claim of this article is that logical inference is a general form that covers query expansion and query translation. This analysis provides a unified view of different subareas of IR. We further develop the inferential IR approach in two particular contexts: using fuzzy logic and probability theory. The evaluation formulas obtained are shown to strongly correspond to those used in other IR models. This indicates that inference is indeed the core of advanced IR.
    Type
    a
  15. Pahlevi, S.M.; Kitagawa, H.: Conveying taxonomy context for topic-focused Web search (2005) 0.00 
    0.0020392092 = product of:
  0.0040784185 = sum of:
    0.0040784185 = product of:
      0.008156837 = sum of:
        0.008156837 = weight(_text_:a in 3310) [ClassicSimilarity], result of:
          0.008156837 = score(doc=3310,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1709182 = fieldWeight in 3310, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3310)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Introducing context to a user query is effective to improve the search effectiveness. In this article we propose a method employing the taxonomy-based search services such as Web directories to facilitate searches in any Web search interfaces that support Boolean queries. The proposed method enables one to convey current search context an taxonomy of a taxonomy-based search service to the searches conducted with the Web search interfaces. The basic idea is to learn the search context in the form of a Boolean condition that is commonly accepted by many Web search interfaces, and to use the condition to modify the user query before forwarding it to the Web search interfaces. To guarantee that the modified query can always be processed by the Web search interfaces and to make the method adaptive to different user requirements an search result effectiveness, we have developed new fast classification learning algorithms.
    Type
    a
  16. Graham, R.Y.: Subject no-hits in an academic library online catalog : an exploration of two potential ameliorations (2004) 0.00 
    0.0020392092 = product of:
  0.0040784185 = sum of:
    0.0040784185 = product of:
      0.008156837 = sum of:
        0.008156837 = weight(_text_:a in 178) [ClassicSimilarity], result of:
          0.008156837 = score(doc=178,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1709182 = fieldWeight in 178, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=178)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    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.
    Type
    a
  17. Vallet, D.; Fernández, M.; Castells, P.: ¬An ontology-based information retrieval model (2005) 0.00 
    0.0020392092 = product of:
  0.0040784185 = sum of:
    0.0040784185 = product of:
      0.008156837 = sum of:
        0.008156837 = weight(_text_:a in 4708) [ClassicSimilarity], result of:
          0.008156837 = score(doc=4708,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1709182 = fieldWeight in 4708, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=4708)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Semantic search has been one of the motivations of the Semantic Web since it was envisioned. We propose a model for the exploitation of ontologybased KBs to improve search over large document repositories. Our approach includes an ontology-based scheme for the semi-automatic annotation of documents, and a retrieval system. The retrieval model is based on an adaptation of the classic vector-space model, including an annotation weighting algorithm, and a ranking algorithm. Semantic search is combined with keyword-based search to achieve tolerance to KB incompleteness. Our proposal is illustrated with sample experiments showing improvements with respect to keyword-based search, and providing ground for further research and discussion.
    Source
    The Semantic Web: research and applications ; second European Semantic WebConference, ESWC 2005, Heraklion, Crete, Greece, May 29 - June 1, 2005 ; proceedings. Eds.: A. Gómez-Pérez u. J. Euzenat
    Type
    a
  18. Wang, Y.-H.; Jhuo, P.-S.: ¬A semantic faceted search with rule-based inference (2009) 0.00 
    0.0020392092 = product of:
  0.0040784185 = sum of:
    0.0040784185 = product of:
      0.008156837 = sum of:
        0.008156837 = weight(_text_:a in 540) [ClassicSimilarity], result of:
          0.008156837 = score(doc=540,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1709182 = fieldWeight in 540, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=540)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Semantic Search has become an active research of Semantic Web in recent years. The classification methodology plays a pretty critical role in the beginning of search process to disambiguate irrelevant information. However, the applications related to Folksonomy suffer from many obstacles. This study attempts to eliminate the problems resulted from Folksonomy using existing semantic technology. We also focus on how to effectively integrate heterogeneous ontologies over the Internet to acquire the integrity of domain knowledge. A faceted logic layer is abstracted in order to strengthen category framework and organize existing available ontologies according to a series of steps based on the methodology of faceted classification and ontology construction. The result showed that our approach can facilitate the integration of inconsistent or even heterogeneous ontologies. This paper also generalizes the principles of picking appropriate facets with which our facet browser completely complies so that better semantic search result can be obtained.
    Type
    a
  19. Ng, K.B.: Toward a theoretical framework for understanding the relationship between situated action and planned action models of behavior in information retrieval contexts : contributions from phenomenology (2002) 0.00 
    0.0020106873 = product of:
  0.0040213745 = sum of:
    0.0040213745 = product of:
      0.008042749 = sum of:
        0.008042749 = weight(_text_:a in 2588) [ClassicSimilarity], result of:
          0.008042749 = score(doc=2588,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1685276 = fieldWeight in 2588, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2588)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    In human-computer interaction (HCI), a successful interaction sequence can take its own momentum and drift away from what the user has originally planned. However, this does not mean that planned actions play no important role in the overall performance. In this paper, the author tries to construct a line of argument to demonstrate that it is impossible to consider an action without an a priori plan, even according to the phenomenological position taken for granted by the situated action theory. Based on the phenomenological analysis of problematic situations and typification the author argues that, just like "situated-ness", "planned-ness" of an action should also be understood in the context of the situation. Successful plan can be developed and executed for familiar context. The first part of the paper treats information seeking behavior as a special type of social action and applies Alfred Schutz's phenomenology of sociology to understand the importance and necessity of plan. The second part reports results of a quasi-experiment focusing on plan deviation within an information seeking context. It was found that when the searcher's situation changed from problematic to non-problematic, the degree of plan deviation decreased significantly. These results support the argument proposed in the first part of the paper.
    Type
    a
  20. Sihvonen, A.; Vakkari, P.: Subject knowledge improves interactive query expansion assisted by a thesaurus (2004) 0.00 
    0.0020106873 = product of:
  0.0040213745 = sum of:
    0.0040213745 = product of:
      0.008042749 = sum of:
        0.008042749 = weight(_text_:a in 4417) [ClassicSimilarity], result of:
          0.008042749 = score(doc=4417,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.1685276 = fieldWeight in 4417, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4417)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This study explores how experts and novices in pedagogics expanded queries supported by the ERIC thesaurus, and how this was connected to the search effectiveness in an easy and a difficult search task. The expert group consisted of 15 undergraduates in pedagogy and the novice group of 15 students with no previous studies in this field. Their search logs were recorded and a pre- and post-search interview was conducted. The results show that the number and type of terms selected from the thesaurus for expansion by experts improved search effectiveness, whereas there were no connections between the use of thesaurus and improvement of effectiveness among novices. The effectiveness of expansions varied between the facets of the queries. Thus, a vital condition for benefiting from a thesaurus in query expansion to improve search results is sufficient familiarity with the search topic. The results suggest also that it is not in the first place the number of terms used in expansion, but their type and quality that are crucial for search success.
    Type
    a

Authors

Languages

  • e 75
  • d 22

Types

  • a 93
  • el 8
  • m 3
  • More… Less…

Themes

Subjects

Classifications