Search (6 results, page 1 of 1)

  • × theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
  • × theme_ss:"Suchmaschinen"
  1. Poynder, R.: Web research engines? (1996) 0.00
    0.0030148462 = product of:
      0.02411877 = sum of:
        0.02411877 = weight(_text_:data in 5698) [ClassicSimilarity], result of:
          0.02411877 = score(doc=5698,freq=2.0), product of:
            0.115061514 = queryWeight, product of:
              3.1620505 = idf(docFreq=5088, maxDocs=44218)
              0.03638826 = queryNorm
            0.2096163 = fieldWeight in 5698, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1620505 = idf(docFreq=5088, maxDocs=44218)
              0.046875 = fieldNorm(doc=5698)
      0.125 = coord(1/8)
    
    Abstract
    Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages
  2. Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015) 0.00
    0.0025123719 = product of:
      0.020098975 = sum of:
        0.020098975 = weight(_text_:data in 2696) [ClassicSimilarity], result of:
          0.020098975 = score(doc=2696,freq=2.0), product of:
            0.115061514 = queryWeight, product of:
              3.1620505 = idf(docFreq=5088, maxDocs=44218)
              0.03638826 = queryNorm
            0.17468026 = fieldWeight in 2696, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1620505 = idf(docFreq=5088, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2696)
      0.125 = coord(1/8)
    
    Abstract
    Search Engines have become an integral part of our day to day life. Our reliance on search engines increases with every passing day. With the amount of data available on Internet increasing exponentially, it becomes important to develop new methods and tools that help to return results relevant to the queries and reduce the time spent on searching. The results should be diverse but at the same time should return results focused on the queries asked. Relation Based Page Rank [4] algorithms are considered to be the next frontier in improvement of Semantic Web Search. The probability of finding relevance in the search results as posited by the user while entering the query is used to measure the relevance. However, its application is limited by the complexity of determining relation between the terms and assigning explicit meaning to each term. Trust Rank is one of the most widely used ranking algorithms for semantic web search. Few other ranking algorithms like HITS algorithm, PageRank algorithm are also used for Semantic Web Searching. In this paper, we will provide a comparison of few ranking approaches.
  3. Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014) 0.00
    0.0024706437 = product of:
      0.01976515 = sum of:
        0.01976515 = product of:
          0.0395303 = sum of:
            0.0395303 = weight(_text_:processing in 2799) [ClassicSimilarity], result of:
              0.0395303 = score(doc=2799,freq=2.0), product of:
                0.14730503 = queryWeight, product of:
                  4.048147 = idf(docFreq=2097, maxDocs=44218)
                  0.03638826 = queryNorm
                0.26835677 = fieldWeight in 2799, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.048147 = idf(docFreq=2097, maxDocs=44218)
                  0.046875 = fieldNorm(doc=2799)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Source
    Information processing and management. 50(2014) no.2, S.416-425
  4. Vidinli, I.B.; Ozcan, R.: New query suggestion framework and algorithms : a case study for an educational search engine (2016) 0.00
    0.0024706437 = product of:
      0.01976515 = sum of:
        0.01976515 = product of:
          0.0395303 = sum of:
            0.0395303 = weight(_text_:processing in 3185) [ClassicSimilarity], result of:
              0.0395303 = score(doc=3185,freq=2.0), product of:
                0.14730503 = queryWeight, product of:
                  4.048147 = idf(docFreq=2097, maxDocs=44218)
                  0.03638826 = queryNorm
                0.26835677 = fieldWeight in 3185, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.048147 = idf(docFreq=2097, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3185)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Source
    Information processing and management. 52(2016) no.5, S.733-752
  5. Roy, R.S.; Agarwal, S.; Ganguly, N.; Choudhury, M.: Syntactic complexity of Web search queries through the lenses of language models, networks and users (2016) 0.00
    0.00205887 = product of:
      0.01647096 = sum of:
        0.01647096 = product of:
          0.03294192 = sum of:
            0.03294192 = weight(_text_:processing in 3188) [ClassicSimilarity], result of:
              0.03294192 = score(doc=3188,freq=2.0), product of:
                0.14730503 = queryWeight, product of:
                  4.048147 = idf(docFreq=2097, maxDocs=44218)
                  0.03638826 = queryNorm
                0.22363065 = fieldWeight in 3188, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.048147 = idf(docFreq=2097, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=3188)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Source
    Information processing and management. 52(2016) no.5, S.923-948
  6. Gillitzer, B.: Yewno (2017) 0.00
    0.0012325267 = product of:
      0.009860214 = sum of:
        0.009860214 = product of:
          0.019720428 = sum of:
            0.019720428 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
              0.019720428 = score(doc=3447,freq=2.0), product of:
                0.12742549 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03638826 = queryNorm
                0.15476047 = fieldWeight in 3447, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03125 = fieldNorm(doc=3447)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Date
    22. 2.2017 10:16:49