diff options
| author | Qinggang Zhang <68147254+Qing145@users.noreply.github.com> | 2026-02-02 10:59:59 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2026-02-02 10:59:59 +0800 |
| commit | 3db20ec2a7b0dca97b50ff108d6b3e5212f10bd3 (patch) | |
| tree | fb66182882ec8623deb83f67c381969f37f3d7dc /readme.md | |
| parent | 2a8e6026c95d74f4c97186ddb6c37d5269f681a0 (diff) | |
Update readme.md
Diffstat (limited to 'readme.md')
| -rw-r--r-- | readme.md | 14 |
1 files changed, 7 insertions, 7 deletions
@@ -15,6 +15,13 @@ </p> --- +## π **News** +- **[2026-01-26]** Our **[LinearRAG](https://github.com/DEEP-PolyU/LinearRAG)** is accepted by ICLRβ26. +- **[2025-10-27]** We release **[LinearRAG](https://github.com/DEEP-PolyU/LinearRAG)**, a relation-free graph construction method for efficient GraphRAG. +- **[2025-06-06]** We release **[GraphRAG-Bench](https://github.com/GraphRAG-Bench/GraphRAG-Benchmark.git)**, the benchmark for evaluating GraphRAG models. +- **[2025-01-21]** We release the **[GraphRAG survey](https://github.com/DEEP-PolyU/Awesome-GraphRAG)**. + +--- ## π **Highlights** - β
**Context-Preserving**: Relation-free graph construction, relying on lightweight entity recognition and semantic linking to achieve comprehensive contextual comprehension. @@ -26,13 +33,6 @@ </p> --- -## π **News** -- **[2026-01-26]** Our **[LinearRAG](https://github.com/DEEP-PolyU/LinearRAG)** is accepted by ICLRβ26. -- **[2025-10-27]** We release **[LinearRAG](https://github.com/DEEP-PolyU/LinearRAG)**, a relation-free graph construction method for efficient GraphRAG. -- **[2025-06-06]** We release **[GraphRAG-Bench](https://github.com/GraphRAG-Bench/GraphRAG-Benchmark.git)**, the benchmark for evaluating GraphRAG models. -- **[2025-01-21]** We release the **[GraphRAG survey](https://github.com/DEEP-PolyU/Awesome-GraphRAG)**. - ---- ## π οΈ **Usage** |