2002
DOI: 10.1016/s0306-4573(01)00051-6
|View full text |Cite
|
Sign up to set email alerts
|

Strong similarity measures for ordered sets of documents in information retrieval

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
29
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 32 publications
(31 citation statements)
references
References 3 publications
2
29
0
Order By: Relevance
“…8 shows the relation between different measures in capturing the spatio-temporal co-occurrence patterns. An interesting ordering relation on the selectivity of the boolean versions of Overlap, Cosine, Dice, and Jaccard coefficients was shown in [6]. We experimentally confirm it for the real positive numbers that reflect volumes (please see Fig.…”
Section: Impact Of Measuressupporting
confidence: 67%
“…8 shows the relation between different measures in capturing the spatio-temporal co-occurrence patterns. An interesting ordering relation on the selectivity of the boolean versions of Overlap, Cosine, Dice, and Jaccard coefficients was shown in [6]. We experimentally confirm it for the real positive numbers that reflect volumes (please see Fig.…”
Section: Impact Of Measuressupporting
confidence: 67%
“…In Egghe and Michel (2002), it is explained how to interpret the aforementioned definitions in terms of similarity measures between two vectors…”
Section: Introductionmentioning
confidence: 99%
“…Again we use k = 4 as input parameter of the clustering algorithm. Three more parameters that have to be set appear in expression (7). The first one is the inertia weight w that starts with value 1.5 and decreases along with the iterations.…”
Section: Pso Approach Resultsmentioning
confidence: 99%
“…The vector representation of documents facilitates the comparison of these by using metrics on the vector space in which they have been represented. Although various metrics are allowed [7], one of those most used in text mining is the cosine similarity or angular separation that determines the similarity amongst documents as the cosine of the angle that forms their respective vectors in the representation space. This metric is easy to calculate and various experimental studies have shown that it obtains better results in text mining than other classic metrics such as the Euclidean distance [8].…”
Section: Feature Selection and Vector Representationmentioning
confidence: 99%