Introduction to Information Retrieval

DOI10.1017/CBO9780511809071zbMath1160.68008WikidataQ60673995 ScholiaQ60673995MaRDI QIDQ3532845

Prabhakar Raghavan, Hinrich Schütze, Christopher D. Manning

Publication date: 29 October 2008

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Information storage and retrieval of data (68P20)

Related Items (only showing first 100 items - show all)

Neural software vulnerability analysis using rich intermediate graph representations of programs ⋮ Comparison of communities detection algorithms for multiplex ⋮ Multiple kernel low-rank representation-based robust multi-view subspace clustering ⋮ Embed2detect: temporally clustered embedded words for event detection in social media ⋮ Minimization of \(p\)-Laplacian via the finite element method in MATLAB ⋮ Time-efficient estimation of conditional mutual information for variable selection in classification ⋮ SaaSRec+: a new context-aware recommendation method for SaaS services ⋮ Mint: MDL-based approach for mining interesting numerical pattern sets ⋮ Bibliographic analysis on research publications using authors, categorical labels and the citation network ⋮ Optimizing non-decomposable measures with deep networks ⋮ A 3D shape descriptor based on spectral analysis of medial axis ⋮ Semantic association ranking schemes for information retrieval applications using term association graph representation ⋮ Merging image databases as an example for information integration ⋮ An orthogonal method for measurement matrix optimization ⋮ A novel collaborative filtering recommendation approach based on soft co-clustering ⋮ Information-theoretic feature selection with discrete \(k\)-median clustering ⋮ Which startup to invest in: a personalized portfolio strategy ⋮ Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ Identifying conflict patterns to reach a consensus -- a novel group decision approach ⋮ Efficiency of genetic algorithm for subject search queries ⋮ Nonparametric Bayesian topic modelling with the hierarchical Pitman-Yor processes ⋮ Entropy of high-order Markov chains beyond the pair correlations ⋮ Transformer-based deep neural language modeling for construct-specific automatic item generation ⋮ The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Correlation properties of the random linear high-order Markov chains ⋮ Efficient clustering on Riemannian manifolds: a kernelised random projection approach ⋮ Query expansion using an immune-inspired biclustering algorithm ⋮ The robot crawler graph process ⋮ Simple and efficient classification scheme based on specific vocabulary ⋮ DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling ⋮ Branch-and-mincut: global optimization for image segmentation with high-level priors ⋮ A novel probabilistic clustering model for heterogeneous networks ⋮ Detecting and ordering salient regions ⋮ Dating medieval English charters ⋮ Towards a theory of patches ⋮ Metrics based on average distance between sets ⋮ Consensus-based clustering under hesitant qualitative assessments ⋮ Exploring acquaintances of social network site users for effective social event recommendations ⋮ Regularized nonnegative shared subspace learning ⋮ Multi-view spectral clustering via robust local subspace learning ⋮ A note on using the F-measure for evaluating record linkage algorithms ⋮ Distance-based index structures for fast similarity search ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ On measuring similarity for sequences of itemsets ⋮ Generalization of clustering agreements and distances for overlapping clusters and network communities ⋮ Fitting jump models ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ An overview on XML similarity: background, current trends and future directions ⋮ Probabilistic neural network with homogeneity testing in recognition of discrete patterns set ⋮ A trace ratio maximization approach to multiple kernel-based dimensionality reduction ⋮ DNA-inspired information concealing: a survey ⋮ A PTAS for the square tiling problem ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ Extracting hierarchies from data clusters for better classification ⋮ A polarity analysis framework for Twitter messages ⋮ Using dynamic time warping distances as features for improved time series classification ⋮ Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models ⋮ SimUSF: an efficient and effective similarity measure that is invariant to violations of the interval scale assumption ⋮ Detecting cooperative and organized spammer groups in micro-blogging community ⋮ Micro-review synthesis for multi-entity summarization ⋮ Using applied ontology to saturate semantic relations ⋮ Categorization of text documents taking into account some structural features ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ An efficient \(K\)-means clustering algorithm for tall data ⋮ \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity ⋮ Index structures for fast similarity search for binary vectors ⋮ Statistical properties of the single linkage hierarchical clustering estimator ⋮ Publicly verifiable searchable symmetric encryption based on efficient cryptographic components ⋮ Achieving a compromise between performance and complexity of structure: an incremental approach ⋮ Prototype selection algorithms for distributed learning ⋮ Calibrating AdaBoost for phoneme classification ⋮ Fusing data depth with complex networks: community detection with prior information ⋮ The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities ⋮ Passage retrieval in legal texts ⋮ Spectral clustering with physical intuition on spring-mass dynamics ⋮ Ranking relations using analogies in biological and information networks ⋮ Solution sensitivity-based scenario reduction for stochastic unit commitment ⋮ Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data ⋮ Index-based, high-dimensional, cosine threshold querying with optimality guarantees ⋮ Clustering of modal-valued symbolic data ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ A quantum-inspired version of the nearest mean classifier ⋮ Declarative pearl: deriving monadic quicksort ⋮ A semiparametric method for clustering mixed data ⋮ Self-organizing maps by difference of convex functions optimization ⋮ Higher Criticism for Discriminating Word-Frequency Tables and Testing Authorship ⋮ Classifier-based constraint acquisition ⋮ Threshold optimisation for multi-label classifiers ⋮ Convex programming based spectral clustering ⋮ Importance sampling in reinforcement learning with an estimated behavior policy ⋮ Near-optimal large-scale k-medoids clustering ⋮ Tensorized multi-view subspace representation learning ⋮ Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold ⋮ An incremental density-based clustering framework using fuzzy local clustering ⋮ Scalable computational measures for entropic detection of latent relations and their applications to magnetic imaging ⋮ Towards quantum computing based community detection ⋮ Link prediction techniques, applications, and performance: a survey ⋮ Simplicial and minimal-variance distances in multivariate data analysis ⋮ Hierarchical topic modeling with nested hierarchical Dirichlet process ⋮ A network-based positive and unlabeled learning approach for fake news detection

This page was built for publication: Introduction to Information Retrieval