Pages that link to "Item:Q3532845"

The following pages link to Introduction to Information Retrieval (Q3532845):

Displaying 50 items.

• Fitting jump models (Q1716432) (← links)
• Extracting hierarchies from data clusters for better classification (Q1736527) (← links)
• Using dynamic time warping distances as features for improved time series classification (Q1741147) (← links)
• Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models (Q1741286) (← links)
• SimUSF: an efficient and effective similarity measure that is invariant to violations of the interval scale assumption (Q1741299) (← links)
• Detecting cooperative and organized spammer groups in micro-blogging community (Q1741311) (← links)
• Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
• Categorization of text documents taking into account some structural features (Q1742433) (← links)
• Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
• \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity (Q1748195) (← links)
• Publicly verifiable searchable symmetric encryption based on efficient cryptographic components (Q1755999) (← links)
• The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities (Q1762222) (← links)
• Solution sensitivity-based scenario reduction for stochastic unit commitment (Q1789567) (← links)
• A quantum-inspired version of the nearest mean classifier (Q1797756) (← links)
• Branch-and-mincut: global optimization for image segmentation with high-level priors (Q1932989) (← links)
• Dating medieval English charters (Q1940007) (← links)
• Metrics based on average distance between sets (Q1943080) (← links)
• Regularized nonnegative shared subspace learning (Q1944970) (← links)
• Using applied ontology to saturate semantic relations (Q1982457) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• Calibrating AdaBoost for phoneme classification (Q2001122) (← links)
• Fusing data depth with complex networks: community detection with prior information (Q2002721) (← links)
• Spectral clustering with physical intuition on spring-mass dynamics (Q2017253) (← links)
• Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data (Q2032151) (← links)
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
• Clustering of modal-valued symbolic data (Q2036177) (← links)
• Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
• Declarative pearl: deriving monadic quicksort (Q2039941) (← links)
• Classifier-based constraint acquisition (Q2043441) (← links)
• Convex programming based spectral clustering (Q2051294) (← links)
• Importance sampling in reinforcement learning with an estimated behavior policy (Q2051319) (← links)
• Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
• Tensorized multi-view subspace representation learning (Q2056150) (← links)
• Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold (Q2056274) (← links)
• An incremental density-based clustering framework using fuzzy local clustering (Q2056290) (← links)
• Scalable computational measures for entropic detection of latent relations and their applications to magnetic imaging (Q2065522) (← links)
• Towards quantum computing based community detection (Q2065973) (← links)
• Link prediction techniques, applications, and performance: a survey (Q2070200) (← links)
• Simplicial and minimal-variance distances in multivariate data analysis (Q2074654) (← links)
• A network-based positive and unlabeled learning approach for fake news detection (Q2102409) (← links)
• Neural software vulnerability analysis using rich intermediate graph representations of programs (Q2123552) (← links)
• Multiple kernel low-rank representation-based robust multi-view subspace clustering (Q2126253) (← links)
• Embed2detect: temporally clustered embedded words for event detection in social media (Q2127218) (← links)
• Minimization of \(p\)-Laplacian via the finite element method in MATLAB (Q2128481) (← links)
• SaaSRec+: a new context-aware recommendation method for SaaS services (Q2130196) (← links)
• A novel collaborative filtering recommendation approach based on soft co-clustering (Q2143284) (← links)
• Entropy of high-order Markov chains beyond the pair correlations (Q2149703) (← links)
• Transformer-based deep neural language modeling for construct-specific automatic item generation (Q2152429) (← links)
• The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
• Correlation properties of the random linear high-order Markov chains (Q2161967) (← links)