Search (23 results, page 2 of 2)

  • × classification_ss:"06.70 / Katalogisierung / Bestandserschließung"
  • × year_i:[2000 TO 2010}
  1. Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006) 0.00
    2.2062263E-4 = product of:
      0.0033093393 = sum of:
        0.0033093393 = product of:
          0.0066186786 = sum of:
            0.0066186786 = weight(_text_:information in 6) [ClassicSimilarity], result of:
              0.0066186786 = score(doc=6,freq=10.0), product of:
                0.050870337 = queryWeight, product of:
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.028978055 = queryNorm
                0.1301088 = fieldWeight in 6, product of:
                  3.1622777 = tf(freq=10.0), with freq of:
                    10.0 = termFreq=10.0
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.0234375 = fieldNorm(doc=6)
          0.5 = coord(1/2)
      0.06666667 = coord(1/15)
    
    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
    Chapter 9. Accelerating the Computation of PageRank: 9.1 An Adaptive Power Method - 9.2 Extrapolation - 9.3 Aggregation - 9.4 Other Numerical Methods Chapter 10. Updating the PageRank Vector: 10.1 The Two Updating Problems and their History - 10.2 Restarting the Power Method - 10.3 Approximate Updating Using Approximate Aggregation - 10.4 Exact Aggregation - 10.5 Exact vs. Approximate Aggregation - 10.6 Updating with Iterative Aggregation - 10.7 Determining the Partition - 10.8 Conclusions Chapter 11. The HITS Method for Ranking Webpages: 11.1 The HITS Algorithm - 11.2 HITS Implementation - 11.3 HITS Convergence - 11.4 HITS Example - 11.5 Strengths and Weaknesses of HITS - 11.6 HITS's Relationship to Bibliometrics - 11.7 Query-Independent HITS - 11.8 Accelerating HITS - 11.9 HITS Sensitivity Chapter 12. Other Link Methods for Ranking Webpages: 12.1 SALSA - 12.2 Hybrid Ranking Methods - 12.3 Rankings based on Traffic Flow Chapter 13. The Future of Web Information Retrieval: 13.1 Spam - 13.2 Personalization - 13.3 Clustering - 13.4 Intelligent Agents - 13.5 Trends and Time-Sensitive Search - 13.6 Privacy and Censorship - 13.7 Library Classification Schemes - 13.8 Data Fusion Chapter 14. Resources for Web Information Retrieval: 14.1 Resources for Getting Started - 14.2 Resources for Serious Study Chapter 15. The Mathematics Guide: 15.1 Linear Algebra - 15.2 Perron-Frobenius Theory - 15.3 Markov Chains - 15.4 Perron Complementation - 15.5 Stochastic Complementation - 15.6 Censoring - 15.7 Aggregation - 15.8 Disaggregation
  2. Satija, M.P.: ¬A dictionary of knowledge organization (2004) 0.00
    1.6444239E-4 = product of:
      0.0024666358 = sum of:
        0.0024666358 = product of:
          0.0049332716 = sum of:
            0.0049332716 = weight(_text_:information in 3111) [ClassicSimilarity], result of:
              0.0049332716 = score(doc=3111,freq=2.0), product of:
                0.050870337 = queryWeight, product of:
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.028978055 = queryNorm
                0.09697737 = fieldWeight in 3111, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=3111)
          0.5 = coord(1/2)
      0.06666667 = coord(1/15)
    
    Abstract
    From classification to knowledge organization through subject indexing the field has been so rapidly growing that it is difficult to demarcate its boundaries. Knowledge organization is viewed in the sense of conglomeration of activities to sort and order knowledge, to acquire, ufilize, evaluate, represent and communicate knowledge for problem solving. It has been no simple matter to decide what should be included in and excluded from such a dictionary. Broadly speaking the terms an the following topics are included in the work : Knowledge, Epistemology, Concepts, Terminology and Vocabulary control ; Classification systems, their design, theory and practice of classification, Subject analysis; fundamental categories and facets, Content and Text analysis, Use of classification in online systems and an the web. Subject cataloguing : subject headings, Thesauri and alphabetical indexing languages : Keyword, chain and string indexes, Knowledge representation, Classification for access and retrieval, Cognitive aspects of information- seeking behaviour, Automatic classification, Descriptive cataloguing : Theory, kinds, levels, standards and codes, OPACs, all are covered in this work. Like any other such work of this sort, it is an electic compilation. The work proposes to be descriptive rather than prescriptive. Endeavour is to find brief simple, logical and consensual meaning of terms, and append brief description of a concept or an issue with explanation, examples and comments in a bottom up way. Some current topics denoted by phrases have also been included. At times it may give the look of a concise encyclopaedic dictionary. Terms fully describe concepts and methods, and may evoke some thoughts an current and classic issues in the field.
  3. Wynar, B.S.; Taylor, A.G.; Miller, D.P.: Introduction to cataloging and classification (2006) 0.00
    1.6444239E-4 = product of:
      0.0024666358 = sum of:
        0.0024666358 = product of:
          0.0049332716 = sum of:
            0.0049332716 = weight(_text_:information in 2053) [ClassicSimilarity], result of:
              0.0049332716 = score(doc=2053,freq=2.0), product of:
                0.050870337 = queryWeight, product of:
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.028978055 = queryNorm
                0.09697737 = fieldWeight in 2053, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=2053)
          0.5 = coord(1/2)
      0.06666667 = coord(1/15)
    
    Series
    Library and information science text series

Languages

Types

  • m 22
  • s 3
  • i 2
  • r 1
  • x 1
  • More… Less…

Subjects

Classifications