Introduction to Information Retrieval
From MaRDI portal
Publication:3532845
Recommendations
Cited in
(only showing first 100 items - show all)- Using dynamic time warping distances as features for improved time series classification
- On the characteristics and structures of dynamical systems suitable for reservoir computing
- An overview on XML similarity: background, current trends and future directions
- Using applied ontology to saturate semantic relations
- Cluster-based generalized multiscale finite element method for elliptic PDEs with random coefficients
- An efficient \(K\)-means clustering algorithm for tall data
- Distributed Bayesian machine learning procedures
- Learning to Rank in Entity Relationship Graphs
- Information Retrieval Architecture and Algorithms
- Fast spectral clustering with self-weighted features
- Clustering multivariate count data via Dirichlet-multinomial network fusion
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- A network-based positive and unlabeled learning approach for fake news detection
- Mint: MDL-based approach for mining interesting numerical pattern sets
- Handling subjective information through augmented (fuzzy) computation
- Numerical study of reciprocal recommendation with domain matching
- SNIP: an adaptation of sorted neighborhood methods for deduplicating pedigree data
- Probabilistic methods of analysis for the time series Moran scatterplot quadrant signature
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- Monitoring rare categories in sentiment and opinion analysis: a Milan mega event on Twitter platform
- Detecting and ordering salient regions
- Clustering Search Engine Log for Query Recommendation
- Solution sensitivity-based scenario reduction for stochastic unit commitment
- On measuring similarity for sequences of itemsets
- Surrogate regret bounds for generalized classification performance metrics
- Influence maximization in the presence of vulnerable nodes: a ratio perspective
- Model reduction for LPV systems based on approximate modal decomposition
- Widening the scope of an eigenvector stochastic approximation process and application to streaming PCA and related methods
- Passage retrieval in legal texts
- Prototype selection algorithms for distributed learning
- Extracting hierarchies from data clusters for better classification
- Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models
- Detecting cooperative and organized spammer groups in micro-blogging community
- Micro-review synthesis for multi-entity summarization
- SimUSF: an efficient and effective similarity measure that is invariant to violations of the interval scale assumption
- Towards a theory of patches
- Calibrating AdaBoost for phoneme classification
- Fusing data depth with complex networks: community detection with prior information
- Variational Bayes estimation of hierarchical Dirichlet-multinomial mixtures for text clustering
- Information-theoretic feature selection with discrete \(k\)-median clustering
- Distance-based index structures for fast similarity search
- Ranking with Fairness Constraints
- Classifier-based constraint acquisition
- Comparison of communities detection algorithms for multiplex
- Time-efficient estimation of conditional mutual information for variable selection in classification
- scientific article; zbMATH DE number 7690427 (Why is no real title available?)
- Categorization of text documents taking into account some structural features
- scientific article; zbMATH DE number 1934642 (Why is no real title available?)
- Dating medieval English charters
- Neural software vulnerability analysis using rich intermediate graph representations of programs
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Graph-based natural language processing and information retrieval.
- The search problem in mixture models
- Event detection in online social network: methodologies, state-of-art, and evolution
- Optimizing non-decomposable measures with deep networks
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
- The Geometry of Information Retrieval
- A quantum-inspired version of the nearest mean classifier
- \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
- Minimization of \(p\)-Laplacian via the finite element method in MATLAB
- SaaSRec+: a new context-aware recommendation method for SaaS services
- Spectral clustering with physical intuition on spring-mass dynamics
- Multichannel convolution neural network for gas mixture classification
- Publicly verifiable searchable symmetric encryption based on efficient cryptographic components
- Double linear regressions for single labeled image per person face recognition
- Automated Classification and Categorization of Mathematical Knowledge
- Bibliographic analysis on research publications using authors, categorical labels and the citation network
- Ranking relations using analogies in biological and information networks
- TPNE: topology preserving network embedding
- Solving projected model counting by utilizing treewidth and its limits
- A 3D shape descriptor based on spectral analysis of medial axis
- Which startup to invest in: a personalized portfolio strategy
- Quantum Mathematics in Artificial Intelligence
- Coupled double consensus multi-graph fusion for multi-view clustering
- Model-based clustering for populations of networks
- Textual outlier detection with an unsupervised method using text similarity and density peak
- Group-theoretical vector space model
- The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities
- Merging image databases as an example for information integration
- Semantic association ranking schemes for information retrieval applications using term association graph representation
- An orthogonal method for measurement matrix optimization
- scientific article; zbMATH DE number 1968567 (Why is no real title available?)
- Dokumentations- und Ordnungslehre. Theorie und Praxis des Information Retrieval.
- Query expansion using an immune-inspired biclustering algorithm
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- A novel collaborative filtering recommendation approach based on soft co-clustering
- Document clustering
- A practical guide to text mining with topic extraction
- Bayesian vertex nomination using content and context
- Vertex nomination
- Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data
- Assessing Basin Identification Methods for Locating Multiple Optima
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Convex programming based spectral clustering
- Metrics based on average distance between sets
- Shift of pairwise similarities for data clustering
- QuickDSC: clustering by quick density subgraph estimation
- Minimum common string partition: on solving large‐scale problem instances
- Branch-and-mincut: global optimization for image segmentation with high-level priors
- Optimizing Query Perturbations to Enhance Shape Retrieval
This page was built for publication: Introduction to Information Retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532845)
