Search (6 results, page 1 of 1)

  • × author_ss:"Mayr, P."
  • × year_i:[2000 TO 2010}
  1. Lewandowski, D.; Mayr, P.: Exploring the academic invisible Web (2006) 0.01 
    0.00880801 = product of:
  0.02642403 = sum of:
    0.02642403 = product of:
      0.05284806 = sum of:
        0.05284806 = weight(_text_:methodology in 3752) [ClassicSimilarity], result of:
          0.05284806 = score(doc=3752,freq=2.0), product of:
            0.21236731 = queryWeight, product of:
              4.504705 = idf(docFreq=1328, maxDocs=44218)
              0.047143444 = queryNorm
            0.24885213 = fieldWeight in 3752, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.504705 = idf(docFreq=1328, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3752)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Purpose: To provide a critical review of Bergman's 2001 study on the Deep Web. In addition, we bring a new concept into the discussion, the Academic Invisible Web (AIW). We define the Academic Invisible Web as consisting of all databases and collections relevant to academia but not searchable by the general-purpose internet search engines. Indexing this part of the Invisible Web is central to scien-tific search engines. We provide an overview of approaches followed thus far. Design/methodology/approach: Discussion of measures and calculations, estima-tion based on informetric laws. Literature review on approaches for uncovering information from the Invisible Web. Findings: Bergman's size estimate of the Invisible Web is highly questionable. We demonstrate some major errors in the conceptual design of the Bergman paper. A new (raw) size estimate is given. Research limitations/implications: The precision of our estimate is limited due to a small sample size and lack of reliable data. Practical implications: We can show that no single library alone will be able to index the Academic Invisible Web. We suggest collaboration to accomplish this task. Originality/value: Provides library managers and those interested in developing academic search engines with data on the size and attributes of the Academic In-visible Web.
  2. Mayr, P.; Mutschke, P.; Petras, V.: Reducing semantic complexity in distributed digital libraries : Treatment of term vagueness and document re-ranking (2008) 0.01 
    0.00880801 = product of:
  0.02642403 = sum of:
    0.02642403 = product of:
      0.05284806 = sum of:
        0.05284806 = weight(_text_:methodology in 1909) [ClassicSimilarity], result of:
          0.05284806 = score(doc=1909,freq=2.0), product of:
            0.21236731 = queryWeight, product of:
              4.504705 = idf(docFreq=1328, maxDocs=44218)
              0.047143444 = queryNorm
            0.24885213 = fieldWeight in 1909, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.504705 = idf(docFreq=1328, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1909)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Purpose - The general science portal "vascoda" merges structured, high-quality information collections from more than 40 providers on the basis of search engine technology (FAST) and a concept which treats semantic heterogeneity between different controlled vocabularies. First experiences with the portal show some weaknesses of this approach which come out in most metadata-driven Digital Libraries (DLs) or subject specific portals. The purpose of the paper is to propose models to reduce the semantic complexity in heterogeneous DLs. The aim is to introduce value-added services (treatment of term vagueness and document re-ranking) that gain a certain quality in DLs if they are combined with heterogeneity components established in the project "Competence Center Modeling and Treatment of Semantic Heterogeneity". Design/methodology/approach - Two methods, which are derived from scientometrics and network analysis, will be implemented with the objective to re-rank result sets by the following structural properties: the ranking of the results by core journals (so-called Bradfordizing) and ranking by centrality of authors in co-authorship networks. Findings - The methods, which will be implemented, focus on the query and on the result side of a search and are designed to positively influence each other. Conceptually, they will improve the search quality and guarantee that the most relevant documents in result sets will be ranked higher. Originality/value - The central impact of the paper focuses on the integration of three structural value-adding methods, which aim at reducing the semantic complexity represented in distributed DLs at several stages in the information retrieval process: query construction, search and ranking and re-ranking.
  3. Lewandowski, D.; Mayr, P.: Exploring the academic invisible Web (2006) 0.01 
    0.00880801 = product of:
  0.02642403 = sum of:
    0.02642403 = product of:
      0.05284806 = sum of:
        0.05284806 = weight(_text_:methodology in 2580) [ClassicSimilarity], result of:
          0.05284806 = score(doc=2580,freq=2.0), product of:
            0.21236731 = queryWeight, product of:
              4.504705 = idf(docFreq=1328, maxDocs=44218)
              0.047143444 = queryNorm
            0.24885213 = fieldWeight in 2580, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.504705 = idf(docFreq=1328, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2580)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Purpose: To provide a critical review of Bergman's 2001 study on the deep web. In addition, we bring a new concept into the discussion, the academic invisible web (AIW). We define the academic invisible web as consisting of all databases and collections relevant to academia but not searchable by the general-purpose internet search engines. Indexing this part of the invisible web is central to scientific search engines. We provide an overview of approaches followed thus far. Design/methodology/approach: Discussion of measures and calculations, estimation based on informetric laws. Literature review on approaches for uncovering information from the invisible web. Findings: Bergman's size estimate of the invisible web is highly questionable. We demonstrate some major errors in the conceptual design of the Bergman paper. A new (raw) size estimate is given. Research limitations/implications: The precision of our estimate is limited due to a small sample size and lack of reliable data. Practical implications: We can show that no single library alone will be able to index the academic invisible web. We suggest collaboration to accomplish this task. Originality/value: Provides library managers and those interested in developing academic search engines with data on the size and attributes of the academic invisible web.
  4. Daniel, F.; Maier, C.; Mayr, P.; Wirtz, H.-C.: ¬Die Kunden dort bedienen, wo sie sind : DigiAuskunft besteht Bewährungsprobe / Seit Anfang 2006 in Betrieb (2006) 0.01 
    0.0074518337 = product of:
  0.0223555 = sum of:
    0.0223555 = product of:
      0.044711 = sum of:
        0.044711 = weight(_text_:22 in 5991) [ClassicSimilarity], result of:
          0.044711 = score(doc=5991,freq=2.0), product of:
            0.16508831 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047143444 = queryNorm
            0.2708308 = fieldWeight in 5991, 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=5991)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    8. 7.2006 21:06:22
  5. Mayr, P.; Petras, V.: Building a Terminology Network for Search : the KoMoHe project (2008) 0.01 
    0.0074518337 = product of:
  0.0223555 = sum of:
    0.0223555 = product of:
      0.044711 = sum of:
        0.044711 = weight(_text_:22 in 2618) [ClassicSimilarity], result of:
          0.044711 = score(doc=2618,freq=2.0), product of:
            0.16508831 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047143444 = queryNorm
            0.2708308 = fieldWeight in 2618, 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=2618)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas
  6. Lauser, B.; Johannsen, G.; Caracciolo, C.; Hage, W.R. van; Keizer, J.; Mayr, P.: Comparing human and automatic thesaurus mapping approaches in the agricultural domain (2008) 0.01 
    0.0053227386 = product of:
  0.015968215 = sum of:
    0.015968215 = product of:
      0.03193643 = sum of:
        0.03193643 = weight(_text_:22 in 2627) [ClassicSimilarity], result of:
          0.03193643 = score(doc=2627,freq=2.0), product of:
            0.16508831 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.047143444 = queryNorm
            0.19345059 = fieldWeight in 2627, 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=2627)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas

Authors

Languages

Types

Themes