Search (5 results, page 1 of 1)

0.098102 = product of:
  0.196204 = sum of:
    0.049051 = product of:
      0.147153 = sum of:
        0.147153 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.147153 = score(doc=701,freq=2.0), product of:
            0.3927445 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046325076 = queryNorm
            0.3746787 = fieldWeight in 701, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=701)
      0.33333334 = coord(1/3)
    0.147153 = weight(_text_:2f in 701) [ClassicSimilarity], result of:
      0.147153 = score(doc=701,freq=2.0), product of:
        0.3927445 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046325076 = queryNorm
        0.3746787 = fieldWeight in 701, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.03125 = fieldNorm(doc=701)
  0.5 = coord(2/4)

Content

Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.

0.007845511 = product of:
  0.031382043 = sum of:
    0.031382043 = product of:
      0.062764086 = sum of:
        0.062764086 = weight(_text_:22 in 3406) [ClassicSimilarity], result of:
          0.062764086 = score(doc=3406,freq=2.0), product of:
            0.16222252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046325076 = queryNorm
            0.38690117 = fieldWeight in 3406, 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=3406)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

30. 5.2010 16:22:35

0.005228086 = product of:
  0.020912344 = sum of:
    0.020912344 = product of:
      0.041824687 = sum of:
        0.041824687 = weight(_text_:aspects in 4569) [ClassicSimilarity], result of:
          0.041824687 = score(doc=4569,freq=2.0), product of:
            0.20938325 = queryWeight, product of:
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.046325076 = queryNorm
            0.19975184 = fieldWeight in 4569, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.03125 = fieldNorm(doc=4569)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

The results of this thesis are intended to support the information architect in designing a solution for improved search in a corporate environment. Specifically we have examined the type of search problems that require a domain model to enhance the search process. There are several approaches to modeling a domain. We have considered 3 different types of domain modeling schemes; taxonomy, thesaurus and ontology. The intention is to support the information architect in making an informed choice between one or more of these schemes. In our opinion the main criteria for this choice are the modeling characteristics of a scheme and the suitability for application in the search process. The second chapter is a discussion of modeling characteristics of each scheme, followed by a comparison between them. This should give an information architect an idea of which aspects of a domain can be modeled with each scheme. What is missing here is an indication of the effort required to model a domain with each scheme. There are too many factors that influence the amount of required effort, ranging from measurable factors like domain size and resource characteristics to cultural matters such as the willingness to share knowledge and the existence of a project champion in the team to keep the project running. The third chapter shows what role domain models can play in each part of the search process. This gives an idea of the problems that domain models can solve. We have split the search process into individual parts to show that domain models can be applied very differently in the process. The fourth chapter makes recommendations about the suitability of each individualdomain modeling scheme for improving search. Each scheme has particular characteristics that make it especially suitable for a domain or a search problem. In the appendix each case study is described in detail. These descriptions are intended to serve as a benchmark. The current problem of the enterprise can be compared to those described to see which case study is most similar, which solution was chosen, which problems arose and how they were dealt with. An important issue that we have not touched upon in this thesis is that of maintenance. The real problems of a domain model are revealed when it is applied in a search system and its deficits and wrong assumptions become clear. Adaptation and maintenance are always required. Unfortunately we have not been able to glean sufficient information about maintenance issues from our case studies to draw any meaningful conclusions.

0.005228086 = product of:
  0.020912344 = sum of:
    0.020912344 = product of:
      0.041824687 = sum of:
        0.041824687 = weight(_text_:aspects in 2281) [ClassicSimilarity], result of:
          0.041824687 = score(doc=2281,freq=2.0), product of:
            0.20938325 = queryWeight, product of:
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.046325076 = queryNorm
            0.19975184 = fieldWeight in 2281, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.03125 = fieldNorm(doc=2281)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

An information system like the Web is a continuously evolving system consisting of multiple heterogeneous information sources, covering a wide domain of discourse, and a huge number of users (human or software) with diverse characteristics and needs, that produce and consume information. The challenge nowadays is to build a scalable information infrastructure enabling the effective, accurate, content based retrieval of information, in a way that adapts to the characteristics and interests of the users. The aim of this work is to propose formally sound methods for building such an information network based on ontologies which are widely used and are easy to grasp by ordinary Web users. The main results of this work are: - A novel scheme for indexing and retrieving objects according to multiple aspects or facets. The proposed scheme is a faceted scheme enriched with a method for specifying the combinations of terms that are valid. We give a model-theoretic interpretation to this model and we provide mechanisms for inferring the valid combinations of terms. This inference service can be exploited for preventing errors during the indexing process, which is very important especially in the case where the indexing is done collaboratively by many users, and for deriving "complete" navigation trees suitable for browsing through the Web. The proposed scheme has several advantages over the hierarchical classification schemes currently employed by Web catalogs, namely, conceptual clarity (it is easier to understand), compactness (it takes less space), and scalability (the update operations can be formulated more easily and be performed more effciently). - A exible and effecient model for building mediators over ontology based information sources. The proposed mediators support several modes of query translation and evaluation which can accommodate various application needs and levels of answer quality. The proposed model can be used for providing users with customized views of Web catalogs. It can also complement the techniques for building mediators over relational sources so as to support approximate translation of partially ordered domain values.

0.0039227554 = product of:
  0.015691021 = sum of:
    0.015691021 = product of:
      0.031382043 = sum of:
        0.031382043 = weight(_text_:22 in 1670) [ClassicSimilarity], result of:
          0.031382043 = score(doc=1670,freq=2.0), product of:
            0.16222252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046325076 = queryNorm
            0.19345059 = fieldWeight in 1670, 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=1670)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

26. 9.2006 21:00:22