Search (9 results, page 1 of 1)

0.030114295 = product of:
  0.040152393 = sum of:
    0.010942058 = weight(_text_:science in 1555) [ClassicSimilarity], result of:
      0.010942058 = score(doc=1555,freq=4.0), product of:
        0.1329271 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.050463587 = queryNorm
        0.08231623 = fieldWeight in 1555, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.015625 = fieldNorm(doc=1555)
    0.01815272 = weight(_text_:research in 1555) [ClassicSimilarity], result of:
      0.01815272 = score(doc=1555,freq=8.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.12608525 = fieldWeight in 1555, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.015625 = fieldNorm(doc=1555)
    0.011057617 = product of:
      0.022115234 = sum of:
        0.022115234 = weight(_text_:network in 1555) [ClassicSimilarity], result of:
          0.022115234 = score(doc=1555,freq=2.0), product of:
            0.22473325 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.050463587 = queryNorm
            0.0984066 = fieldWeight in 1555, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.015625 = fieldNorm(doc=1555)
      0.5 = coord(1/2)
  0.75 = coord(3/4)

Content

"Introduction Yahoo! is the undisputed king of the Web directories, providing one of the key information navigation tools on the Internet. It has maintained its popularity over many Internet-years as the most visited Web site, against intense competition. This is because it does a good job of shifting, cataloguing and organising the Web [1] . But what would a map of Yahoo!'s hierarchical classification of the Web look like? Would an interactive map of Yahoo!, rather than the conventional listing of sites, be more useful as navigational tool? We can get some idea what a map of Yahoo! might be like by taking a look at ET-Map, a prototype developed by Hsinchun Chen and colleagues in the Artificial Intelligence Lab [2] at the University of Arizona. ET-Map was developed in 1995 as part of innovative research in automatic Internet homepage categorization and it charts a large chunk of Yahoo!, from the entertainment section representing some 110,000 different Web links. The map is a two-dimensional, multi-layered category map; its aim is to provide an intuitive visual information browsing tool. ET-Map can be browsed interactively, explored and queried, using the familiar point-and-click navigation style of the Web to find information of interest.
The View From Above Browsing for a particular piece on information on the Web can often feel like being stuck in an unfamiliar part of town walking around at street level looking for a particular store. You know the store is around there somewhere, but your viewpoint at ground level is constrained. What you really want is to get above the streets, hovering half a mile or so up in the air, to see the whole neighbourhood. This kind of birds-eye view function has been memorably described by David D. Clark, Senior Research Scientist at MIT's Laboratory for Computer Science and the Chairman of the Invisible Worlds Protocol Advisory Board, as the missing "up button" on the browser [3] . ET-Map is a nice example of a prototype for Clark's "up-button" view of an information space. The goal of information maps, like ET-Map, is to provide the browser with a sense of the lie of the information landscape, what is where, the location of clusters and hotspots, what is related to what. Ideally, this 'big-picture' all-in-one visual summary needs to fit on a single standard computer screen. ET-Map is one of my favourite examples, but there are many other interesting information maps being developed by other researchers and companies (see inset at the bottom of this page). How does ET-Map work? Here is a sequence of screenshots of a typical browsing session with ET-Map, which ends with access to Web pages on jazz musician Miles Davis. You can also tryout ET-Map for yourself, using a fully working demo on the AI Lab's website [4] . We begin with the top-level map showing forty odd broad entertainment 'subject regions' represented by regularly shaped tiles. Each tile is a visual summary of a group of Web pages with similar content. These tiles are shaded different colours to differentiate them, while labels identify the subject of the tile and the number in brackets telling you how many individual Web page links it contains. ET-Map uses two important, but common-sense, spatial concepts in its organisation and representation of the Web. Firstly, the 'subject regions' size is directly related to the number of Web pages in that category. For example, the 'MUSIC' subject area contains over 11,000 pages and so has a much larger area than the neighbouring area of 'LIVE' which only has 4,300 odd pages. This is intuitively meaningful, as the largest tiles are visually more prominent on the map and are likely to be more significant as they contain the most links. In addition, a second spatial concept, that of neighbourhood proximity, is applied so 'subject regions' closely related in term of content are plotted close to each other on the map. For example, 'FILM' and 'YEAR'S OSCARS', at the bottom left, are neighbours in both semantic and spatial space. This make senses as many things in the real-world are ordered in this way, with things that are alike being spatially close together (e.g. layout of goods in a store, or books in a library). Importantly, ET-Map is also a multi-layer map, with sub-maps showing greater informational resolution through a finer degree of categorization. So for any subject region that contains more than two hundred Web pages, a second-level map, with more detailed categories is generated. This subdivision of information space is repeated down the hierarchy as far as necessary. In the example, the user selected the 'MUSIC' subject region which, not surprisingly, contained many thousands of pages. A second-level map with numerous different music categories is then presented to the user. Delving deeper, the user wants to learn more about jazz music, so clicking on the 'JAZZ' tile leads to a third-level map, a fine-grained map of jazz related Web pages. Finally, selecting the 'MILES DAVIS' subject region leads to more a conventional looking ranking of pages from which the user selects one to download.
ET-Map was created using a sophisticated AI technique called Kohonen self-organizing map, a neural network approach that has been used for automatic analysis and classification of semantic content of text documents like Web pages. I do not pretend to fully understand how this technique works; I tend to think of it as a clever 'black-box' that group together things that are alike [5] . It is a real challenge to automatically classify pages from a very heterogeneous information collection like the Web into categories that will match the conceptions of a typical user. Directories like Yahoo! tend to rely on the skill of human editors to achieve this. ET-Map is an interesting prototype that I think highlights well the potential for a map-based approach to Web browsing. I am surprised none of the major search engines or directories have introduced the option of mapping results. Although, I am sure many are working on ideas. People certainly need all the help they get, as Web growth shows no sign of slowing. Just last month it was reported that the Web had surpassed one billion indexable pages [6].
Research Prototypes Visual SiteMap Developed by Xia Lin, based at the College of Library and Information Science, Drexel University. CVG Cyberspace geography visualization, developed by Luc Girardin, at The Graduate Institute of International Studies, Switzerland. WEBSOM Maps the thousands of articles posted on Usenet newsgroups. It is being developed by researchers at the Neural Networks Research Centre, Helsinki University of Technology in Finland. TreeMaps Developed by Brian Johnson, Ben Shneiderman and colleagues in the Human-Computer Interaction Lab at the University of Maryland. Commercial Information Maps: NewsMaps Provides interactive information landscapes summarizing daily news stories, developed Cartia, Inc. Web Squirrel Creates maps known as information farms. It is developed by Eastgate Systems, Inc. Umap Produces interactive maps of Web searches. Map of the Market An interactive map of the market performance of the stocks of major US corporations developed by SmartMoney.com."

0.025889922 = product of:
  0.051779844 = sum of:
    0.015474406 = weight(_text_:science in 4709) [ClassicSimilarity], result of:
      0.015474406 = score(doc=4709,freq=2.0), product of:
        0.1329271 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.050463587 = queryNorm
        0.11641272 = fieldWeight in 4709, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.03125 = fieldNorm(doc=4709)
    0.03630544 = weight(_text_:research in 4709) [ClassicSimilarity], result of:
      0.03630544 = score(doc=4709,freq=8.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.2521705 = fieldWeight in 4709, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.03125 = fieldNorm(doc=4709)
  0.5 = coord(2/4)

Content

"Swoogle, the Semantic web search engine, is a research project carried out by the ebiquity research group in the Computer Science and Electrical Engineering Department at the University of Maryland. It's an engine tailored towards finding documents on the semantic web. The whole research paper is available here. Semantic web is touted as the next generation of online content representation where the web documents are represented in a language that is not only easy for humans but is machine readable (easing the integration of data as never thought possible) as well. And the main elements of the semantic web include data model description formats such as Resource Description Framework (RDF), a variety of data interchange formats (e.g. RDF/XML, Turtle, N-Triples), and notations such as RDF Schema (RDFS), the Web Ontology Language (OWL), all of which are intended to provide a formal description of concepts, terms, and relationships within a given knowledge domain (Wikipedia). And Swoogle is an attempt to mine and index this new set of web documents. The engine performs crawling of semantic documents like most web search engines and the search is available as web service too. The engine is primarily written in Java with the PHP used for the front-end and MySQL for database. Swoogle is capable of searching over 10,000 ontologies and indexes more that 1.3 million web documents. It also computes the importance of a Semantic Web document. The techniques used for indexing are the more google-type page ranking and also mining the documents for inter-relationships that are the basis for the semantic web. For more information on how the RDF framework can be used to relate documents, read the link here. Being a research project, and with a non-commercial motive, there is not much hype around Swoogle. However, the approach to indexing of Semantic web documents is an approach that most engines will have to take at some point of time. When the Internet debuted, there were no specific engines available for indexing or searching. The Search domain only picked up as more and more content became available. One fundamental question that I've always wondered about it is - provided that the search engines return very relevant results for a query - how to ascertain that the documents are indeed the most relevant ones available. There is always an inherent delay in indexing of document. Its here that the new semantic documents search engines can close delay. Experimenting with the concept of Search in the semantic web can only bore well for the future of search technology."

0.009626932 = product of:
  0.03850773 = sum of:
    0.03850773 = weight(_text_:research in 2820) [ClassicSimilarity], result of:
      0.03850773 = score(doc=2820,freq=4.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.2674672 = fieldWeight in 2820, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.046875 = fieldNorm(doc=2820)
  0.25 = coord(1/4)

Abstract

Der Kampf ist eröffnet: Als vergangene Woche der britische Physiker Stephen Wolfram erstmals der Öffentlichkeit die neue "Antwortmaschine" Wolfram Alpha[1] vorstellte, kündigte Google einen eigenen neuen Dienst an. Wolfram Alpha greift auf Datenbanken zurück, die von Wolfram Research betrieben werden, und wendet auf ihre Inhalte Algorithmen an, um Antworten auf Fragen zu generieren, die Nutzer stellen. Mit dem vom Wolfram-Team vorab zur Verfügung gestellten Login machte ich die Probe aufs Exempel: Wolfram Alpha vs. Google (in der Standardform). Ich gab jeweils die gleichen Anfragen ein und variierte sie in einigen Fällen, um zu sehen, was passiert. Auf diese Weise wollte ich jenseits der allgemeineren Beschreibungen, die ich bei einem Besuch bei Wolfram Research[2] bekommen hatte, einige reale Ergebnisse produzieren. Und natürlich den Anspruch der neuen Maschine überprüfen: Antworten aus Suchanfragen zu "berechnen". Hier ist das Ergebnis meines Tests. [06.06.2009]

0.0068072695 = product of:
  0.027229078 = sum of:
    0.027229078 = weight(_text_:research in 940) [ClassicSimilarity], result of:
      0.027229078 = score(doc=940,freq=2.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.18912788 = fieldWeight in 940, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.046875 = fieldNorm(doc=940)
  0.25 = coord(1/4)

Source

Information Research. 5(2000) no.3, April 2000

0.0068072695 = product of:
  0.027229078 = sum of:
    0.027229078 = weight(_text_:research in 852) [ClassicSimilarity], result of:
      0.027229078 = score(doc=852,freq=2.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.18912788 = fieldWeight in 852, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.046875 = fieldNorm(doc=852)
  0.25 = coord(1/4)

Abstract

Nutch is an open-source Web search engine that can be used at global, local, and even personal scale. Its initial design goal was to enable a transparent alternative for global Web search in the public interest - one of its signature features is the ability to "explain" its result rankings. Recent work has emphasized how it can also be used for intranets; by local communities with richer data models, such as the Creative Commons metadata-enabled search for licensed content; on a personal scale to index a user's files, email, and web-surfing history; and we also report on several other research projects built on Nutch. In this paper, we present how the architecture of the Nutch system enables it to be more flexible and scalable than other comparable systems today.

0.0068072695 = product of:
  0.027229078 = sum of:
    0.027229078 = weight(_text_:research in 2434) [ClassicSimilarity], result of:
      0.027229078 = score(doc=2434,freq=2.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.18912788 = fieldWeight in 2434, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.046875 = fieldNorm(doc=2434)
  0.25 = coord(1/4)

Footnote

Vgl.: http://www.cs.washington.edu/research/textrunner/; http://www.heise.de/tr/artikel/140629.

0.00453818 = product of:
  0.01815272 = sum of:
    0.01815272 = weight(_text_:research in 1196) [ClassicSimilarity], result of:
      0.01815272 = score(doc=1196,freq=2.0), product of:
        0.14397179 = queryWeight, product of:
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.050463587 = queryNorm
        0.12608525 = fieldWeight in 1196, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.8529835 = idf(docFreq=6931, maxDocs=44218)
          0.03125 = fieldNorm(doc=1196)
  0.25 = coord(1/4)

Abstract

This article describes the journey from the conception of and vision for a modern search-engine-based search environment to its technological realisation. In doing so, it takes up the thread of an earlier article on this subject, this time from a technical viewpoint. As well as presenting the conceptual considerations of the initial stages, this article will principally elucidate the technological aspects of this journey. The starting point for the deliberations about development of an academic search engine was the experience we gained through the generally successful project "Digital Library NRW", in which from 1998 to 2000-with Bielefeld University Library in overall charge-we designed a system model for an Internet-based library portal with an improved academic search environment at its core. At the heart of this system was a metasearch with an availability function, to which we added a user interface integrating all relevant source material for study and research. The deficiencies of this approach were felt soon after the system was launched in June 2001. There were problems with the stability and performance of the database retrieval system, with the integration of full-text documents and Internet pages, and with acceptance by users, because users are increasingly performing the searches themselves using search engines rather than going to the library for help in doing searches. Since a long list of problems are also encountered using commercial search engines for academic use (in particular the retrieval of academic information and long-term availability), the idea was born for a search engine configured specifically for academic use. We also hoped that with one single access point founded on improved search engine technology, we could access the heterogeneous academic resources of subject-based bibliographic databases, catalogues, electronic newspapers, document servers and academic web pages.

0.0042731995 = product of:
  0.017092798 = sum of:
    0.017092798 = product of:
      0.034185596 = sum of:
        0.034185596 = weight(_text_:22 in 2564) [ClassicSimilarity], result of:
          0.034185596 = score(doc=2564,freq=2.0), product of:
            0.17671488 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050463587 = 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.25 = coord(1/4)

Date

16. 1.2016 10:22:28

0.0042731995 = product of:
  0.017092798 = sum of:
    0.017092798 = product of:
      0.034185596 = sum of:
        0.034185596 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
          0.034185596 = score(doc=2565,freq=2.0), product of:
            0.17671488 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050463587 = 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.25 = coord(1/4)

Date

16. 1.2016 10:22:28