-
Schomburg, S.; Prante, J.: Search Engine Federation in Libraries - Suchmaschinenföderation in Bibliotheken (2009)
0.01
0.011314914 = product of:
0.06788948 = sum of:
0.0052914224 = weight(_text_:in in 2809) [ClassicSimilarity], result of:
0.0052914224 = score(doc=2809,freq=8.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.18034597 = fieldWeight in 2809, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=2809)
0.020302603 = weight(_text_:bibliotheken in 2809) [ClassicSimilarity], result of:
0.020302603 = score(doc=2809,freq=2.0), product of:
0.08127756 = queryWeight, product of:
3.768121 = idf(docFreq=2775, maxDocs=44218)
0.021569785 = queryNorm
0.24979347 = fieldWeight in 2809, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.768121 = idf(docFreq=2775, maxDocs=44218)
0.046875 = fieldNorm(doc=2809)
0.020302603 = weight(_text_:bibliotheken in 2809) [ClassicSimilarity], result of:
0.020302603 = score(doc=2809,freq=2.0), product of:
0.08127756 = queryWeight, product of:
3.768121 = idf(docFreq=2775, maxDocs=44218)
0.021569785 = queryNorm
0.24979347 = fieldWeight in 2809, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.768121 = idf(docFreq=2775, maxDocs=44218)
0.046875 = fieldNorm(doc=2809)
0.020302603 = weight(_text_:bibliotheken in 2809) [ClassicSimilarity], result of:
0.020302603 = score(doc=2809,freq=2.0), product of:
0.08127756 = queryWeight, product of:
3.768121 = idf(docFreq=2775, maxDocs=44218)
0.021569785 = queryNorm
0.24979347 = fieldWeight in 2809, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.768121 = idf(docFreq=2775, maxDocs=44218)
0.046875 = fieldNorm(doc=2809)
0.0016902501 = weight(_text_:s in 2809) [ClassicSimilarity], result of:
0.0016902501 = score(doc=2809,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.072074346 = fieldWeight in 2809, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.046875 = fieldNorm(doc=2809)
0.16666667 = coord(5/30)
- Abstract
- The hbz (Academic Library Center, Cologne) has a strong focus on search engine applications: Beyond the projected integration of respective technologies into the new release of the Digital Library portal solution (DigiBib6), vascoda background services also apply and take advantage of search engine technology. Experience since 2003 has given proof that building and updating of search engine indexes involves a vast amount of resources. The use of search engine federations, however, pledges major improvements: The total amount of data records held in linked indexes can be almost unlimited but also allow for a joint output of all hits retrieved. A federation also comes with excellent response times - hits retrieved can also refer to or link into the original system's layout. Nonetheless, the major challenge these days is different search engine technologies, e.g. Lucene and FAST, the variations in terms of ranking, and the implementation or non-implementation of so-called drill-downs. The lecture is designed to give a brief insight into the hbz search engine workshop with an introduction to the special project state of play.
-
Kopp, O.: Google Hummingbird-Algorithmus-Update : Infos & Hintergründe (2013)
0.00
0.0031473883 = product of:
0.031473882 = sum of:
0.01419361 = weight(_text_:und in 2522) [ClassicSimilarity], result of:
0.01419361 = score(doc=2522,freq=6.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.2968967 = fieldWeight in 2522, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=2522)
0.0030866629 = weight(_text_:in in 2522) [ClassicSimilarity], result of:
0.0030866629 = score(doc=2522,freq=2.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.10520181 = fieldWeight in 2522, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=2522)
0.01419361 = weight(_text_:und in 2522) [ClassicSimilarity], result of:
0.01419361 = score(doc=2522,freq=6.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.2968967 = fieldWeight in 2522, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=2522)
0.1 = coord(3/30)
- Abstract
- Pünktlich zum 15. Geburtstag der Google Suche verkündete Google gestern auf einer Pressekonferenz in der "Gründungs-Garage", dass das bedeutendste Google Update seit dem Caffeine Update im Jahr 2010 und größte Algorithmus-Update seit 2001 schon seit ca. einem Monat aktiv ist. Das aktuelle Update heißt Hummingbird zu deutsch Kollibri. Es soll ca. 90% aller Suchanfragen betreffen und soll im Vergleich zu Caffeine ein echtes Algorithmus-Update sein. Es soll dabei helfen komplexere Suchanfragen besser zu deuten und noch besser die eigentliche Suchintention bzw. Fragestellung hinter einer Suchanfrage zu erkennen sowie passende Dokumente dazu anzubieten. Auch auf Dokumentenebene soll die eigentliche Intention hinter dem Content besser mit der Suchanfrage gematcht werden.
-
Hogan, A.; Harth, A.; Umbrich, J.; Kinsella, S.; Polleres, A.; Decker, S.: Searching and browsing Linked Data with SWSE : the Semantic Web Search Engine (2011)
0.00
0.002604256 = product of:
0.019531919 = sum of:
0.0058533465 = weight(_text_:und in 438) [ClassicSimilarity], result of:
0.0058533465 = score(doc=438,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.12243814 = fieldWeight in 438, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0390625 = fieldNorm(doc=438)
0.005833246 = weight(_text_:in in 438) [ClassicSimilarity], result of:
0.005833246 = score(doc=438,freq=14.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.19881277 = fieldWeight in 438, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=438)
0.0058533465 = weight(_text_:und in 438) [ClassicSimilarity], result of:
0.0058533465 = score(doc=438,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.12243814 = fieldWeight in 438, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0390625 = fieldNorm(doc=438)
0.001991979 = weight(_text_:s in 438) [ClassicSimilarity], result of:
0.001991979 = score(doc=438,freq=4.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.08494043 = fieldWeight in 438, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.0390625 = fieldNorm(doc=438)
0.13333334 = coord(4/30)
- Abstract
- In this paper, we discuss the architecture and implementation of the Semantic Web Search Engine (SWSE). Following traditional search engine architecture, SWSE consists of crawling, data enhancing, indexing and a user interface for search, browsing and retrieval of information; unlike traditional search engines, SWSE operates over RDF Web data - loosely also known as Linked Data - which implies unique challenges for the system design, architecture, algorithms, implementation and user interface. In particular, many challenges exist in adopting Semantic Web technologies for Web data: the unique challenges of the Web - in terms of scale, unreliability, inconsistency and noise - are largely overlooked by the current Semantic Web standards. Herein, we describe the current SWSE system, initially detailing the architecture and later elaborating upon the function, design, implementation and performance of each individual component. In so doing, we also give an insight into how current Semantic Web standards can be tailored, in a best-effort manner, for use on Web data. Throughout, we offer evaluation and complementary argumentation to support our design choices, and also offer discussion on future directions and open research questions. Later, we also provide candid discussion relating to the difficulties currently faced in bringing such a search engine into the mainstream, and lessons learnt from roughly six years working on the Semantic Web Search Engine project.
- Content
- Vgl.: http://swse.deri.org/ und http://swse.org/.
-
Smith, A.G.: Search features of digital libraries (2000)
0.00
0.0016693742 = product of:
0.016693741 = sum of:
0.0070240153 = weight(_text_:und in 940) [ClassicSimilarity], result of:
0.0070240153 = score(doc=940,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.14692576 = fieldWeight in 940, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=940)
0.0026457112 = weight(_text_:in in 940) [ClassicSimilarity], result of:
0.0026457112 = score(doc=940,freq=2.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.09017298 = fieldWeight in 940, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=940)
0.0070240153 = weight(_text_:und in 940) [ClassicSimilarity], result of:
0.0070240153 = score(doc=940,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.14692576 = fieldWeight in 940, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=940)
0.1 = coord(3/30)
- Abstract
- Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc). This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries; for instance, by providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc.
- Content
- Enthält eine Zusammenstellung der Werkzeuge und Hilfsmittel des Information Retrieval
-
Birmingham, J.: Internet search engines (1996)
0.00
0.0015217247 = product of:
0.02282587 = sum of:
0.0052914224 = weight(_text_:in in 5664) [ClassicSimilarity], result of:
0.0052914224 = score(doc=5664,freq=2.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.18034597 = fieldWeight in 5664, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.09375 = fieldNorm(doc=5664)
0.017534448 = product of:
0.035068896 = sum of:
0.035068896 = weight(_text_:22 in 5664) [ClassicSimilarity], result of:
0.035068896 = score(doc=5664,freq=2.0), product of:
0.07553371 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.021569785 = queryNorm
0.46428138 = fieldWeight in 5664, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=5664)
0.5 = coord(1/2)
0.06666667 = coord(2/30)
- Abstract
- Basically a good listing in table format of features from the major search engines
- Date
- 10.11.1996 16:36:22
-
Page, L.; Brin, S.; Motwani, R.; Winograd, T.: ¬The PageRank citation ranking : Bringing order to the Web (1999)
0.00
0.0014342186 = product of:
0.021513278 = sum of:
0.017569361 = product of:
0.052708082 = sum of:
0.052708082 = weight(_text_:l in 496) [ClassicSimilarity], result of:
0.052708082 = score(doc=496,freq=2.0), product of:
0.0857324 = queryWeight, product of:
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.021569785 = queryNorm
0.6147977 = fieldWeight in 496, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.109375 = fieldNorm(doc=496)
0.33333334 = coord(1/3)
0.003943917 = weight(_text_:s in 496) [ClassicSimilarity], result of:
0.003943917 = score(doc=496,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.16817348 = fieldWeight in 496, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.109375 = fieldNorm(doc=496)
0.06666667 = coord(2/30)
-
Brin, S.; Page, L.: ¬The anatomy of a large-scale hypertextual Web search engine (1998)
0.00
0.0013667287 = product of:
0.013667286 = sum of:
0.0054005357 = weight(_text_:in in 947) [ClassicSimilarity], result of:
0.0054005357 = score(doc=947,freq=12.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.18406484 = fieldWeight in 947, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=947)
0.006274772 = product of:
0.018824315 = sum of:
0.018824315 = weight(_text_:l in 947) [ClassicSimilarity], result of:
0.018824315 = score(doc=947,freq=2.0), product of:
0.0857324 = queryWeight, product of:
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.021569785 = queryNorm
0.2195706 = fieldWeight in 947, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.0390625 = fieldNorm(doc=947)
0.33333334 = coord(1/3)
0.001991979 = weight(_text_:s in 947) [ClassicSimilarity], result of:
0.001991979 = score(doc=947,freq=4.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.08494043 = fieldWeight in 947, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.0390625 = fieldNorm(doc=947)
0.1 = coord(3/30)
- Abstract
- In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://google.stanford.edu/. To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want
- Source
- Computer networks. 30(1998) no.1-7, S.107-117
-
Boldi, P.; Santini, M.; Vigna, S.: PageRank as a function of the damping factor (2005)
0.00
0.0013644554 = product of:
0.013644554 = sum of:
0.004929992 = weight(_text_:in in 2564) [ClassicSimilarity], result of:
0.004929992 = score(doc=2564,freq=10.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.16802745 = fieldWeight in 2564, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=2564)
0.0014085418 = weight(_text_:s in 2564) [ClassicSimilarity], result of:
0.0014085418 = score(doc=2564,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.060061958 = fieldWeight in 2564, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.0390625 = fieldNorm(doc=2564)
0.0073060202 = product of:
0.0146120405 = sum of:
0.0146120405 = weight(_text_:22 in 2564) [ClassicSimilarity], result of:
0.0146120405 = score(doc=2564,freq=2.0), product of:
0.07553371 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.021569785 = queryNorm
0.19345059 = fieldWeight in 2564, 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=2564)
0.5 = coord(1/2)
0.1 = coord(3/30)
- Abstract
- PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor alpha that spreads uniformly part of the rank. The choice of alpha is eminently empirical, and in most cases the original suggestion alpha=0.85 by Brin and Page is still used. Recently, however, the behaviour of PageRank with respect to changes in alpha was discovered to be useful in link-spam detection. Moreover, an analytical justification of the value chosen for alpha is still missing. In this paper, we give the first mathematical analysis of PageRank when alpha changes. In particular, we show that, contrarily to popular belief, for real-world graphs values of alpha close to 1 do not give a more meaningful ranking. Then, we give closed-form formulae for PageRank derivatives of any order, and an extension of the Power Method that approximates them with convergence O(t**k*alpha**t) for the k-th derivative. Finally, we show a tight connection between iterated computation and analytical behaviour by proving that the k-th iteration of the Power Method gives exactly the PageRank value obtained using a Maclaurin polynomial of degree k. The latter result paves the way towards the application of analytical methods to the study of PageRank.
- Date
- 16. 1.2016 10:22:28
-
Bladow, N.; Dorey, C.; Frederickson, L.; Grover, P.; Knudtson, Y.; Krishnamurthy, S.; Lazarou, V.: What's the Buzz about? : An empirical examination of Search on Yahoo! (2005)
0.00
0.0012961577 = product of:
0.012961577 = sum of:
0.003741601 = weight(_text_:in in 3072) [ClassicSimilarity], result of:
0.003741601 = score(doc=3072,freq=4.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.12752387 = fieldWeight in 3072, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=3072)
0.007529726 = product of:
0.022589177 = sum of:
0.022589177 = weight(_text_:l in 3072) [ClassicSimilarity], result of:
0.022589177 = score(doc=3072,freq=2.0), product of:
0.0857324 = queryWeight, product of:
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.021569785 = queryNorm
0.26348472 = fieldWeight in 3072, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.046875 = fieldNorm(doc=3072)
0.33333334 = coord(1/3)
0.0016902501 = weight(_text_:s in 3072) [ClassicSimilarity], result of:
0.0016902501 = score(doc=3072,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.072074346 = fieldWeight in 3072, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.046875 = fieldNorm(doc=3072)
0.1 = coord(3/30)
- Abstract
- We present an analysis of the Yahoo Buzz Index over a period of 45 weeks. Our key findings are that: (1) It is most common for a search term to show up on the index for one week, followed by two weeks, three weeks, etc. Only two terms persist for all 45 weeks studied - Britney Spears and Jennifer Lopez. Search term longevity follows a power-law distribution or a winner-take-all structure; (2) Most search terms focus on entertainment. Search terms related to serious topics are found less often. The Buzz Index does not necessarily follow the "news cycle"; and, (3) We provide two ways to determine "star power" of various search terms - one that emphasizes staying power on the Index and another that emphasizes rank. In general, the methods lead to dramatically different results. Britney Spears performs well in both methods. We conclude that the data available on the Index is symptomatic of a celebrity-crazed, entertainment-centered culture.
-
¬Der Google Hummingbird Algorithmus : semantisch-holistische Suche (2013)
0.00
0.0012487139 = product of:
0.018730707 = sum of:
0.009365354 = weight(_text_:und in 2521) [ClassicSimilarity], result of:
0.009365354 = score(doc=2521,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.19590102 = fieldWeight in 2521, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=2521)
0.009365354 = weight(_text_:und in 2521) [ClassicSimilarity], result of:
0.009365354 = score(doc=2521,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.19590102 = fieldWeight in 2521, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=2521)
0.06666667 = coord(2/30)
- Abstract
- Im September 2013 verkündete Google den schon einen Monat vorher ausgerollten völlig neuen Algorithmus mit dem Namen "Hummingbird". Der Name wurde bewusst gewählt. Schließlich zeichnet den "Kolibri" seine äußerst schnelle und dabei doch präzise Methodik aus. Searchmetrics hat analysiert, wie sich der neue Algorithmus auf die SERPs auswirkt. Ergebnis: Die Diversität der Suchergebnisse hat abgenommen. Google zeigt zunehmend "gleichere" Resultate für semantisch äquivalente Queries an.
-
Advanced online media use (2023)
0.00
0.0012487139 = product of:
0.018730707 = sum of:
0.009365354 = weight(_text_:und in 954) [ClassicSimilarity], result of:
0.009365354 = score(doc=954,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.19590102 = fieldWeight in 954, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=954)
0.009365354 = weight(_text_:und in 954) [ClassicSimilarity], result of:
0.009365354 = score(doc=954,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.19590102 = fieldWeight in 954, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=954)
0.06666667 = coord(2/30)
- Abstract
- Ten recommendations for the advanced use of online media. Mit Links auf historische und weiterführende Beiträge.
-
bbu/c't: Ask Jeeves mit verbesserten Suchfunktionen (2005)
0.00
0.0012420359 = product of:
0.012420358 = sum of:
0.004682677 = weight(_text_:und in 3453) [ClassicSimilarity], result of:
0.004682677 = score(doc=3453,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.09795051 = fieldWeight in 3453, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.03125 = fieldNorm(doc=3453)
0.0030550044 = weight(_text_:in in 3453) [ClassicSimilarity], result of:
0.0030550044 = score(doc=3453,freq=6.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.1041228 = fieldWeight in 3453, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.03125 = fieldNorm(doc=3453)
0.004682677 = weight(_text_:und in 3453) [ClassicSimilarity], result of:
0.004682677 = score(doc=3453,freq=2.0), product of:
0.04780656 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021569785 = queryNorm
0.09795051 = fieldWeight in 3453, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.03125 = fieldNorm(doc=3453)
0.1 = coord(3/30)
- Abstract
- Mit nicht völlig neuen, aber überarbeiteten Suchfunktionen erweitert das zum Firmenimperium des US-Medienzaren Barry Diller gehörende Unternehmen Ask Jeeves das Leistungsspektrum seiner Suchmaschine. Mit der Ergebnisverfeinerungsfunktion Focus erhält der Suchende auf der rechten oberen Bildschirmseite eine Liste, die das Thema seiner Suche thematisch aufgliedern soll. Eine zweite Neuerung verspricht präzise Antworten auf als Fragen formulierte Sucheinträge. So ergibt der Eintrag "Lady Diana" zum Beispiel eine Liste mit den Items Princess Di, Princess Dianas Life, Princess Diana's Wedding. Interessant dabei ist, dass diese Liste nicht einfach aus einem monolithischen Block von Schlüsselwörtern besteht, sondern in drei Kategorien aufgeteilt ist: "Narrow Your Search", "Expand Your Search" und "Related Names". Waren die eben genannten Beispiele aus der ersten Kategorie, finden sich unter Expand Your Search Einträge wie Royal Family, Princess Di Ring, Princess Di Prince Charles History oder Prince William Harry, allerdings auch Who Is Louis De Funes? "Related Names" verweist auf Einträge wie Diana Spencer, Prince Harry oder Imran Khan. Die Suchfunktion soll also die thematische Verfeinerung oder Ausweitung gleichermaßen wie die Fortsetzung der Suche mit einem verwandten Thema ermöglichen. Auf die Frage "who invented the telephone" erhält der Suchende als ersten Eintrag die Antwort "The telephone was invented by Alexander Graham Bell" mit dem roten Vermerk "Web Answer'. Bemerkenswert ist hier, dass auf eine Frage nicht nur eine passende Webseite mit der Antwort angezeigt wird, sondern die ausformulierte Antwort direkt aus der vorgeschlagenen Webseite zitiert wird. Die Frage "who is the mother of Albert Einstein" gibt immerhin einen Eintrag unter "Narrow Your Search" mit "Albert Einstein Family tree". Ask Jeeves wird wohl noch eine weitere Neuerung bevorstehen: Auf einer Pressekonferenz in San Francisco bemerkte Chief Executive Barry Diller, dass das Unternehmen über eine Namensänderung von Ask Jeeves nachdenke. Wahrscheinlich werde auf eines der beiden Worte verzichtet werden. Mit dem Sucheintrag "How will Ask Jeeves be called in the future" erhält man bislang jedoch noch keine "Web Answer". (26.05.2005 15:30)
-
Ding, L.; Finin, T.; Joshi, A.; Peng, Y.; Cost, R.S.; Sachs, J.; Pan, R.; Reddivari, P.; Doshi, V.: Swoogle : a Semantic Web search and metadata engine (2004)
0.00
0.0011865686 = product of:
0.011865687 = sum of:
0.0026457112 = weight(_text_:in in 4704) [ClassicSimilarity], result of:
0.0026457112 = score(doc=4704,freq=2.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.09017298 = fieldWeight in 4704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=4704)
0.007529726 = product of:
0.022589177 = sum of:
0.022589177 = weight(_text_:l in 4704) [ClassicSimilarity], result of:
0.022589177 = score(doc=4704,freq=2.0), product of:
0.0857324 = queryWeight, product of:
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.021569785 = queryNorm
0.26348472 = fieldWeight in 4704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.046875 = fieldNorm(doc=4704)
0.33333334 = coord(1/3)
0.0016902501 = weight(_text_:s in 4704) [ClassicSimilarity], result of:
0.0016902501 = score(doc=4704,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.072074346 = fieldWeight in 4704, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.046875 = fieldNorm(doc=4704)
0.1 = coord(3/30)
- Abstract
- Swoogle is a crawler-based indexing and retrieval system for the Semantic Web, i.e., for Web documents in RDF or OWL. It extracts metadata for each discovered document, and computes relations between documents. Discovered documents are also indexed by an information retrieval system which can use either character N-Gram or URIrefs as keywords to find relevant documents and to compute the similarity among a set of documents. One of the interesting properties we compute is rank, a measure of the importance of a Semantic Web document.
- Pages
- xx S
-
Baeza-Yates, R.; Boldi, P.; Castillo, C.: Generalizing PageRank : damping functions for linkbased ranking algorithms (2006)
0.00
7.4165175E-4 = product of:
0.011124776 = sum of:
0.0038187557 = weight(_text_:in in 2565) [ClassicSimilarity], result of:
0.0038187557 = score(doc=2565,freq=6.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.1301535 = fieldWeight in 2565, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=2565)
0.0073060202 = product of:
0.0146120405 = sum of:
0.0146120405 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
0.0146120405 = score(doc=2565,freq=2.0), product of:
0.07553371 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.021569785 = queryNorm
0.19345059 = fieldWeight in 2565, 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=2565)
0.5 = coord(1/2)
0.06666667 = coord(2/30)
- Abstract
- This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that PageRank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank's using a fixed small number of iterations; comparisons were performed using Kendall's tau on large domain datasets.
- Date
- 16. 1.2016 10:22:28
-
Dunning, A.: Do we still need search engines? (1999)
0.00
6.8189524E-4 = product of:
0.020456856 = sum of:
0.020456856 = product of:
0.040913712 = sum of:
0.040913712 = weight(_text_:22 in 6021) [ClassicSimilarity], result of:
0.040913712 = score(doc=6021,freq=2.0), product of:
0.07553371 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.021569785 = queryNorm
0.5416616 = fieldWeight in 6021, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=6021)
0.5 = coord(1/2)
0.033333335 = coord(1/30)
- Source
- Ariadne. 1999, no.22
-
Barlow, L.: ¬The spider's apprentice : how to use Web search engines (1997)
0.00
6.6930905E-4 = product of:
0.02007927 = sum of:
0.02007927 = product of:
0.060237806 = sum of:
0.060237806 = weight(_text_:l in 7534) [ClassicSimilarity], result of:
0.060237806 = score(doc=7534,freq=2.0), product of:
0.0857324 = queryWeight, product of:
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.021569785 = queryNorm
0.70262593 = fieldWeight in 7534, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.125 = fieldNorm(doc=7534)
0.33333334 = coord(1/3)
0.033333335 = coord(1/30)
-
Broder, A.; Kumar, R.; Maghoul, F.; Raghavan, P.; Rajagopalan, S.; Stata, R.; Tomkins, A.; Wiener, J.: Graph structure in the Web (2000)
0.00
4.8283124E-4 = product of:
0.007242468 = sum of:
0.004988801 = weight(_text_:in in 5595) [ClassicSimilarity], result of:
0.004988801 = score(doc=5595,freq=4.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.17003182 = fieldWeight in 5595, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=5595)
0.002253667 = weight(_text_:s in 5595) [ClassicSimilarity], result of:
0.002253667 = score(doc=5595,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.09609913 = fieldWeight in 5595, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.0625 = fieldNorm(doc=5595)
0.06666667 = coord(2/30)
- Abstract
- The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the web graph using two Altavista crawls each with over 200M pages and 1.5 billion links. Our study indicates that the macroscopic structure of the web is considerably more intricate than suggested by earlier experiments on a smaller scale
-
Bryan, K.; Leise, T.: ¬The $25.000.000.000 eigenvector : the linear algebra behind Google
0.00
4.2247731E-4 = product of:
0.0063371593 = sum of:
0.004365201 = weight(_text_:in in 1353) [ClassicSimilarity], result of:
0.004365201 = score(doc=1353,freq=4.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.14877784 = fieldWeight in 1353, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=1353)
0.0019719584 = weight(_text_:s in 1353) [ClassicSimilarity], result of:
0.0019719584 = score(doc=1353,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.08408674 = fieldWeight in 1353, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.0546875 = fieldNorm(doc=1353)
0.06666667 = coord(2/30)
- Abstract
- Google's success derives in large part from its PageRank algorithm, which ranks the importance of webpages according to an eigenvector of a weighted link matrix. Analysis of the PageRank formula provides a wonderful applied topic for a linear algebra course. Instructors may assign this article as a project to more advanced students, or spend one or two lectures presenting the material with assigned homework from the exercises. This material also complements the discussion of Markov chains in matrix algebra. Maple and Mathematica files supporting this material can be found at www.rose-hulman.edu/~bryan.
- Source
- SIAM review. 48(2006) no.3, S.569-581
-
Lossau, N.: Search engine technology and digital libraries : libraries need to discover the academic internet (2004)
0.00
4.2247731E-4 = product of:
0.0063371593 = sum of:
0.004365201 = weight(_text_:in in 1161) [ClassicSimilarity], result of:
0.004365201 = score(doc=1161,freq=4.0), product of:
0.029340398 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.021569785 = queryNorm
0.14877784 = fieldWeight in 1161, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=1161)
0.0019719584 = weight(_text_:s in 1161) [ClassicSimilarity], result of:
0.0019719584 = score(doc=1161,freq=2.0), product of:
0.023451481 = queryWeight, product of:
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.021569785 = queryNorm
0.08408674 = fieldWeight in 1161, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.0872376 = idf(docFreq=40523, maxDocs=44218)
0.0546875 = fieldNorm(doc=1161)
0.06666667 = coord(2/30)
- Abstract
- With the development of the World Wide Web, the "information search" has grown to be a significant business sector of a global, competitive and commercial market. Powerful players have entered this market, such as commercial internet search engines, information portals, multinational publishers and online content integrators. Will Google, Yahoo or Microsoft be the only portals to global knowledge in 2010? If libraries do not want to become marginalized in a key area of their traditional services, they need to acknowledge the challenges that come with the globalisation of scholarly information, the existence and further growth of the academic internet
- Source
- D-Lib magazine. 10(2004) no.6, x S
-
Bensman, S.J.: Eugene Garfield, Francis Narin, and PageRank : the theoretical bases of the Google search engine (2013)
0.00
3.8965442E-4 = product of:
0.011689632 = sum of:
0.011689632 = product of:
0.023379264 = sum of:
0.023379264 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
0.023379264 = score(doc=1149,freq=2.0), product of:
0.07553371 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.021569785 = 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.5 = coord(1/2)
0.033333335 = coord(1/30)
- Date
- 17.12.2013 11:02:22
