An overview on the 2-tuple linguistic model for computing with words in decision making: Extensions, applications and challenges
Many real world problems need to deal with uncertainty, therefore the management of such uncertainty is usually a big challenge. Hence, different proposals to tackle and manage the uncertainty have been developed. Probabilistic models are quite common, ...
Exploiting pairwise recommendation and clustering strategies for image re-ranking
In Content-based Image Retrieval (CBIR) systems, accurately ranking collection images is of great relevance. Users are interested in the returned images placed at the first positions, which usually are the most relevant ones. Commonly, image content ...
Ranking semantic relationships between two entities using personalization in context specification
Semantic relationship deals with complex relationship between two entities in a knowledge base. In the process of finding the relationship, multiple paths connecting entities could be explored. Each path has a different meaning depending on the type of ...
Biological invasion-inspired migration in distributed evolutionary algorithms
Migration strategy plays an important role in designing effective distributed evolutionary algorithms. In this work, a novel migration model inspired to the phenomenon known as biological invasion is devised. The migration strategy is implemented ...
Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system
Rough set is a useful tool to deal with partition related uncertainty, granularity, and incompleteness of knowledge. Although the classical rough set is constructed on the basis of an indiscernibility relation, it can also be generalized by using some ...
An Adaptive Scoring Job Scheduling algorithm for grid computing
When human culture advances, current problems in science and engineering become more complicated and need more computing power to tackle and analyze. A supercomputer is not the only choice for solving complex problems any more as a result of the speed-...
Development of two new mean codeword lengths
Two new mean codeword lengths L(@a,@b) and L(@b) are defined and it is shown that these lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently two new noiseless coding theorems subject to Kraft's inequality have been ...