Metaheuristic search algorithms in solving the \(n\)-similarity problem (Q4595591)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Metaheuristic search algorithms in solving the n-similarity problem |
scientific article; zbMATH DE number 6815543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Metaheuristic search algorithms in solving the \(n\)-similarity problem |
scientific article; zbMATH DE number 6815543 |
Statements
Metaheuristic Search Algorithms in Solving the n-Similarity Problem (English)
0 references
5 December 2017
0 references
\(n\)-similarity
0 references
text document similarity
0 references
particle swarm optimization
0 references
gravitational search algorithm
0 references
imperialist competition algorithm
0 references
fuzzy imperialist competition algorithm
0 references
0.6733158230781555
0 references
0.6667627692222595
0 references
0.6593656539916992
0 references
0.6580860614776611
0 references
