Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems

2015 ◽  
pp. 79-96 ◽  
Author(s):  
Nasrin Mohabbati-Kalejahi ◽  
Hossein Akbaripour ◽  
Ellips Masehian
Keyword(s):  
Competitive Algorithms

An Image Segmentation Method Based on Two-Dimensional Entropy and Chaotic Lightning Attachment Procedure Optimization Algorithm

2020 ◽  
Vol 34 (11) ◽  
pp. 2054030 ◽  
Author(s):  
Wei Liu ◽  
Shuai Yang ◽  
Zhiwei Ye ◽  
Qian Huang ◽  
Yongkun Huang
Keyword(s):  
Image Segmentation ◽  
Maximum Entropy ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Computational Time ◽  
Two Dimensional ◽  
Threshold Segmentation ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization ◽  
Competitive Algorithms

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently.

A Clustering Algorithm in Stream Data Using Strong Coreset

2021 ◽  
Author(s):  
Manmohan Singh ◽  
Rajendra Pamula ◽  
Alok Kumar
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Local Optimum ◽  
Reduction Algorithm ◽  
Stream Data ◽  
Stream Data Mining ◽  
Clustering Approach ◽  
Approximation Guarantee ◽  
Competitive Algorithms ◽  
Learning Data

There are various applications of clustering in the fields of machine learning, data mining, data compression along with pattern recognition. The existent techniques like the Llyods algorithm (sometimes called k-means) were affected by the issue of the algorithm which converges to a local optimum along with no approximation guarantee. For overcoming these shortcomings, an efficient k-means clustering approach is offered by this paper for stream data mining. Coreset is a popular and fundamental concept for k-means clustering in stream data. In each step, reduction determines a coreset of inputs, and represents the error, where P represents number of input points according to nested property of coreset. Hence, a bit reduction in error of final coreset gets n times more accurate. Therefore, this motivated the author to propose a new coreset-reduction algorithm. The proposed algorithm executed on the Covertype dataset, Spambase dataset, Census 1990 dataset, Bigcross dataset, and Tower dataset. Our algorithm outperforms with competitive algorithms like Streamkm[Formula: see text], BICO (BIRCH meets Coresets for k-means clustering), and BIRCH (Balance Iterative Reducing and Clustering using Hierarchies.

Randomized competitive algorithms for the list update problem

Algorithmica ◽  
1994 ◽  
Vol 11 (1) ◽  
pp. 15-32 ◽  
Author(s):  
Nick Reingold ◽  
Jeffery Westbrook ◽  
Daniel D. Sleator
Keyword(s):  
List Update ◽  
Competitive Algorithms

Competitive Algorithms for Due Date Scheduling

2007 ◽  
pp. 28-39 ◽  
Author(s):  
Nikhil Bansal ◽  
Ho-Leung Chan ◽  
Kirk Pruhs
Keyword(s):  
Due Date ◽  
Competitive Algorithms

scholarly journals An Algorithm for Anaphora Resolution in Spanish Texts

2001 ◽  
Vol 27 (4) ◽  
pp. 545-567 ◽  
Author(s):  
Manuel Palomar ◽  
Antonio Ferrández ◽  
Lidia Moreno ◽  
Patricio Martínez-Barco ◽  
Jesús Peral ◽  
...  
Keyword(s):  
Noun Phrase ◽  
Anaphora Resolution ◽  
New Approach ◽  
Partial Parsing ◽  
Test Corpus ◽  
Reflexive Pronouns ◽  
Different Types ◽  
Demonstrative Pronouns ◽  
Third Person ◽  
Competitive Algorithms

This paper presents an algorithm for identifying noun phrase antecedents of third person personal pronouns, demonstrative pronouns, reflexive pronouns, and omitted pronouns (zero pronouns) in unrestricted Spanish texts. We define a list of constraints and preferences for different types of pronominal expressions, and we document in detail the importance of each kind of knowledge (lexical, morphological, syntactic, and statistical) in anaphora resolution for Spanish. The paper also provides a definition for syntactic conditions on Spanish NP-pronoun noncoreference using partial parsing. The algorithm has been evaluated on a corpus of 1,677 pronouns and achieved a success rate of 76.8%. We have also implemented four competitive algorithms and tested their performance in a blind evaluation on the same test corpus. This new approach could easily be extended to other languages such as English, Portuguese, Italian, or Japanese.

Sign in / Sign up

Export Citation Format

Share Document