CODA
Define novel local patterns on directed hypergraphs (directed hypergraphlets). Design efficient algorithms CODA-E(xact), CODA-A(dvanced). Applications: clustering, classification, temporal analysis.
| KAIST | 2023 |
CODA is the algorithm for counting directed hypergraphlets on directed hypergraphs.
- Define novel local patterns on directed hypergraphs (directed hypergraphlets)
- Design efficient algorithms: CODA-E(xact), CODA-A(dvanced)
- Applications: clustering, classification, and temporal analysis