125 citations · 125 across the 2 of their papers we have counts for
3 papers
cs.SI2019
Fast and Accurate Network Embeddings via Very Sparse Random Projection
Haochen Chen, Syed Fahad Sultan, Yingtao Tian +2
We present FastRP, a scalable and performant algorithm for learning distributed node representations in a graph. FastRP is over 4,000 times faster than state-of-the-art methods suc…
cs.IR2019
Pseudo-Implicit Feedback for Alleviating Data Sparsity in Top-K Recommendation
Yun He, Haochen Chen, Ziwei Zhu +1
We propose PsiRec, a novel user preference propagation recommender that incorporates pseudo-implicit feedback for enriching the original sparse implicit feedback dataset. Three of…
cs.SI2017★ 125 cited
HARP: Hierarchical Representation Learning for Networks
Haochen Chen, Bryan Perozzi, Yifan Hu +1
We present HARP, a novel method for learning low dimensional embeddings of a graph's nodes which preserves higher-order structural features. Our proposed method achieves this by co…