-
Westermeyer, D.: Adaptive Techniken zur Informationsgewinnung : der Webcrawler InfoSpiders (2005)
0.01
0.00780006 = product of:
0.01560012 = sum of:
0.01560012 = product of:
0.03120024 = sum of:
0.03120024 = weight(_text_:22 in 4333) [ClassicSimilarity], result of:
0.03120024 = score(doc=4333,freq=2.0), product of:
0.16128273 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046056706 = queryNorm
0.19345059 = fieldWeight in 4333, 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=4333)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Pages
- 22 S
-
Lehrke, C.: Architektur von Suchmaschinen : Googles Architektur, insb. Crawler und Indizierer (2005)
0.01
0.00780006 = product of:
0.01560012 = sum of:
0.01560012 = product of:
0.03120024 = sum of:
0.03120024 = weight(_text_:22 in 867) [ClassicSimilarity], result of:
0.03120024 = score(doc=867,freq=2.0), product of:
0.16128273 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046056706 = queryNorm
0.19345059 = fieldWeight in 867, 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=867)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Pages
- 22 S
-
Gerber, A.: Vergleich von Suchmaschinen und Katalogen : Schwerpunkt deutschsprachiger Suchmaschinen Stand 2002 (2002)
0.00
0.0023678814 = product of:
0.0047357627 = sum of:
0.0047357627 = product of:
0.009471525 = sum of:
0.009471525 = weight(_text_:a in 4005) [ClassicSimilarity], result of:
0.009471525 = score(doc=4005,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.17835285 = fieldWeight in 4005, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.109375 = fieldNorm(doc=4005)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Stölzel, A.: Was Google nicht sieht : Das "Invisible Web" (2004)
0.00
0.0023678814 = product of:
0.0047357627 = sum of:
0.0047357627 = product of:
0.009471525 = sum of:
0.009471525 = weight(_text_:a in 4040) [ClassicSimilarity], result of:
0.009471525 = score(doc=4040,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.17835285 = fieldWeight in 4040, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.109375 = fieldNorm(doc=4040)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Li, Z.: ¬A domain specific search engine with explicit document relations (2013)
0.00
0.0020714647 = product of:
0.0041429293 = sum of:
0.0041429293 = product of:
0.008285859 = sum of:
0.008285859 = weight(_text_:a in 1210) [ClassicSimilarity], result of:
0.008285859 = score(doc=1210,freq=12.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.15602624 = fieldWeight in 1210, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=1210)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The current web consists of documents that are highly heterogeneous and hard for machines to understand. The Semantic Web is a progressive movement of the Word Wide Web, aiming at converting the current web of unstructured documents to the web of data. In the Semantic Web, web documents are annotated with metadata using standardized ontology language. These annotated documents are directly processable by machines and it highly improves their usability and usefulness. In Ericsson, similar problems occur. There are massive documents being created with well-defined structures. Though these documents are about domain specific knowledge and can have rich relations, they are currently managed by a traditional search engine, which ignores the rich domain specific information and presents few data to users. Motivated by the Semantic Web, we aim to find standard ways to process these documents, extract rich domain specific information and annotate these data to documents with formal markup languages. We propose this project to develop a domain specific search engine for processing different documents and building explicit relations for them. This research project consists of the three main focuses: examining different domain specific documents and finding ways to extract their metadata; integrating a text search engine with an ontology server; exploring novel ways to build relations for documents. We implement this system and demonstrate its functions. As a prototype, the system provides required features and will be extended in the future.
-
Haveliwala, T.: Context-Sensitive Web search (2005)
0.00
0.0017899501 = product of:
0.0035799001 = sum of:
0.0035799001 = product of:
0.0071598003 = sum of:
0.0071598003 = weight(_text_:a in 2567) [ClassicSimilarity], result of:
0.0071598003 = score(doc=2567,freq=14.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.13482209 = fieldWeight in 2567, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.03125 = fieldNorm(doc=2567)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- As the Web continues to grow and encompass broader and more diverse sources of information, providing effective search facilities to users becomes an increasingly challenging problem. To help users deal with the deluge of Web-accessible information, we propose a search system which makes use of context to improve search results in a scalable way. By context, we mean any sources of information, in addition to any search query, that provide clues about the user's true information need. For instance, a user's bookmarks and search history can be considered a part of the search context. We consider two types of context-based search. The first type of functionality we consider is "similarity search." In this case, as the user is browsing Web pages, URLs for pages similar to the current page are retrieved and displayed in a side panel. No query is explicitly issued; context alone (i.e., the page currently being viewed) is used to provide the user with useful related information. The second type of functionality involves taking search context into account when ranking results to standard search queries. Web search differs from traditional information retrieval tasks in several major ways, making effective context-sensitive Web search challenging. First, scalability is of critical importance. With billions of publicly accessible documents, the Web is much larger than traditional datasets. Similarly, with millions of search queries issued each day, the query load is much higher than for traditional information retrieval systems. Second, there are no guarantees on the quality ofWeb pages, with Web-authors taking an adversarial, rather than cooperative, approach in attempts to inflate the rankings of their pages. Third, there is a significant amount of metadata embodied in the link structure corresponding to the hyperlinks between Web pages that can be exploitedduring the retrieval process. In this thesis, we design a search system, using the Stanford WebBase platform, that exploits the link structure of the Web to provide scalable, context-sensitive search.
