Pages that link to "Item:Q1591153"

The following pages link to Latent semantic indexing: A probabilistic analysis (Q1591153):

Displaying 50 items.

• The stochastic topic block model for the clustering of vertices in networks with textual edges (Q111344) (← links)
• Structural similarity: spectral methods for relaxed blockmodeling (Q286617) (← links)
• Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation (Q413911) (← links)
• Linear classifiers are nearly optimal when hidden variables have diverse effects (Q420914) (← links)
• Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
• A spectral algorithm for learning mixture models (Q598259) (← links)
• A randomized algorithm for the decomposition of matrices (Q617703) (← links)
• Finding similar users in social networks (Q693756) (← links)
• Tell me who I am: An interactive recommendation system (Q733719) (← links)
• Latent semantic analysis and Fiedler retrieval (Q869904) (← links)
• A new differential LSI space-based probabilistic document classifier (Q1029015) (← links)
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
• Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
• Lower bounds for the low-rank matrix approximation (Q1681803) (← links)
• Adversarial classification using signaling games with an application to phishing detection (Q1741294) (← links)
• Optimization problems for weighted graphs and related correlation estimates (Q1827724) (← links)
• Level search schemes for information filtering and retrieval (Q1866353) (← links)
• Parallel Monte Carlo algorithms for information retrieval (Q1873022) (← links)
• Second order accurate distributed eigenvector computation for extremely large matrices (Q1952103) (← links)
• PTEM: a popularity-based topical expertise model for community question answering (Q2044255) (← links)
• Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
• An asymptotic thin shell condition and large deviations for random multidimensional projections (Q2070086) (← links)
• Single-pass randomized QLP decomposition for low-rank approximation (Q2107279) (← links)
• A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (Q2174980) (← links)
• A randomized method for solving discrete ill-posed problems (Q2263217) (← links)
• A spectral algorithm for latent Dirichlet allocation (Q2345947) (← links)
• A unified statistical approach to non-negative matrix factorization and probabilistic latent semantic indexing (Q2347713) (← links)
• The uncovering of hidden structures by latent semantic analysis (Q2384532) (← links)
• Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
• A probabilistic model for latent semantic indexing in information retrieval and filtering (Q2765827) (← links)
• Taking a new look at the latent semantic analysis approach to information retrieval (Q2765833) (← links)
• Experiments with LSA scoring: Optimal rank and basis (Q2765837) (← links)
• A comparative analysis of LSI strategies (Q2765839) (← links)
• Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
• Randomized Local Model Order Reduction (Q3174769) (← links)
• On the complexity of decoding Boolean cube splitting into cube faces (Q3184526) (← links)
• (Q3436639) (← links)
• Group-Level Analysis and Visualization of Social Networks (Q3637326) (← links)
• Downdating the Latent Semantic Indexing Model for Conceptual Information Retrieval (Q4243004) (← links)
• Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
• Literature survey on low rank approximation of matrices (Q4603753) (← links)
• (Q4638104) (← links)
• Less is More: Sparse Graph Mining with Compact Matrix Decomposition (Q4969614) (← links)
• Recovering Structured Probability Matrices (Q4993314) (← links)
• A separable surrogate function method for sparse and low-rank matrices decomposition (Q5110318) (← links)
• (Q5149229) (← links)
• A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION (Q5149591) (← links)
• Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
• Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization (Q5252582) (← links)
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463954) (← links)