Search (200 results, page 1 of 10)

  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  1. Schatz, B.R.; Johnson, E.H.; Cochrane, P.A.; Chen, H.: Interactive term suggestion for users of digital libraries : using thesauri and co-occurrence lists for information retrieval (1996) 0.25 
    0.25246483 = product of:
  0.33661976 = sum of:
    0.03189404 = weight(_text_:for in 6417) [ClassicSimilarity], result of:
      0.03189404 = score(doc=6417,freq=6.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.35929856 = fieldWeight in 6417, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.078125 = fieldNorm(doc=6417)
    0.15982707 = weight(_text_:computing in 6417) [ClassicSimilarity], result of:
      0.15982707 = score(doc=6417,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.6111468 = fieldWeight in 6417, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.078125 = fieldNorm(doc=6417)
    0.14489865 = product of:
      0.2897973 = sum of:
        0.2897973 = weight(_text_:machinery in 6417) [ClassicSimilarity], result of:
          0.2897973 = score(doc=6417,freq=2.0), product of:
            0.35214928 = queryWeight, product of:
              7.448392 = idf(docFreq=69, maxDocs=44218)
              0.047278564 = queryNorm
            0.8229388 = fieldWeight in 6417, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.448392 = idf(docFreq=69, maxDocs=44218)
              0.078125 = fieldNorm(doc=6417)
      0.5 = coord(1/2)
  0.75 = coord(3/4)
    Imprint
    New York : Association for Computing Machinery
  2. Qu, R.; Fang, Y.; Bai, W.; Jiang, Y.: Computing semantic similarity based on novel models of semantic representation using Wikipedia (2018) 0.07 
    0.07381066 = product of:
  0.14762132 = sum of:
    0.009207015 = weight(_text_:for in 5052) [ClassicSimilarity], result of:
      0.009207015 = score(doc=5052,freq=2.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.103720546 = fieldWeight in 5052, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5052)
    0.13841431 = weight(_text_:computing in 5052) [ClassicSimilarity], result of:
      0.13841431 = score(doc=5052,freq=6.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.5292687 = fieldWeight in 5052, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5052)
  0.5 = coord(2/4)
    Abstract
    Computing Semantic Similarity (SS) between concepts is one of the most critical issues in many domains such as Natural Language Processing and Artificial Intelligence. Over the years, several SS measurement methods have been proposed by exploiting different knowledge resources. Wikipedia provides a large domain-independent encyclopedic repository and a semantic network for computing SS between concepts. Traditional feature-based measures rely on linear combinations of different properties with two main limitations, the insufficient information and the loss of semantic information. In this paper, we propose several hybrid SS measurement approaches by using the Information Content (IC) and features of concepts, which avoid the limitations introduced above. Considering integrating discrete properties into one component, we present two models of semantic representation, called CORM and CARM. Then, we compute SS based on these models and take the IC of categories as a supplement of SS measurement. The evaluation, based on several widely used benchmarks and a benchmark developed by ourselves, sustains the intuitions with respect to human judgments. In summary, our approaches are more efficient in determining SS between concepts and have a better human correlation than previous methods such as Word2Vec and NASARI.
  3. Hemmje, M.: LyberWorld - a 3D graphical user interface for fulltext retrieval (1995) 0.07 
    0.06710239 = product of:
  0.13420478 = sum of:
    0.022325827 = weight(_text_:for in 2385) [ClassicSimilarity], result of:
      0.022325827 = score(doc=2385,freq=6.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.25150898 = fieldWeight in 2385, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2385)
    0.111878954 = weight(_text_:computing in 2385) [ClassicSimilarity], result of:
      0.111878954 = score(doc=2385,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.42780277 = fieldWeight in 2385, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2385)
  0.5 = coord(2/4)
    Abstract
    LyberWorld is a prototype IR user interface. It implements visualizations of an abstract information space: fulltext. The video demonstrates a visual user interface for the probabilistic fulltext retrieval system INQUERY. Visualizations are used to communicate information search and browsing activities in a natural way by applying metaphors of spatial navigation in abstract information spaces. Visualization tools for exploring information spaces and judging relevance of information items are introduced and an example session demonstrates the prototype. The presence of a spatial model in the user's mind is regarded as an essential contribution towards natural interaction and reduction of cognitive costs during retrieval dialogues.
    Source
    Proceeding CHI '95 Conference Companion on Human Factors in Computing Systems
  4. Gao, J.; Zhang, J.: Clustered SVD strategies in latent semantic indexing (2005) 0.07 
    0.065053955 = product of:
  0.13010791 = sum of:
    0.01822896 = weight(_text_:for in 1166) [ClassicSimilarity], result of:
      0.01822896 = score(doc=1166,freq=4.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.20535621 = fieldWeight in 1166, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1166)
    0.111878954 = weight(_text_:computing in 1166) [ClassicSimilarity], result of:
      0.111878954 = score(doc=1166,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.42780277 = fieldWeight in 1166, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1166)
  0.5 = coord(2/4)
    Abstract
    The text retrieval method using latent semantic indexing (LSI) technique with truncated singular value decomposition (SVD) has been intensively studied in recent years. The SVD reduces the noise contained in the original representation of the term-document matrix and improves the information retrieval accuracy. Recent studies indicate that SVD is mostly useful for small homogeneous data collections. For large inhomogeneous datasets, the performance of the SVD based text retrieval technique may deteriorate. We propose to partition a large inhomogeneous dataset into several smaller ones with clustered structure, on which we apply the truncated SVD. Our experimental results show that the clustered SVD strategies may enhance the retrieval accuracy and reduce the computing and storage costs.
  5. Beaulieu, M.; Payne, A.; Do, T.; Jones, S.: ENQUIRE Okapi project (1996) 0.06 
    0.055760533 = product of:
  0.111521065 = sum of:
    0.015624823 = weight(_text_:for in 3369) [ClassicSimilarity], result of:
      0.015624823 = score(doc=3369,freq=4.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.17601961 = fieldWeight in 3369, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.046875 = fieldNorm(doc=3369)
    0.095896244 = weight(_text_:computing in 3369) [ClassicSimilarity], result of:
      0.095896244 = score(doc=3369,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.36668807 = fieldWeight in 3369, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.046875 = fieldNorm(doc=3369)
  0.5 = coord(2/4)
    Abstract
    The ENQUIRE project forms part of a series of investigations on query expansion in the Okapi experimental text retrieval system. A configurable user interface was implemented as an evaluative tool and tested in two locations on two different databases: the library catalogue of The London Business SChool and the computing section of INSPEC. The system offered a range of possible strategies based on thesaural terms for reformulating queries. These could be initiated automatically by the system or interactively with the user. The formative phase of the evaluation established the appropriateness and usability of the interface as well as users' perceptions of the underlying functionality. The aim of the large scale field trial was to determine to what extent user would select thesaural terms suggested by the system to reformulate queries, and to evaluate the effectiveness of a new dynamic form of query expansion implemented for this project
  6. Chen, H.; Martinez, J.; Kirchhoff, A.; Ng, T.D.; Schatz, B.R.: Alleviating search uncertainty through concept associations : automatic indexing, co-occurence analysis, and parallel computing (1998) 0.05 
    0.053472333 = product of:
  0.106944665 = sum of:
    0.0110484185 = weight(_text_:for in 5202) [ClassicSimilarity], result of:
      0.0110484185 = score(doc=5202,freq=2.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.12446466 = fieldWeight in 5202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.046875 = fieldNorm(doc=5202)
    0.095896244 = weight(_text_:computing in 5202) [ClassicSimilarity], result of:
      0.095896244 = score(doc=5202,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.36668807 = fieldWeight in 5202, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.046875 = fieldNorm(doc=5202)
  0.5 = coord(2/4)
    Source
    Journal of the American Society for Information Science. 49(1998) no.3, S.206-216
  7. Agarwal, N.K.: Exploring context in information behavior : seeker, situation, surroundings, and shared identities (2018) 0.05 
    0.051584728 = product of:
  0.103169456 = sum of:
    0.012757615 = weight(_text_:for in 4992) [ClassicSimilarity], result of:
      0.012757615 = score(doc=4992,freq=6.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.14371942 = fieldWeight in 4992, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.03125 = fieldNorm(doc=4992)
    0.09041184 = weight(_text_:computing in 4992) [ClassicSimilarity], result of:
      0.09041184 = score(doc=4992,freq=4.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.34571683 = fieldWeight in 4992, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.03125 = fieldNorm(doc=4992)
  0.5 = coord(2/4)
    Abstract
    The field of human information behavior runs the gamut of processes from the realization of a need or gap in understanding, to the search for information from one or more sources to fill that gap, to the use of that information to complete a task at hand or to satisfy a curiosity, as well as other behaviors such as avoiding information or finding information serendipitously. Designers of mechanisms, tools, and computer-based systems to facilitate this seeking and search process often lack a full knowledge of the context surrounding the search. This context may vary depending on the job or role of the person; individual characteristics such as personality, domain knowledge, age, gender, perception of self, etc.; the task at hand; the source and the channel and their degree of accessibility and usability; and the relationship that the seeker shares with the source. Yet researchers have yet to agree on what context really means. While there have been various research studies incorporating context, and biennial conferences on context in information behavior, there lacks a clear definition of what context is, what its boundaries are, and what elements and variables comprise context. In this book, we look at the many definitions of and the theoretical and empirical studies on context, and I attempt to map the conceptual space of context in information behavior. I propose theoretical frameworks to map the boundaries, elements, and variables of context. I then discuss how to incorporate these frameworks and variables in the design of research studies on context. We then arrive at a unified definition of context. This book should provide designers of search systems a better understanding of context as they seek to meet the needs and demands of information seekers. It will be an important resource for researchers in Library and Information Science, especially doctoral students looking for one resource that covers an exhaustive range of the most current literature related to context, the best selection of classics, and a synthesis of these into theoretical frameworks and a unified definition. The book should help to move forward research in the field by clarifying the elements, variables, and views that are pertinent. In particular, the list of elements to be considered, and the variables associated with each element will be extremely useful to researchers wanting to include the influences of context in their studies.
    LCSH
    Context / aware computing
    Subject
    Context / aware computing
  8. Jiang, Y.; Zhang, X.; Tang, Y.; Nie, R.: Feature-based approaches to semantic similarity assessment of concepts using Wikipedia (2015) 0.05 
    0.04646711 = product of:
  0.09293422 = sum of:
    0.013020686 = weight(_text_:for in 2682) [ClassicSimilarity], result of:
      0.013020686 = score(doc=2682,freq=4.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.14668301 = fieldWeight in 2682, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2682)
    0.079913534 = weight(_text_:computing in 2682) [ClassicSimilarity], result of:
      0.079913534 = score(doc=2682,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.3055734 = fieldWeight in 2682, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2682)
  0.5 = coord(2/4)
    Abstract
    Semantic similarity assessment between concepts is an important task in many language related applications. In the past, several approaches to assess similarity by evaluating the knowledge modeled in an (or multiple) ontology (or ontologies) have been proposed. However, there are some limitations such as the facts of relying on predefined ontologies and fitting non-dynamic domains in the existing measures. Wikipedia provides a very large domain-independent encyclopedic repository and semantic network for computing semantic similarity of concepts with more coverage than usual ontologies. In this paper, we propose some novel feature based similarity assessment methods that are fully dependent on Wikipedia and can avoid most of the limitations and drawbacks introduced above. To implement similarity assessment based on feature by making use of Wikipedia, firstly a formal representation of Wikipedia concepts is presented. We then give a framework for feature based similarity based on the formal representation of Wikipedia concepts. Lastly, we investigate several feature based approaches to semantic similarity measures resulting from instantiations of the framework. The evaluation, based on several widely used benchmarks and a benchmark developed in ourselves, sustains the intuitions with respect to human judgements. Overall, several methods proposed in this paper have good human correlation and constitute some effective ways of determining similarity between Wikipedia concepts.
  9. Jiang, Y.; Bai, W.; Zhang, X.; Hu, J.: Wikipedia-based information content and semantic similarity computation (2017) 0.05 
    0.04646711 = product of:
  0.09293422 = sum of:
    0.013020686 = weight(_text_:for in 2877) [ClassicSimilarity], result of:
      0.013020686 = score(doc=2877,freq=4.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.14668301 = fieldWeight in 2877, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2877)
    0.079913534 = weight(_text_:computing in 2877) [ClassicSimilarity], result of:
      0.079913534 = score(doc=2877,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.3055734 = fieldWeight in 2877, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2877)
  0.5 = coord(2/4)
    Abstract
    The Information Content (IC) of a concept is a fundamental dimension in computational linguistics. It enables a better understanding of concept's semantics. In the past, several approaches to compute IC of a concept have been proposed. However, there are some limitations such as the facts of relying on corpora availability, manual tagging, or predefined ontologies and fitting non-dynamic domains in the existing methods. Wikipedia provides a very large domain-independent encyclopedic repository and semantic network for computing IC of concepts with more coverage than usual ontologies. In this paper, we propose some novel methods to IC computation of a concept to solve the shortcomings of existing approaches. The presented methods focus on the IC computation of a concept (i.e., Wikipedia category) drawn from the Wikipedia category structure. We propose several new IC-based measures to compute the semantic similarity between concepts. The evaluation, based on several widely used benchmarks and a benchmark developed in ourselves, sustains the intuitions with respect to human judgments. Overall, some methods proposed in this paper have a good human correlation and constitute some effective ways of determining IC values for concepts and semantic similarity between concepts.
  10. Brambilla, M.; Ceri, S.: Designing exploratory search applications upon Web data sources (2012) 0.04 
    0.043013833 = product of:
  0.08602767 = sum of:
    0.022096835 = weight(_text_:for in 428) [ClassicSimilarity], result of:
      0.022096835 = score(doc=428,freq=18.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.2489293 = fieldWeight in 428, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.03125 = fieldNorm(doc=428)
    0.06393083 = weight(_text_:computing in 428) [ClassicSimilarity], result of:
      0.06393083 = score(doc=428,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.24445872 = fieldWeight in 428, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.03125 = fieldNorm(doc=428)
  0.5 = coord(2/4)
    Abstract
    Search is the preferred method to access information in today's computing systems. The Web, accessed through search engines, is universally recognized as the source for answering users' information needs. However, offering a link to a Web page does not cover all information needs. Even simple problems, such as "Which theater offers an at least three-stars action movie in London close to a good Italian restaurant," can only be solved by searching the Web multiple times, e.g., by extracting a list of the recent action movies filtered by ranking, then looking for movie theaters, then looking for Italian restaurants close to them. While search engines hint to useful information, the user's brain is the fundamental platform for information integration. An important trend is the availability of new, specialized data sources-the so-called "long tail" of the Web of data. Such carefully collected and curated data sources can be much more valuable than information currently available in Web pages; however, many sources remain hidden or insulated, in the lack of software solutions for bringing them to surface and making them usable in the search context. A new class of tailor-made systems, designed to satisfy the needs of users with specific aims, will support the publishing and integration of data sources for vertical domains; the user will be able to select sources based on individual or collective trust, and systems will be able to route queries to such sources and to provide easyto-use interfaces for combining them within search strategies, at the same time, rewarding the data source owners for each contribution to effective search. Efforts such as Google's Fusion Tables show that the technology for bringing hidden data sources to surface is feasible.
  11. Jun, W.: ¬A knowledge network constructed by integrating classification, thesaurus and metadata in a digital library (2003) 0.04 
    0.038344223 = product of:
  0.076688446 = sum of:
    0.012757615 = weight(_text_:for in 1254) [ClassicSimilarity], result of:
      0.012757615 = score(doc=1254,freq=6.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.14371942 = fieldWeight in 1254, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.03125 = fieldNorm(doc=1254)
    0.06393083 = weight(_text_:computing in 1254) [ClassicSimilarity], result of:
      0.06393083 = score(doc=1254,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.24445872 = fieldWeight in 1254, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.03125 = fieldNorm(doc=1254)
  0.5 = coord(2/4)
    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.
    Source
    Bulletin of the American Society for Information Science. 29(2003) no.2, S.24-28
  12. Caro Castro, C.; Travieso Rodríguez, C.: Ariadne's thread : knowledge structures for browsing in OPAC's (2003) 0.04 
    0.036495555 = product of:
  0.07299111 = sum of:
    0.017051632 = weight(_text_:for in 2768) [ClassicSimilarity], result of:
      0.017051632 = score(doc=2768,freq=14.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.19209315 = fieldWeight in 2768, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2768)
    0.055939477 = weight(_text_:computing in 2768) [ClassicSimilarity], result of:
      0.055939477 = score(doc=2768,freq=2.0), product of:
        0.26151994 = queryWeight, product of:
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.047278564 = queryNorm
        0.21390139 = fieldWeight in 2768, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.5314693 = idf(docFreq=475, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2768)
  0.5 = coord(2/4)
    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
    Source
    Challenges in knowledge representation and organization for the 21st century: Integration of knowledge across boundaries. Proceedings of the 7th ISKO International Conference Granada, Spain, July 10-13, 2002. Ed.: M. López-Huertas
  13. Marx, E. et al.: Exploring term networks for semantic search over RDF knowledge graphs (2016) 0.03 
    0.025220998 = product of:
  0.050441995 = sum of:
    0.01841403 = weight(_text_:for in 3279) [ClassicSimilarity], result of:
      0.01841403 = score(doc=3279,freq=2.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.20744109 = fieldWeight in 3279, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.078125 = fieldNorm(doc=3279)
    0.032027967 = product of:
      0.064055935 = sum of:
        0.064055935 = weight(_text_:22 in 3279) [ClassicSimilarity], result of:
          0.064055935 = score(doc=3279,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.38690117 = fieldWeight in 3279, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=3279)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Source
    Metadata and semantics research: 10th International Conference, MTSR 2016, Göttingen, Germany, November 22-25, 2016, Proceedings. Eds.: E. Garoufallou
  14. Fieldhouse, M.; Hancock-Beaulieu, M.: ¬The design of a graphical user interface for a highly interactive information retrieval system (1996) 0.02 
    0.024099609 = product of:
  0.048199218 = sum of:
    0.025779642 = weight(_text_:for in 6958) [ClassicSimilarity], result of:
      0.025779642 = score(doc=6958,freq=8.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.29041752 = fieldWeight in 6958, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6958)
    0.022419576 = product of:
      0.04483915 = sum of:
        0.04483915 = weight(_text_:22 in 6958) [ClassicSimilarity], result of:
          0.04483915 = score(doc=6958,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.2708308 = fieldWeight in 6958, 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=6958)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    Reports on the design of a GUI for the Okapi 'best match' retrieval system developed at the Centre for Interactive Systems Research, City University, UK, for online library catalogues. The X-Windows interface includes an interactive query expansion (IQE) facilty which involves the user in the selection of query terms to reformulate a search. Presents the design rationale, based on a game board metaphor, and describes the features of each of the stages of the search interaction. Reports on the early operational field trial and discusses relevant evaluation issues and objectives
    Source
    Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
  15. Sacco, G.M.: Dynamic taxonomies and guided searches (2006) 0.02 
    0.022297945 = product of:
  0.04459589 = sum of:
    0.012889821 = weight(_text_:for in 5295) [ClassicSimilarity], result of:
      0.012889821 = score(doc=5295,freq=2.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.14520876 = fieldWeight in 5295, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5295)
    0.03170607 = product of:
      0.06341214 = sum of:
        0.06341214 = weight(_text_:22 in 5295) [ClassicSimilarity], result of:
          0.06341214 = score(doc=5295,freq=4.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.38301262 = fieldWeight in 5295, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5295)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Date
    22. 7.2006 17:56:22
    Source
    Journal of the American Society for Information Science and Technology. 57(2006) no.6, S.792-796
  16. Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004) 0.02 
    0.020656807 = product of:
  0.041313615 = sum of:
    0.022096837 = weight(_text_:for in 2419) [ClassicSimilarity], result of:
      0.022096837 = score(doc=2419,freq=8.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.24892932 = fieldWeight in 2419, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.046875 = fieldNorm(doc=2419)
    0.019216778 = product of:
      0.038433556 = sum of:
        0.038433556 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
          0.038433556 = score(doc=2419,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = 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.5 = coord(2/4)
    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
    Source
    Research and advanced technology for digital libraries : 8th European conference, ECDL 2004, Bath, UK, September 12-17, 2004 : proceedings. Eds.: Heery, R. u. E. Lyon
  17. Järvelin, K.; Kristensen, J.; Niemi, T.; Sormunen, E.; Keskustalo, H.: ¬A deductive data model for query expansion (1996) 0.02 
    0.020656807 = product of:
  0.041313615 = sum of:
    0.022096837 = weight(_text_:for in 2230) [ClassicSimilarity], result of:
      0.022096837 = score(doc=2230,freq=8.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.24892932 = fieldWeight in 2230, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.046875 = fieldNorm(doc=2230)
    0.019216778 = product of:
      0.038433556 = sum of:
        0.038433556 = weight(_text_:22 in 2230) [ClassicSimilarity], result of:
          0.038433556 = score(doc=2230,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.23214069 = fieldWeight in 2230, 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=2230)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    We present a deductive data model for concept-based query expansion. It is based on three abstraction levels: the conceptual, linguistic and occurrence levels. Concepts and relationships among them are represented at the conceptual level. The expression level represents natural language expressions for concepts. Each expression has one or more matching models at the occurrence level. Each model specifies the matching of the expression in database indices built in varying ways. The data model supports a concept-based query expansion and formulation tool, the ExpansionTool, for environments providing heterogeneous IR systems. Expansion is controlled by adjustable matching reliability.
    Source
    Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR '96), Zürich, Switzerland, August 18-22, 1996. Eds.: H.P. Frei et al
  18. Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998) 0.02 
    0.020324267 = product of:
  0.040648535 = sum of:
    0.01822896 = weight(_text_:for in 1319) [ClassicSimilarity], result of:
      0.01822896 = score(doc=1319,freq=4.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.20535621 = fieldWeight in 1319, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.022419576 = product of:
      0.04483915 = sum of:
        0.04483915 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
          0.04483915 = score(doc=1319,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.2708308 = fieldWeight in 1319, 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=1319)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
    Date
    1. 8.1996 22:08:06
  19. Faaborg, A.; Lagoze, C.: Semantic browsing (2003) 0.02 
    0.020324267 = product of:
  0.040648535 = sum of:
    0.01822896 = weight(_text_:for in 1026) [ClassicSimilarity], result of:
      0.01822896 = score(doc=1026,freq=4.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.20535621 = fieldWeight in 1026, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1026)
    0.022419576 = product of:
      0.04483915 = sum of:
        0.04483915 = weight(_text_:22 in 1026) [ClassicSimilarity], result of:
          0.04483915 = score(doc=1026,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.2708308 = fieldWeight in 1026, 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=1026)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    We have created software applications that allow users to both author and use Semantic Web metadata. To create and use a layer of semantic content on top of the existing Web, we have (1) implemented a user interface that expedites the task of attributing metadata to resources on the Web, and (2) augmented a Web browser to leverage this semantic metadata to provide relevant information and tasks to the user. This project provides a framework for annotating and reorganizing existing files, pages, and sites on the Web that is similar to Vannevar Bushrsquos original concepts of trail blazing and associative indexing.
    Source
    Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003
  20. Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995) 0.02 
    0.020186728 = product of:
  0.040373456 = sum of:
    0.024359472 = weight(_text_:for in 5697) [ClassicSimilarity], result of:
      0.024359472 = score(doc=5697,freq=14.0), product of:
        0.08876751 = queryWeight, product of:
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.047278564 = queryNorm
        0.27441877 = fieldWeight in 5697, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.8775425 = idf(docFreq=18385, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5697)
    0.016013984 = product of:
      0.032027967 = sum of:
        0.032027967 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
          0.032027967 = score(doc=5697,freq=2.0), product of:
            0.16556148 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047278564 = queryNorm
            0.19345059 = fieldWeight in 5697, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5697)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    The performance of 8 ranking algorithms was evaluated with respect to their effectiveness in ranking terms for query expansion. The evaluation was conducted within an investigation of interactive query expansion and relevance feedback in a real operational environment. Focuses on the identification of algorithms that most effectively take cognizance of user preferences. user choices (i.e. the terms selected by the searchers for the query expansion search) provided the yardstick for the evaluation of the 8 ranking algorithms. This methodology introduces a user oriented approach in evaluating ranking algorithms for query expansion in contrast to the standard, system oriented approaches. Similarities in the performance of the 8 algorithms and the ways these algorithms rank terms were the main focus of this evaluation. The findings demonstrate that the r-lohi, wpq, enim, and porter algorithms have similar performance in bringing good terms to the top of a ranked list of terms for query expansion. However, further evaluation of the algorithms in different (e.g. full text) environments is needed before these results can be generalized beyond the context of the present study
    Date
    22. 2.1996 13:14:10

Authors

Years

Languages

  • e 192
  • d 5
  • chi 1
  • f 1
  • More… Less…

Types

  • a 173
  • el 21
  • m 17
  • r 3
  • p 2
  • s 2
  • x 2
  • More… Less…

Themes

Subjects

Classifications