Entry NLP1: Corpus Cleaning with RegEx
Recently I’ve been working my way through one of the older versions of CSE 140 (now CSE 160) offered at the University of Washington. Homework 8 is a nice ex...
Recent Posts
Entry G22: Mean Distance Between Connected Nodes
The apoc.path.expandingTree algorithm in Entry G19 revealed a gold mine of information. Once I had that table of results I knew that not only could I grab th...
Entry G21: Diameter
Having encountered the limit of connections between node pairs in Entry G19, I couldn’t resist taking a closer look. I’ve been trying to calculate the diamet...
Entry G20: Shortest Path
In an unweighted graph, the fewest steps between any node (A) to another node (B) is called the shortest path.
Entry G19: Neighborhood Node Counts
Now that we’ve established how to define an egocentric neighborhood and differentiated our people nodes, it’s time to start calculating metrics for the diffe...