Introduction: In unsupervised learning, data clustering is essential. However, many current algorithms have issues like early convergence, inadequate local search capabilities, and trouble processing ...
Abstract: The shuffled frog leaping algorithm is easily sunk into local optimum and not enough accurate when optimizing the problem of some higher dimensional functions. In view of these shortcomings, ...
We consider discounted Markov decision processes (MDPs) with countably-infinite state spaces, finite action spaces, and unbounded rewards. Typical examples of such MDPs are inventory management and ...
Abstract: This paper presents a new method of minimum volume class for hyperspectral unmixing, termed minimum volume simplex analysis (MVSA). The underlying mixing model is linear; i.e., the mixed ...
Your Artstor image groups were copied to Workspace. The Artstor website will be retired on Aug 1st. Science Progress (1933-) Vol. 103, No. 4, 2020 A new method for ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback