dntls Goto Github PK

sparkinternals

Notes talking about the design and implementation of Apache Spark

texthin

A text-to-network representation and semantic parsing toolkit.

towards-combinational-relation-linking-over-knowledge-graphs

train-ticket

Train Ticket - A Benchmark Microservice System

treewand

Our implementation of the paper "Efficient top-k SimRank-based similarity join"

typora-cobalt-theme

A dark theme for Typora with enhanced UI

uniwalk

We design a Monte Carlo based method, UniWalk, to enable the fast top-k SimRank computation over large undirected graphs. UniWalk directly locates the top-k similar vertices for any single source vertex u via approximately R sampling paths originating from u only. Related work has been published in ICDE 2017 ("UniWalk: Unidirectional Random Walk Based Scalable SimRank Computation over Large Graph"). Furthermore, in order to overcome the "rectification issue" in the original UniWalk, we design a path enumeration strategy to gain higher precision, which computes SimRank with the path probabilities instead of path frequencies in sampling. We call it the optimized UniWalk here, which is shown in the "UniWalk/src/simrank/SingleRandomDev.java" file(the basic UniWalk is shown in "UniWalk/src/simrank/SingleRandomWalk.java").

youaremyalways

An APP for family pictures sharing in the form of games.