graphinius
graphinius copied to clipboard
Generic graph (analysis) library in Typescript
- [ ] use the built-in node similarity library ;-) - [ ] implement NN-Descent (Dong et al, 2011) - [ ] various test cases
- [ ] node-partitioning - [ ] merge each partition into a *supernode* - [ ] drop internal edges - [ ] re-route cross edges to corresponding supernodes - [...
- [ ] implement simple graph embeddings via deep walk / random walks - [ ] construct similarity (k-NN) graphs - [ ] use similarity graph for - [ ]...
- [ ] newest version uses compacted json graph files ('e' instead of 'edges' etc.) - update graphext & GraphiniusVis sites! - [ ] module import only delivers .js files...
Use something along the line of the `ingredient de-duplicating pipeline` demonstrated in a neo4j tutorial using the BBC goodfood ingredients ### Pipeline - [ ] download the goodfood dataset (scraping...
- it seems that if the data set isn't large & expandK runs back and forth between already visited nodes, our results differ from neo4j's - [x] formulate more test...
- [ ] formats / libraries / ...
- [ ] similarity of SetsOfSets - [ ] go through Julia similarity library and extract which other types of similarities we could need - [ ] implement weighted set...
there are different data structures for different use cases, which is legit, BUT * we need something like a standardized compute pipeline * starting with ID(s) or single Nodes -...