Search Results for author:
Found 4 papers, 2 papers with code
Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
Estimating node distances enables us to find a node's nearest neighbors, and perform label propagation on hypergraphs using a K-nearest neighbors (KNN) approach.
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs
Researchers have designed many algorithms to measure the distances between graph nodes, such as average hitting times of random walks, cosine distances from DeepWalk, personalized PageRank, etc.
Discrete Mathematics Combinatorics Probability
Suppression of Overfitting in Extraction of Spectral Data from Imaginary Frequency Green Function Using Maximum Entropy Method
Although maximum entropy method (maxEnt method) is currently the standard algorithm for extracting real frequency information from imaginary frequency Green function, still this method is beset with overfitting problem, which manifests itself as the spurious spikes in the resultant spectral functions.
Computational Physics
Variational Neural Networks: Every Layer and Neuron Can Be Unique
The lack of guiding principles for the selection of activation function is lamentable.
