Search (26 results, page 1 of 2)

  • × year_i:[2010 TO 2020}
  • × theme_ss:"Suchmaschinen"
  1. Fluhr, C.: Crosslingual access to photo databases (2012) 0.05 
    0.046356894 = product of:
  0.13907067 = sum of:
    0.09983622 = weight(_text_:problem in 93) [ClassicSimilarity], result of:
      0.09983622 = score(doc=93,freq=6.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.48735106 = fieldWeight in 93, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=93)
    0.03923445 = weight(_text_:22 in 93) [ClassicSimilarity], result of:
      0.03923445 = score(doc=93,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.23214069 = fieldWeight in 93, 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=93)
  0.33333334 = coord(2/6)
    Abstract
    This paper is about search of photos in photo databases of agencies which sell photos over the Internet. The problem is far from the behavior of photo databases managed by librarians and also far from the corpora generally used for research purposes. The descriptions use mainly single words and it is well known that it is not the best way to have a good search. This increases the problem of semantic ambiguity. This problem of semantic ambiguity is crucial for cross-language querying. On the other hand, users are not aware of documentation techniques and use generally very simple queries but want to get precise answers. This paper gives the experience gained in a 3 year use (2006-2008) of a cross-language access to several of the main international commercial photo databases. The languages used were French, English, and German.
    Date
    17. 4.2012 14:25:22
  2. Bouidghaghen, O.; Tamine, L.: Spatio-temporal based personalization for mobile search (2012) 0.03 
    0.032291643 = product of:
  0.09687492 = sum of:
    0.05764047 = weight(_text_:problem in 108) [ClassicSimilarity], result of:
      0.05764047 = score(doc=108,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 108, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=108)
    0.03923445 = weight(_text_:22 in 108) [ClassicSimilarity], result of:
      0.03923445 = score(doc=108,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.23214069 = fieldWeight in 108, 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=108)
  0.33333334 = coord(2/6)
    Abstract
    The explosion of the information available on the Internet has made traditional information retrieval systems, characterized by one size fits all approaches, less effective. Indeed, users are overwhelmed by the information delivered by such systems in response to their queries, particularly when the latter are ambiguous. In order to tackle this problem, the state-of-the-art reveals that there is a growing interest towards contextual information retrieval (CIR) which relies on various sources of evidence issued from the user's search background and environment, in order to improve the retrieval accuracy. This chapter focuses on mobile context, highlights challenges they present for IR, and gives an overview of CIR approaches applied in this environment. Then, the authors present an approach to personalize search results for mobile users by exploiting both cognitive and spatio-temporal contexts. The experimental evaluation undertaken in front of Yahoo search shows that the approach improves the quality of top search result lists and enhances search result precision.
    Date
    20. 4.2012 13:19:22
  3. Vidinli, I.B.; Ozcan, R.: New query suggestion framework and algorithms : a case study for an educational search engine (2016) 0.01 
    0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 3185) [ClassicSimilarity], result of:
      0.05764047 = score(doc=3185,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 3185, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=3185)
  0.16666667 = coord(1/6)
    Abstract
    Query suggestion is generally an integrated part of web search engines. In this study, we first redefine and reduce the query suggestion problem as "comparison of queries". We then propose a general modular framework for query suggestion algorithm development. We also develop new query suggestion algorithms which are used in our proposed framework, exploiting query, session and user features. As a case study, we use query logs of a real educational search engine that targets K-12 students in Turkey. We also exploit educational features (course, grade) in our query suggestion algorithms. We test our framework and algorithms over a set of queries by an experiment and demonstrate a 66-90% statistically significant increase in relevance of query suggestions compared to a baseline method.
  4. Luo, M.M.; Nahl, D.: Let's Google : uncertainty and bilingual search (2019) 0.01 
    0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 5363) [ClassicSimilarity], result of:
      0.05764047 = score(doc=5363,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 5363, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=5363)
  0.16666667 = coord(1/6)
    Abstract
    This study applies Kuhlthau's Information Search Process stage (ISP) model to understand bilingual users' Internet search experience. We conduct a quasi-field experiment with 30 bilingual searchers and the results suggested that the ISP model was applicable in studying searchers' information retrieval behavior in search tasks. The ISP model was applicable in studying searchers' information retrieval behavior in simple tasks. However, searchers' emotional responses differed from those of the ISP model for a complex task. By testing searchers using different search strategies, the results suggested that search engines with multilanguage search functions provide an advantage for bilingual searchers in the Internet's multilingual environment. The findings showed that when searchers used a search engine as a tool for problem solving, they might experience different feelings in each ISP stage than in searching for information for a term paper using a library. The results echo other research findings that indicate that information seeking is a multifaceted phenomenon.
  5. Lewandowski, D.: Query understanding (2011) 0.01 
    0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 344) [ClassicSimilarity], result of:
      0.052312598 = score(doc=344,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 344, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0625 = fieldNorm(doc=344)
  0.16666667 = coord(1/6)
    Date
    18. 9.2018 18:22:18
  6. Bensman, S.J.: Eugene Garfield, Francis Narin, and PageRank : the theoretical bases of the Google search engine (2013) 0.01 
    0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
      0.052312598 = score(doc=1149,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 1149, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0625 = fieldNorm(doc=1149)
  0.16666667 = coord(1/6)
    Date
    17.12.2013 11:02:22
  7. Tober, M.; Hennig, L.; Furch, D.: SEO Ranking-Faktoren und Rang-Korrelationen 2014 : Google Deutschland (2014) 0.01 
    0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 1484) [ClassicSimilarity], result of:
      0.052312598 = score(doc=1484,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 1484, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0625 = fieldNorm(doc=1484)
  0.16666667 = coord(1/6)
    Date
    13. 9.2014 14:45:22
  8. Schaat, S.: Von der automatisierten Manipulation zur Manipulation der Automatisierung (2019) 0.01 
    0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 4996) [ClassicSimilarity], result of:
      0.052312598 = score(doc=4996,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 4996, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0625 = fieldNorm(doc=4996)
  0.16666667 = coord(1/6)
    Date
    19. 2.2019 17:22:00
  9. Shapira, B.; Zabar, B.: Personalized search : integrating collaboration and social networks (2011) 0.01 
    0.008005621 = product of:
  0.04803372 = sum of:
    0.04803372 = weight(_text_:problem in 4140) [ClassicSimilarity], result of:
      0.04803372 = score(doc=4140,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.23447686 = fieldWeight in 4140, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4140)
  0.16666667 = coord(1/6)
    Abstract
    Despite improvements in their capabilities, search engines still fail to provide users with only relevant results. One reason is that most search engines implement a "one size fits all" approach that ignores personal preferences when retrieving the results of a user's query. Recent studies (Smyth, 2010) have elaborated the importance of personalizing search results and have proposed integrating recommender system methods for enhancing results using contextual and extrinsic information that might indicate the user's actual needs. In this article, we review recommender system methods used for personalizing and improving search results and examine the effect of two such methods that are merged for this purpose. One method is based on collaborative users' knowledge; the second integrates information from the user's social network. We propose new methods for collaborative-and social-based search and demonstrate that each of these methods, when separately applied, produce more accurate search results than does a purely keyword-based search engine (referred to as "standard search engine"), where the social search engine is more accurate than is the collaborative one. However, separately applied, these methods do not produce a sufficient number of results (low coverage). Nevertheless, merging these methods with those implemented by standard search engines overcomes the low-coverage problem and produces personalized results for users that display significantly more accurate results while also providing sufficient coverage than do standard search engines. The improvement, however, is significant only for topics for which the diversity of terms used for queries among users is low.
  10. Weigert, M.: Horizobu: Webrecherche statt Websuche (2011) 0.01 
    0.006792995 = product of:
  0.04075797 = sum of:
    0.04075797 = weight(_text_:problem in 4443) [ClassicSimilarity], result of:
      0.04075797 = score(doc=4443,freq=4.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.19896023 = fieldWeight in 4443, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.0234375 = fieldNorm(doc=4443)
  0.16666667 = coord(1/6)
    Content
    "Das Problem mit der Suchmaschinen-Optimierung Suchmaschinen sind unser Instrument, um mit der Informationsflut im Internet klar zu kommen. Wie ich in meinem Artikel Die kürzeste Anleitung zur Suchmaschinenoptimierung aller Zeiten ausgeführt habe, gibt es dabei leider das Problem, dass der Platzhirsch Google nicht wirklich die besten Suchresultate liefert: Habt ihr schon mal nach einem Hotel, einem Restaurant oder einer anderen Location gesucht - und die ersten vier Ergebnis-Seiten sind voller Location-Aggregatoren? Wenn ich ganz spezifisch nach einem Hotel soundso in der Soundso-Strasse suche, dann finde ich, das relevanteste Ergebnis ist die Webseite dieses Hotels. Das gehört auf Seite 1 an Platz 1. Dort aber finden sich nur die Webseiten, die ganz besonders dolle suchmaschinenoptimiert sind. Wobei Google Webseiten als am suchmaschinenoptimiertesten einstuft, wenn möglichst viele Links darauf zeigen und der Inhalt relevant sein soll. Die Industrie der Suchmaschinen-Optimierer erreicht dies dadurch, dass sie folgende Dinge machen: - sie lassen Programme und Praktikanten im Web rumschwirren, die sich überall mit hirnlosen Kommentaren verewigen (Hauptsache, die sind verlinkt und zeigen auf ihre zu pushende Webseite) - sie erschaffen geistlose Blogs, in denen hirnlose Texte stehen (Hauptsache, die Keyword-Dichte stimmt) - diese Texte lassen sie durch Schüler und Praktikanten oder gleich durch Software schreiben - Dann kommt es anscheinend noch auf Keywords im Titel, in der URL etc. an.
  11. Chen, L.-C.: Next generation search engine for the result clustering technology (2012) 0.01 
    0.0065390747 = product of:
  0.03923445 = sum of:
    0.03923445 = weight(_text_:22 in 105) [ClassicSimilarity], result of:
      0.03923445 = score(doc=105,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.23214069 = fieldWeight in 105, 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=105)
  0.16666667 = coord(1/6)
    Date
    17. 4.2012 15:22:11
  12. Lewandowski, D.: ¬Die Macht der Suchmaschinen und ihr Einfluss auf unsere Entscheidungen (2014) 0.01 
    0.0065390747 = product of:
  0.03923445 = sum of:
    0.03923445 = weight(_text_:22 in 1491) [ClassicSimilarity], result of:
      0.03923445 = score(doc=1491,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.23214069 = fieldWeight in 1491, 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=1491)
  0.16666667 = coord(1/6)
    Date
    22. 9.2014 18:54:11
  13. Huvila, I.: Affective capitalism of knowing and the society of search engine (2016) 0.01 
    0.0065390747 = product of:
  0.03923445 = sum of:
    0.03923445 = weight(_text_:22 in 3246) [ClassicSimilarity], result of:
      0.03923445 = score(doc=3246,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.23214069 = fieldWeight in 3246, 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=3246)
  0.16666667 = coord(1/6)
    Date
    20. 1.2015 18:30:22
  14. Bressan, M.; Peserico, E.: Choose the damping, choose the ranking? (2010) 0.01 
    0.0064044963 = product of:
  0.038426977 = sum of:
    0.038426977 = weight(_text_:problem in 2563) [ClassicSimilarity], result of:
      0.038426977 = score(doc=2563,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.1875815 = fieldWeight in 2563, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.03125 = fieldNorm(doc=2563)
  0.16666667 = coord(1/6)
    Abstract
    To what extent can changes in PageRank's damping factor affect node ranking? We prove that, at least on some graphs, the top k nodes assume all possible k! orderings as the damping factor varies, even if it varies within an arbitrarily small interval (e.g. [0.84999,0.85001][0.84999,0.85001]). Thus, the rank of a node for a given (finite set of discrete) damping factor(s) provides very little information about the rank of that node as the damping factor varies over a continuous interval. We bypass this problem introducing lineage analysis and proving that there is a simple condition, with a "natural" interpretation independent of PageRank, that allows one to verify "in one shot" if a node outperforms another simultaneously for all damping factors and all damping variables (informally, time variant damping factors). The novel notions of strong rank and weak rank of a node provide a measure of the fuzziness of the rank of that node, of the objective orderability of a graph's nodes, and of the quality of results returned by different ranking algorithms based on the random surfer model. We deploy our analytical tools on a 41M node snapshot of the .it Web domain and on a 0.7M node snapshot of the CiteSeer citation graph. Among other findings, we show that rank is indeed relatively stable in both graphs; that "classic" PageRank (d=0.85) marginally outperforms Weighted In-degree (d->0), mainly due to its ability to ferret out "niche" items; and that, for both the Web and CiteSeer, the ideal damping factor appears to be 0.8-0.9 to obtain those items of high importance to at least one (model of randomly surfing) user, but only 0.5-0.6 to obtain those items important to every (model of randomly surfing) user.
  15. Chaudiron, S.; Ihadjadene, M.: Studying Web search engines from a user perspective : key concepts and main approaches (2012) 0.01 
    0.0054492294 = product of:
  0.032695375 = sum of:
    0.032695375 = weight(_text_:22 in 109) [ClassicSimilarity], result of:
      0.032695375 = score(doc=109,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.19345059 = fieldWeight in 109, 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=109)
  0.16666667 = coord(1/6)
    Date
    20. 4.2012 13:22:37
  16. Lewandowski, D.; Spree, U.: Ranking of Wikipedia articles in search engines revisited : fair ranking for reasonable quality? (2011) 0.01 
    0.0054492294 = product of:
  0.032695375 = sum of:
    0.032695375 = weight(_text_:22 in 444) [ClassicSimilarity], result of:
      0.032695375 = score(doc=444,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.19345059 = fieldWeight in 444, 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=444)
  0.16666667 = coord(1/6)
    Date
    30. 9.2012 19:27:22
  17. Aloteibi, S.; Sanderson, M.: Analyzing geographic query reformulation : an exploratory study (2014) 0.01 
    0.0054492294 = product of:
  0.032695375 = sum of:
    0.032695375 = weight(_text_:22 in 1177) [ClassicSimilarity], result of:
      0.032695375 = score(doc=1177,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.19345059 = fieldWeight in 1177, 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=1177)
  0.16666667 = coord(1/6)
    Date
    26. 1.2014 18:48:22
  18. Vaughan, L.; Chen, Y.: Data mining from web search queries : a comparison of Google trends and Baidu index (2015) 0.01 
    0.0054492294 = product of:
  0.032695375 = sum of:
    0.032695375 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
      0.032695375 = score(doc=1605,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.19345059 = fieldWeight in 1605, 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=1605)
  0.16666667 = coord(1/6)
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.1, S.13-22
  19. Alqaraleh, S.; Ramadan, O.; Salamah, M.: Efficient watcher based web crawler design (2015) 0.01 
    0.0054492294 = product of:
  0.032695375 = sum of:
    0.032695375 = weight(_text_:22 in 1627) [ClassicSimilarity], result of:
      0.032695375 = score(doc=1627,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.19345059 = fieldWeight in 1627, 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=1627)
  0.16666667 = coord(1/6)
    Date
    20. 1.2015 18:30:22
  20. epd: Kaiserslauterer Forscher untersuchen Google-Suche (2017) 0.01 
    0.0054492294 = product of:
  0.032695375 = sum of:
    0.032695375 = weight(_text_:22 in 3815) [ClassicSimilarity], result of:
      0.032695375 = score(doc=3815,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.19345059 = fieldWeight in 3815, 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=3815)
  0.16666667 = coord(1/6)
    Date
    22. 7.2004 9:42:33

Authors

Languages

  • e 17
  • d 9

Types

  • a 22
  • el 4
  • m 1
  • r 1
  • More… Less…

Themes

Subjects

Classifications