Recovery mechanism on sensor networks

On the completion of project, we propose novel recovery mechanisms which recovers limited-resource wireless sensor networks quickly from an malicious attack. The research outcomes include re-clustering algorithms, reprogramming techniques and authentications protocols developed and tested on both hardware and simulation platforms. The work is also well compared with other researchers.

Comparison of 3S multi-thresolding with fuzzy c-means method

The 3S (Shrinking-Search-Space) multi-thresholding method which have been used for segmentation of medical images according to their intensities, now have been implemented and compared with FCM method in terms of segmentation quality and segmentation time as a benchmark in thresholding. The results show that 3S method produced almost the same segmentation quality or in some occasions better quality than FCM, and the computation time of 3S method is much lower than FCM. This is another superiority of this method with respect to others. Also, the performance of C-means has been compared with two other methods. This comparison shows that, C-means is not a reliable clustering algorithm and it needs several run to give us a reliable result.

A C-DBSCAN algorithm for determining bus-stop locations based on taxi GPS data

Determining suitable bus-stop locations is critical in improving the quality of bus services. Previous studies on selecting bus stop locations mainly consider environmental factors such as population density and traffic conditions, seldom of them consider the travel patterns of people, which is a key factor for determining bus-stop locations. In order to draw people’s travel patterns, this paper improves the density-based spatial clustering of applications with noise (DBSCAN) algorithm to find hot pick-up and drop-off locations based on taxi GPS data. The discovered density-based hot locations could be regarded as the candidate for bus-stop locations. This paper further utilizes the improved DBSCAN algorithm, namely as C-DBSCAN in this paper, to discover candidate bus-stop locations to Capital International Airport in Beijing based on taxi GPS data in November 2012. Finally, this paper discusses the effects of key parameters in C-DBSCAN algorithm on the clustering results. Keywords Bus-stop locations, Public transport service, Taxi GPS data, Centralize density-based spatial clustering of applications with noise.

Contribuições a técnicas de agrupamento e visualização de dados multivariados utilizando mapas auto-organizáveis

Self-organizing maps (SOM) are artificial neural networks widely used in the data mining field, mainly because they constitute a dimensionality reduction technique given the fixed grid of neurons associated with the network. In order to properly the partition and visualize the SOM network, the various methods available in the literature must be applied in a post-processing stage, that consists of inferring, through its neurons, relevant characteristics of the data set. In general, such processing applied to the network neurons, instead of the entire database, reduces the computational costs due to vector quantization. This work proposes a post-processing of the SOM neurons in the input and output spaces, combining visualization techniques with algorithms based on gravitational forces and the search for the shortest path with the greatest reward. Such methods take into account the connection strength between neighbouring neurons and characteristics of pattern density and distances among neurons, both associated with the position that the neurons occupy in the data space after training the network. Thus, the goal consists of defining more clearly the arrangement of the clusters present in the data. Experiments were carried out so as to evaluate the proposed methods using various artificially generated data sets, as well as real world data sets. The results obtained were compared with those from a number of well-known methods existent in the literature

Multidimensional cluster stability analysis from a Brazilian Bradyrhizobium sp RFLP/PCR data set

The taxonomy of the N(2)-fixing bacteria belonging to the genus Bradyrhizobium is still poorly refined, mainly due to conflicting results obtained by the analysis of the phenotypic and genotypic properties. This paper presents an application of a method aiming at the identification of possible new clusters within a Brazilian collection of 119 Bradryrhizobium strains showing phenotypic characteristics of B. japonicum and B. elkanii. The stability was studied as a function of the number of restriction enzymes used in the RFLP-PCR analysis of three ribosomal regions with three restriction enzymes per region. The method proposed here uses Clustering algorithms with distances calculated by average-linkage clustering. Introducing perturbations using sub-sampling techniques makes the stability analysis. The method showed efficacy in the grouping of the species B. japonicum and B. elkanii. Furthermore, two new clusters were clearly defined, indicating possible new species, and sub-clusters within each detected cluster. (C) 2008 Elsevier B.V. All rights reserved.

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

Comitês de grupamento aplicados a dados de expressão gênica

The main goal of this work is to investigate the suitability of applying cluster ensemble techniques (ensembles or committees) to gene expression data. More specifically, we will develop experiments with three diferent cluster ensembles methods, which have been used in many works in literature: coassociation matrix, relabeling and voting, and ensembles based on graph partitioning. The inputs for these methods will be the partitions generated by three clustering algorithms, representing diferent paradigms: kmeans, ExpectationMaximization (EM), and hierarchical method with average linkage. These algorithms have been widely applied to gene expression data. In general, the results obtained with our experiments indicate that the cluster ensemble methods present a better performance when compared to the individual techniques. This happens mainly for the heterogeneous ensembles, that is, ensembles built with base partitions generated with diferent clustering algorithms

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

Geoprocessamento aplicado na identificação de padrões espaciais do perfil de nascimento na região do Vale do Paraíba

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Framework para prospecção de dados espaciais baseado em semântica apoiado por ontologias

Pós-graduação em Ciência da Computação - IBILCE

Estudo da diversidade genética do MycobacteriUm leprae em pacientes com hanseníase no município de Rondonópolis (MT): uma contribuição para o melhor entendimento da sua transmissão

Pós-graduação em Doenças Tropicais - FMB

A Comparative Evaluation of Three Skin Color Detection Approaches

Skin segmentation is a challenging task due to several influences such as unknown lighting conditions, skin colored background, and camera limitations. A lot of skin segmentation approaches were proposed in the past including adaptive (in the sense of updating the skin color online) and non-adaptive approaches. In this paper, we compare three skin segmentation approaches that are promising to work well for hand tracking, which is our main motivation for this work. Hand tracking can widely be used in VR/AR e.g. navigation and object manipulation. The first skin segmentation approach is a well-known non-adaptive approach. It is based on a simple, pre-computed skin color distribution. Methods two and three adaptively estimate the skin color in each frame utilizing clustering algorithms. The second approach uses a hierarchical clustering for a simultaneous image and color space segmentation, while the third approach is a pure color space clustering, but with a more sophisticated clustering approach. For evaluation, we compared the segmentation results of the approaches against a ground truth dataset. To obtain the ground truth dataset, we labeled about 500 images captured under various conditions.

A Fuzzy Grassroots Ontology for improving Weblog Extraction

This paper presents fuzzy clustering algorithms to establish a grassroots ontology – a machine-generated weak ontology – based on folksonomies. Furthermore, it describes a search engine for vaguely associated terms and aggregates them into several meaningful cluster categories, based on the introduced weak grassroots ontology. A potential application of this ontology, weblog extraction, is illustrated using a simple example. Added value and possible future studies are discussed in the conclusion.

Weblog extraction with fuzzy classification methods

This paper uses folksonomies and fuzzy clustering algorithms to establish term-relevant related results. This paper will propose a Meta search engine with the ability to search for vaguely associated terms and aggregate them into several meaningful cluster categories. The potential of the fuzzy weblog extraction is illustrated using a simple example and added value and possible future studies are discussed in the conclusion.

Serosurveillance of Schmallenberg virus in Switzerland using bulk tank milk samples.

Infections with Schmallenberg virus (SBV), a novel Orthobunyavirus transmitted by biting midges, can cause abortions and malformations of newborns and severe symptoms in adults of domestic and wild ruminants. Understanding the temporal and spatial distribution of the virus in a certain territory is important for the control and prevention of the disease. In this study, seroprevalence of antibodies against SBV and the spatial spread of the virus was investigated in Swiss dairy cattle applying a milk serology technique on bulk milk samples. The seroprevalence in cattle herds was significantly higher in December 2012 (99.5%) compared to July 2012 (19.7%). This high between-herd seroprevalence in cattle herds was observed shortly after the first detection of viral infections. Milk samples originating from farms with seropositive animals taken in December 2012 (n=209; mean 160%) revealed significantly higher S/P% ratios than samples collected in July 2012 (n=48; mean 103.6%). This finding suggests a high within-herd seroprevalence in infected herds which makes testing of bulk tank milk samples for the identification farms with past exposures to SBV a sensitive method. It suggests also that within-herd transmission followed by seroconversion still occurred between July and December. In July 2012, positive bulk tank milk samples were mainly restricted to the western part of Switzerland whereas in December 2012, all samples except one were positive. A spatial analysis revealed a separation of regions with and without positive farms in July 2012 and no spatial clustering within the regions with positive farms. In contrast to the spatial dispersion of bluetongue virus, a virus that is also transmitted by Culicoides midges, in 2008 in Switzerland, the spread of SBV occurred from the western to the eastern part of the country. The dispersed incursion of SBV took place in the western part of Switzerland and the virus spread rapidly to the remaining territory. This spatial pattern is consistent with the hypothesis that transmission by Culicoides midges was the main way of spreading.