In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Our results show that using top-k distances as a similarity measure outperforms classical similarity measures such as Jaccard and Adamic/Adar.

This paper describes our approach to tackle the Author Verification task at PAN 2015. Our method builds a representation of an author’s style by using the information contained in dependency trees. This information is represented as syntactic n-grams and used to conform a vector space. Using unsupervised machine learning approach, each instance is associated to the correponding author using the...

Methods Pattern analysis of a chorological dataset, consisting of the occurrences of 3041 vascular plant species in each of the 50 km 9 50 km UTM cells of a grid covering Iberia and the Balearic Islands, was based on cluster analysis (unweighted pair-group method using arithmetic averages; UPGMA) and parsimony analysis of endemicity (PAE). The Jaccard similarity index was used in the UPGMA, and...

A graph in van Eck and Waltman [JASIST 60(8), 2009, p. 1644], representing the relation between the Association Strength and the Cosine, is partially explained as a sheaf of parabolas, each parabola being the functional relation between these similarity measures on the trajectories . X Y a  , a constant. Based on earlier obtained relations between Cosine and other similarity measures (such as ...

Automatic hashtag segmentation is used when analysing twitter data, to associate hashtag terms to those used in common language. The most common form of hashtag segmentation uses a dictionary with a probability distribution over the dictionary terms, constructed from sample texts specific to the given hashtag domain. The language used in Twitter is different to the common language found in publ...

After our first participation in the Bilingual task of WebCLEF 2005, we have emigrated to a more challenging task. In this report we are presenting the results obtained after evaluating a set of topics in the Mixed-Monolingual task of WebCLEF 2006. Our efforts were focused on the preprocessing of the EuroGOV corpus which is itself a very challenging task, due to the high variety of errors that ...

Abstract. In this paper, we propose three similarity measure methods for single valued neutrosophic refined sets and interval neutrosophic refined sets based on Jaccard, Dice and Cosine similarity measures of single valued neutrosophic sets and interval neutrosophic sets. Furthermore, we suggest two multi-criteria decision making method under single valued neutrosophic refined environment and i...

Clustering is one of the very powerful and widely used technique in information retrieval. All clustering methods works on finding relationship among data objects. There are various similarity measures used along with criterion functions to find similarity between documents like cosine, jaccard etc. Clustering efficiency and performance is highly dependent on the accuracy of the similarity meas...