8 Result(s)
within
Conference Paper
Yongguo Liu
-
Chapter and Conference Paper
A Weakly Supervised Deep Learning Model for Alzheimer’s Disease Prognosis Using MRI and Incomplete Labels
Predicting cognitive scores using magnetic resonance imaging (MRI) can aid in the early recognition of Alzheimer’s disease (AD) and provide insights into future disease progression. Existing methods typically ...
-
Chapter and Conference Paper
Multilayer Perceptron Networks Training Using Particle Swarm Optimization with Minimum Velocity Constraints
Multilayer perceptron networks have been successfully trai- ned by error backpropagation algorithm. We show that Particle Swarm Optimization(PSO) with minimum velocity constraints can efficiently be applied to...
-
Chapter and Conference Paper
An Improved Hybrid Genetic Clustering Algorithm
In this paper, a new genetic clustering algorithm called IHGA-clustering is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. In IHGA-clustering, DHB operat...
-
Chapter and Conference Paper
A Novel Clustering Technique Based on Improved Noising Method
In this article, the clustering problem under the criterion of minimum sum of squares clustering is considered. It is known that this problem is a nonconvex program which possesses many locally optimal values,...
-
Chapter and Conference Paper
A Tabu Clustering Method with DHB Operation and Mergence and Partition Operation
A new tabu clustering method called ITCA is developed for the minimum sum of squares clustering problem, where DHB operation and mergence and partition operation are introduced to fine-tune the current solutio...
-
Chapter and Conference Paper
A Hybrid Tabu Search Based Clustering Algorithm
The clustering problem under the criterion of minimum sum of squares clustering is a nonconvex program which possesses many locally optimal values, resulting that its solution often falls into these traps. In ...
-
Chapter and Conference Paper
Clustering with Noising Method
The minimum sum of squares clustering problem is a nonconvex program which possesses many locally optimal values, resulting that its solution often falls into these traps. In this article, a recent metaheurist...
-
Chapter and Conference Paper
A Tabu Search Based Method for Minimum Sum of Squares Clustering
In this article, the metaheuristic algorithm, tabu search, is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. The presented method integrates four moving ...
