Search (7 results, page 1 of 1)

0.057275757 = product of:
  0.085913636 = sum of:
    0.068818994 = weight(_text_:interest in 1753) [ClassicSimilarity], result of:
      0.068818994 = score(doc=1753,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.27446008 = fieldWeight in 1753, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1753)
    0.017094642 = product of:
      0.034189284 = sum of:
        0.034189284 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
          0.034189284 = score(doc=1753,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = 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.6666667 = coord(2/3)

Abstract

This book offers a comprehensive and consistent mathematical approach to information retrieval (IR) without which no implementation is possible, and sheds an entirely new light upon the structure of IR models. It contains the descriptions of all IR models in a unified formal style and language, along with examples for each, thus offering a comprehensive overview of them. The book also creates mathematical foundations and a consistent mathematical theory (including all mathematical results achieved so far) of IR as a stand-alone mathematical discipline, which thus can be read and taught independently. Also, the book contains all necessary mathematical knowledge on which IR relies, to help the reader avoid searching different sources. The book will be of interest to computer or information scientists, librarians, mathematicians, undergraduate students and researchers whose work involves information retrieval.

Date

22. 3.2008 12:26:32

0.047367524 = product of:
  0.071051285 = sum of:
    0.055055197 = weight(_text_:interest in 26) [ClassicSimilarity], result of:
      0.055055197 = score(doc=26,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.21956807 = fieldWeight in 26, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.03125 = fieldNorm(doc=26)
    0.01599609 = product of:
      0.03199218 = sum of:
        0.03199218 = weight(_text_:classification in 26) [ClassicSimilarity], result of:
          0.03199218 = score(doc=26,freq=4.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.19904417 = fieldWeight in 26, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03125 = fieldNorm(doc=26)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more effective information-seeking support to users than best-first search. Indeed, faceted search has become increasingly prevalent in online information access systems, particularly for e-commerce and site search. In this lecture, we explore the history, theory, and practice of faceted search. Although we cannot hope to be exhaustive, our aim is to provide sufficient depth and breadth to offer a useful resource to both researchers and practitioners. Because faceted search is an area of interest to computer scientists, information scientists, interface designers, and usability researchers, we do not assume that the reader is a specialist in any of these fields. Rather, we offer a self-contained treatment of the topic, with an extensive bibliography for those who would like to pursue particular aspects in more depth.

LCSH

Faceted classification / Research

Subject

Faceted classification / Research

0.011469833 = product of:
  0.034409497 = sum of:
    0.034409497 = weight(_text_:interest in 636) [ClassicSimilarity], result of:
      0.034409497 = score(doc=636,freq=2.0), product of:
        0.25074318 = queryWeight, product of:
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.05046903 = queryNorm
        0.13723004 = fieldWeight in 636, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.9682584 = idf(docFreq=835, maxDocs=44218)
          0.01953125 = fieldNorm(doc=636)
  0.33333334 = coord(1/3)

Abstract

The Text REtrieval Conference (TREC), a yearly workshop hosted by the US government's National Institute of Standards and Technology, provides the infrastructure necessary for large-scale evaluation of text retrieval methodologies. With the goal of accelerating research in this area, TREC created the first large test collections of full-text documents and standardized retrieval evaluation. The impact has been significant; since TREC's beginning in 1992, retrieval effectiveness has approximately doubled. TREC has built a variety of large test collections, including collections for such specialized retrieval tasks as cross-language retrieval and retrieval of speech. Moreover, TREC has accelerated the transfer of research ideas into commercial systems, as demonstrated in the number of retrieval techniques developed in TREC that are now used in Web search engines. This book provides a comprehensive review of TREC research, summarizing the variety of TREC results, documenting the best practices in experimental information retrieval, and suggesting areas for further research. The first part of the book describes TREC's history, test collections, and retrieval methodology. Next, the book provides "track" reports -- describing the evaluations of specific tasks, including routing and filtering, interactive retrieval, and retrieving noisy text. The final part of the book offers perspectives on TREC from such participants as Microsoft Research, University of Massachusetts, Cornell University, University of Waterloo, City University of New York, and IBM. The book will be of interest to researchers in information retrieval and related technologies, including natural language processing.

0.006530377 = product of:
  0.01959113 = sum of:
    0.01959113 = product of:
      0.03918226 = sum of:
        0.03918226 = weight(_text_:classification in 4041) [ClassicSimilarity], result of:
          0.03918226 = score(doc=4041,freq=6.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.24377833 = fieldWeight in 4041, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03125 = fieldNorm(doc=4041)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Class-tested and coherent, this textbook teaches information retrieval, including web search, text classification, and text clustering from basic concepts. Ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students. Slides and additional exercises are available for lecturers. - This book provides what Salton and Van Rijsbergen both failed to achieve. Even more important, unlike some other books in IR, the authors appear to care about making the theory as accessible as possible to the reader, on occasion including short primers to certain topics or choosing to explain difficult concepts using simplified approaches. Its coverage [is] excellent, the quality of writing high and I was surprised how much I learned from reading it. I think the online resources are impressive.

Content

Inhalt: Boolean retrieval - The term vocabulary & postings lists - Dictionaries and tolerant retrieval - Index construction - Index compression - Scoring, term weighting & the vector space model - Computing scores in a complete search system - Evaluation in information retrieval - Relevance feedback & query expansion - XML retrieval - Probabilistic information retrieval - Language models for information retrieval - Text classification & Naive Bayes - Vector space classification - Support vector machines & machine learning on documents - Flat clustering - Hierarchical clustering - Matrix decompositions & latent semantic indexing - Web search basics - Web crawling and indexes - Link analysis Vgl. die digitale Fassung unter: http://nlp.stanford.edu/IR-book/pdf/irbookprint.pdf.

0.004712893 = product of:
  0.014138679 = sum of:
    0.014138679 = product of:
      0.028277358 = sum of:
        0.028277358 = weight(_text_:classification in 262) [ClassicSimilarity], result of:
          0.028277358 = score(doc=262,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.17593184 = fieldWeight in 262, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=262)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The Architecture of Cyberspace is aimed at students taking information management as a minor in their course as well as those who manage document collections but who are not professional librarians. The first part of this book looks at how users find documents and the problems they have; the second part discusses how to manage the information space using various tools such as classification and controlled vocabularies. It also explores the general issues of publishing, including legal considerations, as well the main issues of creating and managing archives. Supported by exercises and discussion questions at the end of each chapter, the book includes some sample assignments suitable for use with students of this subject. A glossary is also provided to help readers understand the specialised vocabulary and the key concepts in the design and assessment of information spaces.

0.004558571 = product of:
  0.013675713 = sum of:
    0.013675713 = product of:
      0.027351426 = sum of:
        0.027351426 = weight(_text_:22 in 1082) [ClassicSimilarity], result of:
          0.027351426 = score(doc=1082,freq=2.0), product of:
            0.17673394 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05046903 = queryNorm
            0.15476047 = fieldWeight in 1082, 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=1082)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

16.10.2013 19:22:44

0.0037703146 = product of:
  0.011310943 = sum of:
    0.011310943 = product of:
      0.022621887 = sum of:
        0.022621887 = weight(_text_:classification in 4127) [ClassicSimilarity], result of:
          0.022621887 = score(doc=4127,freq=2.0), product of:
            0.16072905 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05046903 = queryNorm
            0.14074548 = fieldWeight in 4127, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03125 = fieldNorm(doc=4127)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Content

Inhalt Collaborating to search effectively in different searcher modes through cues and specialty search / Naresh Kumar Agarwal and Danny C.C. Poo -- Collaborative querying using a hybrid content and results-based approach / Chandrani Sinha Ray ... [et al.] -- Collaborative classification for group-oriented organization of search results / Keiichi Nakata and Amrish Singh -- A case study of use-centered descriptions : archival descriptions of what can be done with a collection / Richard Butterworth -- Metadata for social recommendations : storing, sharing, and reusing evaluations of learning resources / Riina Vuorikari, Nikos Manouselis, and Erik Duval -- Social network models for enhancing reference-based search engine rankings / Nikolaos Korfiatis ... [et al.] -- From PageRank to social rank : authority-based retrieval in social information spaces / Sebastian Marius Kirsch ... [et al.] -- Adaptive peer-to-peer social networks for distributed content-based Web search / Le-Shin Wu ... [et al.] -- The ethics of social information retrieval / Brendan Luyt and Chu Keong Lee -- The social context of knowledge / Daniel Memmi -- Social information seeking in digital libraries / George Buchanan and Annika Hinze -- Relevant intra-actions in networked environments / Theresa Dirndorfer Anderson -- Publication and citation analysis as a tool for information retrieval / Ronald Rousseau -- Personalized information retrieval in a semantic-based learning environment / Antonella Carbonaro and Rodolfo Ferrini -- Multi-agent tourism system (MATS) / Soe Yu Maw and Myo-Myo Naing -- Hybrid recommendation systems : a case study on the movies domain / Konstantinos Markellos ... [et al.].