Efficient similarity factorization of rank-1 modifications
From MaRDI portal
Publication:3177130
DOI10.1002/PAMM.200510371zbMATH Open1396.65106OpenAlexW2161301051WikidataQ57389643 ScholiaQ57389643MaRDI QIDQ3177130FDOQ3177130
Sebastian Schlenkrich, Andreas Griewank, Andrea Walther
Publication date: 26 July 2018
Published in: PAMM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/pamm.200510371
Recommendations
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning 👍 👎
- An efficient method for computing factor similarity coefficients: a computational note and an algorithm 👍 👎
- Fast, memory-efficient low-rank approximation of SimRank 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Efficient similarity factorization of rank-1 modifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177130)
