Introduction to Information Retrieval
By Ray R. Larson. 2008
2,258 citations recorded by the source corpus.
Class-tested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an up-to-date treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures.
Subfields: Information Systems, Information Retrieval & Search
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Information Systems
In Information Retrieval & Search
- Sebastian Hofstätter
- Allan Hanbury
- Jimmy J. Lin
- Mete Sertkan
- Ji-rong Wen
- Wayne Xin Zhao
- Zhiyuan Liu
- Xueqi Cheng
Citations in the corpus
- A Neural Attention Model for Abstractive Sentence Summarization (2015, neutral): “This baseline indexes the training set, and gives the title for the article with highest BM-25 match to the input (see Manning et al. (2008)).”
- A Structured Vector Space Model for Word Meaning in Context (2008, neutral): “These vectors are able to provide a robust model of semantic similarity that has been used in NLP (Salton et al., 1975; McCarthy and Carroll, 2003; Manning et al., 2008) and to model experimental results in cognitive science (Landauer and Dumais, 1997; McDonald and Ramscar, 2001).”
- Understanding the Sparse Vector Technique for Differential Privacy (2016, positive): “We use the widely used F-measure [15] which is the harmonic mean of precision and recall, i.”
- A General SIMD-Based Approach to Accelerating Compression Algorithms (2015, positive): “Compression algorithms can reduce the space of posting lists, and therefore reduce the transfer of data from disk to memory [Manning et al. 2008, p. 85; Zhang et al. 2008].”
- Variations of the Similarity Function of TextRank for Automated Summarization (2016, positive): “For the task of automated summarization, TextRank models any document as a graph using sentences as nodes [3].”
- Locally Differentially Private Heavy Hitter Identification (2017, neutral): “We use the widely used F-measure [23] which is the harmonic mean of precision and recall, i.e., We note that when | C T | = | C g | , the precision P equals the recall R , and the F-measure equals the precision, as well as 1 minus the false negative rate.”
- Scientific Paper Summarization Using Citation Summary Networks (2008, positive): “Purity (Manning et al., 2008) is a method in which each cluster is assigned to the class with the majority vote in the cluster, and then”
- Semantic Matching in Search (2014, neutral): “See [131, 52, 6] for introduction to the fundamentals of web search system.”
- Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation (2020, positive): “The same principles that applied to traditional IR systems to achieve low query latency also apply to novel neural ranking models: We need to transfer as much computation and data transformation to the indexing phase as possible to require less resources at query time [31, 32].”