Measuring the similarity between documents is an essential operation in text mining, especially document clustering. The traditional method of finding the similarity between documents has always been based on extracting individual words from the documents, and using heuristics to give weights to those features. Standard methods in data mining are then used to find the similarity between documen...

This article continues study of the prequential framework for evaluating a probability forecaster. Testing the hypothesis that the sequence of forecasts issued by the forecaster is in agreement with the observed outcomes can be done using prequential notions of probability. It turns out that there are two natural notions of probability in the prequential framework: game-theoretic, whose idea go...

In this paper, the problem of measuring the degree of inclusion and similarity measure for two   interval-valued intuitionistic  fuzzy sets is considered. We propose inclusion and similarity measure by using  order on interval-valued intuitionistic fuzzy sets connected with lexicographical order. Moreover, some properties of inclusion and similarity measure and some correlation, between them an...

In this paper several similarity measures of fuzzy soft sets are introduced. The measures are examined based on the geometric model, the set-theoretic approach and the matching function. A comparative study of these measures is done.

0

A totally semantic measure is presented which is able to calculate a similarity value between concept descriptions and also between concept description and individual or between individuals expressed in an expressive description logic. It is applicable on symbolic descriptions although it uses a numeric approach for the calculus. Considering that Description Logics stand as the theoretic framew...

‎let $x=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the hankel matrix of size $2times n$ and let $g$ be a closed graph on the vertex set $[n].$ we study the binomial ideal $i_gsubset k[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $x$ which correspond to the edges of $g.$ we show that...