Improved Landweber Algorithm Based on Correlation
نویسندگان
چکیده
منابع مشابه
Improved Feature Selection Algorithm Based on SVM and Correlation
As a feature selection method, support vector machinesrecursive feature elimination (SVM-RFE) can remove irrelevance features but don’t take redundant features into consideration. In this paper, it is shown why this method can’t remove redundant features and an improved technique is presented. Correlation coefficient is introduced to measure the redundancy in the selected subset with SVM-RFE. T...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملA shearlet-based fast thresholded Landweber algorithm for deconvolution
Image deconvolution is an important problem which has seen plenty of progress in the last decades. Due to its ill-posedness, a common approach is to formulate the reconstruction as an optimisation problem, regularised by an additional sparsityenforcing term. This term is often modeled as an l1 norm measured in the domain of a suitable signal transform. The resulting optimisation problem can be ...
متن کاملEfficient Strategy based on Improved Biogeography-based Algorithm for Inventory Routing problem
Researchers and urban administrators have often considered the routing problem as one of the fundamental phases in developing hazard management systems. In this research, a routing problem is investigated and analyzed by proposing an enhanced metaheuristic algorithm based on biogeography. In this problem, the production planning, inventory management, and distribution planning have been conside...
متن کاملAn Improved Algorithm for Bipartite Correlation Clustering
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained in any way. The best known approximation algorithm for this problem gives a factor of 11. This result and all previous ones involve solving large linear or s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Physics
سال: 2017
ISSN: 2153-1196,2153-120X
DOI: 10.4236/jmp.2017.89093