CoSimRank: A Flexible & Efficient Graph-Theoretic Similarity Measure
نویسندگان
چکیده
We present CoSimRank, a graph-theoretic similarity measure that is efficient because it can compute a single node similarity without having to compute the similarities of the entire graph. We present equivalent formalizations that show CoSimRank’s close relationship to Personalized PageRank and SimRank and also show how we can take advantage of fast matrix multiplication algorithms to compute CoSimRank. Another advantage of CoSimRank is that it can be flexibly extended from basic node-node similarity to several other graph-theoretic similarity measures. In an experimental evaluation on the tasks of synonym extraction and bilingual lexicon extraction, CoSimRank is faster or more accurate than previous approaches.
منابع مشابه
Supervised and unsupervised methods for learning representations of linguistic units
Word representations, also called word embeddings, are generic representations, often high-dimensional vectors. They map the discrete space of words into a continuous vector space, which allows us to handle rare or even unseen events, e.g. by considering the nearest neighbors. Many Natural Language Processing tasks can be improved by word representations if we extend the task specific training ...
متن کاملSOME SIMILARITY MEASURES FOR PICTURE FUZZY SETS AND THEIR APPLICATIONS
In this work, we shall present some novel process to measure the similarity between picture fuzzy sets. Firstly, we adopt the concept of intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets and picture fuzzy sets. Secondly, we develop some similarity measures between picture fuzzy sets, such as, cosine similarity measure, weighted cosine similarity measure, set-theoretic similar...
متن کاملVertex Reordering Algorithms for Cluster Identification
In this paper we present two graph-theoretic algorithms for cluster identification and demonstrate the effectiveness of their combined use. Building on the results of our previous study using sparse matrix reordering schemes to generate clusters, we modify the most promising algorithms to take advantage of similarity scores to produce orderings that nearly recover known clusters. Both algorithm...
متن کاملAnalysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملA Game-theoretic Approach for Enumerating Dominant Sets
Recently, a novel graph-theoretic notion of a cluster has been proposed, i.e., the “dominant set”, which captures the two basic requirements of a cluster, namely internal coherency and external incoherency. In this paper, we tackle the problem of finding several dominant sets using the replicator dynamics. Specifically, we adopt a game-theoretic perspective to this iterative extraction: Game dy...
متن کامل