Uma nova forma de calcular os centros dos Clusters em algoritmos de agrupamento tipo fuzzy c-means

Clustering data is a very important task in data mining, image processing and pattern recognition problems. One of the most popular clustering algorithms is the Fuzzy C-Means (FCM). This thesis proposes to implement a new way of calculating the cluster centers in the procedure of FCM algorithm which are called ckMeans, and in some variants of FCM, in particular, here we apply it for those variants that use other distances. The goal of this change is to reduce the number of iterations and processing time of these algorithms without affecting the quality of the partition, or even to improve the number of correct classifications in some cases. Also, we developed an algorithm based on ckMeans to manipulate interval data considering interval membership degrees. This algorithm allows the representation of data without converting interval data into punctual ones, as it happens to other extensions of FCM that deal with interval data. In order to validate the proposed methodologies it was made a comparison between a clustering for ckMeans, K-Means and FCM algorithms (since the algorithm proposed in this paper to calculate the centers is similar to the K-Means) considering three different distances. We used several known databases. In this case, the results of Interval ckMeans were compared with the results of other clustering algorithms when applied to an interval database with minimum and maximum temperature of the month for a given year, referring to 37 cities distributed across continents

Centros subcorticais dos sistemas visual primário e óptico acessório no mocó (kerodon rupestris): caracterização pela projeção retiniana e citoarquitetura.

The primary and accessory optic systems comprise two set of retinorecipient neural clusters. In this study, these visual related centers in the rock cavy were evaluated by using the retinal innervations pattern and Nissl staining cytoarchigtecture. After unilateral intraocular injection of cholera toxin B subunit and immunohistochemical reaction of coronal and sagittal sections from the diencephalon and midbrain region of rock cavy. Three subcortical centres of primary visual system were identified, superior colliculus, lateral geniculate complex and pretectal complex. The lateral geniculate complex is formed by a series of nuclei receiving direct visual information from the retina, dorsal lateral geniculate nucleus, intergeniculate leaflet and ventral lateral geniculate nucleus. The pretectal complex is formed by series of pretectal nuclei, medial pretectal nucleus, olivary pretectal nucleus, posterior pretectal nucleus, nucleus of the optic tract and anterior pretectal nucleus. In the accessory optic system, retinal terminals were observed in the dorsal terminal, lateral terminal and medial terminal nuclei as well as in the interstitial nucleus of the superior fasciculus, posterior fibres. All retinorecipient nuclei received bilateral input, with a contralateral predominance. This is the first study of this nature in the rock cavy and the results are compared with the data obtained for other species. The investigation represents a contribution to the knowledge regarding the organization of visual optic systems in relation to the biology of species.

Novos métodos determinísticos para gerar centros iniciais dos grupos no algoritmo fuzzy C-Means e variantes

Data clustering is applied to various fields such as data mining, image processing and pattern recognition technique. Clustering algorithms splits a data set into clusters such that elements within the same cluster have a high degree of similarity, while elements belonging to different clusters have a high degree of dissimilarity. The Fuzzy C-Means Algorithm (FCM) is a fuzzy clustering algorithm most used and discussed in the literature. The performance of the FCM is strongly affected by the selection of the initial centers of the clusters. Therefore, the choice of a good set of initial cluster centers is very important for the performance of the algorithm. However, in FCM, the choice of initial centers is made randomly, making it difficult to find a good set. This paper proposes three new methods to obtain initial cluster centers, deterministically, the FCM algorithm, and can also be used in variants of the FCM. In this work these initialization methods were applied in variant ckMeans.With the proposed methods, we intend to obtain a set of initial centers which are close to the real cluster centers. With these new approaches startup if you want to reduce the number of iterations to converge these algorithms and processing time without affecting the quality of the cluster or even improve the quality in some cases. Accordingly, cluster validation indices were used to measure the quality of the clusters obtained by the modified FCM and ckMeans algorithms with the proposed initialization methods when applied to various data sets