CONVEX HULL BASED CLUSTERING ALGORITHM
times labeled training set. In this paper, we propose a dynamic convex hull based clustering algorithm dealing with data appearing sequentially. Considering that classification is the task of assigning a test object to one among two or several possible clusters, an intuitive way to proceed is to restrict clusters to be combinations of vertices of the convex hull
containing the data set. This hull gives rather an approximation to the cluster region. The classification process is achieved by evaluating the variation of the data density of that region. An additional merge mechanism is proposed to avoid local optima drawbacks and improve performances. The developed algorithm is assessed at first on some empirical data and then it is applied for the monitoring of a complex system to illustrate its efficiency in real time applications.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.thentic information.