Enriching Recommendation Models with Logic Conditions
Summary: RecLogic augments ML-based recommenders with graph-based TIE rules that embed ML predicates to reduce misclassifications without retraining. It learns TIEs iteratively, enabling a PTIME parallel recommendation algorithm with 22.89% gains (up to 33.10%) on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Lihang Fan
- 2. Wenfei Fan
- 3. Ping Lu
- 4. Chao Tian
- 5. Qiang Yin
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,406 | Explaining GNN-based Recommendations in Logic | 2025 | VLDB | 4.3399748e-05 |
| 9,439 | Rock: Cleaning Data by Embedding ML in Logic Rules | 2024 | SIGMOD | 4.3389137e-05 |
| 10,029 | Outliers: The Good, the Bad and the Ugly | 2026 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 432 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023349408 |
| 1,188 | word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data | 2020 | PODS | 0.00013431099 |
| 1,522 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD | 0.0001152219 |
| 3,478 | Functional Dependencies for Graphs | 2016 | SIGMOD | 7.0554625e-05 |
| 5,120 | Association Rules with Graph Patterns | 2015 | VLDB | 5.6754325e-05 |
| 7,120 | Discovering Graph Functional Dependencies | 2018 | SIGMOD | 4.8200122e-05 |
| 7,283 | Discovering Association Rules from Big Graphs | 2022 | VLDB | 4.7716465e-05 |
| 8,135 | Towards Event Prediction in Temporal Graphs | 2022 | VLDB | 4.5740737e-05 |
| 8,145 | Capturing Associations in Graphs | 2020 | VLDB | 4.5724134e-05 |
| 9,489 | Making It Tractable to Catch Duplicates and Conflicts in Graphs | 2023 | SIGMOD | 4.3300131e-05 |
Previous
Page 1 / 1
Next