Search (13 results, page 1 of 1)

0.018534804 = product of:
  0.04633701 = sum of:
    0.015785638 = weight(_text_:7 in 150) [ClassicSimilarity], result of:
      0.015785638 = score(doc=150,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.09150316 = fieldWeight in 150, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.01953125 = fieldNorm(doc=150)
    0.030551372 = weight(_text_:22 in 150) [ClassicSimilarity], result of:
      0.030551372 = score(doc=150,freq=6.0), product of:
        0.18236019 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052075688 = queryNorm
        0.16753313 = fieldWeight in 150, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.01953125 = fieldNorm(doc=150)
  0.4 = coord(2/5)

Classification

006.7 22

Date

7. 3.2007 19:30:22

DDC

006.7 22

0.007055537 = product of:
  0.035277683 = sum of:
    0.035277683 = weight(_text_:22 in 1397) [ClassicSimilarity], result of:
      0.035277683 = score(doc=1397,freq=2.0), product of:
        0.18236019 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052075688 = queryNorm
        0.19345059 = fieldWeight in 1397, 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=1397)
  0.2 = coord(1/5)

Date

22. 3.2008 14:29:25

0.0063142553 = product of:
  0.031571276 = sum of:
    0.031571276 = weight(_text_:7 in 2470) [ClassicSimilarity], result of:
      0.031571276 = score(doc=2470,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.18300632 = fieldWeight in 2470, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2470)
  0.2 = coord(1/5)

Isbn

978-3-925474-63-7 *

0.0062507945 = product of:
  0.03125397 = sum of:
    0.03125397 = weight(_text_:7 in 4515) [ClassicSimilarity], result of:
      0.03125397 = score(doc=4515,freq=4.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.18116702 = fieldWeight in 4515, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.02734375 = fieldNorm(doc=4515)
  0.2 = coord(1/5)

Classification

025.042/7

DDC

025.042/7

0.0056444295 = product of:
  0.028222147 = sum of:
    0.028222147 = weight(_text_:22 in 2426) [ClassicSimilarity], result of:
      0.028222147 = score(doc=2426,freq=2.0), product of:
        0.18236019 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052075688 = queryNorm
        0.15476047 = fieldWeight in 2426, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.03125 = fieldNorm(doc=2426)
  0.2 = coord(1/5)

0.0056444295 = product of:
  0.028222147 = sum of:
    0.028222147 = weight(_text_:22 in 2428) [ClassicSimilarity], result of:
      0.028222147 = score(doc=2428,freq=2.0), product of:
        0.18236019 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052075688 = queryNorm
        0.15476047 = fieldWeight in 2428, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.03125 = fieldNorm(doc=2428)
  0.2 = coord(1/5)

0.0050514047 = product of:
  0.025257023 = sum of:
    0.025257023 = weight(_text_:7 in 1486) [ClassicSimilarity], result of:
      0.025257023 = score(doc=1486,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.14640506 = fieldWeight in 1486, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.03125 = fieldNorm(doc=1486)
  0.2 = coord(1/5)

Isbn

1-402-03003-7

0.0037885536 = product of:
  0.018942768 = sum of:
    0.018942768 = weight(_text_:7 in 6) [ClassicSimilarity], result of:
      0.018942768 = score(doc=6,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.109803796 = fieldWeight in 6, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.0234375 = fieldNorm(doc=6)
  0.2 = coord(1/5)

Content

Inhalt: Chapter 1. Introduction to Web Search Engines: 1.1 A Short History of Information Retrieval - 1.2 An Overview of Traditional Information Retrieval - 1.3 Web Information Retrieval Chapter 2. Crawling, Indexing, and Query Processing: 2.1 Crawling - 2.2 The Content Index - 2.3 Query Processing Chapter 3. Ranking Webpages by Popularity: 3.1 The Scene in 1998 - 3.2 Two Theses - 3.3 Query-Independence Chapter 4. The Mathematics of Google's PageRank: 4.1 The Original Summation Formula for PageRank - 4.2 Matrix Representation of the Summation Equations - 4.3 Problems with the Iterative Process - 4.4 A Little Markov Chain Theory - 4.5 Early Adjustments to the Basic Model - 4.6 Computation of the PageRank Vector - 4.7 Theorem and Proof for Spectrum of the Google Matrix Chapter 5. Parameters in the PageRank Model: 5.1 The a Factor - 5.2 The Hyperlink Matrix H - 5.3 The Teleportation Matrix E Chapter 6. The Sensitivity of PageRank; 6.1 Sensitivity with respect to alpha - 6.2 Sensitivity with respect to H - 6.3 Sensitivity with respect to vT - 6.4 Other Analyses of Sensitivity - 6.5 Sensitivity Theorems and Proofs Chapter 7. The PageRank Problem as a Linear System: 7.1 Properties of (I - alphaS) - 7.2 Properties of (I - alphaH) - 7.3 Proof of the PageRank Sparse Linear System Chapter 8. Issues in Large-Scale Implementation of PageRank: 8.1 Storage Issues - 8.2 Convergence Criterion - 8.3 Accuracy - 8.4 Dangling Nodes - 8.5 Back Button Modeling

0.0031571276 = product of:
  0.015785638 = sum of:
    0.015785638 = weight(_text_:7 in 42) [ClassicSimilarity], result of:
      0.015785638 = score(doc=42,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.09150316 = fieldWeight in 42, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.01953125 = fieldNorm(doc=42)
  0.2 = coord(1/5)

Footnote

Am interessantesten und wichtigsten erschien mir der Grundsatzartikel von Peter Ingwersen und Kalervo Järvelin (Kopenhagen/Tampere), The sense of information: Understanding the cognitive conditional information concept in relation to information acquisition (S. 7-19). Hier versuchen die Autoren, den ursprünglich von Ingwersen1 vorgeschlagenen und damals ausschliesslich im Zusammenhang mit dem interaktiven Information Retrieval verwendeten Begriff "conditional cognitive information" anhand eines erweiterten Modells nicht nur auf das Gesamtgebiet von "information seeking and retrieval" (IS&R) auszuweiten, sondern auch auf den menschlichen Informationserwerb aus der Sinneswahrnehmung, wie z.B. im Alltag oder im Rahmen der wissenschaftlichen Erkenntnistätigkeit. Dabei werden auch alternative Informationsbegriffe sowie die Beziehung von Information und Bedeutung diskutiert. Einen ebenfalls auf Ingwersen zurückgehenden Ansatz thematisiert der Beitrag von Birger Larsen (Kopenhagen), indem er sich mit dessen vor über 10 Jahren veröffentlichten2 Principle of Polyrepresentation befasst. Dieses beruht auf der Hypothese, wonach die Überlappung zwischen unterschiedlichen kognitiven Repräsentationen - nämlich jenen der Situation des Informationssuchenden und der Dokumente - zur Reduktion der einer Retrievalsituation anhaftenden Unsicherheit und damit zur Verbesserung der Performance des IR-Systems genutzt werden könne. Das Prinzip stellt die Dokumente, ihre Autoren und Indexierer, aber auch die sie zugänglich machende IT-Lösung in einen umfassenden und kohärenten theoretischen Bezugsrahmen, der die benutzerorientierte Forschungsrichtung "Information-Seeking" mit der systemorientierten IR-Forschung zu integrieren trachtet. Auf der Basis theoretischer Überlegungen sowie der (wenigen) dazu vorliegenden empirischen Studien hält Larsen das Model, das von Ingwersen sowohl für "exact match-IR" als auch für "best match-IR" intendiert war, allerdings schon in seinen Grundzügen für "Boolean" (d.h. "exact match"-orientiert) und schlägt ein "polyrepresentation continuum" als Verbesserungsmöglichkeit vor.

0.0031571276 = product of:
  0.015785638 = sum of:
    0.015785638 = weight(_text_:7 in 636) [ClassicSimilarity], result of:
      0.015785638 = score(doc=636,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.09150316 = fieldWeight in 636, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.01953125 = fieldNorm(doc=636)
  0.2 = coord(1/5)

Content

Enthält die Beiträge: 1. The Text REtrieval Conference - Ellen M. Voorhees and Donna K. Harman 2. The TREC Test Collections - Donna K. Harman 3. Retrieval System Evaluation - Chris Buckley and Ellen M. Voorhees 4. The TREC Ad Hoc Experiments - Donna K. Harman 5. Routing and Filtering - Stephen Robertson and Jamie Callan 6. The TREC Interactive Tracks: Putting the User into Search - Susan T. Dumais and Nicholas J. Belkin 7. Beyond English - Donna K. Harman 8. Retrieving Noisy Text - Ellen M. Voorhees and John S. Garofolo 9.The Very Large Collection and Web Tracks - David Hawking and Nick Craswell 10. Question Answering in TREC - Ellen M. Voorhees 11. The University of Massachusetts and a Dozen TRECs - James Allan, W. Bruce Croft and Jamie Callan 12. How Okapi Came to TREC - Stephen Robertson 13. The SMART Project at TREC - Chris Buckley 14. Ten Years of Ad Hoc Retrieval at TREC Using PIRCS - Kui-Lam Kwok 15. MultiText Experiments for TREC - Gordon V. Cormack, Charles L. A. Clarke, Christopher R. Palmer and Thomas R. Lynam 16. A Language-Modeling Approach to TREC - Djoerd Hiemstra and Wessel Kraaij 17. BM Research Activities at TREC - Eric W. Brown, David Carmel, Martin Franz, Abraham Ittycheriah, Tapas Kanungo, Yoelle Maarek, J. Scott McCarley, Robert L. Mack, John M. Prager, John R. Smith, Aya Soffer, Jason Y. Zien and Alan D. Marwick Epilogue: Metareflections on TREC - Karen Sparck Jones

0.0028222147 = product of:
  0.014111074 = sum of:
    0.014111074 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
      0.014111074 = score(doc=1789,freq=2.0), product of:
        0.18236019 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052075688 = queryNorm
        0.07738023 = fieldWeight in 1789, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.015625 = fieldNorm(doc=1789)
  0.2 = coord(1/5)

Date

23. 3.2008 19:10:22

0.0025257024 = product of:
  0.0126285115 = sum of:
    0.0126285115 = weight(_text_:7 in 68) [ClassicSimilarity], result of:
      0.0126285115 = score(doc=68,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.07320253 = fieldWeight in 68, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.015625 = fieldNorm(doc=68)
  0.2 = coord(1/5)

Footnote

1. historisch (die Gegenwart aus der Vergangheit heraus verstehen) 2. konstruktivistisch (Individuen konstruieren unter dem Einfluss ihres sozialen Kontexts das Verständnis ihrer Welten) 3. diskursanalytisch (Sprache konstituiert die Konstruktion der Identität und die Ausbildung von Bedeutungen) 4. philosophisch-analytisch (rigorose Analyse von Begriffen und Thesen) 5. kritische Theorie (Analyse versteckter Macht- und Herrschaftsmuster) 6. ethnographisch (Verständnis von Menschen durch Hineinversetzen in deren Kulturen) 7. sozialkognitiv (sowohl das Denken des Individuums als auch dessen sozialer bzw. fachlicher Umraum beeinflussen die Informationsnutzung) 8. kognitiv (Fokus auf das Denken der Individuen im Zusammenhang mit Suche, Auffindung und Nutzung von Information) 9. bibliometrisch (statistische Eigenschaften von Information) 10. physikalisch (Signalübertragung, Informationstheorie) 11. technisch (Informationsbedürfnisse durch immer bessere Systeme und Dienste erfüllen) 12. benutzerorientierte Gestaltung ("usability", Mensch-Maschine-Interaktion) 13. evolutionär (Anwendung von Ergebnissen von Biologie und Evolutionspsychologie auf informationsbezogene Phänomene). Bates Beitrag ist, wie stets, wohldurchdacht, didaktisch gut aufbereitet und in klarer Sprache abgefasst, sodass man ihn mit Freude und Gewinn liest. Zu letzterem trägt auch noch die umfangreiche Liste von Literaturangaben bei, mit der sich insbesondere die 13 genannten Metatheorien optimal weiterverfolgen lassen. . . .

0.0025257024 = product of:
  0.0126285115 = sum of:
    0.0126285115 = weight(_text_:7 in 92) [ClassicSimilarity], result of:
      0.0126285115 = score(doc=92,freq=2.0), product of:
        0.17251469 = queryWeight, product of:
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.052075688 = queryNorm
        0.07320253 = fieldWeight in 92, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3127685 = idf(docFreq=4376, maxDocs=44218)
          0.015625 = fieldNorm(doc=92)
  0.2 = coord(1/5)

Footnote

Rez. in: JASIST 56(2005) no.2, S.215-216 (A. Heath): "What is small, thoroughly organized, and easy to understand? Well, it's Heting Chu's latest book an information retrieval. A very welcome release, this small literary addition to the field (only 248 pages) contains a concise and weIl-organized discussion of every major topic in information retrieval. The often-complex field of information retrieval is presented from its origin in the early 1950s to the present day. The organization of this text is top-notch, thus making this an easy read for even the novice. Unlike other titles in this area, Chu's user-friendly style of writing is done an purpose to properly introduce newcomers to the field in a less intimidating way. As stated by the author in the Preface, the purpose of the book is to "present a systematic, thorough yet nontechnical view of the field by using plain language to explain complex subjects." Chu has definitely struck up the right combination of ingredients. In a field so broad and complex, a well-organized presentation of topics that don't trip an themselves is essential. The use of plain language where possible is also a good choice for this topic because it allows one to absorb topics that are, by nature, not as easy to grasp. For instance, Chapters 6 and 7, which cover retrieval approaches and techniques, an often painstaking topic for many students and teachers is deftly handled with the use of tables that can be used to compare and contrast the various models discussed. I particularly loved Chu's use of Koll's 2000 article from the Bulletin of the American Society for Information Science to explain subject searching at the beginning of Chapter 6, which discusses the differences between browsing and searching. The Koll article uses the task of finding a needle in a haystack as an analogy.