Using modularity clusters of the user-item graph as hash buckets sharply improves retrieval accuracy when embedding tables are compressed.
Scikit-network: Graph analysis in python
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IR 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems
Using modularity clusters of the user-item graph as hash buckets sharply improves retrieval accuracy when embedding tables are compressed.