Search (7 results, page 1 of 1)

0.016682485 = sum of:
  0.0074932543 = product of:
    0.029973017 = sum of:
      0.029973017 = weight(_text_:authors in 6299) [ClassicSimilarity], result of:
        0.029973017 = score(doc=6299,freq=2.0), product of:
          0.23803101 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.052213363 = queryNorm
          0.12592064 = fieldWeight in 6299, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.01953125 = fieldNorm(doc=6299)
    0.25 = coord(1/4)
  0.00918923 = product of:
    0.01837846 = sum of:
      0.01837846 = weight(_text_:k in 6299) [ClassicSimilarity], result of:
        0.01837846 = score(doc=6299,freq=2.0), product of:
          0.18639012 = queryWeight, product of:
            3.569778 = idf(docFreq=3384, maxDocs=44218)
            0.052213363 = queryNorm
          0.098602116 = fieldWeight in 6299, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.569778 = idf(docFreq=3384, maxDocs=44218)
            0.01953125 = fieldNorm(doc=6299)
    0.5 = coord(1/2)

Content

Enthält die Beiträge: GREFENSTETTE, G.: The Problem of Cross-Language Information Retrieval; DAVIS, M.W.: On the Effective Use of Large Parallel Corpora in Cross-Language Text Retrieval; BALLESTEROS, L. u. W.B. CROFT: Statistical Methods for Cross-Language Information Retrieval; Distributed Cross-Lingual Information Retrieval; Automatic Cross-Language Information Retrieval Using Latent Semantic Indexing; EVANS, D.A. u.a.: Mapping Vocabularies Using Latent Semantics; PICCHI, E. u. C. PETERS: Cross-Language Information Retrieval: A System for Comparable Corpus Querying; YAMABANA, K. u.a.: A Language Conversion Front-End for Cross-Language Information Retrieval; GACHOT, D.A. u.a.: The Systran NLP Browser: An Application of Machine Translation Technology in Cross-Language Information Retrieval; HULL, D.: A Weighted Boolean Model for Cross-Language Text Retrieval; SHERIDAN, P. u.a. Building a Large Multilingual Test Collection from Comparable News Documents; OARD; D.W. u. B.J. DORR: Evaluating Cross-Language Text Filtering Effectiveness

Footnote

The retrieved output from a query including the phrase 'big rockets' may be, for instance, a sentence containing 'giant rocket' which is semantically ranked above 'military ocket'. David Hull (Xerox Research Centre, Grenoble) describes an implementation of a weighted Boolean model for Spanish-English CLIR. Users construct Boolean-type queries, weighting each term in the query, which is then translated by an on-line dictionary before being applied to the database. Comparisons with the performance of unweighted free-form queries ('vector space' models) proved encouraging. Two contributions consider the evaluation of CLIR systems. In order to by-pass the time-consuming and expensive process of assembling a standard collection of documents and of user queries against which the performance of an CLIR system is manually assessed, Páriac Sheridan et al (ETH Zurich) propose a method based on retrieving 'seed documents'. This involves identifying a unique document in a database (the 'seed document') and, for a number of queries, measuring how fast it is retrieved. The authors have also assembled a large database of multilingual news documents for testing purposes. By storing the (fairly short) documents in a structured form tagged with descriptor codes (e.g. for topic, country and area), the test suite is easily expanded while remaining consistent for the purposes of testing. Douglas Ouard and Bonne Dorr (University of Maryland) describe an evaluation methodology which appears to apply LSI techniques in order to filter and rank incoming documents designed for testing CLIR systems. The volume provides the reader an excellent overview of several projects in CLIR. It is well supported with references and is intended as a secondary text for researchers and practitioners. It highlights the need for a good, general tutorial introduction to the field."

0.012995535 = product of:
  0.02599107 = sum of:
    0.02599107 = product of:
      0.05198214 = sum of:
        0.05198214 = weight(_text_:k in 4998) [ClassicSimilarity], result of:
          0.05198214 = score(doc=4998,freq=4.0), product of:
            0.18639012 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.052213363 = queryNorm
            0.2788889 = fieldWeight in 4998, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4998)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Classification

BCA (FH K)

GHBS

BCA (FH K)

0.0089919055 = product of:
  0.017983811 = sum of:
    0.017983811 = product of:
      0.071935244 = sum of:
        0.071935244 = weight(_text_:authors in 5777) [ClassicSimilarity], result of:
          0.071935244 = score(doc=5777,freq=2.0), product of:
            0.23803101 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.052213363 = queryNorm
            0.30220953 = fieldWeight in 5777, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046875 = fieldNorm(doc=5777)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

This book discusses many of the key design issues for building search engines and emphazises the important role that applied mathematics can play in improving information retrieval. The authors discuss not only important data structures, algorithms, and software but also user-centered issues such as interfaces, manual indexing, and document preparation. They also present some of the current problems in information retrieval that many not be familiar to applied mathematicians and computer scientists and some of the driving computational methods (SVD, SDD) for automated conceptual indexing

0.008842737 = product of:
  0.017685475 = sum of:
    0.017685475 = product of:
      0.03537095 = sum of:
        0.03537095 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
          0.03537095 = score(doc=1753,freq=2.0), product of:
            0.1828423 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052213363 = queryNorm
            0.19345059 = fieldWeight in 1753, 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=1753)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 3.2008 12:26:32

0.00847765 = product of:
  0.0169553 = sum of:
    0.0169553 = product of:
      0.0678212 = sum of:
        0.0678212 = weight(_text_:authors in 7) [ClassicSimilarity], result of:
          0.0678212 = score(doc=7,freq=4.0), product of:
            0.23803101 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.052213363 = queryNorm
            0.28492588 = fieldWeight in 7, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.03125 = fieldNorm(doc=7)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

The second edition of Understanding Search Engines: Mathematical Modeling and Text Retrieval follows the basic premise of the first edition by discussing many of the key design issues for building search engines and emphasizing the important role that applied mathematics can play in improving information retrieval. The authors discuss important data structures, algorithms, and software as well as user-centered issues such as interfaces, manual indexing, and document preparation. Significant changes bring the text up to date on current information retrieval methods: for example the addition of a new chapter on link-structure algorithms used in search engines such as Google. The chapter on user interface has been rewritten to specifically focus on search engine usability. In addition the authors have added new recommendations for further reading and expanded the bibliography, and have updated and streamlined the index to make it more reader friendly.

0.0044959527 = product of:
  0.0089919055 = sum of:
    0.0089919055 = product of:
      0.035967622 = sum of:
        0.035967622 = weight(_text_:authors in 6) [ClassicSimilarity], result of:
          0.035967622 = score(doc=6,freq=2.0), product of:
            0.23803101 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.052213363 = queryNorm
            0.15110476 = fieldWeight in 6, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0234375 = fieldNorm(doc=6)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other Web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of Web page rankings, "Google's PageRank and Beyond" supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample Web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. It includes: many illustrative examples and entertaining asides; MATLAB code; accessible and informal style; and complete and self-contained section for mathematics review.

0.003675692 = product of:
  0.007351384 = sum of:
    0.007351384 = product of:
      0.014702768 = sum of:
        0.014702768 = weight(_text_:k in 5973) [ClassicSimilarity], result of:
          0.014702768 = score(doc=5973,freq=2.0), product of:
            0.18639012 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.052213363 = queryNorm
            0.078881696 = fieldWeight in 5973, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.015625 = fieldNorm(doc=5973)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Footnote

"Evaluierung", das Thema des dritten Kapitels, ist in seiner Breite nicht auf das Information Retrieval beschränkt sondern beinhaltet ebenso einzelne Aspekte der Bereiche Mensch-Maschine-Interaktion sowie des E-Learning. Michael Muck und Marco Winter von der Stiftung Wissenschaft und Politik sowie dem Informationszentrum Sozialwissenschaften thematisieren in ihrem Beitrag den Einfluss der Fragestellung (Topic) auf die Bewertung von Relevanz und zeigen Verfahrensweisen für die Topic-Erstellung auf, die beim Cross Language Evaluation Forum (CLEF) Anwendung finden. Im darauf folgenden Aufsatz stellt Thomas Mandl verschiedene Evaluierungsinitiativen im Information Retrieval und aktuelle Entwicklungen dar. Joachim Pfister erläutert in seinem Beitrag das automatisierte Gruppieren, das sogenannte Clustering, von Patent-Dokumenten in den Datenbanken des Fachinformationszentrums Karlsruhe und evaluiert unterschiedliche Clusterverfahren auf Basis von Nutzerbewertungen. Ralph Kölle, Glenn Langemeier und Wolfgang Semar widmen sich dem kollaborativen Lernen unter den speziellen Bedingungen des Programmierens. Dabei werden das System VitaminL zur synchronen Bearbeitung von Programmieraufgaben und das Kennzahlensystem K-3 für die Bewertung kollaborativer Zusammenarbeit in einer Lehrveranstaltung angewendet. Der aktuelle Forschungsschwerpunkt der Hildesheimer Informationswissenschaft zeichnet sich im vierten Kapitel unter dem Thema "Multilinguale Systeme" ab. Hier finden sich die meisten Beiträge des Tagungsbandes wieder. Olga Tartakovski und Margaryta Shramko beschreiben und prüfen das System Langldent, das die Sprache von mono- und multilingualen Texten identifiziert. Die Eigenheiten der japanischen Schriftzeichen stellt Nina Kummer dar und vergleicht experimentell die unterschiedlichen Techniken der Indexierung. Suriya Na Nhongkai und Hans-Joachim Bentz präsentieren und prüfen eine bilinguale Suche auf Basis von Konzeptnetzen, wobei die Konzeptstruktur das verbindende Elemente der beiden Textsammlungen darstellt. Das Entwickeln und Evaluieren eines mehrsprachigen Question-Answering-Systems im Rahmen des Cross Language Evaluation Forum (CLEF), das die alltagssprachliche Formulierung von konkreten Fragestellungen ermöglicht, wird im Beitrag von Robert Strötgen, Thomas Mandl und Rene Schneider thematisiert. Den Schluss bildet der Aufsatz von Niels Jensen, der ein mehrsprachiges Web-Retrieval-System ebenfalls im Zusammenhang mit dem CLEF anhand des multilingualen EuroGOVKorpus evaluiert.