In this paper, the authors contain a partitional based algorithm for clustering high-dimensional objects in subspaces for iris gene dataset. In high dimensional data, clusters of objects often exist ...
This is a preview. Log in through your library . Abstract We apply a potential reduction algorithm to solve the general linear complementarity problem (GLCP) minimize ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback