WorldWideScience

Sample records for hierarchical clustering techniques

  1. Technique for fast and efficient hierarchical clustering

    Science.gov (United States)

    Stork, Christopher

    2013-10-08

    A fast and efficient technique for hierarchical clustering of samples in a dataset includes compressing the dataset to reduce a number of variables within each of the samples of the dataset. A nearest neighbor matrix is generated to identify nearest neighbor pairs between the samples based on differences between the variables of the samples. The samples are arranged into a hierarchy that groups the samples based on the nearest neighbor matrix. The hierarchy is rendered to a display to graphically illustrate similarities or differences between the samples.

  2. Hierarchical clustering techniques for image database organization and summarization

    Science.gov (United States)

    Vellaikal, Asha; Kuo, C.-C. Jay

    1998-10-01

    This paper investigates clustering techniques as a method of organizing image databases to support popular visual management functions such as searching, browsing and navigation. Different types of hierarchical agglomerative clustering techniques are studied as a method of organizing features space as well as summarizing image groups by the selection of a few appropriate representatives. Retrieval performance using both single and multiple level hierarchies are experimented with and the algorithms show an interesting relationship between the top k correct retrievals and the number of comparisons required. Some arguments are given to support the use of such cluster-based techniques for managing distributed image databases.

  3. Neutrosophic Hierarchical Clustering Algoritms

    Directory of Open Access Journals (Sweden)

    Rıdvan Şahin

    2014-03-01

    Full Text Available Interval neutrosophic set (INS is a generalization of interval valued intuitionistic fuzzy set (IVIFS, whose the membership and non-membership values of elements consist of fuzzy range, while single valued neutrosophic set (SVNS is regarded as extension of intuitionistic fuzzy set (IFS. In this paper, we extend the hierarchical clustering techniques proposed for IFSs and IVIFSs to SVNSs and INSs respectively. Based on the traditional hierarchical clustering procedure, the single valued neutrosophic aggregation operator, and the basic distance measures between SVNSs, we define a single valued neutrosophic hierarchical clustering algorithm for clustering SVNSs. Then we extend the algorithm to classify an interval neutrosophic data. Finally, we present some numerical examples in order to show the effectiveness and availability of the developed clustering algorithms.

  4. Content Based Image Retrieval using Hierarchical and K-Means Clustering Techniques

    Directory of Open Access Journals (Sweden)

    V.S.V.S. Murthy

    2010-03-01

    Full Text Available In this paper we present an image retrieval system that takes an image as the input query and retrieves images based on image content. Content Based Image Retrieval is an approach for retrieving semantically-relevant images from an image database based on automatically-derived image features. The unique aspect of the system is the utilization of hierarchical and k-means clustering techniques. The proposed procedure consists of two stages. First, here we are going to filter most of the images in the hierarchical clustering and then apply the clustered images to KMeans, so that we can get better favored image results.

  5. Quality Assured Optimal Resource Provisioning and Scheduling Technique Based on Improved Hierarchical Agglomerative Clustering Algorithm (IHAC

    Directory of Open Access Journals (Sweden)

    A. Meenakshi

    2016-08-01

    Full Text Available Resource allocation is the task of convenient resources to different uses. In the context of an resources, entire economy, can be assigned by different means, such as markets or central planning. Cloud computing has become a new age technology that has got huge potentials in enterprises and markets. Clouds can make it possible to access applications and associated data from anywhere. The fundamental motive of the resource allocation is to allot the available resource in the most effective manner. In the initial phase, a representative resource usage distribution for a group of nodes with identical resource usage patterns is evaluated as resource bundle which can be easily employed to locate a group of nodes fulfilling a standard criterion. In the document, an innovative clustering-based resource aggregation viz. the Improved Hierarchal Agglomerative Clustering Algorithm (IHAC is elegantly launched to realize the compact illustration of a set of identically behaving nodes for scalability. In the subsequent phase concerned with energetic resource allocation procedure, the hybrid optimization technique is brilliantly brought in. The novel technique is devised for scheduling functions to cloud resources which duly consider both financial and evaluation expenses. The efficiency of the novel Resource allocation system is assessed by means of several parameters such the reliability, reusability and certain other metrics. The optimal path choice is the consequence of the hybrid optimization approach. The new-fangled technique allocates the available resource based on the optimal path.

  6. Hierarchical clustering for graph visualization

    CERN Document Server

    Clémençon, Stéphan; Rossi, Fabrice; Tran, Viet Chi

    2012-01-01

    This paper describes a graph visualization methodology based on hierarchical maximal modularity clustering, with interactive and significant coarsening and refining possibilities. An application of this method to HIV epidemic analysis in Cuba is outlined.

  7. Hierarchical Formation of Galactic Clusters

    CERN Document Server

    Elmegreen, B G

    2006-01-01

    Young stellar groupings and clusters have hierarchical patterns ranging from flocculent spiral arms and star complexes on the largest scale to OB associations, OB subgroups, small loose groups, clusters and cluster subclumps on the smallest scales. There is no obvious transition in morphology at the cluster boundary, suggesting that clusters are only the inner parts of the hierarchy where stars have had enough time to mix. The power-law cluster mass function follows from this hierarchical structure: n(M_cl) M_cl^-b for b~2. This value of b is independently required by the observation that the summed IMFs from many clusters in a galaxy equals approximately the IMF of each cluster.

  8. Classification of cancer cell lines using an automated two-dimensional liquid mapping method with hierarchical clustering techniques.

    Science.gov (United States)

    Wang, Yanfei; Wu, Rong; Cho, Kathleen R; Shedden, Kerby A; Barder, Timothy J; Lubman, David M

    2006-01-01

    A two-dimensional liquid mapping method was used to map the protein expression of eight ovarian serous carcinoma cell lines and three immortalized ovarian surface epithelial cell lines. Maps were produced using pI as the separation parameter in the first dimension and hydrophobicity based upon reversed-phase HPLC separation in the second dimension. The method can be reproducibly used to produce protein expression maps over a pH range from 4.0 to 8.5. A dynamic programming method was used to correct for minor shifts in peaks during the HPLC gradient between sample runs. The resulting corrected maps can then be compared using hierarchical clustering to produce dendrograms indicating the relationship between different cell lines. It was found that several of the ovarian surface epithelial cell lines clustered together, whereas specific groups of serous carcinoma cell lines clustered with each other. Although there is limited information on the current biology of these cell lines, it was shown that the protein expression of certain cell lines is closely related to each other. Other cell lines, including one ovarian clear cell carcinoma cell line, two endometrioid carcinoma cell lines, and three breast epithelial cell lines, were also mapped for comparison to show that their protein profiles cluster differently than the serous samples and to study how they cluster relative to each other. In addition, comparisons can be made between proteins differentially expressed between cell lines that may serve as markers of ovarian serous carcinomas. The automation of the method allows reproducible comparison of many samples, and the use of differential analysis limits the number of proteins that might require further analysis by mass spectrometry techniques.

  9. Intuitionistic fuzzy hierarchical clustering algorithms

    Institute of Scientific and Technical Information of China (English)

    Xu Zeshui

    2009-01-01

    Intuitionistic fuzzy set (IFS) is a set of 2-tuple arguments, each of which is characterized by a mem-bership degree and a nonmembership degree. The generalized form of IFS is interval-valued intuitionistic fuzzy set (IVIFS), whose components are intervals rather than exact numbers. IFSs and IVIFSs have been found to be very useful to describe vagueness and uncertainty. However, it seems that little attention has been focused on the clus-tering analysis of IFSs and IVIFSs. An intuitionistic fuzzy hierarchical algorithm is introduced for clustering IFSs, which is based on the traditional hierarchical clustering procedure, the intuitionistic fuzzy aggregation operator, and the basic distance measures between IFSs: the Hamming distance, normalized Hamming, weighted Hamming, the Euclidean distance, the normalized Euclidean distance, and the weighted Euclidean distance. Subsequently, the algorithm is extended for clustering IVIFSs. Finally the algorithm and its extended form are applied to the classifications of building materials and enterprises respectively.

  10. Hierarchical Clustering and Active Galaxies

    CERN Document Server

    Hatziminaoglou, E; Manrique, A

    2000-01-01

    The growth of Super Massive Black Holes and the parallel development of activity in galactic nuclei are implemented in an analytic code of hierarchical clustering. The evolution of the luminosity function of quasars and AGN will be computed with special attention paid to the connection between quasars and Seyfert galaxies. One of the major interests of the model is the parallel study of quasar formation and evolution and the History of Star Formation.

  11. Galaxy formation through hierarchical clustering

    Science.gov (United States)

    White, Simon D. M.; Frenk, Carlos S.

    1991-01-01

    Analytic methods for studying the formation of galaxies by gas condensation within massive dark halos are presented. The present scheme applies to cosmogonies where structure grows through hierarchical clustering of a mixture of gas and dissipationless dark matter. The simplest models consistent with the current understanding of N-body work on dissipationless clustering, and that of numerical and analytic work on gas evolution and cooling are adopted. Standard models for the evolution of the stellar population are also employed, and new models for the way star formation heats and enriches the surrounding gas are constructed. Detailed results are presented for a cold dark matter universe with Omega = 1 and H(0) = 50 km/s/Mpc, but the present methods are applicable to other models. The present luminosity functions contain significantly more faint galaxies than are observed.

  12. Determination of genetic structure of germplasm collections: are traditional hierarchical clustering methods appropriate for molecular marker data?

    NARCIS (Netherlands)

    Odong, T.L.; Heerwaarden, van J.; Jansen, J.; Hintum, van T.J.L.; Eeuwijk, van F.A.

    2011-01-01

    Despite the availability of newer approaches, traditional hierarchical clustering remains very popular in genetic diversity studies in plants. However, little is known about its suitability for molecular marker data. We studied the performance of traditional hierarchical clustering techniques using

  13. Assembling hierarchical cluster solids with atomic precision.

    Science.gov (United States)

    Turkiewicz, Ari; Paley, Daniel W; Besara, Tiglet; Elbaz, Giselle; Pinkard, Andrew; Siegrist, Theo; Roy, Xavier

    2014-11-12

    Hierarchical solids created from the binary assembly of cobalt chalcogenide and iron oxide molecular clusters are reported. Six different molecular clusters based on the octahedral Co6E8 (E = Se or Te) and the expanded cubane Fe8O4 units are used as superatomic building blocks to construct these crystals. The formation of the solid is driven by the transfer of charge between complementary electron-donating and electron-accepting clusters in solution that crystallize as binary ionic compounds. The hierarchical structures are investigated by single-crystal X-ray diffraction, providing atomic and superatomic resolution. We report two different superstructures: a superatomic relative of the CsCl lattice type and an unusual packing arrangement based on the double-hexagonal close-packed lattice. Within these superstructures, we demonstrate various compositions and orientations of the clusters.

  14. Hesitant fuzzy agglomerative hierarchical clustering algorithms

    Science.gov (United States)

    Zhang, Xiaolu; Xu, Zeshui

    2015-02-01

    Recently, hesitant fuzzy sets (HFSs) have been studied by many researchers as a powerful tool to describe and deal with uncertain data, but relatively, very few studies focus on the clustering analysis of HFSs. In this paper, we propose a novel hesitant fuzzy agglomerative hierarchical clustering algorithm for HFSs. The algorithm considers each of the given HFSs as a unique cluster in the first stage, and then compares each pair of the HFSs by utilising the weighted Hamming distance or the weighted Euclidean distance. The two clusters with smaller distance are jointed. The procedure is then repeated time and again until the desirable number of clusters is achieved. Moreover, we extend the algorithm to cluster the interval-valued hesitant fuzzy sets, and finally illustrate the effectiveness of our clustering algorithms by experimental results.

  15. A New Metrics for Hierarchical Clustering

    Institute of Scientific and Technical Information of China (English)

    YANGGuangwen; SHIShuming; WANGDingxing

    2003-01-01

    Hierarchical clustering is a popular method of performing unsupervised learning. Some metric must be used to determine the similarity between pairs of clusters in hierarchical clustering. Traditional similarity metrics either can deal with simple shapes (i.e. spherical shapes) only or are very sensitive to outliers (the chaining effect). The main contribution of this paper is to propose some potential-based similarity metrics (APES and AMAPES) between clusters in hierarchical clustering, inspired by the concepts of the electric potential and the gravitational potential in electromagnetics and astronomy. The main features of these metrics are: the first, they have strong antijamming capability; the second, they are capable of finding clusters of different shapes such as spherical, spiral, chain, circle, sigmoid, U shape or other complex irregular shapes; the third, existing algorithms and research fruits for classical metrics can be adopted to deal with these new potential-based metrics with no or little modification. Experiments showed that the new metrics are more superior to traditional ones. Different potential functions are compared, and the sensitivity to parameters is also analyzed in this paper.

  16. Managing Clustered Data Using Hierarchical Linear Modeling

    Science.gov (United States)

    Warne, Russell T.; Li, Yan; McKyer, E. Lisako J.; Condie, Rachel; Diep, Cassandra S.; Murano, Peter S.

    2012-01-01

    Researchers in nutrition research often use cluster or multistage sampling to gather participants for their studies. These sampling methods often produce violations of the assumption of data independence that most traditional statistics share. Hierarchical linear modeling is a statistical method that can overcome violations of the independence…

  17. Managing Clustered Data Using Hierarchical Linear Modeling

    Science.gov (United States)

    Warne, Russell T.; Li, Yan; McKyer, E. Lisako J.; Condie, Rachel; Diep, Cassandra S.; Murano, Peter S.

    2012-01-01

    Researchers in nutrition research often use cluster or multistage sampling to gather participants for their studies. These sampling methods often produce violations of the assumption of data independence that most traditional statistics share. Hierarchical linear modeling is a statistical method that can overcome violations of the independence…

  18. Convex Clustering: An Attractive Alternative to Hierarchical Clustering

    Science.gov (United States)

    Chen, Gary K.; Chi, Eric C.; Ranola, John Michael O.; Lange, Kenneth

    2015-01-01

    The primary goal in cluster analysis is to discover natural groupings of objects. The field of cluster analysis is crowded with diverse methods that make special assumptions about data and address different scientific aims. Despite its shortcomings in accuracy, hierarchical clustering is the dominant clustering method in bioinformatics. Biologists find the trees constructed by hierarchical clustering visually appealing and in tune with their evolutionary perspective. Hierarchical clustering operates on multiple scales simultaneously. This is essential, for instance, in transcriptome data, where one may be interested in making qualitative inferences about how lower-order relationships like gene modules lead to higher-order relationships like pathways or biological processes. The recently developed method of convex clustering preserves the visual appeal of hierarchical clustering while ameliorating its propensity to make false inferences in the presence of outliers and noise. The solution paths generated by convex clustering reveal relationships between clusters that are hidden by static methods such as k-means clustering. The current paper derives and tests a novel proximal distance algorithm for minimizing the objective function of convex clustering. The algorithm separates parameters, accommodates missing data, and supports prior information on relationships. Our program CONVEXCLUSTER incorporating the algorithm is implemented on ATI and nVidia graphics processing units (GPUs) for maximal speed. Several biological examples illustrate the strengths of convex clustering and the ability of the proximal distance algorithm to handle high-dimensional problems. CONVEXCLUSTER can be freely downloaded from the UCLA Human Genetics web site at http://www.genetics.ucla.edu/software/ PMID:25965340

  19. Robust Pseudo-Hierarchical Support Vector Clustering

    DEFF Research Database (Denmark)

    Hansen, Michael Sass; Sjöstrand, Karl; Olafsdóttir, Hildur

    2007-01-01

    Support vector clustering (SVC) has proven an efficient algorithm for clustering of noisy and high-dimensional data sets, with applications within many fields of research. An inherent problem, however, has been setting the parameters of the SVC algorithm. Using the recent emergence of a method...... for calculating the entire regularization path of the support vector domain description, we propose a fast method for robust pseudo-hierarchical support vector clustering (HSVC). The method is demonstrated to work well on generated data, as well as for detecting ischemic segments from multidimensional myocardial...

  20. Hierarchical Control for Multiple DC Microgrids Clusters

    DEFF Research Database (Denmark)

    Shafiee, Qobad; Dragicevic, Tomislav; Vasquez, Juan Carlos;

    2014-01-01

    This paper presents a distributed hierarchical control framework to ensure reliable operation of dc Microgrid (MG) clusters. In this hierarchy, primary control is used to regulate the common bus voltage inside each MG locally. An adaptive droop method is proposed for this level which determines....... Another distributed policy is employed then to regulate the power flow among the MGs according to their local SOCs. The proposed distributed controllers on each MG communicate with only the neighbor MGs through a communication infrastructure. Finally, the small signal model is expanded for dc MG clusters...

  1. Hierarchical multiple bit clusters and patterned media enabled by novel nanofabrication techniques -- High resolution electron beam lithography and block polymer self assembly

    Science.gov (United States)

    Xiao, Qijun

    This thesis discusses the full scope of a project exploring the physics of hierarchical clusters of interacting nanomagnets. These clusters may be relevant for novel applications such as multilevel data storage devices. The work can be grouped into three main activities: micromagnetic simulation, fabrication and characterization of proof-of-concept prototype devices, and efforts to scale down the structures by creating the hierarchical structures with the aid of diblock copolymer self assembly. Theoretical micromagnetic studies and simulations based on Landau-Lifshitz-Gilbert (LLG) equation were conducted on nanoscale single domain magnetic entities. For the simulated nanomagnet clusters with perpendicular uniaxial anisotropy, the simulation showed the switching field distributions, the stability of the magnetostatic states with distinctive total cluster perpendicular moments, and the stepwise magnetic switching curves. For simulated nanomagnet clusters with in-plane shape anisotropy, the simulation showed the stepwise switching behaviors governed by thermal agitation and cluster configurations. Proof-of-concept cluster devices with three interacting Co nanomagnets were fabricated by e-beam lithography (EBL) and pulse-reverse electrochemical deposition (PRECD). EBL patterning on a suspended 100 nm SiN membrane showed improved lateral lithography resolution to 30 nm. The Co nanomagnets deposited using the PRECD method showed perpendicular anisotropy. The switching experiments with external applied fields were able to switch the Co nanomagnets through the four magnetostatic states with distinctive total perpendicular cluster magnetization, and proved the feasibility of multilevel data storage devices based on the cluster concept. Shrinking the structures size was experimented by the aid of diblock copolymer. Thick poly(styrene)-b-poly(methyl methacrylate) (PS-b-PMMA) diblock copolymer templates aligned with external electrical field were used to fabricate long Ni

  2. PERFORMANCE OF SELECTED AGGLOMERATIVE HIERARCHICAL CLUSTERING METHODS

    Directory of Open Access Journals (Sweden)

    Nusa Erman

    2015-01-01

    Full Text Available A broad variety of different methods of agglomerative hierarchical clustering brings along problems how to choose the most appropriate method for the given data. It is well known that some methods outperform others if the analysed data have a specific structure. In the presented study we have observed the behaviour of the centroid, the median (Gower median method, and the average method (unweighted pair-group method with arithmetic mean – UPGMA; average linkage between groups. We have compared them with mostly used methods of hierarchical clustering: the minimum (single linkage clustering, the maximum (complete linkage clustering, the Ward, and the McQuitty (groups method average, weighted pair-group method using arithmetic averages - WPGMA methods. We have applied the comparison of these methods on spherical, ellipsoid, umbrella-like, “core-and-sphere”, ring-like and intertwined three-dimensional data structures. To generate the data and execute the analysis, we have used R statistical software. Results show that all seven methods are successful in finding compact, ball-shaped or ellipsoid structures when they are enough separated. Conversely, all methods except the minimum perform poor on non-homogenous, irregular and elongated ones. Especially challenging is a circular double helix structure; it is being correctly revealed only by the minimum method. We can also confirm formerly published results of other simulation studies, which usually favour average method (besides Ward method in cases when data is assumed to be fairly compact and well separated.

  3. Non-hierarchical clustering methods on factorial subspaces

    OpenAIRE

    Tortora, Cristina

    2011-01-01

    Cluster analysis (CA) aims at finding homogeneous group of individuals, where homogeneous is referred to individuals that present similar characteristics. Many CA techniques already exist, among the non-hierarchical ones the most known, thank to its simplicity and computational property, is k-means method. However, the method is unstable when the number of variables is large and when variables are correlated. This problem leads to the development of two-step methods, they perform a linear tra...

  4. A fast quad-tree based two dimensional hierarchical clustering.

    Science.gov (United States)

    Rajadurai, Priscilla; Sankaranarayanan, Swamynathan

    2012-01-01

    Recently, microarray technologies have become a robust technique in the area of genomics. An important step in the analysis of gene expression data is the identification of groups of genes disclosing analogous expression patterns. Cluster analysis partitions a given dataset into groups based on specified features. Euclidean distance is a widely used similarity measure for gene expression data that considers the amount of changes in gene expression. However, the huge number of genes and the intricacy of biological networks have highly increased the challenges of comprehending and interpreting the resulting group of data, increasing processing time. The proposed technique focuses on a QT based fast 2-dimensional hierarchical clustering algorithm to perform clustering. The construction of the closest pair data structure is an each level is an important time factor, which determines the processing time of clustering. The proposed model reduces the processing time and improves analysis of gene expression data.

  5. A combined multidimensional scaling and hierarchical clustering view for the exploratory analysis of multidimensional data

    Science.gov (United States)

    Craig, Paul; Roa-Seïler, Néna

    2013-01-01

    This paper describes a novel information visualization technique that combines multidimensional scaling and hierarchical clustering to support the exploratory analysis of multidimensional data. The technique displays the results of multidimensional scaling using a scatter plot where the proximity of any two items' representations is approximate to their similarity according to a Euclidean distance metric. The results of hierarchical clustering are overlaid onto this view by drawing smoothed outlines around each nested cluster. The difference in similarity between successive cluster combinations is used to colour code clusters and make stronger natural clusters more prominent in the display. When a cluster or group of items is selected, multidimensional scaling and hierarchical clustering are re-applied to a filtered subset of the data, and animation is used to smooth the transition between successive filtered views. As a case study we demonstrate the technique being used to analyse survey data relating to the appropriateness of different phrases to different emotionally charged situations.

  6. Constructing storyboards based on hierarchical clustering analysis

    Science.gov (United States)

    Hasebe, Satoshi; Sami, Mustafa M.; Muramatsu, Shogo; Kikuchi, Hisakazu

    2005-07-01

    There are growing needs for quick preview of video contents for the purpose of improving accessibility of video archives as well as reducing network traffics. In this paper, a storyboard that contains a user-specified number of keyframes is produced from a given video sequence. It is based on hierarchical cluster analysis of feature vectors that are derived from wavelet coefficients of video frames. Consistent use of extracted feature vectors is the key to avoid a repetition of computationally-intensive parsing of the same video sequence. Experimental results suggest that a significant reduction in computational time is gained by this strategy.

  7. Magnetic susceptibilities of cluster-hierarchical models

    Science.gov (United States)

    McKay, Susan R.; Berker, A. Nihat

    1984-02-01

    The exact magnetic susceptibilities of hierarchical models are calculated near and away from criticality, in both the ordered and disordered phases. The mechanism and phenomenology are discussed for models with susceptibilities that are physically sensible, e.g., nondivergent away from criticality. Such models are found based upon the Niemeijer-van Leeuwen cluster renormalization. A recursion-matrix method is presented for the renormalization-group evaluation of response functions. Diagonalization of this matrix at fixed points provides simple criteria for well-behaved densities and response functions.

  8. Hierarchical Aligned Cluster Analysis for Temporal Clustering of Human Motion.

    Science.gov (United States)

    Zhou, Feng; De la Torre, Fernando; Hodgins, Jessica K

    2013-03-01

    Temporal segmentation of human motion into plausible motion primitives is central to understanding and building computational models of human motion. Several issues contribute to the challenge of discovering motion primitives: the exponential nature of all possible movement combinations, the variability in the temporal scale of human actions, and the complexity of representing articulated motion. We pose the problem of learning motion primitives as one of temporal clustering, and derive an unsupervised hierarchical bottom-up framework called hierarchical aligned cluster analysis (HACA). HACA finds a partition of a given multidimensional time series into m disjoint segments such that each segment belongs to one of k clusters. HACA combines kernel k-means with the generalized dynamic time alignment kernel to cluster time series data. Moreover, it provides a natural framework to find a low-dimensional embedding for time series. HACA is efficiently optimized with a coordinate descent strategy and dynamic programming. Experimental results on motion capture and video data demonstrate the effectiveness of HACA for segmenting complex motions and as a visualization tool. We also compare the performance of HACA to state-of-the-art algorithms for temporal clustering on data of a honey bee dance. The HACA code is available online.

  9. Clustering Techniques in Bioinformatics

    Directory of Open Access Journals (Sweden)

    Muhammad Ali Masood

    2015-01-01

    Full Text Available Dealing with data means to group information into a set of categories either in order to learn new artifacts or understand new domains. For this purpose researchers have always looked for the hidden patterns in data that can be defined and compared with other known notions based on the similarity or dissimilarity of their attributes according to well-defined rules. Data mining, having the tools of data classification and data clustering, is one of the most powerful techniques to deal with data in such a manner that it can help researchers identify the required information. As a step forward to address this challenge, experts have utilized clustering techniques as a mean of exploring hidden structure and patterns in underlying data. Improved stability, robustness and accuracy of unsupervised data classification in many fields including pattern recognition, machine learning, information retrieval, image analysis and bioinformatics, clustering has proven itself as a reliable tool. To identify the clusters in datasets algorithm are utilized to partition data set into several groups based on the similarity within a group. There is no specific clustering algorithm, but various algorithms are utilized based on domain of data that constitutes a cluster and the level of efficiency required. Clustering techniques are categorized based upon different approaches. This paper is a survey of few clustering techniques out of many in data mining. For the purpose five of the most common clustering techniques out of many have been discussed. The clustering techniques which have been surveyed are: K-medoids, K-means, Fuzzy C-means, Density-Based Spatial Clustering of Applications with Noise (DBSCAN and Self-Organizing Map (SOM clustering.

  10. Hierarchically Clustered Star Formation in the Magellanic Clouds

    CERN Document Server

    Gouliermis, Dimitrios A; Ossenkopf, Volker; Klessen, Ralf S; Dolphin, Andrew E

    2012-01-01

    We present a cluster analysis of the bright main-sequence and faint pre--main-sequence stellar populations of a field ~ 90 x 90 pc centered on the HII region NGC 346/N66 in the Small Magellanic Cloud, from imaging with HST/ACS. We extend our earlier analysis on the stellar cluster population in the region to characterize the structuring behavior of young stars in the region as a whole with the use of stellar density maps interpreted through techniques designed for the study of the ISM structuring. In particular, we demonstrate with Cartwrigth & Whitworth's Q parameter, dendrograms, and the Delta-variance wavelet transform technique that the young stellar populations in the region NGC 346/N66 are hierarchically clustered, in agreement with other regions in the Magellanic Clouds observed with HST. The origin of this hierarchy is currently under investigation.

  11. A Hierarchical Clustering Methodology for the Estimation of Toxicity

    Science.gov (United States)

    A Quantitative Structure Activity Relationship (QSAR) methodology based on hierarchical clustering was developed to predict toxicological endpoints. This methodology utilizes Ward's method to divide a training set into a series of structurally similar clusters. The structural sim...

  12. Hierarchical Cluster Assembly in Globally Collapsing Clouds

    CERN Document Server

    Vazquez-Semadeni, Enrique; Colin, Pedro

    2016-01-01

    We discuss the mechanism of cluster formation in a numerical simulation of a molecular cloud (MC) undergoing global hierarchical collapse (GHC). The global nature of the collapse implies that the SFR increases over time. The hierarchical nature of the collapse consists of small-scale collapses within larger-scale ones. The large-scale collapses culminate a few Myr later than the small-scale ones and consist of filamentary flows that accrete onto massive central clumps. The small-scale collapses form clumps that are embedded in the filaments and falling onto the large-scale collapse centers. The stars formed in the early, small-scale collapses share the infall motion of their parent clumps. Thus, the filaments feed both gaseous and stellar material to the massive central clump. This leads to the presence of a few older stars in a region where new protostars are forming, and also to a self-similar structure, in which each unit is composed of smaller-scale sub-units that approach each other and may merge. Becaus...

  13. Hierarchical clustering using correlation metric and spatial continuity constraint

    Science.gov (United States)

    Stork, Christopher L.; Brewer, Luke N.

    2012-10-02

    Large data sets are analyzed by hierarchical clustering using correlation as a similarity measure. This provides results that are superior to those obtained using a Euclidean distance similarity measure. A spatial continuity constraint may be applied in hierarchical clustering analysis of images.

  14. Performance Analysis of Hierarchical Clustering Algorithm

    Directory of Open Access Journals (Sweden)

    K.Ranjini

    2011-07-01

    Full Text Available Clustering is the classification of objects into different groups, or more precisely, the partitioning of a data set into subsets (clusters, so that the data in each subset (ideally share some common trait - often proximity according to some defined distance measure. Data clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. This paper explains the implementation of agglomerative and divisive clustering algorithms applied on various types of data. The details of the victims of Tsunami in Thailand during the year 2004, was taken as the test data. Visual programming is used for implementation and running time of the algorithms using different linkages (agglomerative to different types of data are taken for analysis.

  15. Research of Parallel Programming Techniques of Hierarchical Model Based on SMP Clusters%基于SMP机群的层次化并行编程技术的研究

    Institute of Scientific and Technical Information of China (English)

    祝永志; 张丹丹; 曹宝香; 禹继国

    2012-01-01

    针对多核SMP机群的体系结构特点,讨论了MPI+ OpenMP混合并行程序设计技术.提出了一种多层次化混合设计新方法.设计了N-body问题的多层次化并行算法,并在曙光5000A机群上与传统的混合算法作了性能方面的比较.结果表明,该层次化混合并行算法具有更好的扩展性和加速比.%For multi-core SMP cluster systems, this paper discusses hybrid parallel programming techniques based on MPI and OpenMP.We propose a new hybrid parallel programming methods lhat are aware of architecture hierarchy on SMP cluster systems. We design a hierarchically parallel algorithm on the N-body problem, and compared its performance with traditional hybrid parallel algorithms on the Dawning 5000A cluster. The results indicate that our hierarchically hybrid parallel algorithm has better scalability and speedup than others.

  16. Fast, Linear Time Hierarchical Clustering using the Baire Metric

    CERN Document Server

    Contreras, Pedro

    2011-01-01

    The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. In this work we evaluate empirically this new approach to hierarchical clustering. We compare hierarchical clustering based on the Baire metric with (i) agglomerative hierarchical clustering, in terms of algorithm properties; (ii) generalized ultrametrics, in terms of definition; and (iii) fast clustering through k-means partititioning, in terms of quality of results. For the latter, we carry out an in depth astronomical study. We apply the Baire distance to spectrometric and photometric redshifts from the Sloan Digital Sky Survey using, in this work, about half a million astronomical objects. We want to know how well the (more costly to determine) spectrometric redshifts can predict the (more easily obtained) photometric redshifts, i.e. we seek to regress the spectrometric on the photometric redshifts, and we use clusterwi...

  17. Clustering Techniques in Bioinformatics

    National Research Council Canada - National Science Library

    Muhammad Ali Masood; M. N. A. Khan

    2015-01-01

    ... according to well-defined rules. Data mining, having the tools of data classification and data clustering, is one of the most powerful techniques to deal with data in such a manner that it can help researchers identify the required information...

  18. Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem

    Science.gov (United States)

    Fajar, Abdulah; Herman, Nanna Suryana; Abu, Nur Azman; Shahib, Sahrin

    There has been growing interest in studying combinatorial optimization problems by clustering strategy, with a special emphasis on the traveling salesman problem (TSP). TSP naturally arises as a sub problem in much transportation, manufacturing and logistics application, this problem has caught much attention of mathematicians and computer scientists. A clustering approach will decompose TSP into sub graph and form cluster, so it may reduce problem size into smaller problem. Impact of hierarchical approach will be investigated to produce a better clustering strategy that fit into Euclidean TSP. Clustering strategy to Euclidean TSP consist of two main step, there are; clustering and tour construction. The significant of this research is clustering approach solution result has error less than 10% compare to best known solution (TSPLIB) and there is improvement to a hierarchical clustering algorithm in order to fit in such Euclidean TSP solution method.

  19. An Automatic Clustering Technique for Optimal Clusters

    CERN Document Server

    Pavan, K Karteeka; Rao, A V Dattatreya; 10.5121/ijcsea.2011.1412

    2011-01-01

    This paper proposes a simple, automatic and efficient clustering algorithm, namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate nearly optimal clusters for the given datasets automatically. The AMOC is an extension to standard k-means with a two phase iterative procedure combining certain validation techniques in order to find optimal clusters with automation of merging of clusters. Experiments on both synthetic and real data have proved that the proposed algorithm finds nearly optimal clustering structures in terms of number of clusters, compactness and separation.

  20. A Framework for Analyzing Software Quality using Hierarchical Clustering

    Directory of Open Access Journals (Sweden)

    Arashdeep Kaur

    2011-02-01

    Full Text Available Fault proneness data available in the early software life cycle from previous releases or similar kind of projects will aid in improving software quality estimations. Various techniques have been proposed in the literature which includes statistical method, machine learning methods, neural network techniques and clustering techniques for the prediction of faulty and non faulty modules in the project. In this study, Hierarchical clustering algorithm is being trained and tested with lifecycle data collected from NASA projects namely, CM1, PC1 and JM1 as predictive models. These predictive models contain requirement metrics and static code metrics. We have combined requirement metric model with static code metric model to get fusion metric model. Further we have investigated that which of the three prediction models is found to be the best prediction model on the basis of fault detection. The basic hypothesis of software quality estimation is that automatic quality prediction models enable verificationexperts to concentrate their attention and resources at problem areas of the system under development. The proposed approach has been implemented in MATLAB 7.4. The results show that when all the prediction techniques are evaluated, the best prediction model is found to be the fusion metric model. This proposed model is also compared with other quality models available in the literature and is found to be efficient for predicting faulty modules.

  1. Hierarchical Clustering and the Concept of Space Distortion.

    Science.gov (United States)

    Hubert, Lawrence; Schultz, James

    An empirical assesssment of the space distortion properties of two prototypic hierarchical clustering procedures is given in terms of an occupancy model developed from combinatorics. Using one simple example, the single-link and complete-link clustering strategies now in common use in the behavioral sciences are empirically shown to be space…

  2. The Hierarchical Distribution of Young Stellar Clusters in Nearby Galaxies

    Science.gov (United States)

    Grasha, Kathryn; Calzetti, Daniela

    2017-01-01

    We investigate the spatial distributions of young stellar clusters in six nearby galaxies to trace the large scale hierarchical star-forming structures. The six galaxies are drawn from the Legacy ExtraGalactic UV Survey (LEGUS). We quantify the strength of the clustering among stellar clusters as a function of spatial scale and age to establish the survival timescale of the substructures. We separate the clusters into different classes, compact (bound) clusters and associations (unbound), and compare the clustering among them. We find that younger star clusters are more strongly clustered over small spatial scales and that the clustering disappears rapidly for ages as young as a few tens of Myr, consistent with clusters slowly losing the fractal dimension inherited at birth from their natal molecular clouds.

  3. Hierarchical Clustering Given Confidence Intervals of Metric Distances

    CERN Document Server

    Huang, Weiyu

    2016-01-01

    This paper considers metric spaces where distances between a pair of nodes are represented by distance intervals. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a resolution parameter, induced from the given distance intervals of the metric spaces. Our construction of hierarchical clustering methods is based on defining admissible methods to be those methods that abide to the axioms of value - nodes in a metric space with two nodes are clustered together at the convex combination of the distance bounds between them - and transformation - when both distance bounds are reduced, the output may become more clustered but not less. Two admissible methods are constructed and are shown to provide universal upper and lower bounds in the space of admissible methods. Practical implications are explored by clustering moving points via snapshots and by clustering networks representing brain structural connectivity using the lower and upper bounds...

  4. Hierarchical modeling of cluster size in wildlife surveys

    Science.gov (United States)

    Royle, J. Andrew

    2008-01-01

    Clusters or groups of individuals are the fundamental unit of observation in many wildlife sampling problems, including aerial surveys of waterfowl, marine mammals, and ungulates. Explicit accounting of cluster size in models for estimating abundance is necessary because detection of individuals within clusters is not independent and detectability of clusters is likely to increase with cluster size. This induces a cluster size bias in which the average cluster size in the sample is larger than in the population at large. Thus, failure to account for the relationship between delectability and cluster size will tend to yield a positive bias in estimates of abundance or density. I describe a hierarchical modeling framework for accounting for cluster-size bias in animal sampling. The hierarchical model consists of models for the observation process conditional on the cluster size distribution and the cluster size distribution conditional on the total number of clusters. Optionally, a spatial model can be specified that describes variation in the total number of clusters per sample unit. Parameter estimation, model selection, and criticism may be carried out using conventional likelihood-based methods. An extension of the model is described for the situation where measurable covariates at the level of the sample unit are available. Several candidate models within the proposed class are evaluated for aerial survey data on mallard ducks (Anas platyrhynchos).

  5. Update Legal Documents Using Hierarchical Ranking Models and Word Clustering

    OpenAIRE

    Pham, Minh Quang Nhat; Nguyen, Minh Le; Shimazu, Akira

    2010-01-01

    Our research addresses the task of updating legal documents when newinformation emerges. In this paper, we employ a hierarchical ranking model tothe task of updating legal documents. Word clustering features are incorporatedto the ranking models to exploit semantic relations between words. Experimentalresults on legal data built from the United States Code show that the hierarchicalranking model with word clustering outperforms baseline methods using VectorSpace Model, and word cluster-based ...

  6. Exploiting Homogeneity of Density in Incremental Hierarchical Clustering

    Directory of Open Access Journals (Sweden)

    Dwi H. Widiyantoro

    2006-11-01

    Full Text Available Hierarchical clustering is an important tool in many applications. As it involves a large data set that proliferates over time, reclustering the data set periodically is not an efficient process. Therefore, the ability to incorporate a new data set incrementally into an existing hierarchy becomes increasingly demanding. This article describes Homogen, a system that employs a new algorithm for generating a hierarchy of concepts and clusters incrementally from a stream of observations. The system aims to construct a hierarchy that satisfies the homogeneity and the monotonicity properties. Working in a bottom-up fashion, a new observation is placed in the hierarchy and a sequence of hierarchy restructuring processes is performed only in regions that have been affected by the presence of the new observation. Additionally, it combines multiple restructuring techniques that address different restructuring objectives to get a synergistic effect. The system has been tested on a variety of domains including structured and unstructured data sets. The experimental results reveal that the system is able to construct a concept hierarchy that is consistent regardless of the input data order and whose quality is comparable to the quality of those produced by non incremental clustering algorithms.

  7. Hierarchical Cluster Analysis: Comparison of Three Linkage Measures and Application to Psychological Data

    Directory of Open Access Journals (Sweden)

    Odilia Yim

    2015-02-01

    Full Text Available Cluster analysis refers to a class of data reduction methods used for sorting cases, observations, or variables of a given dataset into homogeneous groups that differ from each other. The present paper focuses on hierarchical agglomerative cluster analysis, a statistical technique where groups are sequentially created by systematically merging similar clusters together, as dictated by the distance and linkage measures chosen by the researcher. Specific distance and linkage measures are reviewed, including a discussion of how these choices can influence the clustering process by comparing three common linkage measures (single linkage, complete linkage, average linkage. The tutorial guides researchers in performing a hierarchical cluster analysis using the SPSS statistical software. Through an example, we demonstrate how cluster analysis can be used to detect meaningful subgroups in a sample of bilinguals by examining various language variables.

  8. MultiDendrograms: Variable-Group Agglomerative Hierarchical Clustering

    CERN Document Server

    Gomez, Sergio; Montiel, Justo; Torres, David

    2012-01-01

    MultiDendrograms is a Java-written application that computes agglomerative hierarchical clusterings of data. Starting from a distances (or weights) matrix, MultiDendrograms is able to calculate its dendrograms using the most common agglomerative hierarchical clustering methods. The application implements a variable-group algorithm that solves the non-uniqueness problem found in the standard pair-group algorithm. This problem arises when two or more minimum distances between different clusters are equal during the agglomerative process, because then different output clusterings are possible depending on the criterion used to break ties between distances. MultiDendrograms solves this problem implementing a variable-group algorithm that groups more than two clusters at the same time when ties occur.

  9. Hierarchical Overlapping Clustering of Network Data Using Cut Metrics

    CERN Document Server

    Gama, Fernando; Ribeiro, Alejandro

    2016-01-01

    A novel method to obtain hierarchical and overlapping clusters from network data -i.e., a set of nodes endowed with pairwise dissimilarities- is presented. The introduced method is hierarchical in the sense that it outputs a nested collection of groupings of the node set depending on the resolution or degree of similarity desired, and it is overlapping since it allows nodes to belong to more than one group. Our construction is rooted on the facts that a hierarchical (non-overlapping) clustering of a network can be equivalently represented by a finite ultrametric space and that a convex combination of ultrametrics results in a cut metric. By applying a hierarchical (non-overlapping) clustering method to multiple dithered versions of a given network and then convexly combining the resulting ultrametrics, we obtain a cut metric associated to the network of interest. We then show how to extract a hierarchical overlapping clustering structure from the aforementioned cut metric. Furthermore, the so-called overlappi...

  10. Properties of hierarchically forming star clusters

    CERN Document Server

    Maschberger, Th; Bonnell, I A; Kroupa, P

    2010-01-01

    We undertake a systematic analysis of the early (< 0.5 Myr) evolution of clustering and the stellar initial mass function in turbulent fragmentation simulations. These large scale simulations for the first time offer the opportunity for a statistical analysis of IMF variations and correlations between stellar properties and cluster richness. The typical evolutionary scenario involves star formation in small-n clusters which then progressively merge; the first stars to form are seeds of massive stars and achieve a headstart in mass acquisition. These massive seeds end up in the cores of clusters and a large fraction of new stars of lower mass is formed in the outer parts of the clusters. The resulting clusters are therefore mass segregated at an age of 0.5 Myr, although the signature of mass segregation is weakened during mergers. We find that the resulting IMF has a smaller exponent (alpha=1.8-2.2) than the Salpeter value (alpha=2.35). The IMFs in subclusters are truncated at masses only somewhat larger th...

  11. Hierarchical clusters of phytoplankton variables in dammed water bodies

    Science.gov (United States)

    Silva, Eliana Costa e.; Lopes, Isabel Cristina; Correia, Aldina; Gonçalves, A. Manuela

    2017-06-01

    In this paper a dataset containing biological variables of the water column of several Portuguese reservoirs is analyzed. Hierarchical cluster analysis is used to obtain clusters of phytoplankton variables of the phylum Cyanophyta, with the objective of validating the classification of Portuguese reservoirs previewly presented in [1] which were divided into three clusters: (1) Interior Tagus and Aguieira; (2) Douro; and (3) Other rivers. Now three new clusters of Cyanophyta variables were found. Kruskal-Wallis and Mann-Whitney tests are used to compare the now obtained Cyanophyta clusters and the previous Reservoirs clusters, in order to validate the classification of the water quality of reservoirs. The amount of Cyanophyta algae present in the reservoirs from the three clusters is significantly different, which validates the previous classification.

  12. Kendall’s tau and agglomerative clustering for structure determination of hierarchical Archimedean copulas

    Directory of Open Access Journals (Sweden)

    Górecki J.

    2017-01-01

    Full Text Available Several successful approaches to structure determination of hierarchical Archimedean copulas (HACs proposed in the literature rely on agglomerative clustering and Kendall’s correlation coefficient. However, there has not been presented any theoretical proof justifying such approaches. This work fills this gap and introduces a theorem showing that, given the matrix of the pairwise Kendall correlation coefficients corresponding to a HAC, its structure can be recovered by an agglomerative clustering technique.

  13. A Novel Divisive Hierarchical Clustering Algorithm for Geospatial Analysis

    Directory of Open Access Journals (Sweden)

    Shaoning Li

    2017-01-01

    Full Text Available In the fields of geographic information systems (GIS and remote sensing (RS, the clustering algorithm has been widely used for image segmentation, pattern recognition, and cartographic generalization. Although clustering analysis plays a key role in geospatial modelling, traditional clustering methods are limited due to computational complexity, noise resistant ability and robustness. Furthermore, traditional methods are more focused on the adjacent spatial context, which makes it hard for the clustering methods to be applied to multi-density discrete objects. In this paper, a new method, cell-dividing hierarchical clustering (CDHC, is proposed based on convex hull retraction. The main steps are as follows. First, a convex hull structure is constructed to describe the global spatial context of geospatial objects. Then, the retracting structure of each borderline is established in sequence by setting the initial parameter. The objects are split into two clusters (i.e., “sub-clusters” if the retracting structure intersects with the borderlines. Finally, clusters are repeatedly split and the initial parameter is updated until the terminate condition is satisfied. The experimental results show that CDHC separates the multi-density objects from noise sufficiently and also reduces complexity compared to the traditional agglomerative hierarchical clustering algorithm.

  14. Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods

    Directory of Open Access Journals (Sweden)

    Zweig Katharina A

    2009-10-01

    Full Text Available Abstract Background Hierarchical clustering methods like Ward's method have been used since decades to understand biological and chemical data sets. In order to get a partition of the data set, it is necessary to choose an optimal level of the hierarchy by a so-called level selection algorithm. In 2005, a new kind of hierarchical clustering method was introduced by Palla et al. that differs in two ways from Ward's method: it can be used on data on which no full similarity matrix is defined and it can produce overlapping clusters, i.e., allow for multiple membership of items in clusters. These features are optimal for biological and chemical data sets but until now no level selection algorithm has been published for this method. Results In this article we provide a general selection scheme, the level independent clustering selection method, called LInCS. With it, clusters can be selected from any level in quadratic time with respect to the number of clusters. Since hierarchically clustered data is not necessarily associated with a similarity measure, the selection is based on a graph theoretic notion of cohesive clusters. We present results of our method on two data sets, a set of drug like molecules and set of protein-protein interaction (PPI data. In both cases the method provides a clustering with very good sensitivity and specificity values according to a given reference clustering. Moreover, we can show for the PPI data set that our graph theoretic cohesiveness measure indeed chooses biologically homogeneous clusters and disregards inhomogeneous ones in most cases. We finally discuss how the method can be generalized to other hierarchical clustering methods to allow for a level independent cluster selection. Conclusion Using our new cluster selection method together with the method by Palla et al. provides a new interesting clustering mechanism that allows to compute overlapping clusters, which is especially valuable for biological and

  15. A Framework for Hierarchical Clustering Based Indexing in Search Engines

    Directory of Open Access Journals (Sweden)

    Parul Gupta

    2011-01-01

    Full Text Available Granting efficient and fast accesses to the index is a key issuefor performances of Web Search Engines. In order to enhancememory utilization and favor fast query resolution, WSEs useInverted File (IF indexes that consist of an array of theposting lists where each posting list is associated with a termand contains the term as well as the identifiers of the documentscontaining the term. Since the document identifiers are stored insorted order, they can be stored as the difference between thesuccessive documents so as to reduce the size of the index. Thispaper describes a clustering algorithm that aims atpartitioning the set of documents into ordered clusters so thatthe documents within the same cluster are similar and are beingassigned the closer document identifiers. Thus the averagevalue of the differences between the successive documents willbe minimized and hence storage space would be saved. Thepaper further presents the extension of this clustering algorithmto be applied for the hierarchical clustering in which similarclusters are clubbed to form a mega cluster and similar megaclusters are then combined to form super cluster. Thus thepaper describes the different levels of clustering whichoptimizes the search process by directing the searchto a specific path from higher levels of clustering to the lowerlevels i.e. from super clusters to mega clusters, then to clustersand finally to the individual documents so that the user gets thebest possible matching results in minimum possible time.

  16. Active Clustering: Robust and Efficient Hierarchical Clustering using Adaptively Selected Similarities

    CERN Document Server

    Eriksson, Brian; Singh, Aarti; Nowak, Robert

    2011-01-01

    Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in many problems it may be expensive to obtain or compute similarities between the items to be clustered. This paper investigates the hierarchical clustering of N items based on a small subset of pairwise similarities, significantly less than the complete set of N(N-1)/2 similarities. First, we show that if the intracluster similarities exceed intercluster similarities, then it is possible to correctly determine the hierarchical clustering from as few as 3N log N similarities. We demonstrate this order of magnitude savings in the number of pairwise similarities necessitates sequentially selecting which similarities to obtain in an adaptive fashion, rather than picking them at random. We then propose an active clustering method that is robust to a limited fraction of anomalous similarities, and show how even in the presence of these noisy similarity values we can resolve the hierar...

  17. Hierarchical Cluster Analysis – Various Approaches to Data Preparation

    Directory of Open Access Journals (Sweden)

    Z. Pacáková

    2013-09-01

    Full Text Available The article deals with two various approaches to data preparation to avoid multicollinearity. The aim of the article is to find similarities among the e-communication level of EU states using hierarchical cluster analysis. The original set of fourteen indicators was first reduced on the basis of correlation analysis while in case of high correlation indicator of higher variability was included in further analysis. Secondly the data were transformed using principal component analysis while the principal components are poorly correlated. For further analysis five principal components explaining about 92% of variance were selected. Hierarchical cluster analysis was performed both based on the reduced data set and the principal component scores. Both times three clusters were assumed following Pseudo t-Squared and Pseudo F Statistic, but the final clusters were not identical. An important characteristic to compare the two results found was to look at the proportion of variance accounted for by the clusters which was about ten percent higher for the principal component scores (57.8% compared to 47%. Therefore it can be stated, that in case of using principal component scores as an input variables for cluster analysis with explained proportion high enough (about 92% for in our analysis, the loss of information is lower compared to data reduction on the basis of correlation analysis.

  18. Concept Association and Hierarchical Hamming Clustering Model in Text Classification

    Institute of Scientific and Technical Information of China (English)

    Su Gui-yang; Li Jian-hua; Ma Ying-hua; Li Sheng-hong; Yin Zhong-hang

    2004-01-01

    We propose two models in this paper. The concept of association model is put forward to obtain the co-occurrence relationships among keywords in the documents and the hierarchical Hamming clustering model is used to reduce the dimensionality of the category feature vector space which can solve the problem of the extremely high dimensionality of the documents' feature space. The results of experiment indicate that it can obtain the co-occurrence relations among keywords in the documents which promote the recall of classification system effectively. The hierarchical Hamming clustering model can reduce the dimensionality of the category feature vector efficiently, the size of the vector space is only about 10% of the primary dimensionality.

  19. Global Considerations in Hierarchical Clustering Reveal Meaningful Patterns in Data

    Science.gov (United States)

    Varshavsky, Roy; Horn, David; Linial, Michal

    2008-01-01

    Background A hierarchy, characterized by tree-like relationships, is a natural method of organizing data in various domains. When considering an unsupervised machine learning routine, such as clustering, a bottom-up hierarchical (BU, agglomerative) algorithm is used as a default and is often the only method applied. Methodology/Principal Findings We show that hierarchical clustering that involve global considerations, such as top-down (TD, divisive), or glocal (global-local) algorithms are better suited to reveal meaningful patterns in the data. This is demonstrated, by testing the correspondence between the results of several algorithms (TD, glocal and BU) and the correct annotations provided by experts. The correspondence was tested in multiple domains including gene expression experiments, stock trade records and functional protein families. The performance of each of the algorithms is evaluated by statistical criteria that are assigned to clusters (nodes of the hierarchy tree) based on expert-labeled data. Whereas TD algorithms perform better on global patterns, BU algorithms perform well and are advantageous when finer granularity of the data is sought. In addition, a novel TD algorithm that is based on genuine density of the data points is presented and is shown to outperform other divisive and agglomerative methods. Application of the algorithm to more than 500 protein sequences belonging to ion-channels illustrates the potential of the method for inferring overlooked functional annotations. ClustTree, a graphical Matlab toolbox for applying various hierarchical clustering algorithms and testing their quality is made available. Conclusions Although currently rarely used, global approaches, in particular, TD or glocal algorithms, should be considered in the exploratory process of clustering. In general, applying unsupervised clustering methods can leverage the quality of manually-created mapping of proteins families. As demonstrated, it can also provide

  20. Determination of genetic structure of germplasm collections: are traditional hierarchical clustering methods appropriate for molecular marker data?

    Science.gov (United States)

    Odong, T L; van Heerwaarden, J; Jansen, J; van Hintum, T J L; van Eeuwijk, F A

    2011-07-01

    Despite the availability of newer approaches, traditional hierarchical clustering remains very popular in genetic diversity studies in plants. However, little is known about its suitability for molecular marker data. We studied the performance of traditional hierarchical clustering techniques using real and simulated molecular marker data. Our study also compared the performance of traditional hierarchical clustering with model-based clustering (STRUCTURE). We showed that the cophenetic correlation coefficient is directly related to subgroup differentiation and can thus be used as an indicator of the presence of genetically distinct subgroups in germplasm collections. Whereas UPGMA performed well in preserving distances between accessions, Ward excelled in recovering groups. Our results also showed a close similarity between clusters obtained by Ward and by STRUCTURE. Traditional cluster analysis can provide an easy and effective way of determining structure in germplasm collections using molecular marker data, and, the output can be used for sampling core collections or for association studies.

  1. Image Segmentation by Hierarchical Spatial and Color Spaces Clustering

    Institute of Scientific and Technical Information of China (English)

    YU Wei

    2005-01-01

    Image segmentation, as a basic building block for many high-level image analysis problems, has attracted many research attentions over years. Existing approaches, however, are mainly focusing on the clustering analysis in the single channel information, i.e., either in color or spatial space, which may lead to unsatisfactory segmentation performance. Considering the spatial and color spaces jointly, this paper proposes a new hierarchical image segmentation algorithm, which alternately clusters the image regions in color and spatial spaces in a fine to coarse manner. Without losing the perceptual consistence, the proposed algorithm achieves the segmentation result using only very few number of colors according to user specification.

  2. Extending stability through hierarchical clusters in Echo State Networks

    Directory of Open Access Journals (Sweden)

    Sarah Jarvis

    2010-07-01

    Full Text Available Echo State Networks (ESN are reservoir networks that satisfy well-established criteria for stability when constructed as feedforward networks. Recent evidence suggests that stability criteria are altered in the presence of reservoir substructures, such as clusters. Understanding how the reservoir architecture affects stability is thus important for the appropriate design of any ESN. To quantitatively determine the influence of the most relevant network parameters, we analysed the impact of reservoir substructures on stability in hierarchically clustered ESNs (HESN, as they allow a smooth transition from highly structured to increasingly homogeneous reservoirs. Previous studies used the largest eigenvalue of the reservoir connectivity matrix (spectral radius as a predictor for stable network dynamics. Here, we evaluate the impact of clusters, hierarchy and intercluster connectivity on the predictive power of the spectral radius for stability. Both hierarchy and low relative cluster sizes extend the range of spectral radius values, leading to stable networks, while increasing intercluster connectivity decreased maximal spectral radius.

  3. Multi-mode clustering model for hierarchical wireless sensor networks

    Science.gov (United States)

    Hu, Xiangdong; Li, Yongfu; Xu, Huifen

    2017-03-01

    The topology management, i.e., clusters maintenance, of wireless sensor networks (WSNs) is still a challenge due to its numerous nodes, diverse application scenarios and limited resources as well as complex dynamics. To address this issue, a multi-mode clustering model (M2 CM) is proposed to maintain the clusters for hierarchical WSNs in this study. In particular, unlike the traditional time-trigger model based on the whole-network and periodic style, the M2 CM is proposed based on the local and event-trigger operations. In addition, an adaptive local maintenance algorithm is designed for the broken clusters in the WSNs using the spatial-temporal demand changes accordingly. Numerical experiments are performed using the NS2 network simulation platform. Results validate the effectiveness of the proposed model with respect to the network maintenance costs, node energy consumption and transmitted data as well as the network lifetime.

  4. Globular cluster formation with multiple stellar populations from hierarchical star cluster complexes

    Science.gov (United States)

    Bekki, Kenji

    2017-01-01

    Most old globular clusters (GCs) in the Galaxy are observed to have internal chemical abundance spreads in light elements. We discuss a new GC formation scenario based on hierarchical star formation within fractal molecular clouds. In the new scenario, a cluster of bound and unbound star clusters (`star cluster complex', SCC) that have a power-law cluster mass function with a slope (β) of 2 is first formed from a massive gas clump developed in a dwarf galaxy. Such cluster complexes and β = 2 are observed and expected from hierarchical star formation. The most massive star cluster (`main cluster'), which is the progenitor of a GC, can accrete gas ejected from asymptotic giant branch (AGB) stars initially in the cluster and other low-mass clusters before the clusters are tidally stripped or destroyed to become field stars in the dwarf. The SCC is initially embedded in a giant gas hole created by numerous supernovae of the SCC so that cold gas outside the hole can be accreted onto the main cluster later. New stars formed from the accreted gas have chemical abundances that are different from those of the original SCC. Using hydrodynamical simulations of GC formation based on this scenario, we show that the main cluster with the initial mass as large as [2 - 5] × 105M⊙ can accrete more than 105M⊙ gas from AGB stars of the SCC. We suggest that merging of hierarchical star cluster complexes can play key roles in stellar halo formation around GCs and self-enrichment processes in the early phase of GC formation.

  5. D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

    Science.gov (United States)

    Suhaibah, A.; Uznir, U.; Anton, F.; Mioc, D.; Rahman, A. A.

    2016-06-01

    Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

  6. Improving the Decision Value of Hierarchical Text Clustering Using Term Overlap Detection

    Directory of Open Access Journals (Sweden)

    Nilupulee Nathawitharana

    2015-09-01

    Full Text Available Humans are used to expressing themselves with written language and language provides a medium with which we can describe our experiences in detail incorporating individuality. Even though documents provide a rich source of information, it becomes very difficult to identify, extract, summarize and search when vast amounts of documents are collected especially over time. Document clustering is a technique that has been widely used to group documents based on similarity of content represented by the words used. Once key groups are identified further drill down into sub-groupings is facilitated by the use of hierarchical clustering. Clustering and hierarchical clustering are very useful when applied to numerical and categorical data and cluster accuracy and purity measures exist to evaluate the outcomes of a clustering exercise. Although the same measures have been applied to text clustering, text clusters are based on words or terms which can be repeated across documents associated with different topics. Therefore text data cannot be considered as a direct ‘coding’ of a particular experience or situation in contrast to numerical and categorical data and term overlap is a very common characteristic in text clustering. In this paper we propose a new technique and methodology for term overlap capture from text documents, highlighting the different situations such overlap could signify and discuss why such understanding is important for obtaining value from text clustering. Experiments were conducted using a widely used text document collection where the proposed methodology allowed exploring the term diversity for a given document collection and obtain clusters with minimum term overlap.

  7. Multiscale stochastic hierarchical image segmentation by spectral clustering

    Institute of Scientific and Technical Information of China (English)

    LI XiaoBin; TIAN Zheng

    2007-01-01

    This paper proposes a sampling based hierarchical approach for solving the computational demands of the spectral clustering methods when applied to the problem of image segmentation. The authors first define the distance between a pixel and a cluster, and then derive a new theorem to estimate the number of samples needed for clustering. Finally, by introducing a scale parameter into the similarity function, a novel spectral clustering based image segmentation method has been developed. An important characteristic of the approach is that in the course of image segmentation one needs not only to tune the scale parameter to merge the small size clusters or split the large size clusters but also take samples from the data set at the different scales. The multiscale and stochastic nature makes it feasible to apply the method to very large grouping problem. In addition, it also makes the segmentation compute in time that is linear in the size of the image. The experimental results on various synthetic and real world images show the effectiveness of the approach.

  8. An agglomerative hierarchical approach to visualization in Bayesian clustering problems.

    Science.gov (United States)

    Dawson, K J; Belkhir, K

    2009-07-01

    Clustering problems (including the clustering of individuals into outcrossing populations, hybrid generations, full-sib families and selfing lines) have recently received much attention in population genetics. In these clustering problems, the parameter of interest is a partition of the set of sampled individuals--the sample partition. In a fully Bayesian approach to clustering problems of this type, our knowledge about the sample partition is represented by a probability distribution on the space of possible sample partitions. As the number of possible partitions grows very rapidly with the sample size, we cannot visualize this probability distribution in its entirety, unless the sample is very small. As a solution to this visualization problem, we recommend using an agglomerative hierarchical clustering algorithm, which we call the exact linkage algorithm. This algorithm is a special case of the maximin clustering algorithm that we introduced previously. The exact linkage algorithm is now implemented in our software package PartitionView. The exact linkage algorithm takes the posterior co-assignment probabilities as input and yields as output a rooted binary tree, or more generally, a forest of such trees. Each node of this forest defines a set of individuals, and the node height is the posterior co-assignment probability of this set. This provides a useful visual representation of the uncertainty associated with the assignment of individuals to categories. It is also a useful starting point for a more detailed exploration of the posterior distribution in terms of the co-assignment probabilities.

  9. Clustering-based classification of road traffic accidents using hierarchical clustering and artificial neural networks.

    Science.gov (United States)

    Taamneh, Madhar; Taamneh, Salah; Alkheder, Sharaf

    2017-09-01

    Artificial neural networks (ANNs) have been widely used in predicting the severity of road traffic crashes. All available information about previously occurred accidents is typically used for building a single prediction model (i.e., classifier). Too little attention has been paid to the differences between these accidents, leading, in most cases, to build less accurate predictors. Hierarchical clustering is a well-known clustering method that seeks to group data by creating a hierarchy of clusters. Using hierarchical clustering and ANNs, a clustering-based classification approach for predicting the injury severity of road traffic accidents was proposed. About 6000 road accidents occurred over a six-year period from 2008 to 2013 in Abu Dhabi were used throughout this study. In order to reduce the amount of variation in data, hierarchical clustering was applied on the data set to organize it into six different forms, each with different number of clusters (i.e., clusters from 1 to 6). Two ANN models were subsequently built for each cluster of accidents in each generated form. The first model was built and validated using all accidents (training set), whereas only 66% of the accidents were used to build the second model, and the remaining 34% were used to test it (percentage split). Finally, the weighted average accuracy was computed for each type of models in each from of data. The results show that when testing the models using the training set, clustering prior to classification achieves (11%-16%) more accuracy than without using clustering, while the percentage split achieves (2%-5%) more accuracy. The results also suggest that partitioning the accidents into six clusters achieves the best accuracy if both types of models are taken into account.

  10. A Bayesian Alternative to Mutual Information for the Hierarchical Clustering of Dependent Random Variables.

    Directory of Open Access Journals (Sweden)

    Guillaume Marrelec

    Full Text Available The use of mutual information as a similarity measure in agglomerative hierarchical clustering (AHC raises an important issue: some correction needs to be applied for the dimensionality of variables. In this work, we formulate the decision of merging dependent multivariate normal variables in an AHC procedure as a Bayesian model comparison. We found that the Bayesian formulation naturally shrinks the empirical covariance matrix towards a matrix set a priori (e.g., the identity, provides an automated stopping rule, and corrects for dimensionality using a term that scales up the measure as a function of the dimensionality of the variables. Also, the resulting log Bayes factor is asymptotically proportional to the plug-in estimate of mutual information, with an additive correction for dimensionality in agreement with the Bayesian information criterion. We investigated the behavior of these Bayesian alternatives (in exact and asymptotic forms to mutual information on simulated and real data. An encouraging result was first derived on simulations: the hierarchical clustering based on the log Bayes factor outperformed off-the-shelf clustering techniques as well as raw and normalized mutual information in terms of classification accuracy. On a toy example, we found that the Bayesian approaches led to results that were similar to those of mutual information clustering techniques, with the advantage of an automated thresholding. On real functional magnetic resonance imaging (fMRI datasets measuring brain activity, it identified clusters consistent with the established outcome of standard procedures. On this application, normalized mutual information had a highly atypical behavior, in the sense that it systematically favored very large clusters. These initial experiments suggest that the proposed Bayesian alternatives to mutual information are a useful new tool for hierarchical clustering.

  11. A Bayesian Alternative to Mutual Information for the Hierarchical Clustering of Dependent Random Variables.

    Science.gov (United States)

    Marrelec, Guillaume; Messé, Arnaud; Bellec, Pierre

    2015-01-01

    The use of mutual information as a similarity measure in agglomerative hierarchical clustering (AHC) raises an important issue: some correction needs to be applied for the dimensionality of variables. In this work, we formulate the decision of merging dependent multivariate normal variables in an AHC procedure as a Bayesian model comparison. We found that the Bayesian formulation naturally shrinks the empirical covariance matrix towards a matrix set a priori (e.g., the identity), provides an automated stopping rule, and corrects for dimensionality using a term that scales up the measure as a function of the dimensionality of the variables. Also, the resulting log Bayes factor is asymptotically proportional to the plug-in estimate of mutual information, with an additive correction for dimensionality in agreement with the Bayesian information criterion. We investigated the behavior of these Bayesian alternatives (in exact and asymptotic forms) to mutual information on simulated and real data. An encouraging result was first derived on simulations: the hierarchical clustering based on the log Bayes factor outperformed off-the-shelf clustering techniques as well as raw and normalized mutual information in terms of classification accuracy. On a toy example, we found that the Bayesian approaches led to results that were similar to those of mutual information clustering techniques, with the advantage of an automated thresholding. On real functional magnetic resonance imaging (fMRI) datasets measuring brain activity, it identified clusters consistent with the established outcome of standard procedures. On this application, normalized mutual information had a highly atypical behavior, in the sense that it systematically favored very large clusters. These initial experiments suggest that the proposed Bayesian alternatives to mutual information are a useful new tool for hierarchical clustering.

  12. Multilevel hierarchical kernel spectral clustering for real-life large scale complex networks.

    Directory of Open Access Journals (Sweden)

    Raghvendra Mall

    Full Text Available Kernel spectral clustering corresponds to a weighted kernel principal component analysis problem in a constrained optimization framework. The primal formulation leads to an eigen-decomposition of a centered Laplacian matrix at the dual level. The dual formulation allows to build a model on a representative subgraph of the large scale network in the training phase and the model parameters are estimated in the validation stage. The KSC model has a powerful out-of-sample extension property which allows cluster affiliation for the unseen nodes of the big data network. In this paper we exploit the structure of the projections in the eigenspace during the validation stage to automatically determine a set of increasing distance thresholds. We use these distance thresholds in the test phase to obtain multiple levels of hierarchy for the large scale network. The hierarchical structure in the network is determined in a bottom-up fashion. We empirically showcase that real-world networks have multilevel hierarchical organization which cannot be detected efficiently by several state-of-the-art large scale hierarchical community detection techniques like the Louvain, OSLOM and Infomap methods. We show that a major advantage of our proposed approach is the ability to locate good quality clusters at both the finer and coarser levels of hierarchy using internal cluster quality metrics on 7 real-life networks.

  13. Bayesian latent variable models for hierarchical clustered count outcomes with repeated measures in microbiome studies.

    Science.gov (United States)

    Xu, Lizhen; Paterson, Andrew D; Xu, Wei

    2017-04-01

    Motivated by the multivariate nature of microbiome data with hierarchical taxonomic clusters, counts that are often skewed and zero inflated, and repeated measures, we propose a Bayesian latent variable methodology to jointly model multiple operational taxonomic units within a single taxonomic cluster. This novel method can incorporate both negative binomial and zero-inflated negative binomial responses, and can account for serial and familial correlations. We develop a Markov chain Monte Carlo algorithm that is built on a data augmentation scheme using Pólya-Gamma random variables. Hierarchical centering and parameter expansion techniques are also used to improve the convergence of the Markov chain. We evaluate the performance of our proposed method through extensive simulations. We also apply our method to a human microbiome study.

  14. Kinematic gait patterns in healthy runners: A hierarchical cluster analysis.

    Science.gov (United States)

    Phinyomark, Angkoon; Osis, Sean; Hettinga, Blayne A; Ferber, Reed

    2015-11-01

    Previous studies have demonstrated distinct clusters of gait patterns in both healthy and pathological groups, suggesting that different movement strategies may be represented. However, these studies have used discrete time point variables and usually focused on only one specific joint and plane of motion. Therefore, the first purpose of this study was to determine if running gait patterns for healthy subjects could be classified into homogeneous subgroups using three-dimensional kinematic data from the ankle, knee, and hip joints. The second purpose was to identify differences in joint kinematics between these groups. The third purpose was to investigate the practical implications of clustering healthy subjects by comparing these kinematics with runners experiencing patellofemoral pain (PFP). A principal component analysis (PCA) was used to reduce the dimensionality of the entire gait waveform data and then a hierarchical cluster analysis (HCA) determined group sets of similar gait patterns and homogeneous clusters. The results show two distinct running gait patterns were found with the main between-group differences occurring in frontal and sagittal plane knee angles (Pgait strategies. These results suggest care must be taken when selecting samples of subjects in order to investigate the pathomechanics of injured runners.

  15. The Hierarchical Clustering of Tax Burden in the EU27

    Directory of Open Access Journals (Sweden)

    Simkova Nikola

    2015-09-01

    Full Text Available The issue of taxation has become more important due to a significant share of the government revenue. There are several ways of expressing the tax burden of countries. This paper describes the traditional approach as a share of tax revenue to GDP which is applied to the total taxation and the capital taxation as a part of tax systems affecting investment decisions. The implicit tax rate on capital created by Eurostat also offers a possible explanation of the tax burden on capital, so its components are analysed in detail. This study uses one of the econometric methods called the hierarchical clustering. The data on which the clustering is based comprises countries in the EU27 for the period of 1995 – 2012. The aim of this paper is to reveal clusters of countries in the EU27 with similar tax burden or tax changes. The findings suggest that mainly newly acceding countries (2004 and 2007 are in a group of countries with a low tax burden which tried to encourage investors by favourable tax rates. On the other hand, there are mostly countries from the original EU15. Some clusters may be explained by similar historical development, geographic and demographic characteristics.

  16. Using Dynamic Quantum Clustering to Analyze Hierarchically Heterogeneous Samples on the Nanoscale

    Energy Technology Data Exchange (ETDEWEB)

    Hume, Allison; /Princeton U. /SLAC

    2012-09-07

    Dynamic Quantum Clustering (DQC) is an unsupervised, high visual data mining technique. DQC was tested as an analysis method for X-ray Absorption Near Edge Structure (XANES) data from the Transmission X-ray Microscopy (TXM) group. The TXM group images hierarchically heterogeneous materials with nanoscale resolution and large field of view. XANES data consists of energy spectra for each pixel of an image. It was determined that DQC successfully identifies structure in data of this type without prior knowledge of the components in the sample. Clusters and sub-clusters clearly reflected features of the spectra that identified chemical component, chemical environment, and density in the image. DQC can also be used in conjunction with the established data analysis technique, which does require knowledge of components present.

  17. Hierarchical star cluster assembly in globally collapsing molecular clouds

    Science.gov (United States)

    Vázquez-Semadeni, Enrique; González-Samaniego, Alejandro; Colín, Pedro

    2017-05-01

    We discuss the mechanism of cluster formation in a numerical simulation of a molecular cloud (MC) undergoing global hierarchical collapse, focusing on how the gas motions in the parent cloud control the assembly of the cluster. The global collapse implies that the star formation rate (SFR) increases over time. The collapse is hierarchical because it consists of small-scale collapses within larger scale ones. The latter culminate a few Myr later than the first small-scale ones and consist of filamentary flows that accrete on to massive central clumps. The small-scale collapses consist of clumps that are embedded in the filaments and falling on to the large-scale collapse centres. The stars formed in the early, small-scale collapses share the infall motion of their parent clumps, so that the filaments feed both gas and stars to the massive central clump. This process leads to the presence of a few older stars in a region where new protostars are forming, and also to a self-similar structure, in which each unit is composed of smaller scale subunits that approach each other and may merge. Because the older stars formed in the filaments share the infall motion of the gas on to the central clump, they tend to have larger velocities and to be distributed over larger areas than the younger stars formed in the central clump. Finally, interpreting the initial mass function (IMF) simply as a probability distribution implies that massive stars only form once the local SFR is large enough to sample the IMF up to high masses. In combination with the increase of the SFR, this implies that massive stars tend to appear late in the evolution of the MC, and only in the central massive clumps. We discuss the correspondence of these features with observed properties of young stellar clusters, finding very good qualitative agreement.

  18. Lyman Alpha Emitters in the Hierarchically Clustering Galaxy Formation

    CERN Document Server

    Kobayashi, Masakazu A R; Nagashima, Masahiro

    2007-01-01

    We present a new theoretical model for the luminosity functions (LFs) of Lyman alpha (Lya) emitting galaxies in the framework of hierarchical galaxy formation. We extend a semi-analytic model of galaxy formation that reproduces a number of observations for local galaxies, without changing the original model parameters but introducing a physically-motivated modelling to describe the escape fraction of Lya photons from host galaxies (f_esc). Though a previous study using a hierarchical clustering model simply assumed a constant and universal value of f_esc, we incorporate two new effects on f_esc: extinction by interstellar dust and galaxy-scale outflow induced as a star formation feedback. It is found that the new model nicely reproduces all the observed Lya LFs of the Lya emitters (LAEs) at different redshifts in z ~ 3--6. Our model predicts that galaxies with strong outflows and f_esc ~ 1 are dominant in the observed LFs, which is consistent with available observations while the simple universal f_esc model ...

  19. The structure of dark matter halos in hierarchical clustering theories

    CERN Document Server

    Subramanian, K; Ostriker, J P; Subramanian, Kandaswamy; Cen, Renyue; Ostriker, Jeremiah P.

    1999-01-01

    During hierarchical clustering, smaller masses generally collapse earlier than larger masses and so are denser on the average. The core of a small mass halo could be dense enough to resist disruption and survive undigested, when it is incorporated into a bigger object. We explore the possibility that a nested sequence of undigested cores in the center of the halo, which have survived the hierarchical, inhomogeneous collapse to form larger and larger objects, determines the halo structure in the inner regions. For a flat universe with $P(k) \\propto k^n$, scaling arguments then suggest that the core density profile is, $\\rho \\propto r^{-\\alpha}$ with $\\alpha = (9+3n)/(5+n)$. But whether such behaviour obtains depends on detailed dynamics. We first examine the dynamics using a fluid approach to the self-similar collapse solutions for the dark matter phase space density, including the effect of velocity dispersions. We highlight the importance of tangential velocity dispersions to obtain density profiles shallowe...

  20. Hierarchical Compressed Sensing for Cluster Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Vishal Krishna Singh

    2016-02-01

    Full Text Available Data transmission consumes significant amount of energy in large scale wireless sensor networks (WSNs. In such an environment, reducing the in-network communication and distributing the load evenly over the network can reduce the overall energy consumption and maximize the network lifetime significantly. In this work, the aforementioned problem of network lifetime and uneven energy consumption in large scale wireless sensor networks is addressed. This work proposes a hierarchical compressed sensing (HCS scheme to reduce the in-network communication during the data gathering process. Co-related sensor readings are collected via a hierarchical clustering scheme. A compressed sensing (CS based data processing scheme is devised to transmit the data from the source to the sink. The proposed HCS is able to identify the optimal position for the application of CS to achieve reduced and similar number of transmissions on all the nodes in the network. An activity map is generated to validate the reduced and uniformly distributed communication load of the WSN. Based on the number of transmissions per data gathering round, the bit-hop metric model is used to analyse the overall energy consumption. Simulation results validate the efficiency of the proposed method over the existing CS based approaches.

  1. Hand Tracking based on Hierarchical Clustering of Range Data

    CERN Document Server

    Cespi, Roberto; Lindner, Marvin

    2011-01-01

    Fast and robust hand segmentation and tracking is an essential basis for gesture recognition and thus an important component for contact-less human-computer interaction (HCI). Hand gesture recognition based on 2D video data has been intensively investigated. However, in practical scenarios purely intensity based approaches suffer from uncontrollable environmental conditions like cluttered background colors. In this paper we present a real-time hand segmentation and tracking algorithm using Time-of-Flight (ToF) range cameras and intensity data. The intensity and range information is fused into one pixel value, representing its combined intensity-depth homogeneity. The scene is hierarchically clustered using a GPU based parallel merging algorithm, allowing a robust identification of both hands even for inhomogeneous backgrounds. After the detection, both hands are tracked on the CPU. Our tracking algorithm can cope with the situation that one hand is temporarily covered by the other hand.

  2. Identifying Reference Objects by Hierarchical Clustering in Java Environment

    Directory of Open Access Journals (Sweden)

    RAHUL SAHA

    2011-09-01

    Full Text Available Recently Java programming environment has become so popular. Java programming language is a language that is designed to be portable enough to be executed in wide range of computers ranging from cell phones to supercomputers. Computer programs written in Java are compiled into Java Byte code instructions that are suitable for execution by a Java Virtual Machine implementation. Java virtual Machine is commonly implemented in software by means of an interpreter for the Java Virtual Machine instruction set. As an object oriented language, Java utilizes the concept of objects. Our idea is to identify the candidate objects references in a Java environment through hierarchical cluster analysis using reference stack and execution stack.

  3. Novel density-based and hierarchical density-based clustering algorithms for uncertain data.

    Science.gov (United States)

    Zhang, Xianchao; Liu, Han; Zhang, Xiaotong

    2017-09-01

    Uncertain data has posed a great challenge to traditional clustering algorithms. Recently, several algorithms have been proposed for clustering uncertain data, and among them density-based techniques seem promising for handling data uncertainty. However, some issues like losing uncertain information, high time complexity and nonadaptive threshold have not been addressed well in the previous density-based algorithm FDBSCAN and hierarchical density-based algorithm FOPTICS. In this paper, we firstly propose a novel density-based algorithm PDBSCAN, which improves the previous FDBSCAN from the following aspects: (1) it employs a more accurate method to compute the probability that the distance between two uncertain objects is less than or equal to a boundary value, instead of the sampling-based method in FDBSCAN; (2) it introduces new definitions of probability neighborhood, support degree, core object probability, direct reachability probability, thus reducing the complexity and solving the issue of nonadaptive threshold (for core object judgement) in FDBSCAN. Then, we modify the algorithm PDBSCAN to an improved version (PDBSCANi), by using a better cluster assignment strategy to ensure that every object will be assigned to the most appropriate cluster, thus solving the issue of nonadaptive threshold (for direct density reachability judgement) in FDBSCAN. Furthermore, as PDBSCAN and PDBSCANi have difficulties for clustering uncertain data with non-uniform cluster density, we propose a novel hierarchical density-based algorithm POPTICS by extending the definitions of PDBSCAN, adding new definitions of fuzzy core distance and fuzzy reachability distance, and employing a new clustering framework. POPTICS can reveal the cluster structures of the datasets with different local densities in different regions better than PDBSCAN and PDBSCANi, and it addresses the issues in FOPTICS. Experimental results demonstrate the superiority of our proposed algorithms over the existing

  4. The reflection of hierarchical cluster analysis of co-occurrence matrices in SPSS

    NARCIS (Netherlands)

    Zhou, Q.; Leng, F.; Leydesdorff, L.

    2015-01-01

    Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the SPSS hierarchical clustering module for co-occurrence matrices in order to compare the

  5. The reflection of hierarchical cluster analysis of co-occurrence matrices in SPSS

    NARCIS (Netherlands)

    Zhou, Q.; Leng, F.; Leydesdorff, L.

    2015-01-01

    Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the SPSS hierarchical clustering module for co-occurrence matrices in order to compare

  6. Multilevel Techniques for the Clustering Problem

    Directory of Open Access Journals (Sweden)

    Noureddine Bouhmala

    2014-02-01

    Full Text Available Data Mining is concerned with the discovery of int eresting patterns and knowledge in data repositories. Cluster Analysis which belongs to the core methods of data mining is the process of discovering homogeneous groups called clusters. Given a data-set and some measure of similarity between data objects, the goal in most c lustering algorithms is maximizing both the homogeneity within each cluster and the heterogene ity between different clusters. In this work, two multilevel algorithms for the clustering problem are introduced. The multilevel paradigm suggests looking at the clustering proble m as a hierarchical optimization process going through different levels evolving from a coar se grain to fine grain strategy. The clustering problem is solved by first reducing the problem level by level to a coarser problem where an initial clustering is computed. The clustering of the coarser problem is mapped back level-by- level to obtain a better clustering of the original problem by refining the intermediate different clustering obtained at various levels. A benchmark using a number of data sets collected from a variety of domains is used to compare the effective ness of the hierarchical approach against its single-level counterpart.

  7. Hierarchical clusters in families with type 2 diabetes

    Science.gov (United States)

    García-Solano, Beatriz; Gallegos-Cabriales, Esther C; Gómez-Meza, Marco V; García-Madrid, Guillermina; Flores-Merlo, Marcela; García-Solano, Mauro

    2015-01-01

    Families represent more than a set of individuals; family is more than a sum of its individual members. With this classification, nurses can identify the family health-illness beliefs obey family as a unit concept, and plan family inclusion into the type 2 diabetes treatment, whom is not considered in public policy, despite families share diet, exercise, and self-monitoring with a member who suffers type 2 diabetes. The aim of this study was to determine whether the characteristics, functionality, routines, and family and individual health in type 2 diabetes describes the differences and similarities between families to consider them as a unit. We performed an exploratory, descriptive hierarchical cluster analysis of 61 families using three instruments and a questionnaire, in addition to weight, height, body fat percentage, hemoglobin A1c, total cholesterol, triglycerides, low-density lipoprotein and high-density lipoprotein. The analysis produced three groups of families. Wilk’s lambda demonstrated statistically significant differences provided by age (Λ = 0.778, F = 2.098, p = 0.010) and family health (Λ = 0.813, F = 2.650, p = 0.023). A post hoc Tukey test coincided with the three subsets. Families with type 2 diabetes have common elements that make them similar, while sharing differences that make them unique. PMID:27347419

  8. The formation of NGC 3603 young starburst cluster: "prompt" hierarchical assembly or monolithic starburst?

    CERN Document Server

    Banerjee, Sambaran

    2014-01-01

    The formation of very young massive clusters or "starburst" clusters is currently one of the most widely debated topic in astronomy. The classical notion dictates that a star cluster is formed in-situ in a dense molecular gas clump followed by a substantial residual gas expulsion. On the other hand, based on the observed morphologies of many young stellar associations, a hierarchical formation scenario is alternatively suggested. A very young (age $\\approx$ 1 Myr), massive ($>10^4M_\\odot$) star cluster like the Galactic NGC 3603 young cluster (HD 97950) is an appropriate testbed for distinguishing between such "monolithic" and "hierarchical" formation scenarios. A recent study by Banerjee and Kroupa (2014) demonstrates that the monolithic scenario remarkably reproduces the HD 97950 cluster. In the present work, we explore the possibility of the formation of the above cluster via hierarchical assembly of subclusters. These subclusters are initially distributed over a wide range of spatial volumes and have vari...

  9. A COMPARISON BETWEEN SINGLE LINKAGE AND COMPLETE LINKAGE IN AGGLOMERATIVE HIERARCHICAL CLUSTER ANALYSIS FOR IDENTIFYING TOURISTS SEGMENTS

    OpenAIRE

    Noor Rashidah Rashid

    2012-01-01

    Cluster Analysis is a multivariate method in statistics. Agglomerative Hierarchical Cluster Analysis is one of approaches in Cluster Analysis. There are two linkage methods in Agglomerative Hierarchical Cluster Analysis which are Single Linkage and Complete Linkage. The purpose of this study is to compare between Single Linkage and Complete Linkage in Agglomerative Hierarchical Cluster Analysis. The comparison of performances between these linkage methods was shown by using Kruskal-Wallis tes...

  10. A dynamic hierarchical clustering method for trajectory-based unusual video event detection.

    Science.gov (United States)

    Jiang, Fan; Wu, Ying; Katsaggelos, Aggelos K

    2009-04-01

    The proposed unusual video event detection method is based on unsupervised clustering of object trajectories, which are modeled by hidden Markov models (HMM). The novelty of the method includes a dynamic hierarchical process incorporated in the trajectory clustering algorithm to prevent model overfitting and a 2-depth greedy search strategy for efficient clustering.

  11. THE EVOLUTION OF BRIGHTEST CLUSTER GALAXIES IN A HIERARCHICAL UNIVERSE

    Energy Technology Data Exchange (ETDEWEB)

    Tonini, Chiara; Bernyk, Maksym; Croton, Darren [Centre for Astrophysics and Supercomputing, Swinburne University of Technology, Melbourne, VIC 3122 (Australia); Maraston, Claudia; Thomas, Daniel [Institute of Cosmology and Gravitation, University of Portsmouth, Portsmouth PO1 3FX (United Kingdom)

    2012-11-01

    We investigate the evolution of brightest cluster galaxies (BCGs) from redshift z {approx} 1.6 to z = 0. We upgrade the hierarchical semi-analytic model of Croton et al. with a new spectro-photometric model that produces realistic galaxy spectra, making use of the Maraston stellar populations and a new recipe for the dust extinction. We compare the model predictions of the K-band luminosity evolution and the J - K, V - I, and I - K color evolution with a series of data sets, including those of Collins et al. who argued that semi-analytic models based on the Millennium simulation cannot reproduce the red colors and high luminosity of BCGs at z > 1. We show instead that the model is well in range of the observed luminosity and correctly reproduces the color evolution of BCGs in the whole redshift range up to z {approx} 1.6. We argue that the success of the semi-analytic model is in large part due to the implementation of a more sophisticated spectro-photometric model. An analysis of the model BCGs shows an increase in mass by a factor of 2-3 since z {approx} 1, and star formation activity down to low redshifts. While the consensus regarding BCGs is that they are passively evolving, we argue that this conclusion is affected by the degeneracy between star formation history and stellar population models used in spectral energy distribution fitting, and by the inefficacy of toy models of passive evolution to capture the complexity of real galaxies, especially those with rich merger histories like BCGs. Following this argument, we also show that in the semi-analytic model the BCGs show a realistic mix of stellar populations, and that these stellar populations are mostly old. In addition, the age-redshift relation of the model BCGs follows that of the universe, meaning that given their merger history and star formation history, the ageing of BCGs is always dominated by the ageing of their stellar populations. In a {Lambda}CDM universe, we define such evolution as &apos

  12. Using hierarchical clustering methods to classify motor activities of COPD patients from wearable sensor data

    Directory of Open Access Journals (Sweden)

    Reilly John J

    2005-06-01

    Full Text Available Abstract Background Advances in miniature sensor technology have led to the development of wearable systems that allow one to monitor motor activities in the field. A variety of classifiers have been proposed in the past, but little has been done toward developing systematic approaches to assess the feasibility of discriminating the motor tasks of interest and to guide the choice of the classifier architecture. Methods A technique is introduced to address this problem according to a hierarchical framework and its use is demonstrated for the application of detecting motor activities in patients with chronic obstructive pulmonary disease (COPD undergoing pulmonary rehabilitation. Accelerometers were used to collect data for 10 different classes of activity. Features were extracted to capture essential properties of the data set and reduce the dimensionality of the problem at hand. Cluster measures were utilized to find natural groupings in the data set and then construct a hierarchy of the relationships between clusters to guide the process of merging clusters that are too similar to distinguish reliably. It provides a means to assess whether the benefits of merging for performance of a classifier outweigh the loss of resolution incurred through merging. Results Analysis of the COPD data set demonstrated that motor tasks related to ambulation can be reliably discriminated from tasks performed in a seated position with the legs in motion or stationary using two features derived from one accelerometer. Classifying motor tasks within the category of activities related to ambulation requires more advanced techniques. While in certain cases all the tasks could be accurately classified, in others merging clusters associated with different motor tasks was necessary. When merging clusters, it was found that the proposed method could lead to more than 12% improvement in classifier accuracy while retaining resolution of 4 tasks. Conclusion Hierarchical

  13. Using hierarchical clustering methods to classify motor activities of COPD patients from wearable sensor data

    Science.gov (United States)

    Sherrill, Delsey M; Moy, Marilyn L; Reilly, John J; Bonato, Paolo

    2005-01-01

    Background Advances in miniature sensor technology have led to the development of wearable systems that allow one to monitor motor activities in the field. A variety of classifiers have been proposed in the past, but little has been done toward developing systematic approaches to assess the feasibility of discriminating the motor tasks of interest and to guide the choice of the classifier architecture. Methods A technique is introduced to address this problem according to a hierarchical framework and its use is demonstrated for the application of detecting motor activities in patients with chronic obstructive pulmonary disease (COPD) undergoing pulmonary rehabilitation. Accelerometers were used to collect data for 10 different classes of activity. Features were extracted to capture essential properties of the data set and reduce the dimensionality of the problem at hand. Cluster measures were utilized to find natural groupings in the data set and then construct a hierarchy of the relationships between clusters to guide the process of merging clusters that are too similar to distinguish reliably. It provides a means to assess whether the benefits of merging for performance of a classifier outweigh the loss of resolution incurred through merging. Results Analysis of the COPD data set demonstrated that motor tasks related to ambulation can be reliably discriminated from tasks performed in a seated position with the legs in motion or stationary using two features derived from one accelerometer. Classifying motor tasks within the category of activities related to ambulation requires more advanced techniques. While in certain cases all the tasks could be accurately classified, in others merging clusters associated with different motor tasks was necessary. When merging clusters, it was found that the proposed method could lead to more than 12% improvement in classifier accuracy while retaining resolution of 4 tasks. Conclusion Hierarchical clustering methods are relevant

  14. Quartile Clustering: A quartile based technique for Generating Meaningful Clusters

    CERN Document Server

    Goswami, Saptarsi

    2012-01-01

    Clustering is one of the main tasks in exploratory data analysis and descriptive statistics where the main objective is partitioning observations in groups. Clustering has a broad range of application in varied domains like climate, business, information retrieval, biology, psychology, to name a few. A variety of methods and algorithms have been developed for clustering tasks in the last few decades. We observe that most of these algorithms define a cluster in terms of value of the attributes, density, distance etc. However these definitions fail to attach a clear meaning/semantics to the generated clusters. We argue that clusters having understandable and distinct semantics defined in terms of quartiles/halves are more appealing to business analysts than the clusters defined by data boundaries or prototypes. On the samepremise, we propose our new algorithm named as quartile clustering technique. Through a series of experiments we establish efficacy of this algorithm. We demonstrate that the quartile clusteri...

  15. The Hierarchical Distribution of the Young Stellar Clusters in Six Local Star-forming Galaxies

    Science.gov (United States)

    Grasha, K.; Calzetti, D.; Adamo, A.; Kim, H.; Elmegreen, B. G.; Gouliermis, D. A.; Dale, D. A.; Fumagalli, M.; Grebel, E. K.; Johnson, K. E.; Kahre, L.; Kennicutt, R. C.; Messa, M.; Pellerin, A.; Ryon, J. E.; Smith, L. J.; Shabani, F.; Thilker, D.; Ubeda, L.

    2017-05-01

    We present a study of the hierarchical clustering of the young stellar clusters in six local (3-15 Mpc) star-forming galaxies using Hubble Space Telescope broadband WFC3/UVIS UV and optical images from the Treasury Program LEGUS (Legacy ExtraGalactic UV Survey). We identified 3685 likely clusters and associations, each visually classified by their morphology, and we use the angular two-point correlation function to study the clustering of these stellar systems. We find that the spatial distribution of the young clusters and associations are clustered with respect to each other, forming large, unbound hierarchical star-forming complexes that are in general very young. The strength of the clustering decreases with increasing age of the star clusters and stellar associations, becoming more homogeneously distributed after ˜40-60 Myr and on scales larger than a few hundred parsecs. In all galaxies, the associations exhibit a global behavior that is distinct and more strongly correlated from compact clusters. Thus, populations of clusters are more evolved than associations in terms of their spatial distribution, traveling significantly from their birth site within a few tens of Myr, whereas associations show evidence of disruption occurring very quickly after their formation. The clustering of the stellar systems resembles that of a turbulent interstellar medium that drives the star formation process, correlating the components in unbound star-forming complexes in a hierarchical manner, dispersing shortly after formation, suggestive of a single, continuous mode of star formation across all galaxies.

  16. Exploitation of Clustering Techniques in Transactional Healthcare Data

    Directory of Open Access Journals (Sweden)

    Naeem Ahmad Mahoto

    2014-03-01

    Full Text Available Healthcare service centres equipped with electronic health systems have improved their resources as well as treatment processes. The dynamic nature of healthcare data of each individual makes it complex and difficult for physicians to manually mediate them; therefore, automatic techniques are essential to manage the quality and standardization of treatment procedures. Exploratory data analysis, patternanalysis and grouping of data is managed using clustering techniques, which work as an unsupervised classification. A number of healthcare applications are developed that use several data mining techniques for classification, clustering and extracting useful information from healthcare data. The challenging issue in this domain is to select adequate data mining algorithm for optimal results. This paper exploits three different clustering algorithms: DBSCAN (Density-Based Clustering, agglomerative hierarchical and k-means in real transactional healthcare data of diabetic patients (taken as case study to analyse their performance in large and dispersed healthcare data. The best solution of cluster sets among the exploited algorithms is evaluated using clustering quality indexes and is selected to identify the possible subgroups of patients having similar treatment patterns

  17. 3D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

    DEFF Research Database (Denmark)

    Suhaibah, A.; Uznir, U.; Antón Castro, Francesc/François

    2016-01-01

    , with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our...... findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results...... of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However...

  18. Hierarchical Control for Multiple DC-Microgrids Clusters

    DEFF Research Database (Denmark)

    Shafiee, Qobad; Dragicevic, Tomislav; Vasquez, Juan Carlos

    2014-01-01

    DC microgrids (MGs) have gained research interest during the recent years because of many potential advantages as compared to the ac system. To ensure reliable operation of a low-voltage dc MG as well as its intelligent operation with the other DC MGs, a hierarchical control is proposed in this p......DC microgrids (MGs) have gained research interest during the recent years because of many potential advantages as compared to the ac system. To ensure reliable operation of a low-voltage dc MG as well as its intelligent operation with the other DC MGs, a hierarchical control is proposed...

  19. Hierarchical cluster analysis of progression patterns in open-angle glaucoma patients with medical treatment.

    Science.gov (United States)

    Bae, Hyoung Won; Rho, Seungsoo; Lee, Hye Sun; Lee, Naeun; Hong, Samin; Seong, Gong Je; Sung, Kyung Rim; Kim, Chan Yun

    2014-04-29

    To classify medically treated open-angle glaucoma (OAG) by the pattern of progression using hierarchical cluster analysis, and to determine OAG progression characteristics by comparing clusters. Ninety-five eyes of 95 OAG patients who received medical treatment, and who had undergone visual field (VF) testing at least once per year for 5 or more years. OAG was classified into subgroups using hierarchical cluster analysis based on the following five variables: baseline mean deviation (MD), baseline visual field index (VFI), MD slope, VFI slope, and Glaucoma Progression Analysis (GPA) printout. After that, other parameters were compared between clusters. Two clusters were made after a hierarchical cluster analysis. Cluster 1 showed -4.06 ± 2.43 dB baseline MD, 92.58% ± 6.27% baseline VFI, -0.28 ± 0.38 dB per year MD slope, -0.52% ± 0.81% per year VFI slope, and all "no progression" cases in GPA printout, whereas cluster 2 showed -8.68 ± 3.81 baseline MD, 77.54 ± 12.98 baseline VFI, -0.72 ± 0.55 MD slope, -2.22 ± 1.89 VFI slope, and seven "possible" and four "likely" progression cases in GPA printout. There were no significant differences in age, sex, mean IOP, central corneal thickness, and axial length between clusters. However, cluster 2 included more high-tension glaucoma patients and used a greater number of antiglaucoma eye drops significantly compared with cluster 1. Hierarchical cluster analysis of progression patterns divided OAG into slow and fast progression groups, evidenced by assessing the parameters of glaucomatous progression in VF testing. In the fast progression group, the prevalence of high-tension glaucoma was greater and the number of antiglaucoma medications administered was increased versus the slow progression group. Copyright 2014 The Association for Research in Vision and Ophthalmology, Inc.

  20. DATA CLASSIFICATION WITH NEURAL CLASSIFIER USING RADIAL BASIS FUNCTION WITH DATA REDUCTION USING HIERARCHICAL CLUSTERING

    Directory of Open Access Journals (Sweden)

    M. Safish Mary

    2012-04-01

    Full Text Available Classification of large amount of data is a time consuming process but crucial for analysis and decision making. Radial Basis Function networks are widely used for classification and regression analysis. In this paper, we have studied the performance of RBF neural networks to classify the sales of cars based on the demand, using kernel density estimation algorithm which produces classification accuracy comparable to data classification accuracy provided by support vector machines. In this paper, we have proposed a new instance based data selection method where redundant instances are removed with help of a threshold thus improving the time complexity with improved classification accuracy. The instance based selection of the data set will help reduce the number of clusters formed thereby reduces the number of centers considered for building the RBF network. Further the efficiency of the training is improved by applying a hierarchical clustering technique to reduce the number of clusters formed at every step. The paper explains the algorithm used for classification and for conditioning the data. It also explains the complexities involved in classification of sales data for analysis and decision-making.

  1. Periorbital melasma: Hierarchical cluster analysis of clinical features in Asian patients.

    Science.gov (United States)

    Jung, Y S; Bae, J M; Kim, B J; Kang, J-S; Cho, S B

    2017-03-19

    Studies have shown melasma lesions to be distributed across the face in centrofacial, malar, and mandibular patterns. Meanwhile, however, melasma lesions of the periorbital area have yet to be thoroughly described. We analyzed normal and ultraviolet light-exposed photographs of patients with melasma. The periorbital melasma lesions were measured according to anatomical reference points and a hierarchical cluster analysis was performed. The periorbital melasma lesions showed clinical features of fine and homogenous melasma pigmentation, involving both the upper and lower eyelids that extended to other anatomical sites with a darker and coarser appearance. The hierarchical cluster analysis indicated that patients with periorbital melasma can be categorized into two clusters according to the surface anatomy of the face. Significant differences between cluster 1 and cluster 2 were found in lateral distance and inferolateral distance, but not in medial distance and superior distance. Comparing the two clusters, patients in cluster 2 were found to be significantly older and more commonly accompanied by melasma lesions of the temple and medial cheek. Our hierarchical cluster analysis of periorbital melasma lesions demonstrated that Asian patients with periorbital melasma can be categorized into two clusters according to the surface anatomy of the face. © 2017 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

  2. Percolation technique for galaxy clustering

    Science.gov (United States)

    Klypin, Anatoly; Shandarin, Sergei F.

    1993-01-01

    We study percolation in mass and galaxy distributions obtained in 3D simulations of the CDM, C + HDM, and the power law (n = -1) models in the Omega = 1 universe. Percolation statistics is used here as a quantitative measure of the degree to which a mass or galaxy distribution is of a filamentary or cellular type. The very fast code used calculates the statistics of clusters along with the direct detection of percolation. We found that the two parameters mu(infinity), characterizing the size of the largest cluster, and mu-squared, characterizing the weighted mean size of all clusters excluding the largest one, are extremely useful for evaluating the percolation threshold. An advantage of using these parameters is their low sensitivity to boundary effects. We show that both the CDM and the C + HDM models are extremely filamentary both in mass and galaxy distribution. The percolation thresholds for the mass distributions are determined.

  3. Evaluation by hierarchical clustering of multiple cytokine expression after phytohemagglutinin stimulation

    Directory of Open Access Journals (Sweden)

    Yang Chunhe

    2016-01-01

    Full Text Available The hierarchical clustering method has been used for exploration of gene expression and proteomic profiles; however, little research into its application in the examination of expression of multiplecytokine/chemokine responses to stimuli has been reported. Thus, little progress has been made on how phytohemagglutinin(PHA affects cytokine expression profiling on a large scale in the human hematological system. To investigate the characteristic expression pattern under PHA stimulation, Luminex, a multiplex bead-based suspension array, was performed. The data set collected from human peripheral blood mononuclear cells (PBMC was analyzed using the hierarchical clustering method. It was revealed that two specific chemokines (CCL3 andCCL4 underwent significantly greater quantitative changes during induction of expression than other tested cytokines/chemokines after PHA stimulation. This result indicates that hierarchical clustering is a useful tool for detecting fine patterns during exploration of biological data, and that it can play an important role in comparative studies.

  4. Hierarchical trie packet classification algorithm based on expectation-maximization clustering

    Science.gov (United States)

    Bi, Xia-an; Zhao, Junxia

    2017-01-01

    With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. PMID:28704476

  5. Hierarchical Spread Spectrum Fingerprinting Scheme Based on the CDMA Technique

    Directory of Open Access Journals (Sweden)

    Kuribayashi Minoru

    2011-01-01

    Full Text Available Abstract Digital fingerprinting is a method to insert user's own ID into digital contents in order to identify illegal users who distribute unauthorized copies. One of the serious problems in a fingerprinting system is the collusion attack such that several users combine their copies of the same content to modify/delete the embedded fingerprints. In this paper, we propose a collusion-resistant fingerprinting scheme based on the CDMA technique. Our fingerprint sequences are orthogonal sequences of DCT basic vectors modulated by PN sequence. In order to increase the number of users, a hierarchical structure is produced by assigning a pair of the fingerprint sequences to a user. Under the assumption that the frequency components of detected sequences modulated by PN sequence follow Gaussian distribution, the design of thresholds and the weighting of parameters are studied to improve the performance. The robustness against collusion attack and the computational costs required for the detection are estimated in our simulation.

  6. The Evolution of Galaxy Clustering in Hierarchical Models

    OpenAIRE

    1999-01-01

    The main ingredients of recent semi-analytic models of galaxy formation are summarised. We present predictions for the galaxy clustering properties of a well specified LCDM model whose parameters are constrained by observed local galaxy properties. We present preliminary predictions for evolution of clustering that can be probed with deep pencil beam surveys.

  7. Clinical fracture risk evaluated by hierarchical agglomerative clustering

    DEFF Research Database (Denmark)

    Kruse, Christian; Eiken, P; Vestergaard, P

    2017-01-01

    profiles. INTRODUCTION: The purposes of this study were to establish and quantify patient clusters of high, average and low fracture risk using an unsupervised machine learning algorithm. METHODS: Regional and national Danish patient data on dual-energy X-ray absorptiometry (DXA) scans, medication...... containing less than 250 subjects. Clusters were identified as high, average or low fracture risk based on bone mineral density (BMD) characteristics. Cluster-based descriptive statistics and relative Z-scores for variable means were computed. RESULTS: Ten thousand seven hundred seventy-five women were...... as low fracture risk with high to very high BMD. A mean age of 60 years was the earliest that allowed for separation of high-risk clusters. DXA scan results could identify high-risk subjects with different antiresorptive treatment compliance levels based on similarities and differences in lumbar spine...

  8. Mapping informative clusters in a hierarchical [corrected] framework of FMRI multivariate analysis.

    Directory of Open Access Journals (Sweden)

    Rui Xu

    Full Text Available Pattern recognition methods have become increasingly popular in fMRI data analysis, which are powerful in discriminating between multi-voxel patterns of brain activities associated with different mental states. However, when they are used in functional brain mapping, the location of discriminative voxels varies significantly, raising difficulties in interpreting the locus of the effect. Here we proposed a hierarchical framework of multivariate approach that maps informative clusters rather than voxels to achieve reliable functional brain mapping without compromising the discriminative power. In particular, we first searched for local homogeneous clusters that consisted of voxels with similar response profiles. Then, a multi-voxel classifier was built for each cluster to extract discriminative information from the multi-voxel patterns. Finally, through multivariate ranking, outputs from the classifiers were served as a multi-cluster pattern to identify informative clusters by examining interactions among clusters. Results from both simulated and real fMRI data demonstrated that this hierarchical approach showed better performance in the robustness of functional brain mapping than traditional voxel-based multivariate methods. In addition, the mapped clusters were highly overlapped for two perceptually equivalent object categories, further confirming the validity of our approach. In short, the hierarchical framework of multivariate approach is suitable for both pattern classification and brain mapping in fMRI studies.

  9. Customer Data Clustering using Data Mining Technique

    CERN Document Server

    Rajagopal, Dr Sankar

    2011-01-01

    Classification and patterns extraction from customer data is very important for business support and decision making. Timely identification of newly emerging trends is very important in business process. Large companies are having huge volume of data but starving for knowledge. To overcome the organization current issue, the new breed of technique is required that has intelligence and capability to solve the knowledge scarcity and the technique is called Data mining. The objectives of this paper are to identify the high-profit, high-value and low-risk customers by one of the data mining technique - customer clustering. In the first phase, cleansing the data and developed the patterns via demographic clustering algorithm using IBM I-Miner. In the second phase, profiling the data, develop the clusters and identify the high-value low-risk customers. This cluster typically represents the 10-20 percent of customers which yields 80% of the revenue.

  10. Hierarchical cluster-tendency analysis of the group structure in the foreign exchange market

    Science.gov (United States)

    Wu, Xin-Ye; Zheng, Zhi-Gang

    2013-08-01

    A hierarchical cluster-tendency (HCT) method in analyzing the group structure of networks of the global foreign exchange (FX) market is proposed by combining the advantages of both the minimal spanning tree (MST) and the hierarchical tree (HT). Fifty currencies of the top 50 World GDP in 2010 according to World Bank's database are chosen as the underlying system. By using the HCT method, all nodes in the FX market network can be "colored" and distinguished. We reveal that the FX networks can be divided into two groups, i.e., the Asia-Pacific group and the Pan-European group. The results given by the hierarchical cluster-tendency method agree well with the formerly observed geographical aggregation behavior in the FX market. Moreover, an oil-resource aggregation phenomenon is discovered by using our method. We find that gold could be a better numeraire for the weekly-frequency FX data.

  11. Prediction of in vitro and in vivo oestrogen receptor activity using hierarchical clustering

    Science.gov (United States)

    In this study, hierarchical clustering classification models were developed to predict in vitro and in vivo oestrogen receptor (ER) activity. Classification models were developed for binding, agonist, and antagonist in vitro ER activity and for mouse in vivo uterotrophic ER bindi...

  12. Non-Hierarchical Clustering as a method to analyse an open-ended ...

    African Journals Online (AJOL)

    Apple

    tests, provide instructors with tools to probe students' conceptual knowledge of various fields of science and ... quantitative non-hierarchical clustering analysis method known as k-means (Everitt, Landau, Leese & Stahl, ...... undergraduate engineering students in creating ... mathematics-formal reasoning and the contextual.

  13. Prediction of in vitro and in vivo oestrogen receptor activity using hierarchical clustering

    Science.gov (United States)

    In this study, hierarchical clustering classification models were developed to predict in vitro and in vivo oestrogen receptor (ER) activity. Classification models were developed for binding, agonist, and antagonist in vitro ER activity and for mouse in vivo uterotrophic ER bindi...

  14. Principal component analysis vs. self-organizing maps combined with hierarchical clustering for pattern recognition in volcano seismic spectra

    Science.gov (United States)

    Unglert, K.; Radić, V.; Jellinek, A. M.

    2016-06-01

    Variations in the spectral content of volcano seismicity related to changes in volcanic activity are commonly identified manually in spectrograms. However, long time series of monitoring data at volcano observatories require tools to facilitate automated and rapid processing. Techniques such as self-organizing maps (SOM) and principal component analysis (PCA) can help to quickly and automatically identify important patterns related to impending eruptions. For the first time, we evaluate the performance of SOM and PCA on synthetic volcano seismic spectra constructed from observations during two well-studied eruptions at Klauea Volcano, Hawai'i, that include features observed in many volcanic settings. In particular, our objective is to test which of the techniques can best retrieve a set of three spectral patterns that we used to compose a synthetic spectrogram. We find that, without a priori knowledge of the given set of patterns, neither SOM nor PCA can directly recover the spectra. We thus test hierarchical clustering, a commonly used method, to investigate whether clustering in the space of the principal components and on the SOM, respectively, can retrieve the known patterns. Our clustering method applied to the SOM fails to detect the correct number and shape of the known input spectra. In contrast, clustering of the data reconstructed by the first three PCA modes reproduces these patterns and their occurrence in time more consistently. This result suggests that PCA in combination with hierarchical clustering is a powerful practical tool for automated identification of characteristic patterns in volcano seismic spectra. Our results indicate that, in contrast to PCA, common clustering algorithms may not be ideal to group patterns on the SOM and that it is crucial to evaluate the performance of these tools on a control dataset prior to their application to real data.

  15. Analysis of genomic signatures in prokaryotes using multinomial regression and hierarchical clustering

    DEFF Research Database (Denmark)

    Ussery, David; Bohlin, Jon; Skjerve, Eystein

    2009-01-01

    Recently there has been an explosion in the availability of bacterial genomic sequences, making possible now an analysis of genomic signatures across more than 800 hundred different bacterial chromosomes, from a wide variety of environments. Using genomic signatures, we pair-wise compared 867...... different genomic DNA sequences, taken from chromosomes and plasmids more than 100,000 base-pairs in length. Hierarchical clustering was performed on the outcome of the comparisons before a multinomial regression model was fitted. The regression model included the cluster groups as the response variable...... AT content. Small improvements to the regression model, although significant, were also obtained by factors such as sequence size, habitat, growth temperature, selective pressure measured as oligonucleotide usage variance, and oxygen requirement.The statistics obtained using hierarchical clustering...

  16. Signatures of Hierarchical Clustering in Dark Matter Detection Experiments

    CERN Document Server

    Stiff, D; Frieman, Joshua A

    2001-01-01

    In the cold dark matter model of structure formation, galaxies are assembled hierarchically from mergers and the accretion of subclumps. This process is expected to leave residual substructure in the Galactic dark halo, including partially disrupted clumps and their associated tidal debris. We develop a model for such halo substructure and study its implications for dark matter (WIMP and axion) detection experiments. We combine the Press-Schechter model for the distribution of halo subclump masses with N-body simulations of the evolution and disruption of individual clumps as they orbit through the evolving Galaxy to derive the probability that the Earth is passing through a subclump or stream of a given density. Our results suggest that it is likely that the local complement of dark matter particles includes a 1-5% contribution from a single clump. The implications for dark matter detection experiments are significant, since the disrupted clump is composed of a `cold' flow of high-velocity particles. We desc...

  17. Graph visualization techniques for web clustering engines.

    Science.gov (United States)

    Di Giacomo, Emilio; Didimo, Walter; Grilli, Luca; Liotta, Giuseppe

    2007-01-01

    One of the most challenging issues in mining information from the World Wide Web is the design of systems that present the data to the end user by clustering them into meaningful semantic categories. We show that the analysis of the results of a clustering engine can significantly take advantage of enhanced graph drawing and visualization techniques. We propose a graph-based user interface for Web clustering engines that makes it possible for the user to explore and visualize the different semantic categories and their relationships at the desired level of detail.

  18. WORMHOLE ATTACK MITIGATION IN MANET: A CLUSTER BASED AVOIDANCE TECHNIQUE

    Directory of Open Access Journals (Sweden)

    Subhashis Banerjee

    2014-01-01

    Full Text Available A Mobile Ad-Hoc Network (MANET is a self configuring, infrastructure less network of mobile devices connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic topology, rapid deployment practices, and the hostile environments in which they may be deployed, make MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this attack a malicious node captures packets from one location in the network, and tunnels them to another colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32- bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the wormhole nodes in the case of exposed attack is also given by using this method.

  19. Clustering dynamic textures with the hierarchical em algorithm for modeling video.

    Science.gov (United States)

    Mumtaz, Adeel; Coviello, Emanuele; Lanckriet, Gert R G; Chan, Antoni B

    2013-07-01

    Dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model has been applied to a wide variety of computer vision problems, such as motion segmentation, motion classification, and video registration. In this paper, we derive a new algorithm for clustering DT models that is based on the hierarchical EM algorithm. The proposed clustering algorithm is capable of both clustering DTs and learning novel DT cluster centers that are representative of the cluster members in a manner that is consistent with the underlying generative probabilistic model of the DT. We also derive an efficient recursive algorithm for sensitivity analysis of the discrete-time Kalman smoothing filter, which is used as the basis for computing expectations in the E-step of the HEM algorithm. Finally, we demonstrate the efficacy of the clustering algorithm on several applications in motion analysis, including hierarchical motion clustering, semantic motion annotation, and learning bag-of-systems (BoS) codebooks for dynamic texture recognition.

  20. HCsnip: An R Package for Semi-supervised Snipping of the Hierarchical Clustering Tree.

    Science.gov (United States)

    Obulkasim, Askar; van de Wiel, Mark A

    2015-01-01

    Hierarchical clustering (HC) is one of the most frequently used methods in computational biology in the analysis of high-dimensional genomics data. Given a data set, HC outputs a binary tree leaves of which are the data points and internal nodes represent clusters of various sizes. Normally, a fixed-height cut on the HC tree is chosen, and each contiguous branch of data points below that height is considered as a separate cluster. However, the fixed-height branch cut may not be ideal in situations where one expects a complicated tree structure with nested clusters. Furthermore, due to lack of utilization of related background information in selecting the cutoff, induced clusters are often difficult to interpret. This paper describes a novel procedure that aims to automatically extract meaningful clusters from the HC tree in a semi-supervised way. The procedure is implemented in the R package HCsnip available from Bioconductor. Rather than cutting the HC tree at a fixed-height, HCsnip probes the various way of snipping, possibly at variable heights, to tease out hidden clusters ensconced deep down in the tree. The cluster extraction process utilizes, along with the data set from which the HC tree is derived, commonly available background information. Consequently, the extracted clusters are highly reproducible and robust against various sources of variations that "haunted" high-dimensional genomics data. Since the clustering process is guided by the background information, clusters are easy to interpret. Unlike existing packages, no constraint is placed on the data type on which clustering is desired. Particularly, the package accepts patient follow-up data for guiding the cluster extraction process. To our knowledge, HCsnip is the first package that is able to decomposes the HC tree into clusters with piecewise snipping under the guidance of patient time-to-event information. Our implementation of the semi-supervised HC tree snipping framework is generic, and can

  1. The evolution of Brightest Cluster Galaxies in a hierarchical universe

    CERN Document Server

    Tonini, Chiara; Croton, Darren; Maraston, Claudia; Thomas, Daniel

    2012-01-01

    We investigate the evolution of Brightest Cluster Galaxies (BCGs) from redshift z~1.6 to z~0. We use the semi-analytic model of Croton et al. (2006) with a new spectro-photometric model based on the Maraston (2005) stellar populations and a new recipe for the dust extinction. We compare the model predictions of the K-band luminosity evolution and the J-K, V-I and I-K colour evolution with a series of datasets, including Collins et al. (Nature, 2009) who argued that semi-analytic models based on the Millennium simulation cannot reproduce the red colours and high luminosity of BCGs at z>1. We show instead that the model is well in range of the observed luminosity and correctly reproduces the colour evolution of BCGs in the whole redshift range up to z~1.6. We argue that the success of the semi-analytic model is in large part due to the implementation of a more sophisticated spectro-photometric model. An analysis of the model BCGs shows an increase in mass by a factor ~2 since z~1, and star formation activity do...

  2. Teaching a machine to see: unsupervised image segmentation and categorisation using growing neural gas and hierarchical clustering

    CERN Document Server

    Hocking, Alex; Davey, Neil; Sun, Yi

    2015-01-01

    We present a novel unsupervised learning approach to automatically segment and label images in astronomical surveys. Automation of this procedure will be essential as next-generation surveys enter the petabyte scale: data volumes will exceed the capability of even large crowd-sourced analyses. We demonstrate how a growing neural gas (GNG) can be used to encode the feature space of imaging data. When coupled with a technique called hierarchical clustering, imaging data can be automatically segmented and labelled by organising nodes in the GNG. The key distinction of unsupervised learning is that these labels need not be known prior to training, rather they are determined by the algorithm itself. Importantly, after training a network can be be presented with images it has never 'seen' before and provide consistent categorisation of features. As a proof-of-concept we demonstrate application on data from the Hubble Space Telescope Frontier Fields: images of clusters of galaxies containing a mixture of galaxy type...

  3. Bayesian hierarchical clustering for studying cancer gene expression data with unknown statistics.

    Directory of Open Access Journals (Sweden)

    Korsuk Sirinukunwattana

    Full Text Available Clustering analysis is an important tool in studying gene expression data. The Bayesian hierarchical clustering (BHC algorithm can automatically infer the number of clusters and uses Bayesian model selection to improve clustering quality. In this paper, we present an extension of the BHC algorithm. Our Gaussian BHC (GBHC algorithm represents data as a mixture of Gaussian distributions. It uses normal-gamma distribution as a conjugate prior on the mean and precision of each of the Gaussian components. We tested GBHC over 11 cancer and 3 synthetic datasets. The results on cancer datasets show that in sample clustering, GBHC on average produces a clustering partition that is more concordant with the ground truth than those obtained from other commonly used algorithms. Furthermore, GBHC frequently infers the number of clusters that is often close to the ground truth. In gene clustering, GBHC also produces a clustering partition that is more biologically plausible than several other state-of-the-art methods. This suggests GBHC as an alternative tool for studying gene expression data. The implementation of GBHC is available at https://sites.google.com/site/gaussianbhc/

  4. Hierarchical and Non-Hierarchical Linear and Non-Linear Clustering Methods to “Shakespeare Authorship Question”

    Directory of Open Access Journals (Sweden)

    Refat Aljumily

    2015-09-01

    Full Text Available A few literary scholars have long claimed that Shakespeare did not write some of his best plays (history plays and tragedies and proposed at one time or another various suspect authorship candidates. Most modern-day scholars of Shakespeare have rejected this claim, arguing that strong evidence that Shakespeare wrote the plays and poems being his name appears on them as the author. This has caused and led to an ongoing scholarly academic debate for quite some long time. Stylometry is a fast-growing field often used to attribute authorship to anonymous or disputed texts. Stylometric attempts to resolve this literary puzzle have raised interesting questions over the past few years. The following paper contributes to “the Shakespeare authorship question” by using a mathematically-based methodology to examine the hypothesis that Shakespeare wrote all the disputed plays traditionally attributed to him. More specifically, the mathematically based methodology used here is based on Mean Proximity, as a linear hierarchical clustering method, and on Principal Components Analysis, as a non-hierarchical linear clustering method. It is also based, for the first time in the domain, on Self-Organizing Map U-Matrix and Voronoi Map, as non-linear clustering methods to cover the possibility that our data contains significant non-linearities. Vector Space Model (VSM is used to convert texts into vectors in a high dimensional space. The aim of which is to compare the degrees of similarity within and between limited samples of text (the disputed plays. The various works and plays assumed to have been written by Shakespeare and possible authors notably, Sir Francis Bacon, Christopher Marlowe, John Fletcher, and Thomas Kyd, where “similarity” is defined in terms of correlation/distance coefficient measure based on the frequency of usage profiles of function words, word bi-grams, and character triple-grams. The claim that Shakespeare authored all the disputed

  5. An Exactly Soluble Hierarchical Clustering Model Inverse Cascades, Self-Similarity, and Scaling

    CERN Document Server

    Gabrielov, A; Turcotte, D L

    1999-01-01

    We show how clustering as a general hierarchical dynamical process proceeds via a sequence of inverse cascades to produce self-similar scaling, as an intermediate asymptotic, which then truncates at the largest spatial scales. We show how this model can provide a general explanation for the behavior of several models that has been described as ``self-organized critical,'' including forest-fire, sandpile, and slider-block models.

  6. Coscheduling Technique for Symmetric Multiprocessor Clusters

    Energy Technology Data Exchange (ETDEWEB)

    Yoo, A B; Jette, M A

    2000-09-18

    Coscheduling is essential for obtaining good performance in a time-shared symmetric multiprocessor (SMP) cluster environment. However, the most common technique, gang scheduling, has limitations such as poor scalability and vulnerability to faults mainly due to explicit synchronization between its components. A decentralized approach called dynamic coscheduling (DCS) has been shown to be effective for network of workstations (NOW), but this technique is not suitable for the workloads on a very large SMP-cluster with thousands of processors. Furthermore, its implementation can be prohibitively expensive for such a large-scale machine. IN this paper, they propose a novel coscheduling technique based on the DCS approach which can achieve coscheduling on very large SMP-clusters in a scalable, efficient, and cost-effective way. In the proposed technique, each local scheduler achieves coscheduling based upon message traffic between the components of parallel jobs. Message trapping is carried out at the user-level, eliminating the need for unsupported hardware or device-level programming. A sending process attaches its status to outgoing messages so local schedulers on remote nodes can make more intelligent scheduling decisions. Once scheduled, processes are guaranteed some minimum period of time to execute. This provides an opportunity to synchronize the parallel job's components across all nodes and achieve good program performance. The results from a performance study reveal that the proposed technique is a promising approach that can reduce response time significantly over uncoordinated time-sharing and batch scheduling.

  7. Recursive Hierarchical Image Segmentation by Region Growing and Constrained Spectral Clustering

    Science.gov (United States)

    Tilton, James C.

    2002-01-01

    This paper describes an algorithm for hierarchical image segmentation (referred to as HSEG) and its recursive formulation (referred to as RHSEG). The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HS WO) approach to region growing, which seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing. In addition, HSEG optionally interjects between HSWO region growing iterations merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the segmentation results, especially for larger images, it also significantly increases HSEG's computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) has been devised and is described herein. Included in this description is special code that is required to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. Implementations for single processor and for multiple processor computer systems are described. Results with Landsat TM data are included comparing HSEG with classic region growing. Finally, an application to image information mining and knowledge discovery is discussed.

  8. Hierarchical Adaptive Means (HAM) clustering for hardware-efficient, unsupervised and real-time spike sorting.

    Science.gov (United States)

    Paraskevopoulou, Sivylla E; Wu, Di; Eftekhar, Amir; Constandinou, Timothy G

    2014-09-30

    This work presents a novel unsupervised algorithm for real-time adaptive clustering of neural spike data (spike sorting). The proposed Hierarchical Adaptive Means (HAM) clustering method combines centroid-based clustering with hierarchical cluster connectivity to classify incoming spikes using groups of clusters. It is described how the proposed method can adaptively track the incoming spike data without requiring any past history, iteration or training and autonomously determines the number of spike classes. Its performance (classification accuracy) has been tested using multiple datasets (both simulated and recorded) achieving a near-identical accuracy compared to k-means (using 10-iterations and provided with the number of spike classes). Also, its robustness in applying to different feature extraction methods has been demonstrated by achieving classification accuracies above 80% across multiple datasets. Last but crucially, its low complexity, that has been quantified through both memory and computation requirements makes this method hugely attractive for future hardware implementation. Copyright © 2014 Elsevier B.V. All rights reserved.

  9. Permutation Tests of Hierarchical Cluster Analyses of Carrion Communities and Their Potential Use in Forensic Entomology.

    Science.gov (United States)

    van der Ham, Joris L

    2016-05-19

    Forensic entomologists can use carrion communities' ecological succession data to estimate the postmortem interval (PMI). Permutation tests of hierarchical cluster analyses of these data provide a conceptual method to estimate part of the PMI, the post-colonization interval (post-CI). This multivariate approach produces a baseline of statistically distinct clusters that reflect changes in the carrion community composition during the decomposition process. Carrion community samples of unknown post-CIs are compared with these baseline clusters to estimate the post-CI. In this short communication, I use data from previously published studies to demonstrate the conceptual feasibility of this multivariate approach. Analyses of these data produce series of significantly distinct clusters, which represent carrion communities during 1- to 20-day periods of the decomposition process. For 33 carrion community samples, collected over an 11-day period, this approach correctly estimated the post-CI within an average range of 3.1 days.

  10. An energy efficient cooperative hierarchical MIMO clustering scheme for wireless sensor networks.

    Science.gov (United States)

    Nasim, Mehwish; Qaisar, Saad; Lee, Sungyoung

    2012-01-01

    In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO) communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO) clustering scheme and traditional multihop Single-Input-Single-Output (SISO) routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes.

  11. To Aggregate or Not and Potentially Better Questions for Clustered Data: The Need for Hierarchical Linear Modeling in CTE Research

    Science.gov (United States)

    Nimon, Kim

    2012-01-01

    Using state achievement data that are openly accessible, this paper demonstrates the application of hierarchical linear modeling within the context of career technical education research. Three prominent approaches to analyzing clustered data (i.e., modeling aggregated data, modeling disaggregated data, modeling hierarchical data) are discussed…

  12. [Study of the clinical phenotype of symptomatic chronic airways disease by hierarchical cluster analysis and two-step cluster analyses].

    Science.gov (United States)

    Ning, P; Guo, Y F; Sun, T Y; Zhang, H S; Chai, D; Li, X M

    2016-09-01

    To study the distinct clinical phenotype of chronic airway diseases by hierarchical cluster analysis and two-step cluster analysis. A population sample of adult patients in Donghuamen community, Dongcheng district and Qinghe community, Haidian district, Beijing from April 2012 to January 2015, who had wheeze within the last 12 months, underwent detailed investigation, including a clinical questionnaire, pulmonary function tests, total serum IgE levels, blood eosinophil level and a peak flow diary. Nine variables were chosen as evaluating parameters, including pre-salbutamol forced expired volume in one second(FEV1)/forced vital capacity(FVC) ratio, pre-salbutamol FEV1, percentage of post-salbutamol change in FEV1, residual capacity, diffusing capacity of the lung for carbon monoxide/alveolar volume adjusted for haemoglobin level, peak expiratory flow(PEF) variability, serum IgE level, cumulative tobacco cigarette consumption (pack-years) and respiratory symptoms (cough and expectoration). Subjects' different clinical phenotype by hierarchical cluster analysis and two-step cluster analysis was identified. (1) Four clusters were identified by hierarchical cluster analysis. Cluster 1 was chronic bronchitis in smokers with normal pulmonary function. Cluster 2 was chronic bronchitis or mild chronic obstructive pulmonary disease (COPD) patients with mild airflow limitation. Cluster 3 included COPD patients with heavy smoking, poor quality of life and severe airflow limitation. Cluster 4 recognized atopic patients with mild airflow limitation, elevated serum IgE and clinical features of asthma. Significant differences were revealed regarding pre-salbutamol FEV1/FVC%, pre-salbutamol FEV1% pred, post-salbutamol change in FEV1%, maximal mid-expiratory flow curve(MMEF)% pred, carbon monoxide diffusing capacity per liter of alveolar(DLCO)/(VA)% pred, residual volume(RV)% pred, total serum IgE level, smoking history (pack-years), St.George's respiratory questionnaire

  13. Hierarchical matrix techniques for the solution of elliptic equations

    KAUST Repository

    Chávez, Gustavo

    2014-05-04

    Hierarchical matrix approximations are a promising tool for approximating low-rank matrices given the compactness of their representation and the economy of the operations between them. Integral and differential operators have been the major applications of this technology, but they can be applied into other areas where low-rank properties exist. Such is the case of the Block Cyclic Reduction algorithm, which is used as a direct solver for the constant-coefficient Poisson quation. We explore the variable-coefficient case, also using Block Cyclic reduction, with the addition of Hierarchical Matrices to represent matrix blocks, hence improving the otherwise O(N2) algorithm, into an efficient O(N) algorithm.

  14. Applying of hierarchical clustering to analysis of protein patterns in the human cancer-associated liver.

    Directory of Open Access Journals (Sweden)

    Natalia A Petushkova

    Full Text Available There are two ways that statistical methods can learn from biomedical data. One way is to learn classifiers to identify diseases and to predict outcomes using the training dataset with established diagnosis for each sample. When the training dataset is not available the task can be to mine for presence of meaningful groups (clusters of samples and to explore underlying data structure (unsupervised learning.We investigated the proteomic profiles of the cytosolic fraction of human liver samples using two-dimensional electrophoresis (2DE. Samples were resected upon surgical treatment of hepatic metastases in colorectal cancer. Unsupervised hierarchical clustering of 2DE gel images (n = 18 revealed a pair of clusters, containing 11 and 7 samples. Previously we used the same specimens to measure biochemical profiles based on cytochrome P450-dependent enzymatic activities and also found that samples were clearly divided into two well-separated groups by cluster analysis. It turned out that groups by enzyme activity almost perfectly match to the groups identified from proteomic data. Of the 271 reproducible spots on our 2DE gels, we selected 15 to distinguish the human liver cytosolic clusters. Using MALDI-TOF peptide mass fingerprinting, we identified 12 proteins for the selected spots, including known cancer-associated species.Our results highlight the importance of hierarchical cluster analysis of proteomic data, and showed concordance between results of biochemical and proteomic approaches. Grouping of the human liver samples and/or patients into differing clusters may provide insights into possible molecular mechanism of drug metabolism and creates a rationale for personalized treatment.

  15. SHIPS: Spectral Hierarchical clustering for the Inference of Population Structure in genetic studies.

    Science.gov (United States)

    Bouaziz, Matthieu; Paccard, Caroline; Guedj, Mickael; Ambroise, Christophe

    2012-01-01

    Inferring the structure of populations has many applications for genetic research. In addition to providing information for evolutionary studies, it can be used to account for the bias induced by population stratification in association studies. To this end, many algorithms have been proposed to cluster individuals into genetically homogeneous sub-populations. The parametric algorithms, such as Structure, are very popular but their underlying complexity and their high computational cost led to the development of faster parametric alternatives such as Admixture. Alternatives to these methods are the non-parametric approaches. Among this category, AWclust has proven efficient but fails to properly identify population structure for complex datasets. We present in this article a new clustering algorithm called Spectral Hierarchical clustering for the Inference of Population Structure (SHIPS), based on a divisive hierarchical clustering strategy, allowing a progressive investigation of population structure. This method takes genetic data as input to cluster individuals into homogeneous sub-populations and with the use of the gap statistic estimates the optimal number of such sub-populations. SHIPS was applied to a set of simulated discrete and admixed datasets and to real SNP datasets, that are data from the HapMap and Pan-Asian SNP consortium. The programs Structure, Admixture, AWclust and PCAclust were also investigated in a comparison study. SHIPS and the parametric approach Structure were the most accurate when applied to simulated datasets both in terms of individual assignments and estimation of the correct number of clusters. The analysis of the results on the real datasets highlighted that the clusterings of SHIPS were the more consistent with the population labels or those produced by the Admixture program. The performances of SHIPS when applied to SNP data, along with its relatively low computational cost and its ease of use make this method a promising

  16. Evolutionary-Hierarchical Bases of the Formation of Cluster Model of Innovation Economic Development

    Directory of Open Access Journals (Sweden)

    Yuliya Vladimirovna Dubrovskaya

    2016-10-01

    Full Text Available The functioning of a modern economic system is based on the interaction of objects of different hierarchical levels. Thus, the problem of the study of innovation processes taking into account the mutual influence of the activities of these economic actors becomes important. The paper dwells evolutionary basis for the formation of models of innovation development on the basis of micro and macroeconomic analysis. Most of the concepts recognized that despite a big number of diverse models, the coordination of the relations between economic agents is of crucial importance for the successful innovation development. According to the results of the evolutionary-hierarchical analysis, the authors reveal key phases of the development of forms of business cooperation, science and government in the domestic economy. It has become the starting point of the conception of the characteristics of the interaction in the cluster models of innovation development of the economy. Considerable expectancies on improvement of the national innovative system are connected with the development of cluster and network structures. The main objective of government authorities is the formation of mechanisms and institutions that will foster cooperation between members of the clusters. The article explains that the clusters cannot become the factors in the growth of the national economy, not being an effective tool for interaction between the actors of the regional innovative systems.

  17. Hierarchical clustering

    Directory of Open Access Journals (Sweden)

    L. Infante

    2002-01-01

    Full Text Available En esta contribuci on presento resultados recientes sobre las propiedades de acumulaci on de galaxias, grupos, c umulos y superc umulos de bajo redshift (z 1. Presento, a su vez, lo esperado y lo medido con respecto al grado de evoluci on de la acumulaci on de galaxias. Hemos usado el cat alogo fotom etrico de galaxias extra do de las primeras im agenes del \\Sloan Digital Sky Survey", para estudiar las propiedades de acumulaci on de peque~nas estructuras de galaxias, pares, tr os, cuartetos, quintetos, etc. Un an alisis de la funci on de correlaci on de dos puntos, en un area de 250 grados cuadrados del cielo, muestra que estos objetos, al parecer, est an mucho m as acumulados que galaxias individuales.

  18. Hierarchical Clustering of Large Databases and Classification of Antibiotics at High Noise Levels

    Directory of Open Access Journals (Sweden)

    Alexander V. Yarkov

    2008-12-01

    Full Text Available A new algorithm for divisive hierarchical clustering of chemical compounds based on 2D structural fragments is suggested. The algorithm is deterministic, and given a random ordering of the input, will always give the same clustering and can process a database up to 2 million records on a standard PC. The algorithm was used for classification of 1,183 antibiotics mixed with 999,994 random chemical structures. Similarity threshold, at which best separation of active and non active compounds took place, was estimated as 0.6. 85.7% of the antibiotics were successfully classified at this threshold with 0.4% of inaccurate compounds. A .sdf file was created with the probe molecules for clustering of external databases.

  19. A novel approach to the problem of non-uniqueness of the solution in hierarchical clustering.

    Science.gov (United States)

    Cattinelli, Isabella; Valentini, Giorgio; Paulesu, Eraldo; Borghese, Nunzio Alberto

    2013-07-01

    The existence of multiple solutions in clustering, and in hierarchical clustering in particular, is often ignored in practical applications. However, this is a non-trivial problem, as different data orderings can result in different cluster sets that, in turns, may lead to different interpretations of the same data. The method presented here offers a solution to this issue. It is based on the definition of an equivalence relation over dendrograms that allows developing all and only the significantly different dendrograms for the same dataset, thus reducing the computational complexity to polynomial from the exponential obtained when all possible dendrograms are considered. Experimental results in the neuroimaging and bioinformatics domains show the effectiveness of the proposed method.

  20. A supplier selection using a hybrid grey based hierarchical clustering and artificial bee colony

    Directory of Open Access Journals (Sweden)

    Farshad Faezy Razi

    2014-06-01

    Full Text Available Selection of one or a combination of the most suitable potential providers and outsourcing problem is the most important strategies in logistics and supply chain management. In this paper, selection of an optimal combination of suppliers in inventory and supply chain management are studied and analyzed via multiple attribute decision making approach, data mining and evolutionary optimization algorithms. For supplier selection in supply chain, hierarchical clustering according to the studied indexes first clusters suppliers. Then, according to its cluster, each supplier is evaluated through Grey Relational Analysis. Then the combination of suppliers’ Pareto optimal rank and costs are obtained using Artificial Bee Colony meta-heuristic algorithm. A case study is conducted for a better description of a new algorithm to select a multiple source of suppliers.

  1. 3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE

    Directory of Open Access Journals (Sweden)

    A. Suhaibah

    2016-06-01

    Full Text Available Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

  2. Energy Efficient Backoff Hierarchical Clustering Algorithms for Multi-Hop Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Jun Wang; Yong-Tao Cao; Jun-Yuan Xie; Shi-Fu Chen

    2011-01-01

    Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the multi-hop technique with a backoff-based clustering algorithm to organize sensors. By using an adaptive backoff strategy, the algorithm not only realizes load balance among sensor node, but also achieves fairly uniform cluster head distribution across the network. Simulation results also demonstrate our algorithm is more energy-efficient than classical ones. Our algorithm is also easily extended to generate a hierarchy of cluster heads to obtain better network management and energy-efficiency.

  3. A hierarchical cluster analysis of normal-tension glaucoma using spectral-domain optical coherence tomography parameters.

    Science.gov (United States)

    Bae, Hyoung Won; Ji, Yongwoo; Lee, Hye Sun; Lee, Naeun; Hong, Samin; Seong, Gong Je; Sung, Kyung Rim; Kim, Chan Yun

    2015-01-01

    Normal-tension glaucoma (NTG) is a heterogenous disease, and there is still controversy about subclassifications of this disorder. On the basis of spectral-domain optical coherence tomography (SD-OCT), we subdivided NTG with hierarchical cluster analysis using optic nerve head (ONH) parameters and retinal nerve fiber layer (RNFL) thicknesses. A total of 200 eyes of 200 NTG patients between March 2011 and June 2012 underwent SD-OCT scans to measure ONH parameters and RNFL thicknesses. We classified NTG into homogenous subgroups based on these variables using a hierarchical cluster analysis, and compared clusters to evaluate diverse NTG characteristics. Three clusters were found after hierarchical cluster analysis. Cluster 1 (62 eyes) had the thickest RNFL and widest rim area, and showed early glaucoma features. Cluster 2 (60 eyes) was characterized by the largest cup/disc ratio and cup volume, and showed advanced glaucomatous damage. Cluster 3 (78 eyes) had small disc areas in SD-OCT and were comprised of patients with significantly younger age, longer axial length, and greater myopia than the other 2 groups. A hierarchical cluster analysis of SD-OCT scans divided NTG patients into 3 groups based upon ONH parameters and RNFL thicknesses. It is anticipated that the small disc area group comprised of younger and more myopic patients may show unique features unlike the other 2 groups.

  4. Clustering microcalcifications techniques in digital mammograms

    Science.gov (United States)

    Díaz, Claudia. C.; Bosco, Paolo; Cerello, Piergiorgio

    2008-11-01

    Breast cancer has become a serious public health problem around the world. However, this pathology can be treated if it is detected in early stages. This task is achieved by a radiologist, who should read a large amount of mammograms per day, either for a screening or diagnostic purpose in mammography. However human factors could affect the diagnosis. Computer Aided Detection is an automatic system, which can help to specialists in the detection of possible signs of malignancy in mammograms. Microcalcifications play an important role in early detection, so we focused on their study. The two mammographic features that indicate the microcalcifications could be probably malignant are small size and clustered distribution. We worked with density techniques for automatic clustering, and we applied them on a mammography CAD prototype developed at INFN-Turin, Italy. An improvement of performance is achieved analyzing images from a Perugia-Assisi Hospital, in Italy.

  5. Water quality assessment with hierarchical cluster analysis based on Mahalanobis distance.

    Science.gov (United States)

    Du, Xiangjun; Shao, Fengjing; Wu, Shunyao; Zhang, Hanlin; Xu, Si

    2017-07-01

    Water quality assessment is crucial for assessment of marine eutrophication, prediction of harmful algal blooms, and environment protection. Previous studies have developed many numeric modeling methods and data driven approaches for water quality assessment. The cluster analysis, an approach widely used for grouping data, has also been employed. However, there are complex correlations between water quality variables, which play important roles in water quality assessment but have always been overlooked. In this paper, we analyze correlations between water quality variables and propose an alternative method for water quality assessment with hierarchical cluster analysis based on Mahalanobis distance. Further, we cluster water quality data collected form coastal water of Bohai Sea and North Yellow Sea of China, and apply clustering results to evaluate its water quality. To evaluate the validity, we also cluster the water quality data with cluster analysis based on Euclidean distance, which are widely adopted by previous studies. The results show that our method is more suitable for water quality assessment with many correlated water quality variables. To our knowledge, it is the first attempt to apply Mahalanobis distance for coastal water quality assessment.

  6. Prioritizing the risk of plant pests by clustering methods; self-organising maps, k-means and hierarchical clustering

    Directory of Open Access Journals (Sweden)

    Susan Worner

    2013-09-01

    -means, hierarchical clustering and the incorporation of the SOM analysis into criteria based approaches to assess pest risk.

  7. Intensity-based hierarchical clustering in CT-scans: application to interactive segmentation in cardiology

    Science.gov (United States)

    Hadida, Jonathan; Desrosiers, Christian; Duong, Luc

    2011-03-01

    The segmentation of anatomical structures in Computed Tomography Angiography (CTA) is a pre-operative task useful in image guided surgery. Even though very robust and precise methods have been developed to help achieving a reliable segmentation (level sets, active contours, etc), it remains very time consuming both in terms of manual interactions and in terms of computation time. The goal of this study is to present a fast method to find coarse anatomical structures in CTA with few parameters, based on hierarchical clustering. The algorithm is organized as follows: first, a fast non-parametric histogram clustering method is proposed to compute a piecewise constant mask. A second step then indexes all the space-connected regions in the piecewise constant mask. Finally, a hierarchical clustering is achieved to build a graph representing the connections between the various regions in the piecewise constant mask. This step builds up a structural knowledge about the image. Several interactive features for segmentation are presented, for instance association or disassociation of anatomical structures. A comparison with the Mean-Shift algorithm is presented.

  8. Validation of hierarchical cluster analysis for identification of bacterial species using 42 bacterial isolates

    Science.gov (United States)

    Ghebremedhin, Meron; Yesupriya, Shubha; Luka, Janos; Crane, Nicole J.

    2015-03-01

    Recent studies have demonstrated the potential advantages of the use of Raman spectroscopy in the biomedical field due to its rapidity and noninvasive nature. In this study, Raman spectroscopy is applied as a method for differentiating between bacteria isolates for Gram status and Genus species. We created models for identifying 28 bacterial isolates using spectra collected with a 785 nm laser excitation Raman spectroscopic system. In order to investigate the groupings of these samples, partial least squares discriminant analysis (PLSDA) and hierarchical cluster analysis (HCA) was implemented. In addition, cluster analyses of the isolates were performed using various data types consisting of, biochemical tests, gene sequence alignment, high resolution melt (HRM) analysis and antimicrobial susceptibility tests of minimum inhibitory concentration (MIC) and degree of antimicrobial resistance (SIR). In order to evaluate the ability of these models to correctly classify bacterial isolates using solely Raman spectroscopic data, a set of 14 validation samples were tested using the PLSDA models and consequently the HCA models. External cluster evaluation criteria of purity and Rand index were calculated at different taxonomic levels to compare the performance of clustering using Raman spectra as well as the other datasets. Results showed that Raman spectra performed comparably, and in some cases better than, the other data types with Rand index and purity values up to 0.933 and 0.947, respectively. This study clearly demonstrates that the discrimination of bacterial species using Raman spectroscopic data and hierarchical cluster analysis is possible and has the potential to be a powerful point-of-care tool in clinical settings.

  9. Localization technique in VANets using Clustering (LVC

    Directory of Open Access Journals (Sweden)

    Nasreddine Lagraa

    2010-07-01

    Full Text Available Relative location information is an important aspect in vehicular Ad hoc networks .It helps to build vehicle topology maps, also provides location information of nearby vehicles. Due to the characteristics of VANet, the existing relative positioning techniques developed initially for Ad hoc or sensors networks are not directly applicable to vehicular networks. In this paper, we propose a protocol of localization in VANet when no GPS information is available, based on clustering and has the advantage to use a single coordinates system. We study its impact on the performances of the network, by using the network simulator NS-2.

  10. Hierarchical Regional Disparities and Potential Sector Identification Using Modified Agglomerative Clustering

    Science.gov (United States)

    Munandar, T. A.; Azhari; Mushdholifah, A.; Arsyad, L.

    2017-03-01

    Disparities in regional development methods are commonly identified using the Klassen Typology and Location Quotient. Both methods typically use the data on the gross regional domestic product (GRDP) sectors of a particular region. The Klassen approach can identify regional disparities by classifying the GRDP sector data into four classes, namely Quadrants I, II, III, and IV. Each quadrant indicates a certain level of regional disparities based on the GRDP sector value of the said region. Meanwhile, the Location Quotient (LQ) is usually used to identify potential sectors in a particular region so as to determine which sectors are potential and which ones are not potential. LQ classifies each sector into three classes namely, the basic sector, the non-basic sector with a competitive advantage, and the non-basic sector which can only meet its own necessities. Both Klassen Typology and LQ are unable to visualize the relationship of achievements in the development clearly of each region and sector. This research aimed to develop a new approach to the identification of disparities in regional development in the form of hierarchical clustering. The method of Hierarchical Agglomerative Clustering (HAC) was employed as the basis of the hierarchical clustering model for identifying disparities in regional development. Modifications were made to HAC using the Klassen Typology and LQ. Then, HAC which had been modified using the Klassen Typology was called MHACK while HAC which had been modified using LQ was called MACLoQ. Both algorithms can be used to identify regional disparities (MHACK) and potential sectors (MACLoQ), respectively, in the form of hierarchical clusters. Based on the MHACK in 31 regencies in Central Java Province, it is identified that 3 regencies (Demak, Jepara, and Magelang City) fall into the category of developed and rapidly-growing regions, while the other 28 regencies fall into the category of developed but depressed regions. Results of the MACLo

  11. Diversity of Xiphinema americanum-group Species and Hierarchical Cluster Analysis of Morphometrics.

    Science.gov (United States)

    Lamberti, F; Ciancio, A

    1993-09-01

    Of the 39 species composing the Xiphinema americanum group, 14 were described originally from North America and two others have been reported from this region. Many species are very similar morphologically and can be distinguished only by a difficult comparison of various combinations of some morphometric characters. Study of morphometrics of 49 populations, including the type populations of the 39 species attributed to this group, by principal component analysis and hierarchical cluster analysis placed the populations into five subgroups, proposed here as the X. brevicolle subgroup (seven species), the X. americanum subgroup (17 species), the X. taylori subgroup (two species), the X. pachtaicum subgroup (eight species), and the X. lambertii subgroup (five species).

  12. Iterative Maps with Hierarchical Clustering for the Observed Scales of Astrophysical and Cosmological Structures

    CERN Document Server

    Capozziello, S; De Siena, S; Guerra, F; Illuminati, F

    2000-01-01

    We derive, in order of magnitude, the observed astrophysical and cosmologicalscales in the Universe, from neutron stars to superclusters of galaxies, up to,asymptotically, the observed radius of the Universe. This result is obtained byintroducing a recursive scheme of alternating hierachical mechanisms ofthree-dimensional and two-dimensional close packings of gravitationallyinteracting objects. The iterative scheme yields a rapidly converging geometricsequence, which can be described as a hierarchical clustering of aggregates,having the observed radius of the Universe as its fixed point.

  13. CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection

    Science.gov (United States)

    Ao, Sio-Iong

    More than 6 million single nucleotide polymorphisms (SNPs) in the human genome have been genotyped by the HapMap project. Although only a pro portion of these SNPs are functional, all can be considered as candidate markers for indirect association studies to detect disease-related genetic variants. The complete screening of a gene or a chromosomal region is nevertheless an expensive undertak ing for association studies. A key strategy for improving the efficiency of association studies is to select a subset of informative SNPs, called tag SNPs, for analysis. In the chapter, hierarchical clustering algorithms have been proposed for efficient tag SNP selection.

  14. RATC: A Robust Automated Tag Clustering Technique

    Science.gov (United States)

    Boratto, Ludovico; Carta, Salvatore; Vargiu, Eloisa

    Nowadays, the most dominant and noteworthy web information sources are developed according to the collaborative-web paradigm, also known as Web 2.0. In particular, it represents a novel paradigm in the way users interact with the web. Users (also called prosumers) are no longer passive consumers of published content, but become involved, implicitly and explicitly, as they cooperate by providing their own resources in an “architecture of participation”. In this scenario, collaborative tagging, i.e., the process of classifying shared resources by using keywords, becomes more and more popular. The main problem in such task is related to well-known linguistic phenomena, such as polysemy and synonymy, making effective content retrieval harder. In this paper, an approach that monitors users activity in a tagging system and dynamically quantifies associations among tags is presented. The associations are then used to create tags clusters. Experiments are performed comparing the proposed approach with a state-of-the-art tag clustering technique. Results -given in terms of classical precision and recall- show that the approach is quite effective in the presence of strongly related tags in a cluster.

  15. From Snakes to Stars, the Statistics of Collapsed Objects - II. Testing a Generic Scaling Ansatz for Hierarchical Clustering

    CERN Document Server

    Munshi, D; Melott, A L; Munshi, Dipak; Coles, Peter; Melott, Adrian L.

    1999-01-01

    We develop a diagrammatic technique to represent the multi-point cumulative probability density function (CPDF) of mass fluctuations in terms of the statistical properties of individual collapsed objects and relate this to other statistical descriptors such as cumulants, cumulant correlators and factorial moments. We use this approach to establish key scaling relations describing various measurable statistical quantities if clustering follows a simple general scaling ansatz, as expected in hierarchical models. We test these detailed predictions against high-resolution numerical simulations. We show that, when appropriate variables are used, the count probability distribution function (CPDF) and void probability distribution function (VPF) shows clear scaling properties in the non-linear regime. Generalising the results to the two-point count probability distribution function (2CPDF), and the bivariate void probability function (2VPF) we find good match with numerical simulations. We explore the behaviour of t...

  16. Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Taleb Tariq

    2017-06-01

    Full Text Available Extending the lifetime of wireless sensor networks (WSNs while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

  17. Hierarchical Clustering Algorithm based on Attribute Dependency for Attention Deficit Hyperactive Disorder

    Directory of Open Access Journals (Sweden)

    J Anuradha

    2014-05-01

    Full Text Available Attention Deficit Hyperactive Disorder (ADHD is a disruptive neurobehavioral disorder characterized by abnormal behavioral patterns in attention, perusing activity, acting impulsively and combined types. It is predominant among school going children and it is tricky to differentiate between an active and an ADHD child. Misdiagnosis and undiagnosed cases are very common. Behavior patterns are identified by the mentors in the academic environment who lack skills in screening those kids. Hence an unsupervised learning algorithm can cluster the behavioral patterns of children at school for diagnosis of ADHD. In this paper, we propose a hierarchical clustering algorithm to partition the dataset based on attribute dependency (HCAD. HCAD forms clusters of data based on the high dependent attributes and their equivalence relation. It is capable of handling large volumes of data with reasonably faster clustering than most of the existing algorithms. It can work on both labeled and unlabelled data sets. Experimental results reveal that this algorithm has higher accuracy in comparison to other algorithms. HCAD achieves 97% of cluster purity in diagnosing ADHD. Empirical analysis of application of HCAD on different data sets from UCI repository is provided.

  18. Evaluation of hierarchical agglomerative cluster analysis methods for discrimination of primary biological aerosol

    Directory of Open Access Journals (Sweden)

    I. Crawford

    2015-07-01

    Full Text Available In this paper we present improved methods for discriminating and quantifying Primary Biological Aerosol Particles (PBAP by applying hierarchical agglomerative cluster analysis to multi-parameter ultra violet-light induced fluorescence (UV-LIF spectrometer data. The methods employed in this study can be applied to data sets in excess of 1×106 points on a desktop computer, allowing for each fluorescent particle in a dataset to be explicitly clustered. This reduces the potential for misattribution found in subsampling and comparative attribution methods used in previous approaches, improving our capacity to discriminate and quantify PBAP meta-classes. We evaluate the performance of several hierarchical agglomerative cluster analysis linkages and data normalisation methods using laboratory samples of known particle types and an ambient dataset. Fluorescent and non-fluorescent polystyrene latex spheres were sampled with a Wideband Integrated Bioaerosol Spectrometer (WIBS-4 where the optical size, asymmetry factor and fluorescent measurements were used as inputs to the analysis package. It was found that the Ward linkage with z-score or range normalisation performed best, correctly attributing 98 and 98.1 % of the data points respectively. The best performing methods were applied to the BEACHON-RoMBAS ambient dataset where it was found that the z-score and range normalisation methods yield similar results with each method producing clusters representative of fungal spores and bacterial aerosol, consistent with previous results. The z-score result was compared to clusters generated with previous approaches (WIBS AnalysiS Program, WASP where we observe that the subsampling and comparative attribution method employed by WASP results in the overestimation of the fungal spore concentration by a factor of 1.5 and the underestimation of bacterial aerosol concentration by a factor of 5. We suggest that this likely due to errors arising from misatrribution

  19. Evaluation of hierarchical agglomerative cluster analysis methods for discrimination of primary biological aerosol

    Directory of Open Access Journals (Sweden)

    I. Crawford

    2015-11-01

    Full Text Available In this paper we present improved methods for discriminating and quantifying primary biological aerosol particles (PBAPs by applying hierarchical agglomerative cluster analysis to multi-parameter ultraviolet-light-induced fluorescence (UV-LIF spectrometer data. The methods employed in this study can be applied to data sets in excess of 1 × 106 points on a desktop computer, allowing for each fluorescent particle in a data set to be explicitly clustered. This reduces the potential for misattribution found in subsampling and comparative attribution methods used in previous approaches, improving our capacity to discriminate and quantify PBAP meta-classes. We evaluate the performance of several hierarchical agglomerative cluster analysis linkages and data normalisation methods using laboratory samples of known particle types and an ambient data set. Fluorescent and non-fluorescent polystyrene latex spheres were sampled with a Wideband Integrated Bioaerosol Spectrometer (WIBS-4 where the optical size, asymmetry factor and fluorescent measurements were used as inputs to the analysis package. It was found that the Ward linkage with z-score or range normalisation performed best, correctly attributing 98 and 98.1 % of the data points respectively. The best-performing methods were applied to the BEACHON-RoMBAS (Bio–hydro–atmosphere interactions of Energy, Aerosols, Carbon, H2O, Organics and Nitrogen–Rocky Mountain Biogenic Aerosol Study ambient data set, where it was found that the z-score and range normalisation methods yield similar results, with each method producing clusters representative of fungal spores and bacterial aerosol, consistent with previous results. The z-score result was compared to clusters generated with previous approaches (WIBS AnalysiS Program, WASP where we observe that the subsampling and comparative attribution method employed by WASP results in the overestimation of the fungal spore concentration by a factor of 1.5 and the

  20. Asteroid family identification using the Hierarchical Clustering Method and WISE/NEOWISE physical properties

    CERN Document Server

    Masiero, Joseph R; Bauer, J M; Grav, T; Nugent, C R; Stevenson, R

    2013-01-01

    Using albedos from WISE/NEOWISE to separate distinct albedo groups within the Main Belt asteroids, we apply the Hierarchical Clustering Method to these subpopulations and identify dynamically associated clusters of asteroids. While this survey is limited to the ~35% of known Main Belt asteroids that were detected by NEOWISE, we present the families linked from these objects as higher confidence associations than can be obtained from dynamical linking alone. We find that over one-third of the observed population of the Main Belt is represented in the high-confidence cores of dynamical families. The albedo distribution of family members differs significantly from the albedo distribution of background objects in the same region of the Main Belt, however interpretation of this effect is complicated by the incomplete identification of lower-confidence family members. In total we link 38,298 asteroids into 76 distinct families. This work represents a critical step necessary to debias the albedo and size distributio...

  1. Microglia Morphological Categorization in a Rat Model of Neuroinflammation by Hierarchical Cluster and Principal Components Analysis

    Science.gov (United States)

    Fernández-Arjona, María del Mar; Grondona, Jesús M.; Granados-Durán, Pablo; Fernández-Llebrez, Pedro; López-Ávalos, María D.

    2017-01-01

    It is known that microglia morphology and function are closely related, but only few studies have objectively described different morphological subtypes. To address this issue, morphological parameters of microglial cells were analyzed in a rat model of aseptic neuroinflammation. After the injection of a single dose of the enzyme neuraminidase (NA) within the lateral ventricle (LV) an acute inflammatory process occurs. Sections from NA-injected animals and sham controls were immunolabeled with the microglial marker IBA1, which highlights ramifications and features of the cell shape. Using images obtained by section scanning, individual microglial cells were sampled from various regions (septofimbrial nucleus, hippocampus and hypothalamus) at different times post-injection (2, 4 and 12 h). Each cell yielded a set of 15 morphological parameters by means of image analysis software. Five initial parameters (including fractal measures) were statistically different in cells from NA-injected rats (most of them IL-1β positive, i.e., M1-state) compared to those from control animals (none of them IL-1β positive, i.e., surveillant state). However, additional multimodal parameters were revealed more suitable for hierarchical cluster analysis (HCA). This method pointed out the classification of microglia population in four clusters. Furthermore, a linear discriminant analysis (LDA) suggested three specific parameters to objectively classify any microglia by a decision tree. In addition, a principal components analysis (PCA) revealed two extra valuable variables that allowed to further classifying microglia in a total of eight sub-clusters or types. The spatio-temporal distribution of these different morphotypes in our rat inflammation model allowed to relate specific morphotypes with microglial activation status and brain location. An objective method for microglia classification based on morphological parameters is proposed. Main points Microglia undergo a quantifiable

  2. Analysis of genetic association in Listeria and Diabetes using Hierarchical Clustering and Silhouette Index

    Science.gov (United States)

    Pagnuco, Inti A.; Pastore, Juan I.; Abras, Guillermo; Brun, Marcel; Ballarin, Virginia L.

    2016-04-01

    It is usually assumed that co-expressed genes suggest co-regulation in the underlying regulatory network. Determining sets of co-expressed genes is an important task, where significative groups of genes are defined based on some criteria. This task is usually performed by clustering algorithms, where the whole family of genes, or a subset of them, are clustered into meaningful groups based on their expression values in a set of experiment. In this work we used a methodology based on the Silhouette index as a measure of cluster quality for individual gene groups, and a combination of several variants of hierarchical clustering to generate the candidate groups, to obtain sets of co-expressed genes for two real data examples. We analyzed the quality of the best ranked groups, obtained by the algorithm, using an online bioinformatics tool that provides network information for the selected genes. Moreover, to verify the performance of the algorithm, considering the fact that it doesn’t find all possible subsets, we compared its results against a full search, to determine the amount of good co-regulated sets not detected.

  3. On the Formation of Cool, Non-Flowing Cores in Galaxy Clusters via Hierarchical Mergers

    CERN Document Server

    Burns, J O; Norman, M L; Bryan, G L

    2003-01-01

    We present a new model for the creation of cool cores in rich galaxy clusters within a LambdaCDM cosmological framework using the results from high spatial dynamic range, adaptive mesh hydro/N-body simulations. It is proposed that cores of cool gas first form in subclusters and these subclusters merge to create rich clusters with cool, central X-Ray excesses. The rich cool clusters do not possess ``cooling flows'' due to the presence of bulk velocities in the intracluster medium in excess of 1000 km/sec produced by on-going accretion of gas from supercluster filaments. This new model has several attractive features including the presence of substantial core substructure within the cool cores, and it predicts the appearance of cool bullets, cool fronts, and cool filaments all of which have been recently observed with X-Ray satellites. This hierarchical formation model is also consistent with the observation that cool cores in Abell clusters occur preferentially in dense supercluster environments. On the other ...

  4. Clustering of galaxies in a hierarchical universe - II. Evolution to high redshift

    Science.gov (United States)

    Kauffmann, Guinevere; Colberg, Jörg M.; Diaferio, Antonaldo; White, Simon D. M.

    1999-08-01

    In hierarchical cosmologies the evolution of galaxy clustering depends both on cosmological quantities such as Omega, Lambda and P(k), which determine how collapsed structures - dark matter haloes - form and evolve, and on the physical processes - cooling, star formation, radiative and hydrodynamic feedback - which drive the formation of galaxies within these merging haloes. In this paper we combine dissipationless cosmological N-body simulations and semi-analytic models of galaxy formation in order to study how these two aspects interact. We focus on the differences in clustering predicted for galaxies of differing luminosity, colour, morphology and star formation rate, and on what these differences can teach us about the galaxy formation process. We show that a `dip' in the amplitude of galaxy correlations between z=0 and z=1 can be an important diagnostic. Such a dip occurs in low-density CDM models, because structure forms early, and dark matter haloes of mass ~10^12M_solar, containing galaxies with luminosities ~L_*, are unbiased tracers of the dark matter over this redshift range; their clustering amplitude then evolves similarly to that of the dark matter. At higher redshifts, bright galaxies become strongly biased and the clustering amplitude increases again. In high density models, structure forms late, and bias evolves much more rapidly. As a result, the clustering amplitude of L_* galaxies remains constant from z=0 to z=1. The strength of these effects is sensitive to sample selection. The dip becomes weaker for galaxies with lower star formation rates, redder colours, higher luminosities and earlier morphological types. We explain why this is the case, and how it is related to the variation with redshift of the abundance and environment of the observed galaxies. We also show that the relative peculiar velocities of galaxies are biased low in our models, but that this effect is never very strong. Studies of clustering evolution as a function of galaxy

  5. A Novel Trajectory Clustering technique for selecting cluster heads in Wireless Sensor Networks

    CERN Document Server

    Munaga, Hazarath; Venkateswarlu, N B

    2011-01-01

    Wireless sensor networks (WSNs) suffers from the hot spot problem where the sensor nodes closest to the base station are need to relay more packet than the nodes farther away from the base station. Thus, lifetime of sensory network depends on these closest nodes. Clustering methods are used to extend the lifetime of a wireless sensor network. However, current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and lengthen the network lifetime. Most of the algorithms use random selection for selecting the cluster heads. Here, we propose a novel trajectory clustering technique for selecting the cluster heads in WSNs. Our algorithm selects the cluster heads based on traffic and rotates periodically. It provides the first trajectory based clustering technique for selecting the cluster heads and to extenuate the hot spot problem by prolonging the network lif...

  6. A sliding coherence window technique for hierarchical detection of continuous gravitational waves

    CERN Document Server

    Pletsch, Holger J

    2011-01-01

    A novel hierarchical semicoherent technique is presented for all-sky surveys for continuous gravitational-wave sources, such as rapidly spinning non-axisymmetric neutron stars. Analyzing year-long detector data sets over realistic ranges of parameter space using fully-coherent matched-filtering is computationally prohibitive. Thus more efficient, so-called hierarchical techniques are essential. Traditionally, the standard hierarchical approach consists of dividing the data into non-overlapping segments of which each is coherently analyzed and subsequently the matched-filter outputs from all segments are combined incoherently. The present work proposes to break the data into subsegments being shorter than the desired maximum coherence time span (size of the coherence window). Then matched-filter outputs from the different subsegments are efficiently combined by "sliding" the coherence window in time: Subsegments whose time-stamps are closer than coherence window size are combined coherently, otherwise incohere...

  7. Comparison of statistical clustering techniques for the classification of modelled atmospheric trajectories

    Science.gov (United States)

    Kassomenos, P.; Vardoulakis, S.; Borge, R.; Lumbreras, J.; Papaloukas, C.; Karakitsios, S.

    2010-10-01

    In this study, we used and compared three different statistical clustering methods: an hierarchical, a non-hierarchical (K-means) and an artificial neural network technique (self-organizing maps (SOM)). These classification methods were applied to a 4-year dataset of 5 days kinematic back trajectories of air masses arriving in Athens, Greece at 12.00 UTC, in three different heights, above the ground. The atmospheric back trajectories were simulated with the HYSPLIT Vesion 4.7 model of National Oceanic and Atmospheric Administration (NOAA). The meteorological data used for the computation of trajectories were obtained from NOAA reanalysis database. A comparison of the three statistical clustering methods through statistical indices was attempted. It was found that all three statistical methods seem to depend to the arrival height of the trajectories, but the degree of dependence differs substantially. Hierarchical clustering showed the highest level of dependence for fast-moving trajectories to the arrival height, followed by SOM. K-means was found to be the least depended clustering technique on the arrival height. The air quality management applications of these results in relation to PM10 concentrations recorded in Athens, Greece, were also discussed. Differences of PM10 concentrations, during certain clusters, were found statistically different (at 95% confidence level) indicating that these clusters appear to be associated with long-range transportation of particulates. This study can improve the interpretation of modelled atmospheric trajectories, leading to a more reliable analysis of synoptic weather circulation patterns and their impacts on urban air quality.

  8. Manual hierarchical clustering of regional geochemical data using a Bayesian finite mixture model

    Science.gov (United States)

    Ellefsen, Karl J.; Smith, David

    2016-01-01

    Interpretation of regional scale, multivariate geochemical data is aided by a statistical technique called “clustering.” We investigate a particular clustering procedure by applying it to geochemical data collected in the State of Colorado, United States of America. The clustering procedure partitions the field samples for the entire survey area into two clusters. The field samples in each cluster are partitioned again to create two subclusters, and so on. This manual procedure generates a hierarchy of clusters, and the different levels of the hierarchy show geochemical and geological processes occurring at different spatial scales. Although there are many different clustering methods, we use Bayesian finite mixture modeling with two probability distributions, which yields two clusters. The model parameters are estimated with Hamiltonian Monte Carlo sampling of the posterior probability density function, which usually has multiple modes. Each mode has its own set of model parameters; each set is checked to ensure that it is consistent both with the data and with independent geologic knowledge. The set of model parameters that is most consistent with the independent geologic knowledge is selected for detailed interpretation and partitioning of the field samples.

  9. Modeling Hierarchically Clustered Longitudinal Survival Processes with Applications to Child Mortality and Maternal Health

    Directory of Open Access Journals (Sweden)

    Kuate-Defo, Bathélémy

    2001-01-01

    Full Text Available EnglishThis paper merges two parallel developments since the 1970s of newstatistical tools for data analysis: statistical methods known as hazard models that are used foranalyzing event-duration data and statistical methods for analyzing hierarchically clustered dataknown as multilevel models. These developments have rarely been integrated in research practice andthe formalization and estimation of models for hierarchically clustered survival data remain largelyuncharted. I attempt to fill some of this gap and demonstrate the merits of formulating and estimatingmultilevel hazard models with longitudinal data.FrenchCette étude intègre deux approches statistiques de pointe d'analyse des donnéesquantitatives depuis les années 70: les méthodes statistiques d'analyse desdonnées biographiques ou méthodes de survie et les méthodes statistiquesd'analyse des données hiérarchiques ou méthodes multi-niveaux. Ces deuxapproches ont été très peu mis en symbiose dans la pratique de recherche et parconséquent, la formulation et l'estimation des modèles appropriés aux donnéeslongitudinales et hiérarchiquement nichées demeure essentiellement un champd'investigation vierge. J'essaye de combler ce vide et j'utilise des données réellesen santé publique pour démontrer les mérites et contextes de formulation etd'estimation des modèles multi-niveaux et multi-états des données biographiqueset longitudinales.

  10. Hybrid inverse lithography techniques for advanced hierarchical memories

    Science.gov (United States)

    Xiao, Guangming; Hooker, Kevin; Irby, Dave; Zhang, Yunqiang; Ward, Brian; Cecil, Tom; Hall, Brett; Lee, Mindy; Kim, Dave; Lucas, Kevin

    2014-03-01

    Traditional segment-based model-based OPC methods have been the mainstream mask layout optimization techniques in volume production for memory and embedded memory devices for many device generations. These techniques have been continually optimized over time to meet the ever increasing difficulties of memory and memory periphery patterning. There are a range of difficult issues for patterning embedded memories successfully. These difficulties include the need for a very high level of symmetry and consistency (both within memory cells themselves and between cells) due to circuit effects such as noise margin requirements in SRAMs. Memory cells and access structures consume a large percentage of area in embedded devices so there is a very high return from shrinking the cell area as much as possible. This aggressive scaling leads to very difficult resolution, 2D CD control and process window requirements. Additionally, the range of interactions between mask synthesis corrections of neighboring areas can extend well beyond the size of the memory cell, making it difficult to fully take advantage of the inherent designed cell hierarchy in mask pattern optimization. This is especially true for non-traditional (i.e., less dependent on geometric rule) OPC/RET methods such as inverse lithography techniques (ILT) which inherently have more model-based decisions in their optimizations. New inverse methods such as model-based SRAF placement and ILT are, however, well known to have considerable benefits in finding flexible mask pattern solutions to improve process window, improve 2D CD control, and improve resolution in ultra-dense memory patterns. They also are known to reduce recipe complexity and provide native MRC compliant mask pattern solutions. Unfortunately, ILT is also known to be several times slower than traditional OPC methods due to the increased computational lithographic optimizations it performs. In this paper, we describe and present results for a methodology to

  11. Finding Within Cluster Dense Regions Using Distance Based Technique

    Directory of Open Access Journals (Sweden)

    Wesam Ashour

    2012-03-01

    Full Text Available One of the main categories in Data Clustering is density based clustering. Density based clustering techniques like DBSCAN are attractive because they can find arbitrary shaped clusters along with noisy outlier. The main weakness of the traditional density based algorithms like DBSCAN is clustering the different density level data sets. DBSCAN calculations done according to given parameters applied to all points in a data set, while densities of the data set clusters may be totally different. The proposed algorithm overcomes this weakness of the traditional density based algorithms. The algorithm starts with partitioning the data within a cluster to units based on a user parameter and compute the density for each unit separately. Consequently, the algorithm compares the results and merges neighboring units with closer approximate density values to become a new cluster. The experimental results of the simulation show that the proposed algorithm gives good results in finding clusters for different density cluster data set.

  12. Biomolecule-Assisted Hydrothermal Synthesis and Self-Assembly of Bi2Te3 Nanostring-Cluster Hierarchical Structure

    DEFF Research Database (Denmark)

    Mi, Jianli; Lock, Nina; Sun, Ting;

    2010-01-01

    A simple biomolecule-assisted hydrothermal approach has been developed for the fabrication of Bi2Te3 thermoelectric nanomaterials. The product has a nanostring-cluster hierarchical structure which is composed of ordered and aligned platelet-like crystals. The platelets are100 nm in diameter...

  13. Knowledge Engineering Technique for Cluster Development

    CERN Document Server

    Sureephong, Pradorn; Ouzrout, Yacine; Neubert, Gilles; Bouras, Abdelaziz

    2007-01-01

    After the concept of industry cluster was tangibly applied in many countries, SMEs trended to link to each other to maintain their competitiveness in the market. The major key success factors of the cluster are knowledge sharing and collaboration between partners. This knowledge is collected in form of tacit and explicit knowledge from experts and institutions within the cluster. The objective of this study is about enhancing the industry cluster with knowledge management by using knowledge engineering which is one of the most important method for managing knowledge. This work analyzed three well known knowledge engineering methods, i.e. MOKA, SPEDE and CommonKADS, and compares the capability to be implemented in the cluster context. Then, we selected one method and proposed the adapted methodology. At the end of this paper, we validated and demonstrated the proposed methodology with some primary result by using case study of handicraft cluster in Thailand.

  14. Clustering of Galaxies in a Hierarchical Universe 2 evolution to High Redshift

    CERN Document Server

    Kauffmann, G; Diaferio, A; White, S D M; Kauffmann, Guinevere; Colberg, Joerg M.; Diaferio, Antonaldo; White, Simon D.M.

    1998-01-01

    In hierarchical cosmologies the evolution of galaxy clustering depends both on cosmological quantities such as Omega and Lambda, which determine how dark matter halos form and evolve, and on the physical processes - cooling, star formation and feedback - which drive the formation of galaxies within these merging halos. In this paper, we combine dissipationless cosmological N-body simulations and semi-analytic models of galaxy formation in order to study how these two aspects interact. We focus on the differences in clustering predicted for galaxies of differing luminosity, colour, morphology and star formation rate and on what these differences can teach us about the galaxy formation process. We show that a "dip" in the amplitude of galaxy correlations between z=0 and z=1 can be an important diagnostic. Such a dip occurs in low-density CDM models because structure forms early and dark matter halos of 10**12 solar masses, containing galaxies with luminosities around L*, are unbiased tracers of the dark matter ...

  15. Large-scale multi-zone optimal power dispatch using hybrid hierarchical evolution technique

    Directory of Open Access Journals (Sweden)

    Manjaree Pandit

    2014-03-01

    Full Text Available A new hybrid technique based on hierarchical evolution is proposed for large, non-convex, multi-zone economic dispatch (MZED problems considering all practical constraints. Evolutionary/swarm intelligence-based optimisation techniques are reported to be effective only for small/medium-sized power systems. The proposed hybrid hierarchical evolution (HHE algorithm is specifically developed for solving large systems. The HHE integrates the exploration and exploitation capabilities of particle swarm optimisation and differential evolution in a novel manner such that the search efficiency is improved substantially. Most hybrid techniques export or exchange features or operations from one algorithm to the other, but in HHE their entire individual features are retained. The effectiveness of the proposed algorithm has been verified on six-test systems having different sizes and complexity levels. Non-convex MZED solution for such large and complex systems has not yet been reported.

  16. Demographic Data Assessment using Novel 3DCCOM Spatial Hierarchical Clustering: A Case Study of Sonipat Block, Haryana

    Directory of Open Access Journals (Sweden)

    Mamta Malik

    2011-09-01

    Full Text Available Cluster detection is a tool employed by GIS scientists who specialize in the field of spatial analysis. This study employed a combination of GIS, RS and a novel 3DCCOM spatial data clustering algorithm to assess the rural demographic development strategies of Sonepat block, Haryana, India. This Study is undertaken in the rural and rural-based district in India to demonstrate the integration of village-level spatial and non-spatial data in GIS environment using Hierarchical Clustering. Spatial clusters of living standard parameters, including family members, male and female population, sex ratio, total male and female education ratio etc. The paper also envisages future development and usefulness of this community GIS, Spatial data clustering tool for grass-root level planning. Any data that showsgeographic (spatial variability can be subject to cluster analysis.

  17. Multichannel biomedical time series clustering via hierarchical probabilistic latent semantic analysis.

    Science.gov (United States)

    Wang, Jin; Sun, Xiangping; Nahavandi, Saeid; Kouzani, Abbas; Wu, Yuchuan; She, Mary

    2014-11-01

    Biomedical time series clustering that automatically groups a collection of time series according to their internal similarity is of importance for medical record management and inspection such as bio-signals archiving and retrieval. In this paper, a novel framework that automatically groups a set of unlabelled multichannel biomedical time series according to their internal structural similarity is proposed. Specifically, we treat a multichannel biomedical time series as a document and extract local segments from the time series as words. We extend a topic model, i.e., the Hierarchical probabilistic Latent Semantic Analysis (H-pLSA), which was originally developed for visual motion analysis to cluster a set of unlabelled multichannel time series. The H-pLSA models each channel of the multichannel time series using a local pLSA in the first layer. The topics learned in the local pLSA are then fed to a global pLSA in the second layer to discover the categories of multichannel time series. Experiments on a dataset extracted from multichannel Electrocardiography (ECG) signals demonstrate that the proposed method performs better than previous state-of-the-art approaches and is relatively robust to the variations of parameters including length of local segments and dictionary size. Although the experimental evaluation used the multichannel ECG signals in a biometric scenario, the proposed algorithm is a universal framework for multichannel biomedical time series clustering according to their structural similarity, which has many applications in biomedical time series management. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

  18. Hierarchical clustering of breast cancer methylomes revealed differentially methylated and expressed breast cancer genes.

    Directory of Open Access Journals (Sweden)

    I-Hsuan Lin

    Full Text Available Oncogenic transformation of normal cells often involves epigenetic alterations, including histone modification and DNA methylation. We conducted whole-genome bisulfite sequencing to determine the DNA methylomes of normal breast, fibroadenoma, invasive ductal carcinomas and MCF7. The emergence, disappearance, expansion and contraction of kilobase-sized hypomethylated regions (HMRs and the hypomethylation of the megabase-sized partially methylated domains (PMDs are the major forms of methylation changes observed in breast tumor samples. Hierarchical clustering of HMR revealed tumor-specific hypermethylated clusters and differential methylated enhancers specific to normal or breast cancer cell lines. Joint analysis of gene expression and DNA methylation data of normal breast and breast cancer cells identified differentially methylated and expressed genes associated with breast and/or ovarian cancers in cancer-specific HMR clusters. Furthermore, aberrant patterns of X-chromosome inactivation (XCI was found in breast cancer cell lines as well as breast tumor samples in the TCGA BRCA (breast invasive carcinoma dataset. They were characterized with differentially hypermethylated XIST promoter, reduced expression of XIST, and over-expression of hypomethylated X-linked genes. High expressions of these genes were significantly associated with lower survival rates in breast cancer patients. Comprehensive analysis of the normal and breast tumor methylomes suggests selective targeting of DNA methylation changes during breast cancer progression. The weak causal relationship between DNA methylation and gene expression observed in this study is evident of more complex role of DNA methylation in the regulation of gene expression in human epigenetics that deserves further investigation.

  19. CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks

    Science.gov (United States)

    Franke, R.

    2016-11-01

    In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.

  20. New Alzheimer amyloid beta responsive genes identified in human neuroblastoma cells by hierarchical clustering.

    Directory of Open Access Journals (Sweden)

    Markus Uhrig

    Full Text Available Alzheimer's disease (AD is characterized by neuronal degeneration and cell loss. Abeta(42, in contrast to Abeta(40, is thought to be the pathogenic form triggering the pathological cascade in AD. In order to unravel overall gene regulation we monitored the transcriptomic responses to increased or decreased Abeta(40 and Abeta(42 levels, generated and derived from its precursor C99 (C-terminal fragment of APP comprising 99 amino acids in human neuroblastoma cells. We identified fourteen differentially expressed transcripts by hierarchical clustering and discussed their involvement in AD. These fourteen transcripts were grouped into two main clusters each showing distinct differential expression patterns depending on Abeta(40 and Abeta(42 levels. Among these transcripts we discovered an unexpected inverse and strong differential expression of neurogenin 2 (NEUROG2 and KIAA0125 in all examined cell clones. C99-overexpression had a similar effect on NEUROG2 and KIAA0125 expression as a decreased Abeta(42/Abeta(40 ratio. Importantly however, an increased Abeta(42/Abeta(40 ratio, which is typical of AD, had an inverse expression pattern of NEUROG2 and KIAA0125: An increased Abeta(42/Abeta(40 ratio up-regulated NEUROG2, but down-regulated KIAA0125, whereas the opposite regulation pattern was observed for a decreased Abeta(42/Abeta(40 ratio. We discuss the possibilities that the so far uncharacterized KIAA0125 might be a counter player of NEUROG2 and that KIAA0125 could be involved in neurogenesis, due to the involvement of NEUROG2 in developmental neural processes.

  1. Using hierarchical clustering of secreted protein families to classify and rank candidate effectors of rust fungi.

    Directory of Open Access Journals (Sweden)

    Diane G O Saunders

    Full Text Available Rust fungi are obligate biotrophic pathogens that cause considerable damage on crop plants. Puccinia graminis f. sp. tritici, the causal agent of wheat stem rust, and Melampsora larici-populina, the poplar leaf rust pathogen, have strong deleterious impacts on wheat and poplar wood production, respectively. Filamentous pathogens such as rust fungi secrete molecules called disease effectors that act as modulators of host cell physiology and can suppress or trigger host immunity. Current knowledge on effectors from other filamentous plant pathogens can be exploited for the characterisation of effectors in the genome of recently sequenced rust fungi. We designed a comprehensive in silico analysis pipeline to identify the putative effector repertoire from the genome of two plant pathogenic rust fungi. The pipeline is based on the observation that known effector proteins from filamentous pathogens have at least one of the following properties: (i contain a secretion signal, (ii are encoded by in planta induced genes, (iii have similarity to haustorial proteins, (iv are small and cysteine rich, (v contain a known effector motif or a nuclear localization signal, (vi are encoded by genes with long intergenic regions, (vii contain internal repeats, and (viii do not contain PFAM domains, except those associated with pathogenicity. We used Markov clustering and hierarchical clustering to classify protein families of rust pathogens and rank them according to their likelihood of being effectors. Using this approach, we identified eight families of candidate effectors that we consider of high value for functional characterization. This study revealed a diverse set of candidate effectors, including families of haustorial expressed secreted proteins and small cysteine-rich proteins. This comprehensive classification of candidate effectors from these devastating rust pathogens is an initial step towards probing plant germplasm for novel resistance components.

  2. Using Hierarchical Clustering of Secreted Protein Families to Classify and Rank Candidate Effectors of Rust Fungi

    Science.gov (United States)

    Saunders, Diane G. O.; Win, Joe; Cano, Liliana M.; Szabo, Les J.; Kamoun, Sophien; Raffaele, Sylvain

    2012-01-01

    Rust fungi are obligate biotrophic pathogens that cause considerable damage on crop plants. Puccinia graminis f. sp. tritici, the causal agent of wheat stem rust, and Melampsora larici-populina, the poplar leaf rust pathogen, have strong deleterious impacts on wheat and poplar wood production, respectively. Filamentous pathogens such as rust fungi secrete molecules called disease effectors that act as modulators of host cell physiology and can suppress or trigger host immunity. Current knowledge on effectors from other filamentous plant pathogens can be exploited for the characterisation of effectors in the genome of recently sequenced rust fungi. We designed a comprehensive in silico analysis pipeline to identify the putative effector repertoire from the genome of two plant pathogenic rust fungi. The pipeline is based on the observation that known effector proteins from filamentous pathogens have at least one of the following properties: (i) contain a secretion signal, (ii) are encoded by in planta induced genes, (iii) have similarity to haustorial proteins, (iv) are small and cysteine rich, (v) contain a known effector motif or a nuclear localization signal, (vi) are encoded by genes with long intergenic regions, (vii) contain internal repeats, and (viii) do not contain PFAM domains, except those associated with pathogenicity. We used Markov clustering and hierarchical clustering to classify protein families of rust pathogens and rank them according to their likelihood of being effectors. Using this approach, we identified eight families of candidate effectors that we consider of high value for functional characterization. This study revealed a diverse set of candidate effectors, including families of haustorial expressed secreted proteins and small cysteine-rich proteins. This comprehensive classification of candidate effectors from these devastating rust pathogens is an initial step towards probing plant germplasm for novel resistance components. PMID:22238666

  3. Symptom Clusters in People Living with HIV Attending Five Palliative Care Facilities in Two Sub-Saharan African Countries: A Hierarchical Cluster Analysis.

    Science.gov (United States)

    Moens, Katrien; Siegert, Richard J; Taylor, Steve; Namisango, Eve; Harding, Richard

    2015-01-01

    Symptom research across conditions has historically focused on single symptoms, and the burden of multiple symptoms and their interactions has been relatively neglected especially in people living with HIV. Symptom cluster studies are required to set priorities in treatment planning, and to lessen the total symptom burden. This study aimed to identify and compare symptom clusters among people living with HIV attending five palliative care facilities in two sub-Saharan African countries. Data from cross-sectional self-report of seven-day symptom prevalence on the 32-item Memorial Symptom Assessment Scale-Short Form were used. A hierarchical cluster analysis was conducted using Ward's method applying squared Euclidean Distance as the similarity measure to determine the clusters. Contingency tables, X2 tests and ANOVA were used to compare the clusters by patient specific characteristics and distress scores. Among the sample (N=217) the mean age was 36.5 (SD 9.0), 73.2% were female, and 49.1% were on antiretroviral therapy (ART). The cluster analysis produced five symptom clusters identified as: 1) dermatological; 2) generalised anxiety and elimination; 3) social and image; 4) persistently present; and 5) a gastrointestinal-related symptom cluster. The patients in the first three symptom clusters reported the highest physical and psychological distress scores. Patient characteristics varied significantly across the five clusters by functional status (worst functional physical status in cluster one, pclusters two and three, p=0.012); global distress (F=26.8, pcluster one, best for cluster four). The greatest burden is associated with cluster one, and should be prioritised in clinical management. Further symptom cluster research in people living with HIV with longitudinally collected symptom data to test cluster stability and identify common symptom trajectories is recommended.

  4. Structural system identification using degree of freedom-based reduction and hierarchical clustering algorithm

    Science.gov (United States)

    Chang, Seongmin; Baek, Sungmin; Kim, Ki-Ook; Cho, Maenghyo

    2015-06-01

    A system identification method has been proposed to validate finite element models of complex structures using measured modal data. Finite element method is used for the system identification as well as the structural analysis. In perturbation methods, the perturbed system is expressed as a combination of the baseline structure and the related perturbations. The changes in dynamic responses are applied to determine the structural modifications so that the equilibrium may be satisfied in the perturbed system. In practical applications, the dynamic measurements are carried out on a limited number of accessible nodes and associated degrees of freedom. The equilibrium equation is, in principle, expressed in terms of the measured (master, primary) and unmeasured (slave, secondary) degrees of freedom. Only the specified degrees of freedom are included in the equation formulation for identification and the unspecified degrees of freedom are eliminated through the iterative improved reduction scheme. A large number of system parameters are included as the unknown variables in the system identification of large-scaled structures. The identification problem with large number of system parameters requires a large amount of computation time and resources. In the present study, a hierarchical clustering algorithm is applied to reduce the number of system parameters effectively. Numerical examples demonstrate that the proposed method greatly improves the accuracy and efficiency in the inverse problem of identification.

  5. Hierarchical black hole triples in young star clusters: impact of Kozai-Lidov resonance on mergers

    CERN Document Server

    Kimpson, Thomas O; Mapelli, Michela; Ziosi, Brunetto M

    2016-01-01

    Mergers of compact object binaries are one of the most powerful sources of gravitational waves (GWs) in the frequency range of second-generation ground-based gravitational wave detectors (Advanced LIGO and Virgo). Dynamical simulations of young dense star clusters (SCs) indicate that ~27 per cent of all double compact object binaries are members of hierarchical triple systems (HTs). In this paper, we consider 570 HTs composed of three compact objects (black holes or neutron stars) that formed dynamically in N-body simulations of young dense SCs. We simulate them for a Hubble time with a new code based on the Mikkola's algorithmic regularization scheme, including the 2.5 post-Newtonian term. We find that ~88 per cent of the simulated systems develop Kozai-Lidov (KL) oscillations. KL resonance triggers the merger of the inner binary in three systems (corresponding to 0.5 per cent of the simulated HTs), by increasing the eccentricity of the inner binary. Accounting for KL oscillations leads to an increase of the...

  6. Hierarchical black hole triples in young star clusters: impact of Kozai-Lidov resonance on mergers

    Science.gov (United States)

    Kimpson, Thomas O.; Spera, Mario; Mapelli, Michela; Ziosi, Brunetto M.

    2016-12-01

    Mergers of compact-object binaries are one of the most powerful sources of gravitational waves (GWs) in the frequency range of second-generation ground-based GW detectors (advanced LIGO and Virgo). Dynamical simulations of young dense star clusters (SCs) indicate that ˜27 per cent of all double compact-object binaries are members of hierarchical triple systems (HTs). In this paper, we consider 570 HTs composed of three compact objects (black holes or neutron stars) that formed dynamically in N-body simulations of young dense SCs. We simulate them for a Hubble time with a new code based on the Mikkola's algorithmic regularization scheme, including the 2.5 post-Newtonian term. We find that ˜88 per cent of the simulated systems develop Kozai-Lidov (KL) oscillations. KL resonance triggers the merger of the inner binary in three systems (corresponding to 0.5 per cent of the simulated HTs), by increasing the eccentricity of the inner binary. Accounting for KL oscillations leads to an increase of the total expected merger rate by ≈50 per cent. All binaries that merge because of KL oscillations were formed by dynamical exchanges (i.e. none is a primordial binary) and have chirp mass >20 M⊙. This result might be crucial to interpret the formation channel of the first recently detected GW events.

  7. Ingredients and Process Standardization of Thepla: An Indian Unleavened Vegetable Flatbread using Hierarchical Cluster Analysis

    Directory of Open Access Journals (Sweden)

    S.S. Arya

    2012-10-01

    Full Text Available Thepla is an Indian unleavened flatbread made from whole-wheat flour with added spices and vegetables. It is particularly consumed in western zone of the India. The preparation of thepla is tedious, time consuming and requires skill. In the present study standardization of thepla ingredients were carried out by standardizing each ingredient on the basis of Overall Acceptability (OA score. Sensory analysis was carried out using nine-point hedonic rating scale with ten trained panellists. Standardized ingredients of thepla were: salt 3%, red chili powder 2.5%, fenugreek leaves 12%, cumin seed powder 0.6%, coriander seed powder 0.6%, ginger garlic paste (1:1 6%, asafoetida 0.6% and oil 3% w/w of whole wheat flour on the basis of highest sensory OA score. Further thepla process parameters such as time, temperature, diameter of thepla and weight of dough were standardized on the basis of sensory OA score. Obtained sensory score data was processed for Hierarchical Cluster Analysis (HCA.

  8. A new Hierarchical Group Key Management based on Clustering Scheme for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Ayman EL-SAYED

    2014-05-01

    Full Text Available The migration from wired network to wireless network has been a global trend in the past few decades because they provide anytime-anywhere networking services. The wireless networks are rapidly deployed in the future, secure wireless environment will be mandatory. As well, The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks,Mobile Ad hoc Networks (MANET is one of the most important and unique applications. MANET is a collection of autonomous nodes or terminals which communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. Due to the nature of unreliable wireless medium data transfer is a major problem in MANET and it lacks security and reliability of data. The most suitable solution to provide the expected level of security to these services is the provision of a key management protocol. A Key management is vital part of security. This issue is even bigger in wireless network compared to wired network. The distribution of keys in an authenticated manner is a difficult task in MANET. When a member leaves or joins the group, it needs to generate a new key to maintain forward and backward secrecy. In this paper, we propose a new group key management schemes namely a Hierarchical, Simple, Efficient and Scalable Group Key (HSESGK based on clustering management scheme for MANETs and different other schemes are classified. Group members deduce the group key in a distributed manner.

  9. MAP-Based Underdetermined Blind Source Separation of Convolutive Mixtures by Hierarchical Clustering and -Norm Minimization

    Directory of Open Access Journals (Sweden)

    Kellermann Walter

    2007-01-01

    Full Text Available We address the problem of underdetermined BSS. While most previous approaches are designed for instantaneous mixtures, we propose a time-frequency-domain algorithm for convolutive mixtures. We adopt a two-step method based on a general maximum a posteriori (MAP approach. In the first step, we estimate the mixing matrix based on hierarchical clustering, assuming that the source signals are sufficiently sparse. The algorithm works directly on the complex-valued data in the time-frequency domain and shows better convergence than algorithms based on self-organizing maps. The assumption of Laplacian priors for the source signals in the second step leads to an algorithm for estimating the source signals. It involves the -norm minimization of complex numbers because of the use of the time-frequency-domain approach. We compare a combinatorial approach initially designed for real numbers with a second-order cone programming (SOCP approach designed for complex numbers. We found that although the former approach is not theoretically justified for complex numbers, its results are comparable to, or even better than, the SOCP solution. The advantage is a lower computational cost for problems with low input/output dimensions.

  10. Hierarchical Clustering Multi-Task Learning for Joint Human Action Grouping and Recognition.

    Science.gov (United States)

    Liu, An-An; Su, Yu-Ting; Nie, Wei-Zhi; Kankanhalli, Mohan

    2017-01-01

    This paper proposes a hierarchical clustering multi-task learning (HC-MTL) method for joint human action grouping and recognition. Specifically, we formulate the objective function into the group-wise least square loss regularized by low rank and sparsity with respect to two latent variables, model parameters and grouping information, for joint optimization. To handle this non-convex optimization, we decompose it into two sub-tasks, multi-task learning and task relatedness discovery. First, we convert this non-convex objective function into the convex formulation by fixing the latent grouping information. This new objective function focuses on multi-task learning by strengthening the shared-action relationship and action-specific feature learning. Second, we leverage the learned model parameters for the task relatedness measure and clustering. In this way, HC-MTL can attain both optimal action models and group discovery by alternating iteratively. The proposed method is validated on three kinds of challenging datasets, including six realistic action datasets (Hollywood2, YouTube, UCF Sports, UCF50, HMDB51 & UCF101), two constrained datasets (KTH & TJU), and two multi-view datasets (MV-TJU & IXMAS). The extensive experimental results show that: 1) HC-MTL can produce competing performances to the state of the arts for action recognition and grouping; 2) HC-MTL can overcome the difficulty in heuristic action grouping simply based on human knowledge; 3) HC-MTL can avoid the possible inconsistency between the subjective action grouping depending on human knowledge and objective action grouping based on the feature subspace distributions of multiple actions. Comparison with the popular clustered multi-task learning further reveals that the discovered latent relatedness by HC-MTL aids inducing the group-wise multi-task learning and boosts the performance. To the best of our knowledge, ours is the first work that breaks the assumption that all actions are either

  11. Hierarchical clustering of ryanodine receptors enables emergence of a calcium clock in sinoatrial node cells.

    Science.gov (United States)

    Stern, Michael D; Maltseva, Larissa A; Juhaszova, Magdalena; Sollott, Steven J; Lakatta, Edward G; Maltsev, Victor A

    2014-05-01

    rate in response to β-adrenergic stimulation. The model indicates that the hierarchical clustering of surface RyRs in SANCs may be a crucial adaptive mechanism. Pathological desynchronization of the clocks may explain sinus node dysfunction in heart failure and RyR mutations.

  12. DETERMINE OPTIMUM NUMBER OF COMPACT OVERLAPPED CLUSTERS USING FRLVQ TECHNIQUE

    Institute of Scientific and Technical Information of China (English)

    Xu Wenhuan; Huang Qiang; Ji Zhen; Zhang Jihong

    2005-01-01

    A method, named XHJ-method, is proposed in this letter to determine the number of clusters of a data set, which incorporates with the Fuzzy Reinforced Learning Vector Quantization (FRLVQ) technique. The simulation results show that this new method works well for the traditional iris data and an artificial data set, which contains un-equally sized and spaced clusters.

  13. Taxonomy of Manufacturing Flexibility at Manufacturing Companies Using Imperialist Competitive Algorithms, Support Vector Machines and Hierarchical Cluster Analysis

    Directory of Open Access Journals (Sweden)

    M. Khoobiyan

    2017-04-01

    Full Text Available Manufacturing flexibility is a multidimensional concept and manufacturing companies act differently in using these dimensions. The purpose of this study is to investigate taxonomy and identify dominant groups of manufacturing flexibility. Dimensions of manufacturing flexibility are extracted by content analysis of literature and expert judgements. Manufacturing flexibility was measured by using a questionnaire developed to survey managers of manufacturing companies. The sample size was set at 379. To identify dominant groups of flexibility based on dimensions of flexibility determined, Hierarchical Cluster Analysis (HCA, Imperialist Competitive Algorithms (ICAs and Support Vector Machines (SVMs were used by cluster validity indices. The best algorithm for clustering was SVMs with three clusters, designated as leading delivery-based flexibility, frugal flexibility and sufficient plan-based flexibility.

  14. Hierarchical SnO2 Nanospheres: Bio-inspired Mineralization, Vulcanization, Oxidation Techniques, and the Application for NO Sensors

    Science.gov (United States)

    Wang, Lei; Chen, Yuejiao; Ma, Jianmin; Chen, Libao; Xu, Zhi; Wang, Taihong

    2013-12-01

    Controllable synthesis and surface engineering of nanomaterials are of strategic importance for tailoring their properties. Here, we demonstrate that the synthesis and surface adjustment of highly stable hierarchical of SnO2 nanospheres can be realized by biomineralization, vulcanization and oxidation techniques. Furthermore, we reveal that the highly stable hierarchical SnO2 nanospheres ensure a remarkable sensitivity towards NO gas with fast response and recovery due to their high crystallinity and special structure. Such technique acquiring highly stable hierarchical SnO2 nanospheres offers promising potential for future practical applications in monitoring the emission from waste incinerators and combustion process of fossil fuels.

  15. An Empirical Analysis of Rough Set Categorical Clustering Techniques

    Science.gov (United States)

    2017-01-01

    Clustering a set of objects into homogeneous groups is a fundamental operation in data mining. Recently, many attentions have been put on categorical data clustering, where data objects are made up of non-numerical attributes. For categorical data clustering the rough set based approaches such as Maximum Dependency Attribute (MDA) and Maximum Significance Attribute (MSA) has outperformed their predecessor approaches like Bi-Clustering (BC), Total Roughness (TR) and Min-Min Roughness(MMR). This paper presents the limitations and issues of MDA and MSA techniques on special type of data sets where both techniques fails to select or faces difficulty in selecting their best clustering attribute. Therefore, this analysis motivates the need to come up with better and more generalize rough set theory approach that can cope the issues with MDA and MSA. Hence, an alternative technique named Maximum Indiscernible Attribute (MIA) for clustering categorical data using rough set indiscernible relations is proposed. The novelty of the proposed approach is that, unlike other rough set theory techniques, it uses the domain knowledge of the data set. It is based on the concept of indiscernibility relation combined with a number of clusters. To show the significance of proposed approach, the effect of number of clusters on rough accuracy, purity and entropy are described in the form of propositions. Moreover, ten different data sets from previously utilized research cases and UCI repository are used for experiments. The results produced in tabular and graphical forms shows that the proposed MIA technique provides better performance in selecting the clustering attribute in terms of purity, entropy, iterations, time, accuracy and rough accuracy. PMID:28068344

  16. An Empirical Analysis of Rough Set Categorical Clustering Techniques.

    Science.gov (United States)

    Uddin, Jamal; Ghazali, Rozaida; Deris, Mustafa Mat

    2017-01-01

    Clustering a set of objects into homogeneous groups is a fundamental operation in data mining. Recently, many attentions have been put on categorical data clustering, where data objects are made up of non-numerical attributes. For categorical data clustering the rough set based approaches such as Maximum Dependency Attribute (MDA) and Maximum Significance Attribute (MSA) has outperformed their predecessor approaches like Bi-Clustering (BC), Total Roughness (TR) and Min-Min Roughness(MMR). This paper presents the limitations and issues of MDA and MSA techniques on special type of data sets where both techniques fails to select or faces difficulty in selecting their best clustering attribute. Therefore, this analysis motivates the need to come up with better and more generalize rough set theory approach that can cope the issues with MDA and MSA. Hence, an alternative technique named Maximum Indiscernible Attribute (MIA) for clustering categorical data using rough set indiscernible relations is proposed. The novelty of the proposed approach is that, unlike other rough set theory techniques, it uses the domain knowledge of the data set. It is based on the concept of indiscernibility relation combined with a number of clusters. To show the significance of proposed approach, the effect of number of clusters on rough accuracy, purity and entropy are described in the form of propositions. Moreover, ten different data sets from previously utilized research cases and UCI repository are used for experiments. The results produced in tabular and graphical forms shows that the proposed MIA technique provides better performance in selecting the clustering attribute in terms of purity, entropy, iterations, time, accuracy and rough accuracy.

  17. Genetic Algorithm for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sajid Hussain

    2007-09-01

    Full Text Available Large scale wireless sensor networks (WSNs can be used for various pervasive and ubiquitous applications such as security, health-care, industry automation, agriculture, environment and habitat monitoring. As hierarchical clusters can reduce the energy consumption requirements for WSNs, we investigate intelligent techniques for cluster formation and management. A genetic algorithm (GA is used to create energy efficient clusters for data dissemination in wireless sensor networks. The simulation results show that the proposed intelligent hierarchical clustering technique can extend the network lifetime for different network deployment environments.

  18. A Resting-State Brain Functional Network Study in MDD Based on Minimum Spanning Tree Analysis and the Hierarchical Clustering

    Directory of Open Access Journals (Sweden)

    Xiaowei Li

    2017-01-01

    Full Text Available A large number of studies demonstrated that major depressive disorder (MDD is characterized by the alterations in brain functional connections which is also identifiable during the brain’s “resting-state.” But, in the present study, the approach of constructing functional connectivity is often biased by the choice of the threshold. Besides, more attention was paid to the number and length of links in brain networks, and the clustering partitioning of nodes was unclear. Therefore, minimum spanning tree (MST analysis and the hierarchical clustering were first used for the depression disease in this study. Resting-state electroencephalogram (EEG sources were assessed from 15 healthy and 23 major depressive subjects. Then the coherence, MST, and the hierarchical clustering were obtained. In the theta band, coherence analysis showed that the EEG coherence of the MDD patients was significantly higher than that of the healthy controls especially in the left temporal region. The MST results indicated the higher leaf fraction in the depressed group. Compared with the normal group, the major depressive patients lost clustering in frontal regions. Our findings suggested that there was a stronger brain interaction in the MDD group and a left-right functional imbalance in the frontal regions for MDD controls.

  19. Symptom Clusters in People Living with HIV Attending Five Palliative Care Facilities in Two Sub-Saharan African Countries: A Hierarchical Cluster Analysis.

    Directory of Open Access Journals (Sweden)

    Katrien Moens

    Full Text Available Symptom research across conditions has historically focused on single symptoms, and the burden of multiple symptoms and their interactions has been relatively neglected especially in people living with HIV. Symptom cluster studies are required to set priorities in treatment planning, and to lessen the total symptom burden. This study aimed to identify and compare symptom clusters among people living with HIV attending five palliative care facilities in two sub-Saharan African countries.Data from cross-sectional self-report of seven-day symptom prevalence on the 32-item Memorial Symptom Assessment Scale-Short Form were used. A hierarchical cluster analysis was conducted using Ward's method applying squared Euclidean Distance as the similarity measure to determine the clusters. Contingency tables, X2 tests and ANOVA were used to compare the clusters by patient specific characteristics and distress scores.Among the sample (N=217 the mean age was 36.5 (SD 9.0, 73.2% were female, and 49.1% were on antiretroviral therapy (ART. The cluster analysis produced five symptom clusters identified as: 1 dermatological; 2 generalised anxiety and elimination; 3 social and image; 4 persistently present; and 5 a gastrointestinal-related symptom cluster. The patients in the first three symptom clusters reported the highest physical and psychological distress scores. Patient characteristics varied significantly across the five clusters by functional status (worst functional physical status in cluster one, p<0.001; being on ART (highest proportions for clusters two and three, p=0.012; global distress (F=26.8, p<0.001, physical distress (F=36.3, p<0.001 and psychological distress subscale (F=21.8, p<0.001 (all subscales worst for cluster one, best for cluster four.The greatest burden is associated with cluster one, and should be prioritised in clinical management. Further symptom cluster research in people living with HIV with longitudinally collected symptom data to

  20. Investigation on IMCP based clustering in LTE-M communication for smart metering applications

    National Research Council Canada - National Science Library

    Kartik Vishal Deshpande; A. Rajesh

    2017-01-01

    .... This paper investigates the proposed Improved M2M Clustering Process (IMCP) based clustering technique and it is compared with two well-known clustering algorithms, namely, Low Energy Adaptive Clustering Hierarchical (LEACH...

  1. Clustering economies based on multiple criteria decision making techniques

    Directory of Open Access Journals (Sweden)

    Mansour Momeni

    2011-10-01

    Full Text Available One of the primary concerns on many countries is to determine different important factors affecting economic growth. In this paper, we study some factors such as unemployment rate, inflation ratio, population growth, average annual income, etc to cluster different countries. The proposed model of this paper uses analytical hierarchy process (AHP to prioritize the criteria and then uses a K-mean technique to cluster 59 countries based on the ranked criteria into four groups. The first group includes countries with high standards such as Germany and Japan. In the second cluster, there are some developing countries with relatively good economic growth such as Saudi Arabia and Iran. The third cluster belongs to countries with faster rates of growth compared with the countries located in the second group such as China, India and Mexico. Finally, the fourth cluster includes countries with relatively very low rates of growth such as Jordan, Mali, Niger, etc.

  2. Clustering economies based on multiple criteria decision making techniques

    OpenAIRE

    2011-01-01

    One of the primary concerns on many countries is to determine different important factors affecting economic growth. In this paper, we study some factors such as unemployment rate, inflation ratio, population growth, average annual income, etc to cluster different countries. The proposed model of this paper uses analytical hierarchy process (AHP) to prioritize the criteria and then uses a K-mean technique to cluster 59 countries based on the ranked criteria into four groups. The first group i...

  3. Improved Estimates of the Milky Way's Disk Scale Length From Hierarchical Bayesian Techniques

    CERN Document Server

    Licquia, Timothy C

    2016-01-01

    The exponential scale length ($L_d$) of the Milky Way's (MW's) disk is a critical parameter for describing the global physical size of our Galaxy, important both for interpreting other Galactic measurements and helping us to understand how our Galaxy fits into extragalactic contexts. Unfortunately, current estimates span a wide range of values and often are statistically incompatible with one another. Here, we aim to determine an improved, aggregate estimate for $L_d$ by utilizing a hierarchical Bayesian (HB) meta-analysis technique that accounts for the possibility that any one measurement has not properly accounted for all statistical or systematic errors. Within this machinery we explore a variety of ways of modeling the nature of problematic measurements, and then use a Bayesian model averaging technique to derive net posterior distributions that incorporate any model-selection uncertainty. Our meta-analysis combines 29 different (15 visible and 14 infrared) photometric measurements of $L_d$ available in ...

  4. Preparation of hierarchically aligned carbon nanotube films using the Langmuir-Blodgett technique.

    Science.gov (United States)

    Lee, Jae-Hyeok; Kang, Won-Seok; Nam, Gwang-Hyeon; Choi, Sung-Wook; Kim, Jae-Ho

    2009-12-01

    Hierarchically-aligned single-walled carbon nanotube (SWNT) films over large areas were fabricated by using Langmuir-Blodgett (LB) technique. Thiophenyl-modified SWNTs spreading solution in chloroform was prepared through amidation reaction of oxidized SWNTs. The resulting SWNTs were found to form stable colloidal suspensions in organic solvents, such as chloroform, which is a suitable solvent for the LB application. The compression of the thiophenyl-modified SWNTs spread onto the water surface of an LB trough leading to a uniform SWNT Langmuir monolayer, where SWNTs were aligned parallel to the trough barrier. Optical anisotropy of SWNTs LB films on quartz substrate was confirmed by polarized UV-Vis/NIR spectroscopic measurement. Moreover, the electrical conductivity of the resulting SWNT films, which were parallel to the tube axis, was found to be approximately 15 times higher than those that were perpendicular to the axis, reflecting anisotropic electrical properties due to the uniaxial alignment of individual SWNT bundles.

  5. Investigating the effects of climate variations on bacillary dysentery incidence in northeast China using ridge regression and hierarchical cluster analysis

    Directory of Open Access Journals (Sweden)

    Guo Junqiao

    2008-09-01

    Full Text Available Abstract Background The effects of climate variations on bacillary dysentery incidence have gained more recent concern. However, the multi-collinearity among meteorological factors affects the accuracy of correlation with bacillary dysentery incidence. Methods As a remedy, a modified method to combine ridge regression and hierarchical cluster analysis was proposed for investigating the effects of climate variations on bacillary dysentery incidence in northeast China. Results All weather indicators, temperatures, precipitation, evaporation and relative humidity have shown positive correlation with the monthly incidence of bacillary dysentery, while air pressure had a negative correlation with the incidence. Ridge regression and hierarchical cluster analysis showed that during 1987–1996, relative humidity, temperatures and air pressure affected the transmission of the bacillary dysentery. During this period, all meteorological factors were divided into three categories. Relative humidity and precipitation belonged to one class, temperature indexes and evaporation belonged to another class, and air pressure was the third class. Conclusion Meteorological factors have affected the transmission of bacillary dysentery in northeast China. Bacillary dysentery prevention and control would benefit from by giving more consideration to local climate variations.

  6. Software refactoring at the package level using clustering techniques

    KAUST Repository

    Alkhalid, A.

    2011-01-01

    Enhancing, modifying or adapting the software to new requirements increases the internal software complexity. Software with high level of internal complexity is difficult to maintain. Software refactoring reduces software complexity and hence decreases the maintenance effort. However, software refactoring becomes quite challenging task as the software evolves. The authors use clustering as a pattern recognition technique to assist in software refactoring activities at the package level. The approach presents a computer aided support for identifying ill-structured packages and provides suggestions for software designer to balance between intra-package cohesion and inter-package coupling. A comparative study is conducted applying three different clustering techniques on different software systems. In addition, the application of refactoring at the package level using an adaptive k-nearest neighbour (A-KNN) algorithm is introduced. The authors compared A-KNN technique with the other clustering techniques (viz. single linkage algorithm, complete linkage algorithm and weighted pair-group method using arithmetic averages). The new technique shows competitive performance with lower computational complexity. © 2011 The Institution of Engineering and Technology.

  7. [The hierarchical clustering analysis of hyperspectral image based on probabilistic latent semantic analysis].

    Science.gov (United States)

    Yi, Wen-Bin; Shen, Li; Qi, Yin-Feng; Tang, Hong

    2011-09-01

    The paper introduces the Probabilistic Latent Semantic Analysis (PLSA) to the image clustering and an effective image clustering algorithm using the semantic information from PLSA is proposed which is used for hyperspectral images. Firstly, the ISODATA algorithm is used to obtain the initial clustering result of hyperspectral image and the clusters of the initial clustering result are considered as the visual words of the PLSA. Secondly, the object-oriented image segmentation algorithm is used to partition the hyperspectral image and segments with relatively pure pixels are regarded as documents in PLSA. Thirdly, a variety of identification methods which can estimate the best number of cluster centers is combined to get the number of latent semantic topics. Then the conditional distributions of visual words in topics and the mixtures of topics in different documents are estimated by using PLSA. Finally, the conditional probabilistic of latent semantic topics are distinguished using statistical pattern recognition method, the topic type for each visual in each document will be given and the clustering result of hyperspectral image are then achieved. Experimental results show the clusters of the proposed algorithm are better than K-MEANS and ISODATA in terms of object-oriented property and the clustering result is closer to the distribution of real spatial distribution of surface.

  8. Adaptive Techniques for Clustered N-Body Cosmological Simulations

    CERN Document Server

    Menon, Harshitha; Zheng, Gengbin; Jetley, Pritish; Kale, Laxmikant; Quinn, Thomas; Governato, Fabio

    2014-01-01

    ChaNGa is an N-body cosmology simulation application implemented using Charm++. In this paper, we present the parallel design of ChaNGa and address many challenges arising due to the high dynamic ranges of clustered datasets. We focus on optimizations based on adaptive techniques for scaling to more than 128K cores. We demonstrate strong scaling on up to 512K cores of Blue Waters evolving 12 and 24 billion particles. We also show strong scaling of highly clustered datasets on up to 128K cores.

  9. Comparison of multianalyte proficiency test results by sum of ranking differences, principal component analysis, and hierarchical cluster analysis.

    Science.gov (United States)

    Škrbić, Biljana; Héberger, Károly; Durišić-Mladenović, Nataša

    2013-10-01

    Sum of ranking differences (SRD) was applied for comparing multianalyte results obtained by several analytical methods used in one or in different laboratories, i.e., for ranking the overall performances of the methods (or laboratories) in simultaneous determination of the same set of analytes. The data sets for testing of the SRD applicability contained the results reported during one of the proficiency tests (PTs) organized by EU Reference Laboratory for Polycyclic Aromatic Hydrocarbons (EU-RL-PAH). In this way, the SRD was also tested as a discriminant method alternative to existing average performance scores used to compare mutlianalyte PT results. SRD should be used along with the z scores--the most commonly used PT performance statistics. SRD was further developed to handle the same rankings (ties) among laboratories. Two benchmark concentration series were selected as reference: (a) the assigned PAH concentrations (determined precisely beforehand by the EU-RL-PAH) and (b) the averages of all individual PAH concentrations determined by each laboratory. Ranking relative to the assigned values and also to the average (or median) values pointed to the laboratories with the most extreme results, as well as revealed groups of laboratories with similar overall performances. SRD reveals differences between methods or laboratories even if classical test(s) cannot. The ranking was validated using comparison of ranks by random numbers (a randomization test) and using seven folds cross-validation, which highlighted the similarities among the (methods used in) laboratories. Principal component analysis and hierarchical cluster analysis justified the findings based on SRD ranking/grouping. If the PAH-concentrations are row-scaled, (i.e., z scores are analyzed as input for ranking) SRD can still be used for checking the normality of errors. Moreover, cross-validation of SRD on z scores groups the laboratories similarly. The SRD technique is general in nature, i.e., it can

  10. Marine data users clustering using data mining technique

    Directory of Open Access Journals (Sweden)

    Farnaz Ghiasi

    2015-09-01

    Full Text Available The objective of this research is marine data users clustering using data mining technique. To achieve this objective, marine organizations will enable to know their data and users requirements. In this research, CRISP-DM standard model was used to implement the data mining technique. The required data was extracted from 500 marine data users profile database of Iranian National Institute for Oceanography and Atmospheric Sciences (INIOAS from 1386 to 1393. The TwoStep algorithm was used for clustering. In this research, patterns was discovered between marine data users such as student, organization and scientist and their data request (Data source, Data type, Data set, Parameter and Geographic area using clustering for the first time. The most important clusters are: Student with International data source, Chemistry data type, “World Ocean Database” dataset, Persian Gulf geographic area and Organization with Nitrate parameter. Senior managers of the marine organizations will enable to make correct decisions concerning their existing data. They will direct to planning for better data collection in the future. Also data users will guide with respect to their requests. Finally, the valuable suggestions were offered to improve the performance of marine organizations.

  11. Energy Efficient Zone Division Multihop Hierarchical Clustering Algorithm for Load Balancing in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Ashim Kumar Ghosh

    2011-12-01

    Full Text Available Wireless sensor nodes are use most embedded computing application. Multihop cluster hierarchy has been presented for large wireless sensor networks (WSNs that can provide scalable routing, data aggregation, and querying. The energy consumption rate for sensors in a WSN varies greatly based on the protocols the sensors use for communications. In this paper we present a cluster based routing algorithm. One of our main goals is to design the energy efficient routing protocol. Here we try to solve the usual problems of WSNs. We know the efficiency of WSNs depend upon the distance between node to base station and the amount of data to be transferred and the performance of clustering is greatly influenced by the selection of cluster-heads, which are in charge of creating clusters and controlling member nodes. This algorithm makes the best use of node with low number of cluster head know as super node. Here we divided the full region in four equal zones and the centre area of the region is used to select for super node. Each zone is considered separately and the zone may be or not divided further that’s depending upon the density of nodes in that zone and capability of the super node. This algorithm forms multilayer communication. The no of layer depends on the network current load and statistics. Our algorithm is easily extended to generate a hierarchy of cluster heads to obtain better network management and energy efficiency.

  12. Brain tumor segmentation based on a hybrid clustering technique

    Directory of Open Access Journals (Sweden)

    Eman Abdel-Maksoud

    2015-03-01

    This paper presents an efficient image segmentation approach using K-means clustering technique integrated with Fuzzy C-means algorithm. It is followed by thresholding and level set segmentation stages to provide an accurate brain tumor detection. The proposed technique can get benefits of the K-means clustering for image segmentation in the aspects of minimal computation time. In addition, it can get advantages of the Fuzzy C-means in the aspects of accuracy. The performance of the proposed image segmentation approach was evaluated by comparing it with some state of the art segmentation algorithms in case of accuracy, processing time, and performance. The accuracy was evaluated by comparing the results with the ground truth of each processed image. The experimental results clarify the effectiveness of our proposed approach to deal with a higher number of segmentation problems via improving the segmentation quality and accuracy in minimal execution time.

  13. Cluster based hierarchical resource searching model in P2P network

    Institute of Scientific and Technical Information of China (English)

    Yang Ruijuan; Liu Jian; Tian Jingwen

    2007-01-01

    For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network,auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.

  14. Inter-Cluster Routing Authentication for Ad Hoc Networks by a Hierarchical Key Scheme

    Institute of Scientific and Technical Information of China (English)

    Yueh-Min Huang; Hua-Yi Lin; Tzone-I Wang

    2006-01-01

    Dissimilar to traditional networks, the features of mobile wireless devices that can actively form a network without any infrastructure mean that mobile ad hoc networks frequently display partition due to node mobility or link failures. These indicate that an ad hoc network is difficult to provide on-line access to a trusted authority server. Therefore,applying traditional Public Key Infrastructure (PKI) security framework to mobile ad hoc networks will cause insecurities.This study proposes a scalable and elastic key management scheme integrated into Cluster Based Secure Routing Protocol (CBSRP) to enhance security and non-repudiation of routing authentication, and introduces an ID-Based internal routing authentication scheme to enhance the routing performance in an internal cluster. Additionally, a method of performing routing authentication between internal and external clusters, as well as inter-cluster routing authentication, is developed.The proposed cluster-based key management scheme distributes trust to an aggregation of cluster heads using a threshold scheme faculty, provides Certificate Authority (CA) with a fault tolerance mechanism to prevent a single point of compromise or failure, and saves CA large repositories from maintaining member certificates, making ad hoc networks robust to malicious behaviors and suitable for numerous mobile devices.

  15. Routing Technique Based on Clustering for Data Duplication Prevention in Wireless Sensor Network

    OpenAIRE

    Boseung Kim; HuiBin Lim; Yongtae Shin

    2009-01-01

    Wireless Sensor Networks is important to node’s energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes, sensor network’s routing technique is divided by flat routing and hierarchical routing technique. Specially, hierarchical routing technique is energy-efficient routing protocol to pare down energy consumption of whole sensor nodes and to scatter energy con...

  16. Investigating the provenance of iron artifacts of the Royal Iron Factory of Sao Joao de Ipanema by hierarchical cluster analysis of EDS microanalyses of slag inclusions

    Energy Technology Data Exchange (ETDEWEB)

    Mamani-Calcina, Elmer Antonio; Landgraf, Fernando Jose Gomes; Azevedo, Cesar Roberto de Farias, E-mail: c.azevedo@usp.br [Universidade de Sao Paulo (USP), Sao Paulo, SP (Brazil). Escola Politecnica. Departmento de Engenharia Metalurgica e de Materiais

    2017-01-15

    Microstructural characterization techniques, including EDX (Energy Dispersive X-ray Analysis) microanalyses, were used to investigate the slag inclusions in the microstructure of ferrous artifacts of the Royal Iron Factory of Sao Joao de Ipanema (first steel plant of Brazil, XIX century), the D. Pedro II Bridge (located in Bahia, assembled in XIX century and produced in Scotland) and the archaeological sites of Sao Miguel de Missoes (Rio Grande do Sul, Brazil, production site of iron artifacts, the XVIII century) and Afonso Sardinha (Sao Paulo, Brazil production site of iron artifacts, XVI century). The microanalyses results of the main micro constituents of the microstructure of the slag inclusions were investigated by hierarchical cluster analysis and the dendrogram with the microanalyses results of the wüstite phase (using as critical variables the contents of MnO, MgO, Al{sub 2}O{sub 3}, V{sub 2}O{sub 5} and TiO{sub 2}) allowed the identification of four clusters, which successfully represented the samples of the four investigated sites (Ipanema, Sardinha, Missoes and Bahia). Finally, the comparatively low volumetric fraction of slag inclusions in the samples of Ipanema (∼1%) suggested the existence of technological expertise at the iron making processing in the Royal Iron Factory of Sao Joao de Ipanema. (author)

  17. A comparative performance evaluation of intrusion detection techniques for hierarchical wireless sensor networks

    Directory of Open Access Journals (Sweden)

    H.H. Soliman

    2012-11-01

    Full Text Available An explosive growth in the field of wireless sensor networks (WSNs has been achieved in the past few years. Due to its important wide range of applications especially military applications, environments monitoring, health care application, home automation, etc., they are exposed to security threats. Intrusion detection system (IDS is one of the major and efficient defensive methods against attacks in WSN. Therefore, developing IDS for WSN have attracted much attention recently and thus, there are many publications proposing new IDS techniques or enhancement to the existing ones. This paper evaluates and compares the most prominent anomaly-based IDS systems for hierarchical WSNs and identifying their strengths and weaknesses. For each IDS, the architecture and the related functionality are briefly introduced, discussed, and compared, focusing on both the operational strengths and weakness. In addition, a comparison of the studied IDSs is carried out using a set of critical evaluation metrics that are divided into two groups; the first one related to performance and the second related to security. Finally based on the carried evaluation and comparison, a set of design principles are concluded, which have to be addressed and satisfied in future research of designing and implementing IDS for WSNs.

  18. Preparation of protein imprinted materials by hierarchical imprinting techniques and application in selective depletion of albumin from human serum

    Science.gov (United States)

    Liu, Jinxiang; Deng, Qiliang; Tao, Dingyin; Yang, Kaiguang; Zhang, Lihua; Liang, Zhen; Zhang, Yukui

    2014-06-01

    Hierarchical imprinting was developed to prepare the protein imprinted materials, as the artificial antibody, for the selective depletion of HSA from the human serum proteome. Porcine serum albumin (PSA) was employed as the dummy template for the fabrication of the recognition sites. To demonstrate the advantages of the hierarchical imprinting, molecularly imprinted polymers prepared by hierarchical imprinting technique (h-MIPs) were compared with those obtained by bulk imprinting (b-MIPs), in terms of the binding capacity, adsorption kinetics, selectivity and synthesis reproducibility. The binding capacity of h-MIPs could reach 12 mg g-1. And saturation binding could be reached in less than 20 min for the h-MIPs. In the protein mixture, h-MIPs exhibit excellent selectivity for PSA, with imprinting factors as about 3.6, much higher than those for non-template proteins. For the proteomic application, the identified protein group number in serum treated by h-MIPs was increased to 422, which is 21% higher than that obtained from the original serum, meanwhile the identified protein group number for the Albumin Removal kit was only 376. The results demonstrate that protein imprinted polymers prepared by hierarchical imprinting technique, might become the artificial antibodies for the selective depletion of high abundance proteins in proteome study.

  19. A comparison of hierarchical cluster analysis and league table rankings as methods for analysis and presentation of district health system performance data in Uganda.

    Science.gov (United States)

    Tashobya, Christine K; Dubourg, Dominique; Ssengooba, Freddie; Speybroeck, Niko; Macq, Jean; Criel, Bart

    2016-03-01

    In 2003, the Uganda Ministry of Health introduced the district league table for district health system performance assessment. The league table presents district performance against a number of input, process and output indicators and a composite index to rank districts. This study explores the use of hierarchical cluster analysis for analysing and presenting district health systems performance data and compares this approach with the use of the league table in Uganda. Ministry of Health and district plans and reports, and published documents were used to provide information on the development and utilization of the Uganda district league table. Quantitative data were accessed from the Ministry of Health databases. Statistical analysis using SPSS version 20 and hierarchical cluster analysis, utilizing Wards' method was used. The hierarchical cluster analysis was conducted on the basis of seven clusters determined for each year from 2003 to 2010, ranging from a cluster of good through moderate-to-poor performers. The characteristics and membership of clusters varied from year to year and were determined by the identity and magnitude of performance of the individual variables. Criticisms of the league table include: perceived unfairness, as it did not take into consideration district peculiarities; and being oversummarized and not adequately informative. Clustering organizes the many data points into clusters of similar entities according to an agreed set of indicators and can provide the beginning point for identifying factors behind the observed performance of districts. Although league table ranking emphasize summation and external control, clustering has the potential to encourage a formative, learning approach. More research is required to shed more light on factors behind observed performance of the different clusters. Other countries especially low-income countries that share many similarities with Uganda can learn from these experiences. © The Author 2015

  20. Hierarchical probabilistic regionalization of volcanism for Sengan region in Japan using multivariate statistical techniques and geostatistical interpolation techniques

    Energy Technology Data Exchange (ETDEWEB)

    Park, Jinyong [Univ. of Arizona, Tucson, AZ (United States); Balasingham, P [Univ. of Arizona, Tucson, AZ (United States); McKenna, Sean Andrew [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Kulatilake, Pinnaduwa H.S.W. [Univ. of Arizona, Tucson, AZ (United States)

    2004-09-01

    Sandia National Laboratories, under contract to Nuclear Waste Management Organization of Japan (NUMO), is performing research on regional classification of given sites in Japan with respect to potential volcanic disruption using multivariate statistics and geo-statistical interpolation techniques. This report provides results obtained for hierarchical probabilistic regionalization of volcanism for the Sengan region in Japan by applying multivariate statistical techniques and geostatistical interpolation techniques on the geologic data provided by NUMO. A workshop report produced in September 2003 by Sandia National Laboratories (Arnold et al., 2003) on volcanism lists a set of most important geologic variables as well as some secondary information related to volcanism. Geologic data extracted for the Sengan region in Japan from the data provided by NUMO revealed that data are not available at the same locations for all the important geologic variables. In other words, the geologic variable vectors were found to be incomplete spatially. However, it is necessary to have complete geologic variable vectors to perform multivariate statistical analyses. As a first step towards constructing complete geologic variable vectors, the Universal Transverse Mercator (UTM) zone 54 projected coordinate system and a 1 km square regular grid system were selected. The data available for each geologic variable on a geographic coordinate system were transferred to the aforementioned grid system. Also the recorded data on volcanic activity for Sengan region were produced on the same grid system. Each geologic variable map was compared with the recorded volcanic activity map to determine the geologic variables that are most important for volcanism. In the regionalized classification procedure, this step is known as the variable selection step. The following variables were determined as most important for volcanism: geothermal gradient, groundwater temperature, heat discharge, groundwater

  1. Mineral Detection using K-Means Clustering Technique

    Directory of Open Access Journals (Sweden)

    P. Bangarraju

    2014-04-01

    Full Text Available This paper is all about a novel algorithm formulated with k-means clustering performed on remote sensing images. The fields of Remote Sensing are very wide and its techniques and applications are used both in the data acquisition method and data processing procedures. It is also a fast developing field with respect to all the above terms. Remote Sensing plays a very important role in understanding the natural and human processes affecting the earth’s minerals. The k-means clustering technique is used for segmentation or feature selection of passive and active imaging and non-imaging Remote Sensing, on airborne or on satellite platforms, from monochromatic to hyperspectral. So here we concentrate on the images taken on or above the surface of the earth which are applied based on the proposed algorithm to detect the minerals like Giacomo that exist on the surface of the earth. Our experimental results demonstrate that our technique can improve the computational speed of the direct k-means algorithm by an order to two orders of magnitude in the total number of distance calculations and the overall time.

  2. Scraping and Clustering Techniques for the Characterization of Linkedin Profiles

    Directory of Open Access Journals (Sweden)

    Kais Dai

    2015-01-01

    Full Text Available The socialization of the web has undertaken a new d imension after the emergence of the Online Social Networks (OSN concept. The fact that each I nternet user becomes a potential content creator entails managing a big amount of data. This paper explores the most popular professional OSN: LinkedIn. A scraping technique wa s implemented to get around 5 Million public profiles. The application of natural languag e processing techniques (NLP to classify the educational background and to cluster the professio nal background of the collected profiles led us to provide some insights about this OSN’s users and to evaluate the relationships between educational degrees and professional careers.

  3. 建筑物层次空间聚类方法研究%Hierarchical spatial clustering of buildings

    Institute of Scientific and Technical Information of China (English)

    邓敏; 孙前虎; 文小岳; 徐枫

    2011-01-01

    建筑物空间聚类是实现居民地地图自动综合的有效方法.基于图论和Gestalt原理,发展了一种层次的建筑物聚类方法.该方法可以深层次地挖掘建筑物图形的视觉特性,将面状地物信息充分合理地表达在聚类结果中.依据视觉感知原理,借助Dealaunay三角网构建方法,分析了地图上建筑物的自身形状特性和相互间的邻接关系,并依据建筑物间的可视区域均值距离建立了加权邻近结构图,确定了建筑物的邻近关系(定性约束).根据Gestalt准则将邻近性、方向性和几何特征等量化为旋转卡壳距离约束和几何相似度约束.通过实例验证了层次聚类方法得到更加符合人类认知的建筑物聚类结果.%Spatial clustering provides an effective approach for generalization of residential area in automated cartographic generalization.Based on graph theory and Gestalt principle, a hierarchical approach is proposed in this paper.This approach can be utilized to discover the graphical structure formed by buildings, which is obtained with the consideration of shape, size and neighboring relations.The neighboring relations are determined by Dclaunay triangulation, which is a qualitative constraint among buildings.A weighted neighboring structural graph is obtained by setting visual distance as the weight of the linking edge between adjacent buildings.Two levels of quantitative constraints are developed by considering the Gestalt factors, I.e.proximity, orientation and geometry of buildings.One is the rotating calipers minimum distance;the other is the geometric similarity measure.Through experiments it is illustrated that the results by the hierarchical spatial clustering proposed in this paper are consistent with human perception.

  4. Hierarchical Affinity Propagation

    CERN Document Server

    Givoni, Inmar; Frey, Brendan J

    2012-01-01

    Affinity propagation is an exemplar-based clustering algorithm that finds a set of data-points that best exemplify the data, and associates each datapoint with one exemplar. We extend affinity propagation in a principled way to solve the hierarchical clustering problem, which arises in a variety of domains including biology, sensor networks and decision making in operational research. We derive an inference algorithm that operates by propagating information up and down the hierarchy, and is efficient despite the high-order potentials required for the graphical model formulation. We demonstrate that our method outperforms greedy techniques that cluster one layer at a time. We show that on an artificial dataset designed to mimic the HIV-strain mutation dynamics, our method outperforms related methods. For real HIV sequences, where the ground truth is not available, we show our method achieves better results, in terms of the underlying objective function, and show the results correspond meaningfully to geographi...

  5. Analytical relations concerning the collapse time in hierarchically clustered cosmological models

    CERN Document Server

    Gambera, M

    1997-01-01

    By means of numerical methods, we solve the equations of motion for the collapse of a shell of baryonic matter, made of galaxies and substructure falling into the central regions of a cluster of galaxies, taking into account the effect of the dynamical friction. The parameters on which the dynamical friction mainly depends are: the peaks' height, the number of peaks inside a protocluster multiplied by the correlation function evaluated at the origin, the filtering radius and the nucleus radius of the protocluster of galaxies. We show how the collapse time (Tau) of the shell depends on these parameters. We give a formula that links the dynamical friction coefficient (Eta) o the parameters mentioned above and an analytic relation between the collapse time and (Eta). Finally, we obtain an analytical relation between (Tau) and the mean overdensity (mean Delta) within the shell. All the analytical relations that we find are in excellent agreement with the numerical integration.

  6. Hierarchical cluster analysis of labour market regulations and population health: a taxonomy of low- and middle-income countries

    Directory of Open Access Journals (Sweden)

    Muntaner Carles

    2012-04-01

    Full Text Available Abstract Background An important contribution of the social determinants of health perspective has been to inquire about non-medical determinants of population health. Among these, labour market regulations are of vital significance. In this study, we investigate the labour market regulations among low- and middle-income countries (LMICs and propose a labour market taxonomy to further understand population health in a global context. Methods Using Gross National Product per capita, we classify 113 countries into either low-income (n = 71 or middle-income (n = 42 strata. Principal component analysis of three standardized indicators of labour market inequality and poverty is used to construct 2 factor scores. Factor score reliability is evaluated with Cronbach's alpha. Using these scores, we conduct a hierarchical cluster analysis to produce a labour market taxonomy, conduct zero-order correlations, and create box plots to test their associations with adult mortality, healthy life expectancy, infant mortality, maternal mortality, neonatal mortality, under-5 mortality, and years of life lost to communicable and non-communicable diseases. Labour market and health data are retrieved from the International Labour Organization's Key Indicators of Labour Markets and World Health Organization's Statistical Information System. Results Six labour market clusters emerged: Residual (n = 16, Emerging (n = 16, Informal (n = 10, Post-Communist (n = 18, Less Successful Informal (n = 22, and Insecure (n = 31. Primary findings indicate: (i labour market poverty and population health is correlated in both LMICs; (ii association between labour market inequality and health indicators is significant only in low-income countries; (iii Emerging (e.g., East Asian and Eastern European countries and Insecure (e.g., sub-Saharan African nations clusters are the most advantaged and disadvantaged, respectively, with the remaining clusters experiencing levels of population

  7. Principal factor and hierarchical cluster analyses for the performance assessment of an urban wastewater treatment plant in the Southeast of Spain.

    Science.gov (United States)

    Bayo, Javier; López-Castellanos, Joaquín

    2016-07-01

    Process performance and operation of wastewater treatment plants (WWTP) are carried out to ensure their compliance with legislative requirements imposed by European Union. Because a high amount of variables are daily measured, a coherent and structured approach of such a system is required to understand its inherent behavior and performance efficiency. In this sense, both principal factor analysis (PFA) and hierarchical cluster analysis (HCA) are multivariate techniques that have been widely applied to extract and structure information for different purposes. In this paper, both statistical tools are applied in an urban WWTP situated in the Southeast of Spain, a zone with special characteristics related to the geochemical background composition of water and an important use of fertilizers. Four main factors were extracted in association with nutrients, the ionic component, the organic load to the WWTP, and the efficiency of the whole process. HCA allowed distinguish between influent and effluent parameters, although a deeper examination resulted in a dendrogram with groupings similar to those previously reported for PFA.

  8. Typing of unknown microorganisms based on quantitative analysis of fatty acids by mass spectrometry and hierarchical clustering

    Energy Technology Data Exchange (ETDEWEB)

    Li Tingting; Dai Ling; Li Lun; Hu Xuejiao; Dong Linjie; Li Jianjian; Salim, Sule Khalfan; Fu Jieying [Key Laboratory of Pesticides and Chemical Biology, Ministry of Education, College of Chemistry, Central China Normal University, Wuhan, Hubei 430079 (China); Zhong Hongying, E-mail: hyzhong@mail.ccnu.edu.cn [Key Laboratory of Pesticides and Chemical Biology, Ministry of Education, College of Chemistry, Central China Normal University, Wuhan, Hubei 430079 (China)

    2011-01-17

    Rapid identification of unknown microorganisms of clinical and agricultural importance is not only critical for accurate diagnosis of infections but also essential for appropriate and prompt treatment. We describe here a rapid method for microorganisms typing based on quantitative analysis of fatty acids by iFAT approach (Isotope-coded Fatty Acid Transmethylation). In this work, lyophilized cell lysates were directly mixed with 0.5 M NaOH solution in d3-methanol and n-hexane. After 1 min of ultrasonication, the top n-hexane layer was combined with a mixture of standard d0-methanol derived fatty acid methylesters with known concentration. Measurement of intensity ratios of d3/d0 labeled fragment ion and molecular ion pairs at the corresponding target fatty acids provides a quantitative basis for hierarchical clustering. In the resultant dendrogram, the Euclidean distance between unknown species and known species quantitatively reveals their differences or shared similarities in fatty acid related pathways. It is of particular interest to apply this method for typing fungal species because fungi has distinguished lipid biosynthetic pathways that have been targeted for lots of drugs or fungicides compared with bacteria and animals. The proposed method has no dependence on the availability of genome or proteome databases. Therefore, it is can be applicable for a broad range of unknown microorganisms or mutant species.

  9. Formation of an O-Star Cluster by Hierarchical Accretion in G20.08-0.14 N

    CERN Document Server

    Galván-Madrid, Roberto; Zhang, Qizhou; Kurtz, Stan; Rodríguez, Luis F; Ho, Paul T P

    2009-01-01

    Spectral line and continuum observations of the ionized and molecular gas in G20.08-0.14 N explore the dynamics of accretion over a range of spatial scales in this massive star forming region. Very Large Array observations of NH_3 at 4'' angular resolution show a large scale (0.5 pc) molecular accretion flow around and into a star cluster with three small, bright HII regions. Higher resolution (0.4'') observations with the Submillimeter Array in hot core molecules (CH_3CN, OCS, and SO_2) and the VLA in NH_3, show that the two brightest and smallest HII regions are themselves surrounded by smaller scale (0.05 pc) accretion flows. The axes of rotation of the large and small scale flows are aligned, and the time scale for the contraction of the cloud is short enough, 0.1 Myr, for the large scale accretion flow to deliver significant mass to the smaller scales within the star formation time scale. The flow structure appears to be continuous and hierarchical from larger to smaller scales. Millimeter radio recombin...

  10. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...

  11. Classifying airborne radiometry data with Agglomerative Hierarchical Clustering: A tool for geological mapping in context of rainforest (French Guiana)

    Science.gov (United States)

    Martelet, G.; Truffert, C.; Tourlière, B.; Ledru, P.; Perrin, J.

    2006-09-01

    In highly weathered environments, it is crucial that geological maps provide information concerning both the regolith and the bedrock, for societal needs, such as land-use, mineral or water resources management. Often, geologists are facing the challenge of upgrading existing maps, as relevant information concerning weathering processes and pedogenesis is currently missing. In rugged areas in particular, where access to the field is difficult, ground observations are sparsely available, and need therefore to be complemented using methods based on remotely sensed data. For this purpose, we discuss the use of Agglomerative Hierarchical Clustering (AHC) on eU, K and eTh airborne gamma-ray spectrometry grids. The AHC process allows primarily to segment the geophysical maps into zones having coherent U, K and Th contents. The analysis of these contents are discussed in terms of geochemical signature for lithological attribution of classes, as well as the use of a dendrogram, which gives indications on the hierarchical relations between classes. Unsupervised classification maps resulting from AHC can be considered as spatial models of the distribution of the radioelement content in surface and sub-surface formations. The source of gamma rays emanating from the ground is primarily related to the geochemistry of the bedrock and secondarily to modifications of the radioelement distribution by weathering and other secondary mechanisms, such as mobilisation by wind or water. The interpretation of the obtained predictive classified maps, their U, K, Th contents, and the dendrogram, in light of available geological knowledge, allows to separate signatures related to regolith and solid geology. Consequently, classification maps can be integrated within a GIS environment and used by the geologist as a support for mapping bedrock lithologies and their alteration. We illustrate the AHC classification method in the region of Cayenne using high-resolution airborne radiometric data

  12. Scalable Clustering of High-Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence

    Directory of Open Access Journals (Sweden)

    Thenmozhi Srinivasan

    2015-01-01

    Full Text Available Clusters of high-dimensional data techniques are emerging, according to data noisy and poor quality challenges. This paper has been developed to cluster data using high-dimensional similarity based PCM (SPCM, with ant colony optimization intelligence which is effective in clustering nonspatial data without getting knowledge about cluster number from the user. The PCM becomes similarity based by using mountain method with it. Though this is efficient clustering, it is checked for optimization using ant colony algorithm with swarm intelligence. Thus the scalable clustering technique is obtained and the evaluation results are checked with synthetic datasets.

  13. Comparing chemistry to outcome: the development of a chemical distance metric, coupled with clustering and hierarchal visualization applied to macromolecular crystallography.

    Directory of Open Access Journals (Sweden)

    Andrew E Bruno

    Full Text Available Many bioscience fields employ high-throughput methods to screen multiple biochemical conditions. The analysis of these becomes tedious without a degree of automation. Crystallization, a rate limiting step in biological X-ray crystallography, is one of these fields. Screening of multiple potential crystallization conditions (cocktails is the most effective method of probing a proteins phase diagram and guiding crystallization but the interpretation of results can be time-consuming. To aid this empirical approach a cocktail distance coefficient was developed to quantitatively compare macromolecule crystallization conditions and outcome. These coefficients were evaluated against an existing similarity metric developed for crystallization, the C6 metric, using both virtual crystallization screens and by comparison of two related 1,536-cocktail high-throughput crystallization screens. Hierarchical clustering was employed to visualize one of these screens and the crystallization results from an exopolyphosphatase-related protein from Bacteroides fragilis, (BfR192 overlaid on this clustering. This demonstrated a strong correlation between certain chemically related clusters and crystal lead conditions. While this analysis was not used to guide the initial crystallization optimization, it led to the re-evaluation of unexplained peaks in the electron density map of the protein and to the insertion and correct placement of sodium, potassium and phosphate atoms in the structure. With these in place, the resulting structure of the putative active site demonstrated features consistent with active sites of other phosphatases which are involved in binding the phosphoryl moieties of nucleotide triphosphates. The new distance coefficient, CDcoeff, appears to be robust in this application, and coupled with hierarchical clustering and the overlay of crystallization outcome, reveals information of biological relevance. While tested with a single example the

  14. Rapid recognition of drug-resistance/sensitivity in leukemic cells by Fourier transform infrared microspectroscopy and unsupervised hierarchical cluster analysis.

    Science.gov (United States)

    Bellisola, Giuseppe; Cinque, Gianfelice; Vezzalini, Marzia; Moratti, Elisabetta; Silvestri, Giovannino; Redaelli, Sara; Gambacorti Passerini, Carlo; Wehbe, Katia; Sorio, Claudio

    2013-07-21

    We tested the ability of Fourier Transform (FT) InfraRed (IR) microspectroscopy (microFTIR) in combination with unsupervised Hierarchical Cluster Analysis (HCA) in identifying drug-resistance/sensitivity in leukemic cells exposed to tyrosine kinase inhibitors (TKIs). Experiments were carried out in a well-established mouse model of human Chronic Myelogenous Leukemia (CML). Mouse-derived pro-B Ba/F3 cells transfected with and stably expressing the human p210(BCR-ABL) drug-sensitive wild-type BCR-ABL or the V299L or T315I p210(BCR-ABL) drug-resistant BCR-ABL mutants were exposed to imatinib-mesylate (IMA) or dasatinib (DAS). MicroFTIR was carried out at the Diamond IR beamline MIRIAM where the mid-IR absorbance spectra of individual Ba/F3 cells were acquired using the high brilliance IR synchrotron radiation (SR) via aperture of 15 × 15 μm(2) in sizes. A conventional IR source (globar) was used to compare average spectra over 15 cells or more. IR signatures of drug actions were identified by supervised analyses in the spectra of TKI-sensitive cells. Unsupervised HCA applied to selected intervals of wavenumber allowed us to classify the IR patterns of viable (drug-resistant) and apoptotic (drug-sensitive) cells with an accuracy of >95%. The results from microFTIR + HCA analysis were cross-validated with those obtained via immunochemical methods, i.e. immunoblotting and flow cytometry (FC) that resulted directly and significantly correlated. We conclude that this combined microFTIR + HCA method potentially represents a rapid, convenient and robust screening approach to study the impact of drugs in leukemic cells as well as in peripheral blasts from patients in clinical trials with new anti-leukemic drugs.

  15. A comparison of spatial clustering and cluster detection techniques for childhood leukemia incidence in Ohio, 1996 – 2003

    Directory of Open Access Journals (Sweden)

    Wheeler David C

    2007-03-01

    Full Text Available Abstract Background Spatial cluster detection is an important tool in cancer surveillance to identify areas of elevated risk and to generate hypotheses about cancer etiology. There are many cluster detection methods used in spatial epidemiology to investigate suspicious groupings of cancer occurrences in regional count data and case-control data, where controls are sampled from the at-risk population. Numerous studies in the literature have focused on childhood leukemia because of its relatively large incidence among children compared with other malignant diseases and substantial public concern over elevated leukemia incidence. The main focus of this paper is an analysis of the spatial distribution of leukemia incidence among children from 0 to 14 years of age in Ohio from 1996–2003 using individual case data from the Ohio Cancer Incidence Surveillance System (OCISS. Specifically, we explore whether there is statistically significant global clustering and if there are statistically significant local clusters of individual leukemia cases in Ohio using numerous published methods of spatial cluster detection, including spatial point process summary methods, a nearest neighbor method, and a local rate scanning method. We use the K function, Cuzick and Edward's method, and the kernel intensity function to test for significant global clustering and the kernel intensity function and Kulldorff's spatial scan statistic in SaTScan to test for significant local clusters. Results We found some evidence, although inconclusive, of significant local clusters in childhood leukemia in Ohio, but no significant overall clustering. The findings from the local cluster detection analyses are not consistent for the different cluster detection techniques, where the spatial scan method in SaTScan does not find statistically significant local clusters, while the kernel intensity function method suggests statistically significant clusters in areas of central, southern

  16. Towards Effective Clustering Techniques for the Analysis of Electric Power Grids

    Energy Technology Data Exchange (ETDEWEB)

    Hogan, Emilie A.; Cotilla Sanchez, Jose E.; Halappanavar, Mahantesh; Wang, Shaobu; Mackey, Patrick S.; Hines, Paul; Huang, Zhenyu

    2013-11-30

    Clustering is an important data analysis technique with numerous applications in the analysis of electric power grids. Standard clustering techniques are oblivious to the rich structural and dynamic information available for power grids. Therefore, by exploiting the inherent topological and electrical structure in the power grid data, we propose new methods for clustering with applications to model reduction, locational marginal pricing, phasor measurement unit (PMU or synchrophasor) placement, and power system protection. We focus our attention on model reduction for analysis based on time-series information from synchrophasor measurement devices, and spectral techniques for clustering. By comparing different clustering techniques on two instances of realistic power grids we show that the solutions are related and therefore one could leverage that relationship for a computational advantage. Thus, by contrasting different clustering techniques we make a case for exploiting structure inherent in the data with implications for several domains including power systems.

  17. EFFICIENT ALGORITHM FOR MINING FREQUENT ITEMSETS USING CLUSTERING TECHNIQUES

    Directory of Open Access Journals (Sweden)

    D.Kerana Hanirex

    2011-03-01

    Full Text Available Now a days, Association rule plays an important role. The purchasing of one product when another product is purchased represents an association rule. The Apriori algorithm is the basic algorithm for mining association rules. This paper presents an efficient Partition Algorithm for Mining Frequent Itemsets(PAFI using clustering. This algorithm finds the frequent itemsets by partitioning the database transactions into clusters. Clusters are formed based on the imilarity measures between the transactions. Then it finds the frequent itemsets with the transactions in the clusters directly using improved Apriori algorithm which further reduces the number of scans in the database and hence improve the efficiency.

  18. Differences in Pedaling Technique in Cycling: A Cluster Analysis.

    Science.gov (United States)

    Lanferdini, Fábio J; Bini, Rodrigo R; Figueiredo, Pedro; Diefenthaeler, Fernando; Mota, Carlos B; Arndt, Anton; Vaz, Marco A

    2016-10-01

    To employ cluster analysis to assess if cyclists would opt for different strategies in terms of neuromuscular patterns when pedaling at the power output of their second ventilatory threshold (POVT2) compared with cycling at their maximal power output (POMAX). Twenty athletes performed an incremental cycling test to determine their power output (POMAX and POVT2; first session), and pedal forces, muscle activation, muscle-tendon unit length, and vastus lateralis architecture (fascicle length, pennation angle, and muscle thickness) were recorded (second session) in POMAX and POVT2. Athletes were assigned to 2 clusters based on the behavior of outcome variables at POVT2 and POMAX using cluster analysis. Clusters 1 (n = 14) and 2 (n = 6) showed similar power output and oxygen uptake. Cluster 1 presented larger increases in pedal force and knee power than cluster 2, without differences for the index of effectiveness. Cluster 1 presented less variation in knee angle, muscle-tendon unit length, pennation angle, and tendon length than cluster 2. However, clusters 1 and 2 showed similar muscle thickness, fascicle length, and muscle activation. When cycling at POVT2 vs POMAX, cyclists could opt for keeping a constant knee power and pedal-force production, associated with an increase in tendon excursion and a constant fascicle length. Increases in power output lead to greater variations in knee angle, muscle-tendon unit length, tendon length, and pennation angle of vastus lateralis for a similar knee-extensor activation and smaller pedal-force changes in cyclists from cluster 2 than in cluster 1.

  19. Synthesis and characterization of SiC materials with hierarchical porosity obtained by replication techniques.

    Science.gov (United States)

    Sonnenburg, Kirstin; Adelhelm, Philipp; Antonietti, Markus; Smarsly, Bernd; Nöske, Robert; Strauch, Peter

    2006-08-14

    Porous silicon carbide monoliths were obtained using the infiltration of preformed SiO(2) frameworks with appropriate carbon precursors such as mesophase pitch. The initial SiO(2) monoliths possessed a hierarchical pore system, composed of an interpenetrating bicontinuous macropore structure and 13 nm mesopores confined in the macropore walls. After carbonization, further heat treatment at ca. 1,400 degrees C resulted in the formation of a SiC-SiO(2) composite, which was converted into a porous SiC monolith by post-treatment with ammonium fluoride solution. The resulting porous SiC featured high crystallinity, high chemical purity and showed a surface area of 280 m(2) g(-1) and a pore volume of 0.8 ml g(-1).

  20. Clustering the Results of Brainstorm Sessions: Applying Word Similarity Techniques to Cluster Dutch Nouns

    NARCIS (Netherlands)

    Amrit, Chintan Amrit; Hek, Jeroen

    2016-01-01

    This research addresses the problem of clustering the results of brainstorm sessions. Going through all ideas and clustering them can be a time consuming task. In this research we design a computer-aided approach that can help with clustering of these results. We have limited ourselves to looking at

  1. Clustering the Results of Brainstorm Sessions: Applying Word Similarity Techniques to Cluster Dutch Nouns

    NARCIS (Netherlands)

    Amrit, Chintan; Hek, Jeroen

    2016-01-01

    This research addresses the problem of clustering the results of brainstorm sessions. Going through all ideas and clustering them can be a time consuming task. In this research we design a computer-aided approach that can help with clustering of these results. We have limited ourselves to looking at

  2. A Performance-Prediction Model for PIC Applications on Clusters of Symmetric MultiProcessors: Validation with Hierarchical HPF+OpenMP Implementation

    Directory of Open Access Journals (Sweden)

    Sergio Briguglio

    2003-01-01

    Full Text Available A performance-prediction model is presented, which describes different hierarchical workload decomposition strategies for particle in cell (PIC codes on Clusters of Symmetric MultiProcessors. The devised workload decomposition is hierarchically structured: a higher-level decomposition among the computational nodes, and a lower-level one among the processors of each computational node. Several decomposition strategies are evaluated by means of the prediction model, with respect to the memory occupancy, the parallelization efficiency and the required programming effort. Such strategies have been implemented by integrating the high-level languages High Performance Fortran (at the inter-node stage and OpenMP (at the intra-node one. The details of these implementations are presented, and the experimental values of parallelization efficiency are compared with the predicted results.

  3. The k-means clustering technique: General considerations and implementation in Mathematica

    Directory of Open Access Journals (Sweden)

    Laurence Morissette

    2013-02-01

    Full Text Available Data clustering techniques are valuable tools for researchers working with large databases of multivariate data. In this tutorial, we present a simple yet powerful one: the k-means clustering technique, through three different algorithms: the Forgy/Lloyd, algorithm, the MacQueen algorithm and the Hartigan and Wong algorithm. We then present an implementation in Mathematica and various examples of the different options available to illustrate the application of the technique.

  4. Gene-Set Local Hierarchical Clustering (GSLHC--A Gene Set-Based Approach for Characterizing Bioactive Compounds in Terms of Biological Functional Groups.

    Directory of Open Access Journals (Sweden)

    Feng-Hsiang Chung

    Full Text Available Gene-set-based analysis (GSA, which uses the relative importance of functional gene-sets, or molecular signatures, as units for analysis of genome-wide gene expression data, has exhibited major advantages with respect to greater accuracy, robustness, and biological relevance, over individual gene analysis (IGA, which uses log-ratios of individual genes for analysis. Yet IGA remains the dominant mode of analysis of gene expression data. The Connectivity Map (CMap, an extensive database on genomic profiles of effects of drugs and small molecules and widely used for studies related to repurposed drug discovery, has been mostly employed in IGA mode. Here, we constructed a GSA-based version of CMap, Gene-Set Connectivity Map (GSCMap, in which all the genomic profiles in CMap are converted, using gene-sets from the Molecular Signatures Database, to functional profiles. We showed that GSCMap essentially eliminated cell-type dependence, a weakness of CMap in IGA mode, and yielded significantly better performance on sample clustering and drug-target association. As a first application of GSCMap we constructed the platform Gene-Set Local Hierarchical Clustering (GSLHC for discovering insights on coordinated actions of biological functions and facilitating classification of heterogeneous subtypes on drug-driven responses. GSLHC was shown to tightly clustered drugs of known similar properties. We used GSLHC to identify the therapeutic properties and putative targets of 18 compounds of previously unknown characteristics listed in CMap, eight of which suggest anti-cancer activities. The GSLHC website http://cloudr.ncu.edu.tw/gslhc/ contains 1,857 local hierarchical clusters accessible by querying 555 of the 1,309 drugs and small molecules listed in CMap. We expect GSCMap and GSLHC to be widely useful in providing new insights in the biological effect of bioactive compounds, in drug repurposing, and in function-based classification of complex diseases.

  5. Scaling up the DBSCAN Algorithm for Clustering Large Spatial Databases Based on Sampling Technique

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Clustering, in data mining, is a useful technique for discoveringinte resting data distributions and patterns in the underlying data, and has many app lication fields, such as statistical data analysis, pattern recognition, image p rocessing, and etc. We combine sampling technique with DBSCAN alg orithm to cluster large spatial databases, and two sampling-based DBSCAN (SDBSC A N) algorithms are developed. One algorithm introduces sampling technique inside DBSCAN, and the other uses sampling procedure outside DBSCAN. Experimental resul ts demonstrate that our algorithms are effective and efficient in clustering lar ge-scale spatial databases.

  6. Techniques for Representation of Regional Clusters in Geographical In-formation Systems

    Directory of Open Access Journals (Sweden)

    Adriana REVEIU

    2011-01-01

    Full Text Available This paper provides an overview of visualization techniques adapted for regional clusters presentation in Geographic Information Systems. Clusters are groups of companies and insti-tutions co-located in a specific geographic region and linked by interdependencies in providing a related group of products and services. The regional clusters can be visualized by projecting the data into two-dimensional space or using parallel coordinates. Cluster membership is usually represented by different colours or by dividing clusters into several panels of a grille display. Taking into consideration regional clusters requirements and the multilevel administrative division of the Romania’s territory, I used two cartograms: NUTS2- regions and NUTS3- counties, to illustrate the tools for regional clusters representation.

  7. An Analysis of Particle Swarm Optimization with Data Clustering-Technique for Optimization in Data Mining

    Directory of Open Access Journals (Sweden)

    Amreen Khan,

    2010-07-01

    Full Text Available Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. Clustering aims at representing large datasets by a fewer number of prototypes or clusters. It brings simplicity in modeling data and thus plays a central role in the process of knowledge discovery and data mining. Data mining tasks require fast and accurate partitioning of huge datasets, which may come with a variety of attributes or features. This imposes severe computational requirements on the relevant clustering techniques. A family of bio-inspired algorithms, well-known as Swarm Intelligence (SI has recently emerged that meets these requirements and has successfully been applied to a number ofreal world clustering problems. This paper looks into the use ofParticle Swarm Optimization for cluster analysis. The effectiveness of Fuzzy C-means clustering provides enhanced performance and maintains more diversity in the swarm and also allows the particles to be robust to trace the changing environment.

  8. A novel scheme for binarization of vehicle images using hierarchical histogram equalization technique

    CERN Document Server

    Saha, Satadal; Nasipuri, Mita; Basu, Dipak Kumar

    2010-01-01

    Automatic License Plate Recognition system is a challenging area of research now-a-days and binarization is an integral and most important part of it. In case of a real life scenario, most of existing methods fail to properly binarize the image of a vehicle in a congested road, captured through a CCD camera. In the current work we have applied histogram equalization technique over the complete image and also over different hierarchy of image partitioning. A novel scheme is formulated for giving the membership value to each pixel for each hierarchy of histogram equalization. Then the image is binarized depending on the net membership value of each pixel. The technique is exhaustively evaluated on the vehicle image dataset as well as the license plate dataset, giving satisfactory performances.

  9. Detecting multiple outliers in linear functional relationship model for circular variables using clustering technique

    Science.gov (United States)

    Mokhtar, Nurkhairany Amyra; Zubairi, Yong Zulina; Hussin, Abdul Ghapor

    2017-05-01

    Outlier detection has been used extensively in data analysis to detect anomalous observation in data and has important application in fraud detection and robust analysis. In this paper, we propose a method in detecting multiple outliers for circular variables in linear functional relationship model. Using the residual values of the Caires and Wyatt model, we applied the hierarchical clustering procedure. With the use of tree diagram, we illustrate the graphical approach of the detection of outlier. A simulation study is done to verify the accuracy of the proposed method. Also, an illustration to a real data set is given to show its practical applicability.

  10. Measuring customer loyalty using an extended RFM and clustering technique

    Directory of Open Access Journals (Sweden)

    Zohre Zalaghi

    2014-05-01

    Full Text Available Today, the ability to identify the profitable customers, creating a long-term loyalty in them and expanding the existing relationships are considered as the key and competitive factors for a customer-oriented organization. The prerequisite for having such competitive factors is the presence of a very powerful customer relationship management (CRM. The accurate evaluation of customers’ profitability is considered as one of the fundamental reasons that lead to a successful customer relationship management. RFM is a method that scrutinizes three properties, namely recency, frequency and monetary for each customer and scores customers based on these properties. In this paper, a method is introduced that obtains the behavioral traits of customers using the extended RFM approach and having the information related to the customers of an organization; it then classifies the customers using the K-means algorithm and finally scores the customers in terms of their loyalty in each cluster. In the suggested approach, first the customers’ records will be clustered and then the RFM model items will be specified through selecting the effective properties on the customers’ loyalty rate using the multipurpose genetic algorithm. Next, they will be scored in each cluster based on the effect that they have on the loyalty rate. The influence rate each property has on loyalty is calculated using the Spearman’s correlation coefficient.

  11. Social Learning Network Analysis Model to Identify Learning Patterns Using Ontology Clustering Techniques and Meaningful Learning

    Science.gov (United States)

    Firdausiah Mansur, Andi Besse; Yusof, Norazah

    2013-01-01

    Clustering on Social Learning Network still not explored widely, especially when the network focuses on e-learning system. Any conventional methods are not really suitable for the e-learning data. SNA requires content analysis, which involves human intervention and need to be carried out manually. Some of the previous clustering techniques need…

  12. Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques

    Directory of Open Access Journals (Sweden)

    Rayner Alfred

    2010-01-01

    Full Text Available Problem statement: In solving a classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets stored in multiple tables into a single table. Unfortunately, we may loss some information when we join tables with a high degree of one-to-many association. Therefore, data transformation becomes a tedious trial-and-error work and the classification result is often not very promising especially when the number of tables and the degree of one-to-many association are large. Approach: We proposed a genetic semi-supervised clustering technique as a means of aggregating data stored in multiple tables to facilitate the task of solving a classification problem in relational database. This algorithm is suitable for classification of datasets with a high degree of one-to-many associations. It can be used in two ways. One is user-controlled clustering, where the user may control the result of clustering by varying the compactness of the spherical cluster. The other is automatic clustering, where a non-overlap clustering strategy is applied. In this study, we use the latter method to dynamically cluster multiple instances, as a means of aggregating them and illustrate the effectiveness of this method using the semi-supervised genetic algorithm-based clustering technique. Results: It was shown in the experimental results that using the reciprocal of Davies-Bouldin Index for cluster dispersion and the reciprocal of Gini Index for cluster purity, as the fitness function in the Genetic Algorithm (GA, finds solutions with much greater accuracy. The results obtained in this study showed that automatic clustering (seeding, by optimizing the cluster dispersion or cluster purity alone using GA, provides one with good results compared to the traditional k-means clustering. However, the best result can be achieved by optimizing the combination values of both the cluster

  13. Using ordination and clustering techniques to assess multi-metric fish health response following a coal fly ash spill

    Energy Technology Data Exchange (ETDEWEB)

    Bevelhimer, Mark S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Adams, Marshall [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Fortner, Allison M. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Greeley, Jr, Mark Stephen [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Brandt, Craig C. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2014-01-01

    The effect of coal ash exposure on fish health in freshwater communities is largely unknown. Given the large number of possible pathways of effects (e.g., toxicological effect of exposure to multiple metals, physical effects from ash exposure, and food web effects), measurement of only a few health metrics is not likely to give a complete picture. The authors measured a suite of 20 health metrics from 1100+ fish collected from 5 sites (3 affected and 2 reference) near a coal ash spill in east Tennessee over a 4.5-yr period. The metrics represented a wide range of physiological and energetic responses and were evaluated simultaneously using 2 multivariate techniques. Results from both hierarchical clustering and canonical discriminant analyses suggested that for most speciesXseason combinations, the suite of fish health indicators varied more among years than between spill and reference sites within a year. In a few cases, spill sites from early years in the investigation stood alone or clustered together separate from reference sites and later year spill sites. Outlier groups of fish with relatively unique health profiles were most often from spill sites, suggesting that some response to the ash exposure may have occurred. Results from the 2 multivariate methods suggest that any change in the health status of fish at the spill sites was small and appears to have diminished since the first 2 to 3 yr after the spill.

  14. THE EFFECT OF CLUSTERING TECHNIQUE ON WRITING EXPOSITORY ESSAYS OF EFL STUDENTS

    OpenAIRE

    Sabarun Sabarun

    2013-01-01

    The study is aimed at investigating the effectiveness of using clustering technique in writing expository essays. The aim of the study is to prove whether there is a significant difference between writing using clustering technique and writing without using it on the students’ writing achievement or not. The study belonged to experimental study by applying counterbalance procedure to collect the data. The study was conducted at the fourth semester English department students of Palangka Raya ...

  15. Deprojection technique for galaxy cluster considering the point spread function

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    We present a new method for the analysis of Abell 1835 observed by XMM-Newton.The method is a combination of the Direct Demodulation technique and deprojection.We eliminate the effects of the point spread function(PSF) with the Direct Demodulation technique.We then use a traditional deprojection technique to study the properties of Abell 1835.Compared to only using a deprojection method,the central electron density derived from this method increases by 30%,while the temperature profile is similar.

  16. Classification of protein profiles using fuzzy clustering techniques

    DEFF Research Database (Denmark)

    Karemore, Gopal; Mullick, Jhinuk B.; Sujatha, R.

    2010-01-01

    -to-day   variation,   artifacts   due   to experimental   strategies,   inherent   uncertainty   in   pumping procedure which are very common activities during HPLC-LIF experiment.  Under  these  circumstances  we  demonstrate  how fuzzy clustering algorithm like Gath Geva followed by sammon mapping   outperform......   PCA   mapping   in   classifying   various cancers from healthy spectra with classification rate up to 95 % from  60%.  Methods  are  validated  using  various  clustering indexes   and   shows   promising   improvement   in   developing optical pathology like HPLC-LIF for early detection of various...

  17. Environmental quenching and hierarchical cluster assembly: Evidence from spectroscopic ages of red-sequence galaxies in Coma

    CERN Document Server

    Smith, Russell J; Price, James; Hudson, Michael J; Phillipps, Steven

    2011-01-01

    We explore the variation in stellar population ages for Coma cluster galaxies as a function of projected cluster-centric distance, using a sample of 362 red-sequence galaxies with high signal-to-noise spectroscopy. The sample spans a wide range in luminosity (0.02-4 L*) and extends from the cluster core to near the virial radius. We find a clear distinction in the observed trends of the giant and dwarf galaxies. The ages of red-sequence giants are primarily determined by galaxy mass, with only weak modulation by environment, in the sense that galaxies at larger cluster-centric distance are slightly younger. For red-sequence dwarfs (with mass <10^10 Msun), the roles of mass and environment as predictors of age are reversed: there is little dependence on mass, but strong trends with projected cluster-centric radius are observed. The average age of dwarfs at the 2.5 Mpc limit of our sample is approximately half that of dwarfs near the cluster centre. The gradient in dwarf galaxy ages is a global cluster-centr...

  18. An Efficient Clustering Technique for Message Passing between Data Points using Affinity Propagation

    Directory of Open Access Journals (Sweden)

    D. NAPOLEON,

    2011-01-01

    Full Text Available A wide range of clustering algorithms is available in literature and still an open area for researcher’s k-means algorithm is one of the basic and most simple partitioning clustering technique is given by Macqueen in 1967. A new clustering algorithm used in this paper is affinity propagation. The number of cluster k has been supplied by the user and the Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time between data point. In this paper we make analysis on cluster algorithm k-means, efficient k-means, and affinity propagation with colon dataset. And the result of affinity ropagation shows much lower error when compare with other algorithm and the average accuracy is good.

  19. Comparative Studies of Clustering Techniques for Real-Time Dynamic Model Reduction

    CERN Document Server

    Hogan, Emilie; Halappanavar, Mahantesh; Huang, Zhenyu; Lin, Guang; Lu, Shuai; Wang, Shaobu

    2015-01-01

    Dynamic model reduction in power systems is necessary for improving computational efficiency. Traditional model reduction using linearized models or offline analysis would not be adequate to capture power system dynamic behaviors, especially the new mix of intermittent generation and intelligent consumption makes the power system more dynamic and non-linear. Real-time dynamic model reduction emerges as an important need. This paper explores the use of clustering techniques to analyze real-time phasor measurements to determine generator groups and representative generators for dynamic model reduction. Two clustering techniques -- graph clustering and evolutionary clustering -- are studied in this paper. Various implementations of these techniques are compared and also compared with a previously developed Singular Value Decomposition (SVD)-based dynamic model reduction approach. Various methods exhibit different levels of accuracy when comparing the reduced model simulation against the original model. But some ...

  20. A reliable cluster detection technique using photometric redshifts: introducing the 2TecX algorithm

    CERN Document Server

    van Breukelen, Caroline

    2009-01-01

    We present a new cluster detection algorithm designed for finding high-redshift clusters using optical/infrared imaging data. The algorithm has two main characteristics. First, it utilises each galaxy's full redshift probability function, instead of an estimate of the photometric redshift based on the peak of the probability function and an associated Gaussian error. Second, it identifies cluster candidates through cross-checking the results of two substantially different selection techniques (the name 2TecX representing the cross-check of the two techniques). These are adaptations of the Voronoi Tesselations and Friends-Of-Friends methods. Monte-Carlo simulations of mock catalogues show that cross-checking the cluster candidates found by the two techniques significantly reduces the detection of spurious sources. Furthermore, we examine the selection effects and relative strengths and weaknesses of either method. The simulations also allow us to fine-tune the algorithm's parameters, and define completeness an...

  1. Hierarchical rutile TiO2 flower cluster-based high efficiency dye-sensitized solar cells via direct hydrothermal growth on conducting substrates.

    Science.gov (United States)

    Ye, Meidan; Liu, Hsiang-Yu; Lin, Changjian; Lin, Zhiqun

    2013-01-28

    Dye-sensitized solar cells (DSSCs) based on hierarchical rutile TiO(2) flower clusters prepared by a facile, one-pot hydrothermal process exhibit a high efficiency. Complex yet appealing rutile TiO(2) flower films are, for the first time, directly hydrothermally grown on a transparent conducting fluorine-doped tin oxide (FTO) substrate. The thickness and density of as-grown flower clusters can be readily tuned by tailoring growth parameters, such as growth time, the addition of cations of different valence and size, initial concentrations of precursor and cation, growth temperature, and acidity. Notably, the small lattice mismatch between the FTO substrate and rutile TiO(2) renders the epitaxial growth of a compact rutile TiO(2) layer on the FTO glass. Intriguingly, these TiO(2) flower clusters can then be exploited as photoanodes to produce DSSCs, yielding a power conversion efficiency of 2.94% despite their rutile nature, which is further increased to 4.07% upon the TiCl(4) treatment.

  2. THE EFFECT OF CLUSTERING TECHNIQUE ON WRITING EXPOSITORY ESSAYS OF EFL STUDENTS

    Directory of Open Access Journals (Sweden)

    Sabarun Sabarun

    2013-03-01

    Full Text Available The study is aimed at investigating the effectiveness of using clustering technique in writing expository essays. The aim of the study is to prove whether there is a significant difference between writing using clustering technique and writing without using it on the students’ writing achievement or not. The study belonged to experimental study by applying counterbalance procedure to collect the data. The study was conducted at the fourth semester English department students of Palangka Raya State Islamic College of 2012/ 2013 academic year. The number of the sample was 13 students. This study was restricted to two focuses: using clustering technique and without using clustering technique to write composition. Using clustering technique to write essay was one of the pre writing strategies in writing process. To answer the research problem, the t test for correlated samples was applied. The research findings showed that,it was found that the t value was 10.554.It was also found that the df (Degree of freedom of the distribution observed was 13-1= 12.  Based on the Table of t value, if df was 12, the 5% of significant level of t value was at 1.782 and the 1% of significant level of t value was at 2.179. It meant that using clustering gave facilitative effect on the students’ essay writing performance. Keywords: reading comprehension, text, scaffolding

  3. Hierarchical Neural Regression Models for Customer Churn Prediction

    Directory of Open Access Journals (Sweden)

    Golshan Mohammadi

    2013-01-01

    Full Text Available As customers are the main assets of each industry, customer churn prediction is becoming a major task for companies to remain in competition with competitors. In the literature, the better applicability and efficiency of hierarchical data mining techniques has been reported. This paper considers three hierarchical models by combining four different data mining techniques for churn prediction, which are backpropagation artificial neural networks (ANN, self-organizing maps (SOM, alpha-cut fuzzy c-means (α-FCM, and Cox proportional hazards regression model. The hierarchical models are ANN + ANN + Cox, SOM + ANN + Cox, and α-FCM + ANN + Cox. In particular, the first component of the models aims to cluster data in two churner and nonchurner groups and also filter out unrepresentative data or outliers. Then, the clustered data as the outputs are used to assign customers to churner and nonchurner groups by the second technique. Finally, the correctly classified data are used to create Cox proportional hazards model. To evaluate the performance of the hierarchical models, an Iranian mobile dataset is considered. The experimental results show that the hierarchical models outperform the single Cox regression baseline model in terms of prediction accuracy, Types I and II errors, RMSE, and MAD metrics. In addition, the α-FCM + ANN + Cox model significantly performs better than the two other hierarchical models.

  4. 一种层次聚类的RDF图语义检索方法研究%Hierarchical clustering-based semantic retrieval of RDF graph

    Institute of Scientific and Technical Information of China (English)

    刘宁; 左凤华; 张俊

    2012-01-01

    The cun-ent research related RDF graph retrieve exists some problems, such as low efficiency of memory usage, low search efficiency and so on. This paper proposed a hierarchical clustering semantic retrieval model on RDF graph and the method based on the model to solve aforesaid problems. That extracting entities from RDF graph and hierarchical clustering by the guidance of the ontology library made the complex graph structure into a tree structure for efficient retrieval. Orientating target object which was one of nodes in the model in RDF conducted the semantic expansion queries. Retrieval efficiency increased because retrieval scope narrow down as construction of retrieval model and recall ratio increased by the semantic expansion queries.%针对当前信息资源描述框架(RDF)检索过程中存在的内存使用过大及检索效率低等问题,提出一个RDF图的层次聚类语义检索模型,设计并实现了相应的检索方法.首先从RDF图中抽取实体数据,在本体库的指导下,通过层次聚类,将复杂的图形结构转换为适合检索的树型结构;根据在树中查找到的目标对象,确定其在RDF图中的位置,进行语义扩充查询.检索模型的构建缩小了检索范围,从而提高了检索效率,其语义扩充查询还可以得到较好的查全率.

  5. Prediction of Adsorption of Cadmium by Hematite Using Fuzzy C-Means Clustering Technique

    Directory of Open Access Journals (Sweden)

    Sriparna Das

    2012-11-01

    Full Text Available Clustering is partitioning of data set into subsets (clusters, so that the data in each subset share some common trait. In this paper, an algorithm has been proposed based on Fuzzy C-means clustering technique for prediction of adsorption of cadmium by hematite. The original data elements have been used for clustering the random data set. The random data have been generated within the minimum and maximum value of test data. The proposed algorithm has been applied on random dataset considering the original data set as initial cluster center. A threshold value has been taken to make the boundary around the clustering center. Finally, after execution of algorithm, modified cluster centers have been computed based on each initial cluster center. The modified cluster centers have been treated as predicted data set. The algorithm has been tested in prediction of adsorption of cadmium by hematite. The error has been calculated between the original data and predicted data. It has been observed that the proposed algorithm has given better result than the previous applied methods.

  6. Cluster Studies of Chemisorption Using Total Energy Techniques.

    Science.gov (United States)

    Wander, Adrian

    Available from UMI in association with The British Library. Requires signed TDF. Chapter 1 introduces the topic. Chapter 2 contains a discussion of ab initio quantum chemistry techniques and in particular the self consistent Hartree-Fock equations. Section 2.2 discusses the Hartree -Fock equations and their matrix form the Roothaan-Hall equations. Section 2.3 deals with the important question of the choice of a basis set for molecular calculations and in section 2.4 we move on to present a brief review of the GAMESS SCF MO package. Finally, section 2.5 deals with methods of moving beyond HF theory by including electron -electron correlation effects. Chapters 3, 4 and 5 deal with applications of the ab initio method to real systems. Chapter 3 details calculations performed on the formate and methoxy radicals on the Cu(100) surface, while chapter 4 looks at the controversial topic of the low temperature structure of oxygen on Cu(110). Finally, chapter 5 considers the effects of atomic oxygen chemisorption on the Si(100)(2 times 1) reconstructed surface. While the preceding three chapters highlight the virtues of ab initio methods, chapter 6 points out some of their vices and in particular the severe demands they make on computational resources. Alternative semi-empirical techniques are then introduced in the form of the extended Huckel and ASED methods. In particular, we discuss the role of charge self consistency in semi-empirical techniques and show that in contrast to other methods, it has little effect on the quality of results produced using the ASED method. Finally, we conclude in chapter 7 by reviewing the thesis and suggesting possible future developments to this work, both in terms of interesting systems to investigate and new directions in which the theory could be developed. (Abstract shortened with permission of author.).

  7. 基于类轮廓层次聚类方法的研究%RESEARCH ON CLASS-PROFILE-BASED HIERARCHICAL CLUSTERING METHOD

    Institute of Scientific and Technical Information of China (English)

    孟海东; 唐旋

    2011-01-01

    传统的聚类算法在考虑类与类之间的连通性特征和近似性特征上往往顾此失彼.首先给出类边界点和类轮廓的基本定义以及寻求方法,然后基于类间连通性特征和近似性特征的综合考虑,拟定一些类间相似性度量标准和方法,最后提出一种基于类轮廓的层次聚类算法.该算法能够有效处理任意形状的簇,且能够区分孤立点和噪声数据.通过对图像数据集和Iris标准数据集的聚类分析,验证了该算法的可行性和有效性.%Traditional clustering algorithms are often incapable of roundly considering the connectivity and similarity characteristics among classes. The thesis firstly presents the fundamental definition of class boundary point and class profile; secondly, with comprehensive consideration based on connectivity characteristics and similarity characteristics among classes, defines some standards and methods for inter class similarity measurement; thirdly, proposes a class-profile-based hierarchical clustering algorithm, which is able to effectively process arbitrary shaped clusters and distinguish isolated points from noise data. The feasibility and effectiveness of the algorithm is validated through clustering analysis on image data sets and Iris standard data sets.

  8. Ultrathin mesoporous Co3O4 nanosheets-constructed hierarchical clusters as high rate capability and long life anode materials for lithium-ion batteries

    Science.gov (United States)

    Wu, Shengming; Xia, Tian; Wang, Jingping; Lu, Feifei; Xu, Chunbo; Zhang, Xianfa; Huo, Lihua; Zhao, Hui

    2017-06-01

    Herein, Ultrathin mesoporous Co3O4 nanosheets-constructed hierarchical clusters (UMCN-HCs) have been successfully synthesized via a facile hydrothermal method followed by a subsequent thermolysis treatment at 600 °C in air. The products consist of cluster-like Co3O4 microarchitectures, which are assembled by numerous ultrathin mesoporous Co3O4 nanosheets. When tested as anode materials for lithium-ion batteries, UMCN-HCs deliver a high reversible capacity of 1067 mAh g-1 at a current density of 100 mA g-1 after 100 cycles. Even at 2 A g-1, a stable capacity as high as 507 mAh g-1 can be achieved after 500 cycles. The high reversible capacity, excellent cycling stability, and good rate capability of UMCN-HCs may be attributed to their mesoporous sheet-like nanostructure. The sheet-layered structure of UMCN-HCs may buffer the volume change during the lithiation-delithiation process, and the mesoporous characteristic make lithium-ion transfer more easily at the interface between the active electrode and the electrolyte.

  9. Fingerprint analysis of Hibiscus mutabilis L. leaves based on ultra performance liquid chromatography with photodiode array detector combined with similarity analysis and hierarchical clustering analysis methods

    Directory of Open Access Journals (Sweden)

    Xianrui Liang

    2013-01-01

    Full Text Available Background: A method for chemical fingerprint analysis of Hibiscus mutabilis L. leaves was developed based on ultra performance liquid chromatography with photodiode array detector (UPLC-PAD combined with similarity analysis (SA and hierarchical clustering analysis (HCA. Materials and Methods: 10 batches of Hibiscus mutabilis L. leaves samples were collected from different regions of China. UPLC-PAD was employed to collect chemical fingerprints of Hibiscus mutabilis L. leaves. Results: The relative standard deviations (RSDs of the relative retention times (RRT and relative peak areas (RPA of 10 characteristic peaks (one of them was identified as rutin in precision, repeatability and stability test were less than 3%, and the method of fingerprint analysis was validated to be suitable for the Hibiscus mutabilis L. leaves. Conclusions: The chromatographic fingerprints showed abundant diversity of chemical constituents qualitatively in the 10 batches of Hibiscus mutabilis L. leaves samples from different locations by similarity analysis on basis of calculating the correlation coefficients between each two fingerprints. Moreover, the HCA method clustered the samples into four classes, and the HCA dendrogram showed the close or distant relations among the 10 samples, which was consistent to the SA result to some extent.

  10. Introduction into Hierarchical Matrices

    KAUST Repository

    Litvinenko, Alexander

    2013-12-05

    Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.

  11. Application of clustering techniques to study environmental characteristics of microbialite-bearing aquatic systems

    Science.gov (United States)

    Dalinina, R.; Petryshyn, V. A.; Lim, D. S.; Braverman, A. J.; Tripati, A. K.

    2015-07-01

    Microbialites are a product of trapping and binding of sediment by microbial communities, and are considered to be some of the most ancient records of life on Earth. It is a commonly held belief that microbialites are limited to extreme, hypersaline settings. However, more recent studies report their occurrence in a wider range of environments. The goal of this study is to explore whether microbialite-bearing sites share common geochemical properties. We apply statistical techniques to distinguish any common traits in these environments. These techniques ultimately could be used to address questions of microbialite distribution: are microbialites restricted to environments with specific characteristics; or are they more broadly distributed? A dataset containing hydrographic characteristics of several microbialite sites with data on pH, conductivity, alkalinity, and concentrations of several major anions and cations was constructed from previously published studies. In order to group the water samples by their natural similarities and differences, a clustering approach was chosen for analysis. k means clustering with partial distances was applied to the dataset with missing values, and separated the data into two clusters. One of the clusters is formed by samples from atoll Kiritimati (central Pacific Ocean), and the second cluster contains all other observations. Using these two clusters, the missing values were imputed by k nearest neighbor method, producing a complete dataset that can be used for further multivariate analysis. Salinity is not found to be an important variable defining clustering, and although pH defines clustering in this dataset, it is not an important variable for microbialite formation. Clustering and imputation procedures outlined here can be applied to an expanded dataset on microbialite characteristics in order to determine properties associated with microbialite-containing environments.

  12. Application of clustering techniques to study environmental characteristics of microbialite-bearing aquatic systems

    Directory of Open Access Journals (Sweden)

    R. Dalinina

    2015-07-01

    Full Text Available Microbialites are a product of trapping and binding of sediment by microbial communities, and are considered to be some of the most ancient records of life on Earth. It is a commonly held belief that microbialites are limited to extreme, hypersaline settings. However, more recent studies report their occurrence in a wider range of environments. The goal of this study is to explore whether microbialite-bearing sites share common geochemical properties. We apply statistical techniques to distinguish any common traits in these environments. These techniques ultimately could be used to address questions of microbialite distribution: are microbialites restricted to environments with specific characteristics; or are they more broadly distributed? A dataset containing hydrographic characteristics of several microbialite sites with data on pH, conductivity, alkalinity, and concentrations of several major anions and cations was constructed from previously published studies. In order to group the water samples by their natural similarities and differences, a clustering approach was chosen for analysis. k means clustering with partial distances was applied to the dataset with missing values, and separated the data into two clusters. One of the clusters is formed by samples from atoll Kiritimati (central Pacific Ocean, and the second cluster contains all other observations. Using these two clusters, the missing values were imputed by k nearest neighbor method, producing a complete dataset that can be used for further multivariate analysis. Salinity is not found to be an important variable defining clustering, and although pH defines clustering in this dataset, it is not an important variable for microbialite formation. Clustering and imputation procedures outlined here can be applied to an expanded dataset on microbialite characteristics in order to determine properties associated with microbialite-containing environments.

  13. Critérios de formação de carteiras de ativos por meio de Hierarchical Clusters

    Directory of Open Access Journals (Sweden)

    Pierre Lucena

    2010-04-01

    Full Text Available Este artigo tem como objetivo principal apresentar e testar uma ferramenta de estatística multivariada em modelos financeiros. Essa metodologia, conhecida como análise de clusters, separa as observações em grupos com suas determinadas características, em contraste com a metodologia tradicional, que é somente a ordem com os quantis. Foi aplicada essa ferramenta em 213 ações negociadas na Bolsa de São Paulo (Bovespa, separando os grupos por tamanho e book-tomarket. Depois, as novas carteiras foram aplicadas no modelo de Fama e French (1996, comparando os resultados numa formação de carteira para quantil e análise de cluster. Foram encontrados melhores resultados na segunda metodologia. Os autores concluem que a análise de cluster pode ser mais adequada porque tende a formar grupos mais homogeneizados, sendo sua aplicação útil para a formação de carteiras e para a teoria financeira.

  14. Hierarchical Fragmentation and Jet-like Outflows in IRDC G28.34+0.06, a Growing Massive Protostar Cluster

    CERN Document Server

    Wang, Ke; Wu, Yuefang; Zhang, Huawei

    2011-01-01

    We present Submillimeter Array (SMA) \\lambda = 0.88mm observations of an infrared dark cloud (IRDC) G28.34+0.06. Located in the quiescent southern part of the G28.34 cloud, the region of interest is a massive ($>10^3$\\,\\msun) molecular clump P1 with a luminosity of $\\sim 10^3$ \\lsun, where our previous SMA observations at 1.3mm have revealed a string of five dust cores of 22-64 \\msun\\ along the 1 pc IR-dark filament. The cores are well aligned at a position angle of 48 degrees and regularly spaced at an average projected separation of 0.16 pc. The new high-resolution, high-sensitivity 0.88\\,mm image further resolves the five cores into ten compact condensations of 1.4-10.6 \\msun, with sizes a few thousands AU. The spatial structure at clump ($\\sim 1$ pc) and core ($\\sim 0.1$ pc) scales indicates a hierarchical fragmentation. While the clump fragmentation is consistent with a cylindrical collapse, the observed fragment masses are much larger than the expected thermal Jeans masses. All the cores are driving CO(...

  15. 一种分层分簇的组密钥管理方案%A HIERARCHICAL CLUSTERING-BASED GROUP KEY MANAGEMENT SCHEME

    Institute of Scientific and Technical Information of China (English)

    李珍格; 游林

    2014-01-01

    为了满足无线传感器网络组通信的安全,提出一种分层分簇的组密钥管理方案。该方案采用分层的体系结构,将组中节点分为管理层和普通层。BS通过构造特殊的组密钥多项式更新普通层组密钥,而管理层则采用二元单向函数进行组密钥的协商。分析表明,该方案很好满足了无线传感器网络中组密钥管理的前向安全性,后向安全性,并且减小了存储开销、计算开销和通信开销。%In this paper,a hierarchical clustering-based group key management scheme is proposed in order to satisfy the secure group communication in wireless sensor network.The proposed scheme adopts the hierarchical architecture and divides the nodes in the group into master-node layer and terminal layer.The group key of terminal layer is updated by constructing a special group key polynomial in BS,and the binary one-way function is used by the master-node layer for group key negotiation.Analysis demonstrates that the scheme well satisfies the forward security and backward security of the group key management in WSN,and reduces the storage overhead,computation overhead and communication overhead as well.

  16. Galaxy Cluster Mass Reconstruction Project: I. Methods and first results on galaxy-based techniques

    CERN Document Server

    Old, L; Pearce, F R; Croton, D; Muldrew, S I; Muñoz-Cuartas, J C; Gifford, D; Gray, M E; von der Linden, A; Mamon, G A; Merrifield, M R; Müller, V; Pearson, R J; Ponman, T J; Saro, A; Sepp, T; Sifón, C; Tempel, E; Tundo, E; Wang, Y O; Wojtak, R

    2014-01-01

    This paper is the first in a series in which we perform an extensive comparison of various galaxy-based cluster mass estimation techniques that utilise the positions, velocities and colours of galaxies. Our primary aim is to test the performance of these cluster mass estimation techniques on a diverse set of models that will increase in complexity. We begin by providing participating methods with data from a simple model that delivers idealised clusters, enabling us to quantify the underlying scatter intrinsic to these mass estimation techniques. The mock catalogue is based on a Halo Occupation Distribution (HOD) model that assumes spherical Navarro, Frenk and White (NFW) haloes truncated at R_200, with no substructure nor colour segregation, and with isotropic, isothermal Maxwellian velocities. We find that, above 10^14 M_solar, recovered cluster masses are correlated with the true underlying cluster mass with an intrinsic scatter of typically a factor of two. Below 10^14 M_solar, the scatter rises as the nu...

  17. A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mohammad Gholami

    2016-01-01

    Full Text Available In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1 the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2 an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency.

  18. IMPLEMENTATION OF IMPROVED NETWORK LIFETIME TECHNIQUE FOR WSN USING CLUSTER HEAD ROTATION AND SIMULTANEOUS RECEPTION

    Directory of Open Access Journals (Sweden)

    Arun Vasanaperumal

    2015-11-01

    Full Text Available There are number of potential applications of Wireless Sensor Networks (WSNs like wild habitat monitoring, forest fire detection, military surveillance etc. All these applications are constrained for power from a stand along battery power source. So it becomes of paramount importance to conserve the energy utilized from this power source. A lot of efforts have gone into this area recently and it remains as one of the hot research areas. In order to improve network lifetime and reduce average power consumption, this study proposes a novel cluster head selection algorithm. Clustering is the preferred architecture when the numbers of nodes are larger because it results in considerable power savings for large networks as compared to other ones like tree or star. Since majority of the applications generally involve more than 30 nodes, clustering has gained widespread importance and is most used network architecture. The optimum number of clusters is first selected based on the number of nodes in the network. When the network is in operation the cluster heads in a cluster are rotated periodically based on the proposed cluster head selection algorithm to increase the network lifetime. Throughout the network single-hop communication methodology is assumed. This work will serve as an encouragement for further advances in the low power techniques for implementing Wireless Sensor Networks (WSNs.

  19. A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks.

    Science.gov (United States)

    Gholami, Mohammad; Brennan, Robert W

    2016-01-06

    In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency.

  20. Micromechanics of hierarchical materials

    DEFF Research Database (Denmark)

    Mishnaevsky, Leon, Jr.

    2012-01-01

    A short overview of micromechanical models of hierarchical materials (hybrid composites, biomaterials, fractal materials, etc.) is given. Several examples of the modeling of strength and damage in hierarchical materials are summarized, among them, 3D FE model of hybrid composites...... with nanoengineered matrix, fiber bundle model of UD composites with hierarchically clustered fibers and 3D multilevel model of wood considered as a gradient, cellular material with layered composite cell walls. The main areas of research in micromechanics of hierarchical materials are identified, among them......, the investigations of the effects of load redistribution between reinforcing elements at different scale levels, of the possibilities to control different material properties and to ensure synergy of strengthening effects at different scale levels and using the nanoreinforcement effects. The main future directions...

  1. Deriving semantic structure from category fluency: clustering techniques and their pitfalls.

    Science.gov (United States)

    Voorspoels, Wouter; Storms, Gert; Longenecker, Julia; Verheyen, Steven; Weinberger, Daniel R; Elvevåg, Brita

    2014-06-01

    Assessing verbal output in category fluency tasks provides a sensitive indicator of cortical dysfunction. The most common metrics are the overall number of words produced and the number of errors. Two main observations have been made about the structure of the output, first that there is a temporal component to it with words being generated in spurts, and second that the clustering pattern may reflect a search for meanings such that the 'clustering' is attributable to the activation of a specific semantic field in memory. A number of sophisticated approaches to examining the structure of this clustering have been developed, and a core theme is that the similarity relations between category members will reveal the mental semantic structure of the category underlying an individual's responses, which can then be visualized by a number of algorithms, such as MDS, hierarchical clustering, ADDTREE, ADCLUS or SVD. Such approaches have been applied to a variety of neurological and psychiatric populations, and the general conclusion has been that the clinical condition systematically distorts the semantic structure in the patients, as compared to the healthy controls. In the present paper we explore this approach to understanding semantic structure using category fluency data. On the basis of a large pool of patients with schizophrenia (n = 204) and healthy control participants (n = 204), we find that the methods are problematic and unreliable to the extent that it is not possible to conclude that any putative difference reflects a systematic difference between the semantic representations in patients and controls. Moreover, taking into account the unreliability of the methods, we find that the most probable conclusion to be made is that no difference in underlying semantic representation exists. The consequences of these findings to understanding semantic structure, and the use of category fluency data, in cortical dysfunction are discussed.

  2. Exploring the Effects of Congruence and Holland's Personality Codes on Job Satisfaction: An Application of Hierarchical Linear Modeling Techniques

    Science.gov (United States)

    Ishitani, Terry T.

    2010-01-01

    This study applied hierarchical linear modeling to investigate the effect of congruence on intrinsic and extrinsic aspects of job satisfaction. Particular focus was given to differences in job satisfaction by gender and by Holland's first-letter codes. The study sample included nationally represented 1462 female and 1280 male college graduates who…

  3. Exploring the Effects of Congruence and Holland's Personality Codes on Job Satisfaction: An Application of Hierarchical Linear Modeling Techniques

    Science.gov (United States)

    Ishitani, Terry T.

    2010-01-01

    This study applied hierarchical linear modeling to investigate the effect of congruence on intrinsic and extrinsic aspects of job satisfaction. Particular focus was given to differences in job satisfaction by gender and by Holland's first-letter codes. The study sample included nationally represented 1462 female and 1280 male college graduates who…

  4. Two Applications of Clustering Techniques to Twitter: Community Detection and Issue Extraction

    Directory of Open Access Journals (Sweden)

    Yong-Hyuk Kim

    2013-01-01

    Full Text Available Twitter’s recent growth in the number of users has redefined its status from a simple social media service to a mass media. We deal with clustering techniques applied to Twitter network and Twitter trend analysis. When we divide and cluster Twitter network, we can find a group of users with similar inclination, called a “Community.” In this regard, we introduce the Louvain algorithm and advance a partitioned Louvain algorithm as its improved variant. In the result of the experiment based on actual Twitter data, the partitioned Louvain algorithm supplemented the performance decline and shortened the execution time. Also, we use clustering techniques for trend analysis. We use nonnegative matrix factorization (NMF, which is a convenient method to intuitively interpret and extract issues on various time scales. By cross-verifying the results using NFM, we found that it has clear correlation with the actual main issue.

  5. A Survey On Detect - Discovering And Evaluating Trust Using Efficient Clustering Technique For Manets

    Directory of Open Access Journals (Sweden)

    K.Sudharson

    2012-03-01

    Full Text Available Analyzing and predicting behavior of node can lead to more secure and more appropriate defense mechanism for attackers in the Mobile Adhoc Network. In this work, models for dynamic recommendation based on fuzzy clustering techniques, applicable to nodes that are currently participate in the transmission of Adhoc Network. The approach focuses on both aspects of MANET mining and behavioral mining. Applying fuzzy clustering and mining techniques, the model infers the node's preferences from transmission logs. The fuzzy clustering approach, in this study, provides the possibility of capturing the uncertainty among node's behaviors. The results shown are promising and proved that integrating fuzzy approach provide us with more interesting and useful patterns which consequently making the recommender system more functional and robust.

  6. Hierarchical Cluster-based Partial Least Squares Regression (HC-PLSR is an efficient tool for metamodelling of nonlinear dynamic models

    Directory of Open Access Journals (Sweden)

    Omholt Stig W

    2011-06-01

    Full Text Available Abstract Background Deterministic dynamic models of complex biological systems contain a large number of parameters and state variables, related through nonlinear differential equations with various types of feedback. A metamodel of such a dynamic model is a statistical approximation model that maps variation in parameters and initial conditions (inputs to variation in features of the trajectories of the state variables (outputs throughout the entire biologically relevant input space. A sufficiently accurate mapping can be exploited both instrumentally and epistemically. Multivariate regression methodology is a commonly used approach for emulating dynamic models. However, when the input-output relations are highly nonlinear or non-monotone, a standard linear regression approach is prone to give suboptimal results. We therefore hypothesised that a more accurate mapping can be obtained by locally linear or locally polynomial regression. We present here a new method for local regression modelling, Hierarchical Cluster-based PLS regression (HC-PLSR, where fuzzy C-means clustering is used to separate the data set into parts according to the structure of the response surface. We compare the metamodelling performance of HC-PLSR with polynomial partial least squares regression (PLSR and ordinary least squares (OLS regression on various systems: six different gene regulatory network models with various types of feedback, a deterministic mathematical model of the mammalian circadian clock and a model of the mouse ventricular myocyte function. Results Our results indicate that multivariate regression is well suited for emulating dynamic models in systems biology. The hierarchical approach turned out to be superior to both polynomial PLSR and OLS regression in all three test cases. The advantage, in terms of explained variance and prediction accuracy, was largest in systems with highly nonlinear functional relationships and in systems with positive feedback

  7. Segmentation Algorithm for Oil Spill SAR Images Based on Hierarchical Agglomerative Clustering%基于HAC的溢油SAR图像分割算法

    Institute of Scientific and Technical Information of China (English)

    苏腾飞; 孟俊敏; 张晰

    2013-01-01

    图像分割是SAR溢油检测中的关键步骤,但由于SAR影像中存在斑点噪声,使得一般的图像分割算法难以收到理想的效果,严重影响溢油检测的精度.发展一种基于凝聚层次聚类(Hierarchical Agglomerative Clustering,HAC)的溢油SAR图像分割算法.该算法利用多尺度分割的思想,能够有效保持SAR影像中溢油斑块的形状特征,并能减少细碎斑块的产生.利用2010年墨西哥湾的Envisat ASAR影像开展了溢油SAR图像分割实验,并将该算法和Canny边缘检测、OTSU阈值分割、FCM分割、水平集分割等方法进行了对比.结果显示,HAC方法可以有效减少细碎斑块的产生,有助于提高SAR溢油检测的精度.%Image segmentation is a crucial stage in the SAR oil spill detection.However,the common image segmentation algorithms can hardly achieve satisfactory results due to speckle noise in the SAR images,thus affecting seriously the accuracy of oil spill detection.For this reason,an image segmentation algorithm which is based on HAC (Hierarchical Agglomerative Clustering) is developed for the oil spill SAR images.This method takes advantage of multi-resolution segmentation to maintain effectively the shape property of oil spill patches,and can reduce the formation of small patches.By using Envisat ASAR images of the Gulf of Mexico obtained in 2010,an experiment of SAR oil spill image segmentation has been conducted.Comparing with other approaches such as Canny,OTSU,FCM and Levelset,the results show that HAC can effectively reduce the producing of small patches,which is helpful to improve the accuracy of SAR oil spill detection.

  8. Melodic pattern discovery by structural analysis via wavelets and clustering techniques

    DEFF Research Database (Denmark)

    Velarde, Gissel; Meredith, David

    We present an automatic method to support melodic pattern discovery by structural analysis of symbolic representations by means of wavelet analysis and clustering techniques. In previous work, we used the method to recognize the parent works of melodic segments, or to classify tunes into tune...... to support human or computer assisted music analysis and teaching....

  9. Hybrid Clustering-GWO-NARX neural network technique in predicting stock price

    Science.gov (United States)

    Das, Debashish; Safa Sadiq, Ali; Mirjalili, Seyedali; Noraziah, A.

    2017-09-01

    Prediction of stock price is one of the most challenging tasks due to nonlinear nature of the stock data. Though numerous attempts have been made to predict the stock price by applying various techniques, yet the predicted price is not always accurate and even the error rate is high to some extent. Consequently, this paper endeavours to determine an efficient stock prediction strategy by implementing a combinatorial method of Grey Wolf Optimizer (GWO), Clustering and Non Linear Autoregressive Exogenous (NARX) Technique. The study uses stock data from prominent stock market i.e. New York Stock Exchange (NYSE), NASDAQ and emerging stock market i.e. Malaysian Stock Market (Bursa Malaysia), Dhaka Stock Exchange (DSE). It applies K-means clustering algorithm to determine the most promising cluster, then MGWO is used to determine the classification rate and finally the stock price is predicted by applying NARX neural network algorithm. The prediction performance gained through experimentation is compared and assessed to guide the investors in making investment decision. The result through this technique is indeed promising as it has shown almost precise prediction and improved error rate. We have applied the hybrid Clustering-GWO-NARX neural network technique in predicting stock price. We intend to work with the effect of various factors in stock price movement and selection of parameters. We will further investigate the influence of company news either positive or negative in stock price movement. We would be also interested to predict the Stock indices.

  10. The Application of Clustering Techniques to Citation Data. Research Reports Series B No. 6.

    Science.gov (United States)

    Arms, William Y.; Arms, Caroline

    This report describes research carried out as part of the Design of Information Systems in the Social Sciences (DISISS) project. Cluster analysis techniques were applied to a machine readable file of bibliographic data in the form of cited journal titles in order to identify groupings which could be used to structure bibliographic files. Practical…

  11. The tree clustering technique and the physical reality of galaxy groups

    Directory of Open Access Journals (Sweden)

    M.A. Sabry

    2012-12-01

    Full Text Available In this paper the tree clustering technique (the Euclidean separation distance coefficients is suggested to test how the Hickson compact groups of galaxies (HCGs are really physical groups. The method is applied on groups of 5 members only in Hickson’s catalog.

  12. Partial least square and hierarchical clustering in ADMET modeling: prediction of blood-brain barrier permeation of α-adrenergic and imidazoline receptor ligands.

    Science.gov (United States)

    Nikolic, Katarina; Filipic, Slavica; Smoliński, Adam; Kaliszan, Roman; Agbaba, Danica

    2013-01-01

    PURPOSE. Rate of brain penetration (logPS), brain/plasma equilibration rate (logPS-brain), and extent of blood-brain barrier permeation (logBB) of 29 α-adrenergic and imidazoline-receptors ligands were examined in Quantitative-Structure-Property Relationship (QSPR) study. METHODS. Experimentally determined chromatographic retention data (logKw at pH 4.4, slope (S) at pH 4.4, logKw at pH 7.4, slope (S) at pH 7.4, logKw at pH 9.1, and slope (S) at pH 9.1) and capillary electrophoresis migration parameters (μeff at pH 4.4, μeff at pH 7.4, and μeff at pH 9.1), together with calculated molecular descriptors, were used as independent variables in the QSPR study by use of partial least square (PLS) methodology. RESULTS. Predictive potential of the formed QSPR models, QSPR(logPS), QSPR(logPS-brain), QSPR(logBB), was confirmed by cross- and external validation. Hydrophilicity (Hy) and H-indices (H7m) were selected as significant parameters negatively correlated with both logPS and logPS-brain, while topological polar surface area (TPSA(NO)) was chosen as molecular descriptor negatively correlated with both logPS and logBB. The principal component analysis (PCA) and hierarchical clustering analysis (HCA) were applied to cluster examined drugs based on their chromatographic, electrophoretic and molecular properties. Significant positive correlations were obtained between the slope (S) at pH 7.4 and logBB in A/B cluster and between the logKw at pH 9.1 and logPS in C/D cluster. CONCLUSIONS. Results of the QSPR, clustering and correlation studies could be used as novel tool for evaluation of blood-brain barrier permeation of related α-adrenergic/imidazoline receptor ligands.This article is open to POST-PUBLICATION REVIEW. Registered readers (see "For Readers") may comment by clicking on ABSTRACT on the issue's contents page.PURPOSE. Rate of brain penetration (logPS), brain/plasma equilibration rate (logPS-brain), and extent of blood-brain barrier permeation (logBB) of 29

  13. The maxBCG technique for finding galaxy clusters in SDSS data

    Science.gov (United States)

    Annis, J.; Kent, S.; Castander, F.; Eisenstein, D.; Gunn, J.; Kim, R.; Lupton, R.; Nichol, R.; Postman, M.; Voges, W.; SDSS Collaboration

    1999-12-01

    We present a new technique for finding galaxy clusters based on looking for a core of red, early type galaxies in the cluster center. These galaxies are known to have a small dispersion in color out to at least z=0.5. Further, the brightest of the ellipticals have near constant luminosity. In the maxBCG technique, one looks for objects whose appararent magnitudes and colors are consistent with their being brightest cluster galaxies (BCGs). If one presumes that any such object is a BCG, one can estimate a redshift and then search an area a half megaparsec around the galaxy for other galaxies that have the colors of the E/S0 ridgeline. One obtains a good estimate of the redshift by jointly minimizing the difference from the mean restframe brightest cluster galaxy properties while maximizing the number of galaxies in the E/S0 ridgeline. We have run this algoritm on the Abell clusters in the Sloan Digital Sky Survey commisioning data area with known redshifts, and find that the error in the estimated redshift z is only 0.02. This work was supported by the U.S. Department of Energy under contract No. DE-AC02-76CH03000.

  14. Optical Cluster-Finding with an Adaptive Matched-Filter Technique: Algorithm and Comparison with Simulations

    Energy Technology Data Exchange (ETDEWEB)

    Dong, Feng; Pierpaoli, Elena; Gunn, James E.; Wechsler, Risa H.

    2007-10-29

    We present a modified adaptive matched filter algorithm designed to identify clusters of galaxies in wide-field imaging surveys such as the Sloan Digital Sky Survey. The cluster-finding technique is fully adaptive to imaging surveys with spectroscopic coverage, multicolor photometric redshifts, no redshift information at all, and any combination of these within one survey. It works with high efficiency in multi-band imaging surveys where photometric redshifts can be estimated with well-understood error distributions. Tests of the algorithm on realistic mock SDSS catalogs suggest that the detected sample is {approx} 85% complete and over 90% pure for clusters with masses above 1.0 x 10{sup 14}h{sup -1} M and redshifts up to z = 0.45. The errors of estimated cluster redshifts from maximum likelihood method are shown to be small (typically less that 0.01) over the whole redshift range with photometric redshift errors typical of those found in the Sloan survey. Inside the spherical radius corresponding to a galaxy overdensity of {Delta} = 200, we find the derived cluster richness {Lambda}{sub 200} a roughly linear indicator of its virial mass M{sub 200}, which well recovers the relation between total luminosity and cluster mass of the input simulation.

  15. Hierarchical cluster analysis and chemical characterisation of Myrtus communis L. essential oil from Yemen region and its antimicrobial, antioxidant and anti-colorectal adenocarcinoma properties.

    Science.gov (United States)

    Anwar, Sirajudheen; Crouch, Rebecca A; Awadh Ali, Nasser A; Al-Fatimi, Mohamed A; Setzer, William N; Wessjohann, Ludger

    2017-01-09

    The hydrodistilled essential oil obtained from the dried leaves of Myrtus communis, collected in Yemen, was analysed by GC-MS. Forty-one compounds were identified, representing 96.3% of the total oil. The major constituents of essential oil were oxygenated monoterpenoids (87.1%), linalool (29.1%), 1,8-cineole (18.4%), α-terpineol (10.8%), geraniol (7.3%) and linalyl acetate (7.4%). The essential oil was assessed for its antimicrobial activity using a disc diffusion assay and resulted in moderate to potent antibacterial and antifungal activities targeting mainly Bacillus subtilis, Staphylococcus aureus and Candida albicans. The oil moderately reduced the diphenylpicrylhydrazyl radical (IC50 = 4.2 μL/mL or 4.1 mg/mL). In vitro cytotoxicity evaluation against HT29 (human colonic adenocarcinoma cells) showed that the essential oil exhibited a moderate antitumor effect with IC50 of 110 ± 4 μg/mL. Hierarchical cluster analysis of M. communis has been carried out based on the chemical compositions of 99 samples reported in the literature, including Yemeni sample.

  16. Ultra high performance liquid chromatography with electrospray ionization tandem mass spectrometry coupled with hierarchical cluster analysis to evaluate Wikstroemia indica (L.) C. A. Mey. from different geographical regions.

    Science.gov (United States)

    Wei, Lan; Wang, Xiaobo; Mu, Shanxue; Sun, Lixin; Yu, Zhiguo

    2015-06-01

    A sensitive, rapid and simple ultra high performance liquid chromatography with electrospray ionization tandem mass spectrometry method was developed to determine seven constituents (umbelliferone, apigenin, triumbelletin, daphnoretin, arctigenin, genkwanin and emodin) in Wikstroemia indica (L.) C. A. Mey. The chromatographic analysis was performed on an ACQUITY UPLC® BEH C18 column (2.1 × 50 mm, 1.7 μm) by gradient elution with the mobile phase of 0.05% formic acid aqueous solution (A) and acetonitrile (B). Multiple reaction monitoring mode with positive and negative electrospray ionization interface was carried out to detect the components. This method was validated in terms of specificity, linearity, accuracy, precision and stability. Excellent linear behavior was observed over the certain concentration ranges with the correlation coefficient values higher than 0.999. The intraday and innerday precisions were within 2.0%. The recoveries of seven analytes were 99.4-101.1% with relative standard deviation less than 1.2%. The 18 Wikstroemia indica samples from different origins were classified by hierarchical clustering analysis according to the contents of seven components. The results demonstrated that the developed method could successfully be used to quantify simultaneously of seven components in Wikstroemia indica and could be a helpful tool for the detection and confirmation of the quality of traditional Chinese medicines.

  17. Quantitative and Chemical Fingerprint Analysis for the Quality Evaluation of Receptaculum Nelumbinis by RP-HPLC Coupled with Hierarchical Clustering Analysis

    Directory of Open Access Journals (Sweden)

    Jin-Zhong Wu

    2013-01-01

    Full Text Available A simple and reliable method of high-performance liquid chromatography with photodiode array detection (HPLC-DAD was developed to evaluate the quality of Receptaculum Nelumbinis (dried receptacle of Nelumbo nucifera through establishing chromatographic fingerprint and simultaneous determination of five flavonol glycosides, including hyperoside, isoquercitrin, quercetin-3-O-β-d-glucuronide, isorhamnetin-3-O-β-d-galactoside and syringetin-3-O-β-d-glucoside. In quantitative analysis, the five components showed good regression (R > 0.9998 within linear ranges, and their recoveries were in the range of 98.31%–100.32%. In the chromatographic fingerprint, twelve peaks were selected as the characteristic peaks to assess the similarities of different samples collected from different origins in China according to the State Food and Drug Administration (SFDA requirements. Furthermore, hierarchical cluster analysis (HCA was also applied to evaluate the variation of chemical components among different sources of Receptaculum Nelumbinis in China. This study indicated that the combination of quantitative and chromatographic fingerprint analysis can be readily utilized as a quality control method for Receptaculum Nelumbinis and its related traditional Chinese medicinal preparations.

  18. HILIC-UPLC-MS/MS combined with hierarchical clustering analysis to rapidly analyze and evaluate nucleobases and nucleosides in Ginkgo biloba leaves.

    Science.gov (United States)

    Yao, Xin; Zhou, Guisheng; Tang, Yuping; Guo, Sheng; Qian, Dawei; Duan, Jin-Ao

    2015-02-01

    Ginkgo biloba leaf extract has been widely used in dietary supplements and more recently in some foods and beverages. In addition to the well-known flavonol glycosides and terpene lactones, G. biloba leaves are also rich in nucleobases and nucleosides. To determine the content of nucleobases and nucleosides in G. biloba leaves at trace levels, a reliable method has been established by using hydrophilic interaction ultra performance liquid chromatography coupled with triple-quadrupole tandem mass spectrometry (HILIC-UPLC-TQ-MS/MS) working in multiple reaction monitoring mode. Eleven nucleobases and nucleosides were simultaneously determined in seven min. The proposed method was fully validated in terms of linearity, sensitivity, and repeatability, as well as recovery. Furthermore, hierarchical clustering analysis (HCA) was performed to evaluate and classify the samples according to the contents of the eleven chemical constituents. The established approach could be helpful for evaluation of the potential values as dietary supplements and the quality control of G. biloba leaves, which might also be utilized for the investigation of other medicinal herbs containing nucleobases and nucleosides.

  19. A three-stage strategy for optimal price offering by a retailer based on clustering techniques

    Energy Technology Data Exchange (ETDEWEB)

    Mahmoudi-Kohan, N.; Shayesteh, E. [Islamic Azad University (Garmsar Branch), Garmsar (Iran); Moghaddam, M. Parsa; Sheikh-El-Eslami, M.K. [Tarbiat Modares University, Tehran (Iran)

    2010-12-15

    In this paper, an innovative strategy for optimal price offering to customers for maximizing the profit of a retailer is proposed. This strategy is based on load profile clustering techniques and includes three stages. For the purpose of clustering, an improved weighted fuzzy average K-means is proposed. Also, in this paper a new acceptance function for increasing the profit of the retailer is proposed. The new method is evaluated by implementation on a group of 300 customers of a 20 kV distribution network. (author)

  20. Avoiding progenitor bias: The structural and mass evolution of Brightest Group and Cluster Galaxies in Hierarchical models since z~1

    CERN Document Server

    Shankar, Francesco; Rettura, Alessandro; Bouillot, Vincent; Moreno, Jorge; Licitra, Rossella; Bernardi, Mariangela; Huertas-Company, Marc; Mei, Simona; Ascaso, Begoña; Sheth, Ravi; Delaye, Lauriane; Raichoor, Anand

    2015-01-01

    The mass and structural evolution of massive galaxies is one of the hottest topics in galaxy formation. This is because it may reveal invaluable insights into the still debated evolutionary processes governing the growth and assembly of spheroids. However, direct comparison between models and observations is usually prevented by the so-called "progenitor bias", i.e., new galaxies entering the observational selection at later epochs, thus eluding a precise study of how pre-existing galaxies actually evolve in size. To limit this effect, we here gather data on high-redshift brightest group and cluster galaxies, evolve their (mean) host halo masses down to z=0 along their main progenitors, and assign as their "descendants" local SDSS central galaxies matched in host halo mass. At face value, the comparison between high redshift and local data suggests a noticeable increase in stellar mass of a factor of >2 since z~1, and of >2.5 in mean effective radius. We then compare the inferred stellar mass and size growth ...

  1. Divisive Analysis (DIANA of hierarchical clustering and GPS data for level of service criteria of urban streets

    Directory of Open Access Journals (Sweden)

    Ashish Kumar Patnaik

    2016-03-01

    Full Text Available Level of Service (LOS for heterogeneous traffic flow on urban streets is not well defined in Indian context. Hence in this study an attempt is taken to classify urban road networks into number of street classes and average travel speeds on street segments into LOS categories. Divisive Analysis (DIANA Clustering is used for such classification of large amount of speed data collected using GPS receiver. DIANA algorithm and silhouette validation parameter are used to classify Free Flow Speeds (FFS into optimal number of classes and the same algorithm is applied on speed data to determine ranges of different LOS categories. Speed ranges for LOS categories (A–F expressed in percentage of FFS are found to be 90, 70, 50, 40, 25 and 20–25 respectively in the present study. On the other hand, in HCM (2000 it has been mentioned these values are 85 and above, 67–85, 50–67, 40–50, 30–40 and 30 and less percent respectively.

  2. Gene Expression Data Knowledge Discovery using Global and Local Clustering

    CERN Document Server

    H, Swathi

    2010-01-01

    To understand complex biological systems, the research community has produced huge corpus of gene expression data. A large number of clustering approaches have been proposed for the analysis of gene expression data. However, extracting important biological knowledge is still harder. To address this task, clustering techniques are used. In this paper, hybrid Hierarchical k-Means algorithm is used for clustering and biclustering gene expression data is used. To discover both local and global clustering structure biclustering and clustering algorithms are utilized. A validation technique, Figure of Merit is used to determine the quality of clustering results. Appropriate knowledge is mined from the clusters by embedding a BLAST similarity search program into the clustering and biclustering process. To discover both local and global clustering structure biclustering and clustering algorithms are utilized. To determine the quality of clustering results, a validation technique, Figure of Merit is used. Appropriate ...

  3. Data Clustering

    Science.gov (United States)

    Wagstaff, Kiri L.

    2012-03-01

    matrices—cases in which only pairwise information is known. The list of algorithms covered in this chapter is representative of those most commonly in use, but it is by no means comprehensive. There is an extensive collection of existing books on clustering that provide additional background and depth. Three early books that remain useful today are Anderberg’s Cluster Analysis for Applications [3], Hartigan’s Clustering Algorithms [25], and Gordon’s Classification [22]. The latter covers basics on similarity measures, partitioning and hierarchical algorithms, fuzzy clustering, overlapping clustering, conceptual clustering, validations methods, and visualization or data reduction techniques such as principal components analysis (PCA),multidimensional scaling, and self-organizing maps. More recently, Jain et al. provided a useful and informative survey [27] of a variety of different clustering algorithms, including those mentioned here as well as fuzzy, graph-theoretic, and evolutionary clustering. Everitt’s Cluster Analysis [19] provides a modern overview of algorithms, similarity measures, and evaluation methods.

  4. Performance Comparison in Terms of Communication Overhead for Wireless Sensor Network Based on Clustering Technique

    Directory of Open Access Journals (Sweden)

    Shiv Prasad Kori

    2013-05-01

    Full Text Available Wireless sensor network refers to a group of spatially distributed and dedicated sensors for monitoring and recording the physical conditions of environment like temperature, sound, pollution levels, humidity, wind speed with direction and pressure. Sensors are self powered nodes which also possess limited processing capabilities and the nodes communicate wirelessly through a gateway. The capability of sensing, processing and communication found in sensor networks lead to a vast number of applications of wireless sensor networks in areas such as environmental monitoring, warfare, education, agriculture to name a few. In the present work, the comparative evaluation of communication overhead for the wireless sensor network based of on clustering technique is carried out. It has been be observed that overhead in cluster based protocol is not much dependent upon update time. Simulation a result indicates that cluster based protocol has low communication overheads compared with the BBM based protocol when sink mobility is high

  5. Poly(methyl methacrylate) Composites with Size-selected Silver Nanoparticles Fabricated Using Cluster Beam Technique

    DEFF Research Database (Denmark)

    Muhammad, Hanif; Juluri, Raghavendra R.; Chirumamilla, Manohar

    2016-01-01

    based on cluster beam technique allowing the formation of monocrystalline size-selected silver nanoparticles with a ±5–7% precision of diameter and controllable embedment into poly (methyl methacrylate). It is shown that the soft-landed silver clusters preserve almost spherical shape with a slight......An embedment of metal nanoparticles of well-defined sizes in thin polymer films is of significant interest for a number of practical applications, in particular, for preparing materials with tunable plasmonic properties. In this article, we present a fabrication route for metal–polymer composites...... tendency to flattening upon impact. By controlling the polymer hardness (from viscous to soft state) prior the cluster deposition and annealing conditions after the deposition the degree of immersion of the nanoparticles into polymer can be tuned, thus, making it possible to create composites with either...

  6. Weighted Clustering

    DEFF Research Database (Denmark)

    Ackerman, Margareta; Ben-David, Shai; Branzei, Simina

    2012-01-01

    We investigate a natural generalization of the classical clustering problem, considering clustering tasks in which different instances may have different weights.We conduct the first extensive theoretical analysis on the influence of weighted data on standard clustering algorithms in both...... the partitional and hierarchical settings, characterizing the conditions under which algorithms react to weights. Extending a recent framework for clustering algorithm selection, we propose intuitive properties that would allow users to choose between clustering algorithms in the weighted setting and classify...

  7. An Efficient Technique for Network Traffic Summarization using Multiview Clustering and Statistical Sampling

    Directory of Open Access Journals (Sweden)

    Mohiuddin Ahmed

    2015-07-01

    Full Text Available There is significant interest in the data mining and network management communities to efficiently analyse huge amounts of network traffic, given the amount of network traffic generated even in small networks. Summarization is a primary data mining task for generating a concise yet informative summary of the given data and it is a research challenge to create summary from network traffic data. Existing clustering based summarization techniques lack the ability to create a suitable summary for further data mining tasks such as anomaly detection and require the summary size as an external input. Additionally, for complex and high dimensional network traffic datasets, there is often no single clustering solution that explains the structure of the given data. In this paper, we investigate the use of multiview clustering to create a meaningful summary using original data instances from network traffic data in an efficient manner. We develop a mathematically sound approach to select the summary size using a sampling technique. We compare our proposed approach with regular clustering based summarization incorporating the summary size calculation method and random approach. We validate our proposed approach using the benchmark network traffic dataset and state-of-theart summary evaluation metrics.

  8. Filtering techniques for the detection of Sunyaev-Zel'dovich clusters in multifrequency CMB maps

    CERN Document Server

    Herranz, D; Hobson, M P; Barreiro, R B; Diego-Rodriguez, J M; Martínez-González, E; Lasenby, A N

    2002-01-01

    The problem of detecting Sunyaev-Zel'dovich (SZ) clusters in multifrequency CMB observations is investigated using a number of filtering techniques. A multifilter approach is introduced, which optimizes the detection of SZ clusters on microwave maps. An alternative method is also investigated, in which maps at different frequencies are combined in an optimal manner so that existing filtering techniques can be applied to the single combined map. The SZ profiles are approximated by the circularly-symmetric template $\\tau (x) = [1 +(x/r_c)^2]^{-\\lambda}$, with $\\lambda \\simeq \\tfrac{1}{2}$ and $x\\equiv |\\vec{x}|$, where the core radius $r_c$ and the overall amplitude of the effect are not fixed a priori, but are determined from the data. The background emission is modelled by a homogeneous and isotropic random field, characterized by a cross-power spectrum $P_{\

  9. DUST SPECTRAL ENERGY DISTRIBUTIONS IN THE ERA OF HERSCHEL AND PLANCK: A HIERARCHICAL BAYESIAN-FITTING TECHNIQUE

    Energy Technology Data Exchange (ETDEWEB)

    Kelly, Brandon C.; Goodman, Alyssa A. [Harvard-Smithsonian Center for Astrophysics, 60 Garden Street, Cambridge, MA 02138 (United States); Shetty, Rahul [Zentrum fuer Astronomie der Universitaet Heidelberg, Institut fuer Theoretische Astrophysik, Albert-Ueberle-Str. 2, 69120 Heidelberg (Germany); Stutz, Amelia M.; Launhardt, Ralf [Max Planck Institut fuer Astronomie, Koenigstuhl 17, 69117 Heidelberg (Germany); Kauffmann, Jens [NASA JPL, 4800 Oak Grove Drive, Pasadena, CA 91109 (United States)

    2012-06-10

    We present a hierarchical Bayesian method for fitting infrared spectral energy distributions (SEDs) of dust emission to observed fluxes. Under the standard assumption of optically thin single temperature (T) sources, the dust SED as represented by a power-law-modified blackbody is subject to a strong degeneracy between T and the spectral index {beta}. The traditional non-hierarchical approaches, typically based on {chi}{sup 2} minimization, are severely limited by this degeneracy, as it produces an artificial anti-correlation between T and {beta} even with modest levels of observational noise. The hierarchical Bayesian method rigorously and self-consistently treats measurement uncertainties, including calibration and noise, resulting in more precise SED fits. As a result, the Bayesian fits do not produce any spurious anti-correlations between the SED parameters due to measurement uncertainty. We demonstrate that the Bayesian method is substantially more accurate than the {chi}{sup 2} fit in recovering the SED parameters, as well as the correlations between them. As an illustration, we apply our method to Herschel and submillimeter ground-based observations of the star-forming Bok globule CB244. This source is a small, nearby molecular cloud containing a single low-mass protostar and a starless core. We find that T and {beta} are weakly positively correlated-in contradiction with the {chi}{sup 2} fits, which indicate a T-{beta} anti-correlation from the same data set. Additionally, in comparison to the {chi}{sup 2} fits the Bayesian SED parameter estimates exhibit a reduced range in values.

  10. Discovering hierarchical structure in normal relational data

    DEFF Research Database (Denmark)

    Schmidt, Mikkel Nørgaard; Herlau, Tue; Mørup, Morten

    2014-01-01

    Hierarchical clustering is a widely used tool for structuring and visualizing complex data using similarity. Traditionally, hierarchical clustering is based on local heuristics that do not explicitly provide assessment of the statistical saliency of the extracted hierarchy. We propose a non-param...

  11. Techniques for Mapping Synthetic Aperture Radar Processing Algorithms to Multi-GPU Clusters

    Science.gov (United States)

    2012-12-01

    are suited for threaded (parallel) execution, by labeling them as kernels using syntax specified by the GPU programming language (e.g., CUDA for an...Techniques for Mapping Synthetic Aperture Radar Processing Algorithms to Multi- GPU Clusters Eric Hayden, Mark Schmalz, William Chapman, Sanjay...Abstract - This paper presents a design for parallel processing of synthetic aperture radar (SAR) data using multiple Graphics Processing Units ( GPUs ). Our

  12. Discovery of Overlapping and Hierarchical Communities Based on Extended Link Cluster Sequence%基于增广边簇序列的重叠层次社区发现

    Institute of Scientific and Technical Information of China (English)

    郭红; 黄佳鑫; 郭昆

    2015-01-01

    The mining and discovery of overlapping and hierarchical communities is a hot topic in the area of social network research. Firstly, an algorithm, discovery of link conmunities based on extended link cluster sequence ( DLC ECS) , is proposed to detect overlapping and hierarchical communities in social networks efficiently. Based on the extended link cluster sequence corresponding to community structures with various densities, the optimal link community is detected after searching for the global optimal density. The link communities are transformed into the node communities, and thus the overlapping communities can be found out. Then, hierarchical link communities extraction based on extended link cluster sequence ( HLCE ECS ) is designed. Hierarchical link communities from the extended link cluster sequence is found by the proposed algorithm. The link communities are transformed into the node communities to find out the overlapping and hierarchical communities. Experimental results on are artificial and real-world datasets demonstrate that DLC ECS algorithm significantly improves the community quality and HLCE ECS algorithm effectively discovers meaningful hierarchical communities.%高质量重叠层次社区的挖掘和发现已成为社会网络研究热点,为更有效地发现社会网络中具有重叠层次性的社区结构,提出基于增广边簇序列的边社区发现算法( DLC ECS)。在产生包含所有可能密度参数对应的社区结构的增广边簇序列的基础上,找出全局最优的密度参数,发现全局最优的边社区结构,将识别的边社区结构转化为节点社区结构,发现具有重叠结构的社区。在该序列的基础上,提出层次边社区提取算法( HLCE ECS),快速发现序列中的层次边社区结构,将识别的边社区结构转化为节点社区结构,发现同时具有重叠和层次结构的社区。在真实数据集和人工数据集上的实验表明,DLC ECS具有

  13. A Key Re-Distribution and Authentication Based Technique for Secured Communication in Clustered Wireless Sensor Networks with Node Mobility

    Directory of Open Access Journals (Sweden)

    Saswati Mukherjee

    2010-11-01

    Full Text Available Due to application of WSN in mission critical areas, secured message communication is veryimportant. We have attempted to present a methodology that ensures secured communicationamong nodes in a hierarchical Cluster Based WSN. Our scheme works when member sensornodes move from one Cluster Head (CH to another. The proposed scheme is based on Key Redistributionduring node mobility and development of an Authentication Model to checkwhether the new node in a cluster is an intruder. We have carried out extensive simulationexperiments, which demonstrate the efficacy of the proposed scheme. The experiments suggestthat the number of message transmission in creases linearly with the number of mobile nodesduring key-redistribution when a node moves from one CH to another. We have seen that thedetection efficiency of the Authentication Model is 0.9 to 1 when tunable threshold value is 0.02and sensor nodes are sufficiently mobile.

  14. Hierarchical clustering of genetic diversity associated to different levels of mutation and recombination in Escherichia coli: a study based on Mexican isolates.

    Science.gov (United States)

    González-González, Andrea; Sánchez-Reyes, Luna L; Delgado Sapien, Gabriela; Eguiarte, Luis E; Souza, Valeria

    2013-01-01

    Escherichia coli occur as either free-living microorganisms, or within the colons of mammals and birds as pathogenic or commensal bacteria. Although the Mexican population of intestinal E. coli maintains high levels of genetic diversity, the exact mechanisms by which this occurs remain unknown. We therefore investigated the role of homologous recombination and point mutation in the genetic diversification and population structure of Mexican strains of E. coli. This was explored using a multi locus sequence typing (MLST) approach in a non-outbreak related, host-wide sample of 128 isolates. Overall, genetic diversification in this sample appears to be driven primarily by homologous recombination, and to a lesser extent, by point mutation. Since genetic diversity is hierarchically organized according to the MLST genealogy, we observed that there is not a homogeneous recombination rate, but that different rates emerge at different clustering levels such as phylogenetic group, lineage and clonal complex (CC). Moreover, we detected clear signature of substructure among the A+B1 phylogenetic group, where the majority of isolates were differentiated into four discrete lineages. Substructure pattern is revealed by the presence of several CCs associated to a particular life style and host as well as to different genetic diversification mechanisms. We propose these findings as an alternative explanation for the maintenance of the clear phylogenetic signal of this species despite the prevalence of homologous recombination. Finally, we corroborate using both phylogenetic and genetic population approaches as an effective mean to establish epidemiological surveillance tailored to the ecological specificities of each geographic region.

  15. Interpolation centers' selection using hierarchical curvature-based clustering Selección de centros de interpolacion mediante agrupamiento jerárquico basado en curvatura

    Directory of Open Access Journals (Sweden)

    Juan C. Rodríguez

    2010-07-01

    Full Text Available Es ampliamente conocido que algunos campos relacionados con aplicaciones de gráficos realistas requieren modelos tridimensionales altamente detallados. Las tecnologías para esto están bien desarrolladas, sin embargo, en algunos casos los escáneres láser obtienen modelos complejos formados por millones de puntos, por lo que son computacionalmente intratables. En estos casos es conveniente obtener un conjunto reducido de estas muestras con las que reconstruir la superficie de la función. Obtener un enfoque de reducción adecuado que posea un equilibrio entre la pérdida de precisión de la función reconstruida, y el costo computacional es un problema no trivial. En este artículo presentamos un método jerárquico de aglomeración a través de la selección de centros mediante la geométrica, la distribución y la estimación de curvatura de las muestras en el espacio 3D.It is widely known that some fields related to graphic applications require realistic and full detailed three-dimensional models. Technologies for this kind of applications exist. However, in some cases, laser scanner get complex models composed of million of points, making its computationally difficult. In these cases, it is desirable to obtain a reduced set of these samples to reconstruct the function's surface. An appropriate reduction approach with a non-significant loss of accuracy in the reconstructed function with a good balance of computational load is usually a non-trivial problem. In this article, a hierarchical clustering based method by the selection of center using the geometric distribution and curvature estimation of the samples in the 3D space is described.

  16. Optical Cluster-Finding with An Adaptive Matched-Filter Technique: Algorithm and Comparison with Simulations

    CERN Document Server

    Dong, Feng; Gunn, James E; Wechsler, Risa H

    2007-01-01

    We present a modified adaptive matched filter algorithm designed to identify clusters of galaxies in wide-field imaging surveys such as the Sloan Digital Sky Survey. The cluster-finding technique is fully adaptive to imaging surveys with spectroscopic coverage, multicolor photometric redshifts, no redshift information at all, and any combination of these within one survey. It works with high efficiency in multi-band imaging surveys where photometric redshifts can be estimated with well-understood error distributions. Tests of the algorithm on realistic mock SDSS catalogs suggest that the detected sample is ~85% complete and over 90% pure for clusters with masses above 1.0*10^{14} h^{-1} M_solar and redshifts up to z=0.45. The errors of estimated cluster redshifts from maximum likelihood method are shown to be small (typically less that 0.01) over the whole redshift range with photometric redshift errors typical of those found in the Sloan survey. Inside the spherical radius corresponding to a galaxy overdensi...

  17. Study of atmospheric dynamics and pollution in the coastal area of English Channel using clustering technique

    Science.gov (United States)

    Sokolov, Anton; Dmitriev, Egor; Delbarre, Hervé; Augustin, Patrick; Gengembre, Cyril; Fourmenten, Marc

    2016-04-01

    The problem of atmospheric contamination by principal air pollutants was considered in the industrialized coastal region of English Channel in Dunkirk influenced by north European metropolitan areas. MESO-NH nested models were used for the simulation of the local atmospheric dynamics and the online calculation of Lagrangian backward trajectories with 15-minute temporal resolution and the horizontal resolution down to 500 m. The one-month mesoscale numerical simulation was coupled with local pollution measurements of volatile organic components, particulate matter, ozone, sulphur dioxide and nitrogen oxides. Principal atmospheric pathways were determined by clustering technique applied to backward trajectories simulated. Six clusters were obtained which describe local atmospheric dynamics, four winds blowing through the English Channel, one coming from the south, and the biggest cluster with small wind speeds. This last cluster includes mostly sea breeze events. The analysis of meteorological data and pollution measurements allows relating the principal atmospheric pathways with local air contamination events. It was shown that contamination events are mostly connected with a channelling of pollution from local sources and low-turbulent states of the local atmosphere.

  18. Cluster-cluster clustering

    Science.gov (United States)

    Barnes, J.; Dekel, A.; Efstathiou, G.; Frenk, C. S.

    1985-01-01

    The cluster correlation function xi sub c(r) is compared with the particle correlation function, xi(r) in cosmological N-body simulations with a wide range of initial conditions. The experiments include scale-free initial conditions, pancake models with a coherence length in the initial density field, and hybrid models. Three N-body techniques and two cluster-finding algorithms are used. In scale-free models with white noise initial conditions, xi sub c and xi are essentially identical. In scale-free models with more power on large scales, it is found that the amplitude of xi sub c increases with cluster richness; in this case the clusters give a biased estimate of the particle correlations. In the pancake and hybrid models (with n = 0 or 1), xi sub c is steeper than xi, but the cluster correlation length exceeds that of the points by less than a factor of 2, independent of cluster richness. Thus the high amplitude of xi sub c found in studies of rich clusters of galaxies is inconsistent with white noise and pancake models and may indicate a primordial fluctuation spectrum with substantial power on large scales.

  19. Cluster-cluster clustering

    Energy Technology Data Exchange (ETDEWEB)

    Barnes, J.; Dekel, A.; Efstathiou, G.; Frenk, C.S.

    1985-08-01

    The cluster correlation function xi sub c(r) is compared with the particle correlation function, xi(r) in cosmological N-body simulations with a wide range of initial conditions. The experiments include scale-free initial conditions, pancake models with a coherence length in the initial density field, and hybrid models. Three N-body techniques and two cluster-finding algorithms are used. In scale-free models with white noise initial conditions, xi sub c and xi are essentially identical. In scale-free models with more power on large scales, it is found that the amplitude of xi sub c increases with cluster richness; in this case the clusters give a biased estimate of the particle correlations. In the pancake and hybrid models (with n = 0 or 1), xi sub c is steeper than xi, but the cluster correlation length exceeds that of the points by less than a factor of 2, independent of cluster richness. Thus the high amplitude of xi sub c found in studies of rich clusters of galaxies is inconsistent with white noise and pancake models and may indicate a primordial fluctuation spectrum with substantial power on large scales. 30 references.

  20. Topology of the correlation networks among major currencies using hierarchical structure methods

    Science.gov (United States)

    Keskin, Mustafa; Deviren, Bayram; Kocakaplan, Yusuf

    2011-02-01

    We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currency and the TL was the minor currency. We derived a hierarchical organization and constructed minimal spanning trees (MSTs) and hierarchical trees (HTs) for the full years of 2007, 2008 and for the 2007-2008 period. We performed a technique to associate a value of reliability to the links of MSTs and HTs by using bootstrap replicas of data. We also used the average linkage cluster analysis for obtaining the hierarchical trees in the case of the TL as the numeraire. These trees are useful tools for understanding and detecting the global structure, taxonomy and hierarchy in financial data. We illustrated how the minimal spanning trees and their related hierarchical trees developed over a period of time. From these trees we identified different clusters of currencies according to their proximity and economic ties. The clustered structure of the currencies and the key currency in each cluster were obtained and we found that the clusters matched nicely with the geographical regions of corresponding countries in the world such as Asia or Europe. As expected the key currencies were generally those showing major economic activity.

  1. Facile synthesis of nano cauliflower and nano broccoli like hierarchical superhydrophobic composite coating using PVDF/carbon soot particles via gelation technique.

    Science.gov (United States)

    Sahoo, Bichitra Nanda; Balasubramanian, Kandasubramanian

    2014-12-15

    We have elucidated a cost effective fabrication technique to produce superhydrophobic polyvinylidene fluoride (PVDF/DMF/candle soot particle and PVDF/DMF/camphor soot particle composite) porous materials. The water repellent dry composite was formed by the interaction of non-solvent (methanol) into PVDF/carbon soot particles suspension in N,N-dimethylformamide (DMF). It is seen that longer quenching time effectively changes the surface morphology of dry composites. The nano broccoli like hierarchical microstructure with micro or nano scaled roughen surface was obtained for PVDF/DMF/camphor soot particle, which reveals water contact angle of 172° with roll off angle of 2°. However, composite coating of PVDF/DMF/candle soot particle shows nano cauliflower like hierarchical, which illustrates water contact angle of 169° with roll off angle of 3°. To elucidate the enhancement of water repellent property of PVDF composites, we further divulge the evolution mechanism of nano cauliflower and nano broccoli structure. In order to evaluate the water contact angle of PVDF composites, surface diffusion of water inside the pores is investigated. Furthermore, the addition of small amount of carbon soot particles in composite not only provides the crystallization of PVDF, but also leads to dramatical amendment of surface morphology which increases the surface texture and roughness for superhydrophobicity.

  2. Enhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Lamiaa F. Ibrahim

    2011-01-01

    Full Text Available Problem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN. The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques have been successfully deployed to solve many problems. The problems of the locations of MSAN, the cabling layout and the computation of optimum cable network layouts have been addressed in this study. The proposed algorithm, Clustering density-Based Spatial of Applications with Noise original, minimal Spanning tree and modified Ant-Colony-Based algorithm (CBSCAN-SPANT, used two clustering algorithms which are density-based and agglomerative clustering algorithm using distances which are shortest paths distance and satisfying the network constraints. This algorithm used wire and wireless technology to serve the subscribers demand and place the switches in a real optimal place. Approach: The density-based Spatial Clustering of Applications with Noise original (DBSCAN algorithm has been modified and a new algorithm (NetPlan algorithm has been proposed by the author in a recent work to solve the first step in the problem of network planning. In the present study, the NetPlan algorithm is modified by introduce the modified Ant-Colony-Based algorithm to find the optimal path between any node and the corresponding MSAN node in the first step of network planning process to determine nodes belonging to each cluster. The second step, in the process of network planning, is also introduced in the present study. For each cluster, the optimal cabling layout from each MSAN to the subscriber premises is determining by introduce the Prime algorithm which construct minimal spanning tree. Results: Experimental results and analysis indicate that the

  3. 一种层次结构中多维属性的可视化方法%Visualization Technique for Multi-Attrbute in Hierarchical Structure

    Institute of Scientific and Technical Information of China (English)

    陈谊; 甄远刚; 胡海云; 梁婕; Kwan-Liu MA

    2016-01-01

    在很多领域的统计分析中,通常需要分析既具有层次结构又具有多维属性的复杂数据,如食品安全数据、股票数据、网络安全数据等.针对现有多维数据和层次结构的可视化方法不能满足对同时具有层次和多维两种属性数据的可视分析要求,提出了一种树图中的多维坐标MCT(multi-coordinate in treemap)技术.该技术采用基于Squarified和Strip布局算法的树图表示层次结构,用树图中节点矩形的边作为属性轴,通过属性映射、属性点连接、曲线拟合实现层次结构中多维属性的可视化.将该技术应用于全国农药残留侦测数据,实现了对全国各地区、各超市、各农产品中农药残留检出和超标情况的可视化,为领域人员提供了有效的分析工具.MCT技术也可用于其他领域的层次多属性数据的可视化.%Nowadays, there is increasing need to analyze the complex data with both hierarchical and multi-attributes in many fields such as food safety, stock market, and network security. The visual analytics appeared in recent years provides a good solution to analyze this kind of data. So far, many visualization methods for multi-dimensional data and hierarchical data, the typical data objects in the fieldof information visualization, have been presented to solve data analyzing problems effectively. However, the existing solutions can't meet requirements of visual analysis for the complex data with both multi-dimensional and hierarchical attributes. This paper presents a technology named Multi-Coordinate in Treemap (MCT), which combines rectangle treemap and multi-dimensional coordinates techniques. MCT uses treemap created with Squarified and Strip layout algorithm to represent hierarchical structure, uses four edges of treemap's rectangular node as the attribute axis, and through mapping property values to attribute axis, connecting attribute points and fitting curve, to achieve visualization of multi

  4. A Survey On: Content Based Image Retrieval Systems Using Clustering Techniques For Large Data sets

    Directory of Open Access Journals (Sweden)

    Monika Jain

    2011-12-01

    Full Text Available Content-based image retrieval (CBIR is a new but widely adopted method for finding images from vastand unannotated image databases. As the network and development of multimedia technologies arebecoming more popular, users are not satisfied with the traditional information retrieval techniques. Sonowadays the content based image retrieval (CBIR are becoming a source of exact and fast retrieval. Inrecent years, a variety of techniques have been developed to improve the performance of CBIR. Dataclustering is an unsupervised method for extraction hidden pattern from huge data sets. With large datasets, there is possibility of high dimensionality. Having both accuracy and efficiency for high dimensionaldata sets with enormous number of samples is a challenging arena. In this paper the clustering techniquesare discussed and analysed. Also, we propose a method HDK that uses more than one clustering techniqueto improve the performance of CBIR.This method makes use of hierachical and divide and conquer KMeansclustering technique with equivalency and compatible relation concepts to improve the performanceof the K-Means for using in high dimensional datasets. It also introduced the feature like color, texture andshape for accurate and effective retrieval system.

  5. 结合降维技术的电力负荷曲线集成聚类算法%Ensemble Clustering Algorithm Combined With Dimension Reduction Techniques for Power Load Profiles

    Institute of Scientific and Technical Information of China (English)

    张斌; 庄池杰; 胡军; 陈水明; 张明明; 王科; 曾嵘

    2015-01-01

    电力负荷曲线聚类是配用电大数据挖掘的基础。分析3种典型聚类有效性指标,指出Davies-Bouldin有效性指标更适用于评估负荷曲线的聚类结果。研究基于层次、基于划分、基于密度、基于模型等类型的聚类算法,从聚类效率和聚类质量两方面评价各种算法。层次聚类的质量较高,效率较低;划分聚类的效率较高,质量较低。针对单一聚类算法的不足,研究基于经典聚类算法的集成聚类算法并将其应用于负荷曲线聚类。该算法包括bootstrap重采样、划分聚类、层次聚类3步,对不同规模数据集的聚类结果表明集成算法具有更好的性能,特别适用于大规模数据集聚类。针对电力负荷曲线的特征,研究多种数据集降维算法,在降维后的数据集上进行集成聚类,比较各种降维算法的信息损失和计算效率。研究结果表明,对于大规模电力负荷曲线的聚类问题,结合主成分分析降维的集成聚类算法可以取得最佳效果。%ABSTRACT:Load profiles clustering is a basic task for big data mining in electricity consumption database. This paper illustrated three typical validity indices and pointed out that Davies-Bouldin index is more suitable for assessing the clusters of load profiles. Hierarchical clustering, partitioning clustering, density-based clustering and model-based clustering were studied and the algorithms were evaluated from two aspects: efficiency and accuracy. The results prove that hierarchical clustering has high accuracy and low efficiency, while partitioning clustering has high efficiency and low accuracy. An ensemble algorithm was introduced and used for load profiles clustering, which was a combination of bootstrap sampling, partitioning clustering and hierarchical clustering. The ensemble clustering algorithm outperforms classical clustering algorithms on datasets of different scale and is especially suitable for

  6. 基于多空间多层次谱聚类的非监督SAR图像分割算法%Segmentation method for SAR images based on unsupervised spectral clustering of multi-hierarchical region

    Institute of Scientific and Technical Information of China (English)

    田玲; 邓旌波; 廖紫纤; 石博; 何楚

    2013-01-01

    提出了一种基于多层区域谱聚类的非监督SAR图像分割算法(multi-space and multi-hierarchical region based spectral clustering,MSMHSC).该算法首先在特征与几何空间求距离,快速获得初始过分割区域,然后在过分割区域的谱空间上进行聚类,最终实现非监督的SAR图像分割.该方法计算复杂度小,无须训练样本,使用层次化思想使其能更充分地利用SAR图像各类先验与似然信息.在MSTAR真实SAR数据集上的实验验证了该算法的快速性和有效性.%This paper proposed a method based on the hierarchical clustering concept.First,it over-segmented the source image into many small regions.And then,it conducted a spectral clustering algorithm on those regions.The algorithm was tested on the MSTAR SAR data set,and was proved to be fast and efficient.

  7. Comparative assessment of bone pose estimation using Point Cluster Technique and OpenSim.

    Science.gov (United States)

    Lathrop, Rebecca L; Chaudhari, Ajit M W; Siston, Robert A

    2011-11-01

    Estimating the position of the bones from optical motion capture data is a challenge associated with human movement analysis. Bone pose estimation techniques such as the Point Cluster Technique (PCT) and simulations of movement through software packages such as OpenSim are used to minimize soft tissue artifact and estimate skeletal position; however, using different methods for analysis may produce differing kinematic results which could lead to differences in clinical interpretation such as a misclassification of normal or pathological gait. This study evaluated the differences present in knee joint kinematics as a result of calculating joint angles using various techniques. We calculated knee joint kinematics from experimental gait data using the standard PCT, the least squares approach in OpenSim applied to experimental marker data, and the least squares approach in OpenSim applied to the results of the PCT algorithm. Maximum and resultant RMS differences in knee angles were calculated between all techniques. We observed differences in flexion/extension, varus/valgus, and internal/external rotation angles between all approaches. The largest differences were between the PCT results and all results calculated using OpenSim. The RMS differences averaged nearly 5° for flexion/extension angles with maximum differences exceeding 15°. Average RMS differences were relatively small (techniques appeared to be a constant offset between the PCT and all OpenSim results, which may be due to differences in the definition of anatomical reference frames, scaling of musculoskeletal models, and/or placement of virtual markers within OpenSim. Different methods for data analysis can produce largely different kinematic results, which could lead to the misclassification of normal or pathological gait. Improved techniques to allow non-uniform scaling of generic models to more accurately reflect subject-specific bone geometries and anatomical reference frames may reduce differences

  8. Hierarchical photocatalysts.

    Science.gov (United States)

    Li, Xin; Yu, Jiaguo; Jaroniec, Mietek

    2016-05-01

    As a green and sustainable technology, semiconductor-based heterogeneous photocatalysis has received much attention in the last few decades because it has potential to solve both energy and environmental problems. To achieve efficient photocatalysts, various hierarchical semiconductors have been designed and fabricated at the micro/nanometer scale in recent years. This review presents a critical appraisal of fabrication methods, growth mechanisms and applications of advanced hierarchical photocatalysts. Especially, the different synthesis strategies such as two-step templating, in situ template-sacrificial dissolution, self-templating method, in situ template-free assembly, chemically induced self-transformation and post-synthesis treatment are highlighted. Finally, some important applications including photocatalytic degradation of pollutants, photocatalytic H2 production and photocatalytic CO2 reduction are reviewed. A thorough assessment of the progress made in photocatalysis may open new opportunities in designing highly effective hierarchical photocatalysts for advanced applications ranging from thermal catalysis, separation and purification processes to solar cells.

  9. Secure Cluster Based Routing Using SAT/ILP Techniques and ECC EL-Gamal Threshold Cryptography in MANET

    Directory of Open Access Journals (Sweden)

    Mr. P. Kanagaraju. Me, (Ph. D

    2014-03-01

    Full Text Available The Elliptic curve cryptography ( ECC a promising and important because it requires less computing power, bandwidth, and also the memory when comparing to other cryptosystems The clustering algorithm using the Integer Linear Programming (ILP and Boolean Satisfiability (SAT solvers. These improvements will secure the application of SAT and ILP techniques in modeling composite engineering problem that is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs. The Clustering Problem in MANETs consists of selecting the most appropriate nodes of a given MANET topology as clusterheads, and ensuring that regular nodes are related to clusterheads such that the lifetime of the network is maximized. In which, discussing SAT/ILP techniques for clustering techniques and ECC El Gamal Threshold Cryptography for the security. Through our implementation, explored the possibility of using ECCEG-TC in MANETs.

  10. Assessment of Heart Disease using Fuzzy Classification Techniques

    Directory of Open Access Journals (Sweden)

    Horia F. Pop

    2001-01-01

    Full Text Available In this paper we discuss the classification results of cardiac patients of ischemical cardiopathy, valvular heart disease, and arterial hypertension, based on 19 characteristics (descriptors including ECHO data, effort testings, and age and weight. In this order we have used different fuzzy clustering algorithms, namely hierarchical fuzzy clustering, hierarchical and horizontal fuzzy characteristics clustering, and a new clustering technique, fuzzy hierarchical cross-classification. The characteristics clustering techniques produce fuzzy partitions of the characteristics involved and, thus, are useful tools for studying the similarities between different characteristics and for essential characteristics selection. The cross-classification algorithm produces not only a fuzzy partition of the cardiac patients analyzed, but also a fuzzy partition of their considered characteristics. In this way it is possible to identify which characteristics are responsible for the similarities or dissimilarities observed between different groups of patients.

  11. CLUSTERING BASED ADAPTIVE IMAGE COMPRESSION SCHEME USING PARTICLE SWARM OPTIMIZATION TECHNIQUE

    Directory of Open Access Journals (Sweden)

    M.Mohamed Ismail,

    2010-10-01

    Full Text Available This paper presents an image compression scheme with particle swarm optimization technique for clustering. The PSO technique is a powerful general purpose optimization technique that uses the concept of fitness.It provides a mechanism such that individuals in the swarm communicate and exchange information which is similar to the social behaviour of insects & human beings. Because of the mimicking the social sharing of information ,PSO directs particle to search the solution more efficiently.PSO is like a GA in that the population isinitialized with random potential solutions.The adjustment towards the best individual experience (PBEST and the best social experience (GBEST.Is conceptually similar to the cross over operaton of the GA.However it is unlike a GA in that each potential solution , called a particle is flying through the solution space with a velocity.Moreover the particles and the swarm have memory,which does not exist in the populatiom of GA.This optimization technique is used in Image compression and better results have obtained in terms of PSNR, CR and the visual quality of the image when compared to other existing methods.

  12. Hierarchical video summarization

    Science.gov (United States)

    Ratakonda, Krishna; Sezan, M. Ibrahim; Crinon, Regis J.

    1998-12-01

    We address the problem of key-frame summarization of vide in the absence of any a priori information about its content. This is a common problem that is encountered in home videos. We propose a hierarchical key-frame summarization algorithm where a coarse-to-fine key-frame summary is generated. A hierarchical key-frame summary facilitates multi-level browsing where the user can quickly discover the content of the video by accessing its coarsest but most compact summary and then view a desired segment of the video with increasingly more detail. At the finest level, the summary is generated on the basis of color features of video frames, using an extension of a recently proposed key-frame extraction algorithm. The finest level key-frames are recursively clustered using a novel pairwise K-means clustering approach with temporal consecutiveness constraint. We also address summarization of MPEG-2 compressed video without fully decoding the bitstream. We also propose efficient mechanisms that facilitate decoding the video when the hierarchical summary is utilized in browsing and playback of video segments starting at selected key-frames.

  13. Clustering technique-based least square support vector machine for EEG signal classification.

    Science.gov (United States)

    Siuly; Li, Yan; Wen, Peng Paul

    2011-12-01

    This paper presents a new approach called clustering technique-based least square support vector machine (CT-LS-SVM) for the classification of EEG signals. Decision making is performed in two stages. In the first stage, clustering technique (CT) has been used to extract representative features of EEG data. In the second stage, least square support vector machine (LS-SVM) is applied to the extracted features to classify two-class EEG signals. To demonstrate the effectiveness of the proposed method, several experiments have been conducted on three publicly available benchmark databases, one for epileptic EEG data, one for mental imagery tasks EEG data and another one for motor imagery EEG data. Our proposed approach achieves an average sensitivity, specificity and classification accuracy of 94.92%, 93.44% and 94.18%, respectively, for the epileptic EEG data; 83.98%, 84.37% and 84.17% respectively, for the motor imagery EEG data; and 64.61%, 58.77% and 61.69%, respectively, for the mental imagery tasks EEG data. The performance of the CT-LS-SVM algorithm is compared in terms of classification accuracy and execution (running) time with our previous study where simple random sampling with a least square support vector machine (SRS-LS-SVM) was employed for EEG signal classification. We also compare the proposed method with other existing methods in the literature for the three databases. The experimental results show that the proposed algorithm can produce a better classification rate than the previous reported methods and takes much less execution time compared to the SRS-LS-SVM technique. The research findings in this paper indicate that the proposed approach is very efficient for classification of two-class EEG signals.

  14. Parallel hierarchical radiosity rendering

    Energy Technology Data Exchange (ETDEWEB)

    Carter, M.

    1993-07-01

    In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.

  15. Globular Cluster Abundances from High-Resolution, Integrated-Light Spectroscopy. II. Expanding the Metallicity Range for Old Clusters and Updated Analysis Techniques

    CERN Document Server

    Colucci, J E; McWilliam, A

    2016-01-01

    We present abundances of globular clusters in the Milky Way and Fornax from integrated light spectra. Our goal is to evaluate the consistency of the integrated light analysis relative to standard abundance analysis for individual stars in those same clusters. This sample includes an updated analysis of 7 clusters from our previous publications and results for 5 new clusters that expand the metallicity range over which our technique has been tested. We find that the [Fe/H] measured from integrated light spectra agrees to $\\sim$0.1 dex for globular clusters with metallicities as high as [Fe/H]=$-0.3$, but the abundances measured for more metal rich clusters may be underestimated. In addition we systematically evaluate the accuracy of abundance ratios, [X/Fe], for Na I, Mg I, Al I, Si I, Ca I, Ti I, Ti II, Sc II, V I, Cr I, Mn I, Co I, Ni I, Cu I, Y II, Zr I, Ba II, La II, Nd II, and Eu II. The elements for which the integrated light analysis gives results that are most similar to analysis of individual stellar ...

  16. 水声传感器网络簇头分层通信模式路由算法%Routing Protocol of Hierarchical Cluster-Communication Model in the Underwater Acoustic Sensor Network

    Institute of Scientific and Technical Information of China (English)

    马绅惟; 刘广钟

    2014-01-01

    Routing protocol plays a very important role in underwater acoustic sensor networks. Based on the traditional TEEN protocol, a new routing protocol named HCM-TEEN(Hierarchical Cluster-communication Model on TEEN) has been put forward. The improved algorithm sets a new threshold function on the basis of the process of cluster candidate and the cluster elimination, and then introduces a Hierarchical Cluster-communication model in the period of data transmission to optimize the routing process. The experiment by the Matlab proved that HCM-TEEN performed better than the traditional algorithm on the network lifetime and the network average residual energy.%路由协议在水声传感器网络研究领域中扮演着非常重要的角色。基于传统的TEEN协议路由算法,提出了水声传感器网络中簇头分层通信模式的路由算法(HCM-TEEN)。新算法从簇头候选与淘汰过程入手,设置新的阈值函数。在簇头确定完成后,在数据传输阶段引入簇头分层通信模式,从距离和能量的角度上优化路由选择。通过Matlab仿真实验显示, HCM-TEEN算法与传统的算法相比在网络生命周期和节点平均剩余能量上都更具优越性。

  17. Formation of ordered CoAl alloy clusters by the plasma-gas condensation technique

    OpenAIRE

    Toyohiko J., Konno; Saeki, Yamamuro; Kenji, Sumiyama

    2001-01-01

    CoxAl1-x alloy clusters were synthesized from a mixture of Co and Al metal vapors generated by the sputtering of pure metal targets. We observed that the produced alloy clusters were uniform in size, ranging from approximately 20 nm for Al-rich clusters to 10 nm for Co-rich clusters. For a wide average composition range (x?0.4-0.7), the alloy clusters have the ordered B2 (CsCl-type) structure. In the Co-rich cluster aggregates (x=0.76), the clusters are composed of face-centered-cubic (fcc) C...

  18. Formation of ordered CoAl alloy clusters by the plasma-gas condensation technique

    OpenAIRE

    Toyohiko J., Konno; Saeki, Yamamuro; Kenji, Sumiyama

    2001-01-01

    CoxAl1-x alloy clusters were synthesized from a mixture of Co and Al metal vapors generated by the sputtering of pure metal targets. We observed that the produced alloy clusters were uniform in size, ranging from approximately 20 nm for Al-rich clusters to 10 nm for Co-rich clusters. For a wide average composition range (x?0.4-0.7), the alloy clusters have the ordered B2 (CsCl-type) structure. In the Co-rich cluster aggregates (x=0.76), the clusters are composed of face-centered-cubic (fcc) C...

  19. A systematic approach to vertically excited states of ethylene using configuration interaction and coupled cluster techniques

    Energy Technology Data Exchange (ETDEWEB)

    Feller, David, E-mail: dfeller@owt.com; Peterson, Kirk A. [Department of Chemistry, Washington State University, Pullman, Washington 99164-4630 (United States); Davidson, Ernest R. [Department of Chemistry, University of Washington, Seattle, Washington 98195-1700 (United States)

    2014-09-14

    A systematic sequence of configuration interaction and coupled cluster calculations were used to describe selected low-lying singlet and triplet vertically excited states of ethylene with the goal of approaching the all electron, full configuration interaction/complete basis set limit. Included among these is the notoriously difficult, mixed valence/Rydberg {sup 1}B{sub 1u} V state. Techniques included complete active space and iterative natural orbital configuration interaction with large reference spaces which led to variational spaces of 1.8 × 10{sup 9} parameters. Care was taken to avoid unintentionally biasing the results due to the widely recognized sensitivity of the V state to the details of the calculation. The lowest vertical and adiabatic ionization potentials to the {sup 2}B{sub 3u} and {sup 2}B{sub 3} states were also determined. In addition, the heat of formation of twisted ethylene {sup 3}A{sub 1} was obtained from large basis set coupled cluster theory calculations including corrections for core/valence, scalar relativistic and higher order correlation recovery.

  20. Analysis of acoustic cardiac signals for heart rate variability and murmur detection using nonnegative matrix factorization-based hierarchical decomposition

    DEFF Research Database (Denmark)

    Shah, Ghafoor; Koch, Peter; Papadias, Constantinos B.

    2014-01-01

    . A novel method based on hierarchical decomposition of the single channel mixture using various nonnegative matrix factorization techniques is proposed, which provides unsupervised clustering of the underlying component signals. HRV is determined over the recovered normal cardiac acoustic signals....... This novel decomposition technique is compared against the state-of-the-art techniques; experiments are performed using real-world clinical data, which show the potential significance of the proposed technique....

  1. GPU peer-to-peer techniques applied to a cluster interconnect

    CERN Document Server

    Ammendola, Roberto; Biagioni, Andrea; Bisson, Mauro; Fatica, Massimiliano; Frezza, Ottorino; Cicero, Francesca Lo; Lonardo, Alessandro; Mastrostefano, Enrico; Paolucci, Pier Stanislao; Rossetti, Davide; Simula, Francesco; Tosoratto, Laura; Vicini, Piero

    2013-01-01

    Modern GPUs support special protocols to exchange data directly across the PCI Express bus. While these protocols could be used to reduce GPU data transmission times, basically by avoiding staging to host memory, they require specific hardware features which are not available on current generation network adapters. In this paper we describe the architectural modifications required to implement peer-to-peer access to NVIDIA Fermi- and Kepler-class GPUs on an FPGA-based cluster interconnect. Besides, the current software implementation, which integrates this feature by minimally extending the RDMA programming model, is discussed, as well as some issues raised while employing it in a higher level API like MPI. Finally, the current limits of the technique are studied by analyzing the performance improvements on low-level benchmarks and on two GPU-accelerated applications, showing when and how they seem to benefit from the GPU peer-to-peer method.

  2. Hierarchical Cont-Bouchaud model

    CERN Document Server

    Paluch, Robert; Holyst, Janusz A

    2015-01-01

    We extend the well-known Cont-Bouchaud model to include a hierarchical topology of agent's interactions. The influence of hierarchy on system dynamics is investigated by two models. The first one is based on a multi-level, nested Erdos-Renyi random graph and individual decisions by agents according to Potts dynamics. This approach does not lead to a broad return distribution outside a parameter regime close to the original Cont-Bouchaud model. In the second model we introduce a limited hierarchical Erdos-Renyi graph, where merging of clusters at a level h+1 involves only clusters that have merged at the previous level h and we use the original Cont-Bouchaud agent dynamics on resulting clusters. The second model leads to a heavy-tail distribution of cluster sizes and relative price changes in a wide range of connection densities, not only close to the percolation threshold.

  3. Synthesis of New Dynamic Movement Primitives Through Search in a Hierarchical Database of Example Movements

    Directory of Open Access Journals (Sweden)

    Miha Deniša

    2015-10-01

    Full Text Available This paper presents a novel approach to discovering motor primitives in a hierarchical database of example trajectories. An initial set of example trajectories is obtained by human demonstration. The trajectories are clustered and organized in a binary tree-like hierarchical structure, from which transition graphs at different levels of granularity are constructed. A novel procedure for searching in this hierarchical structure is presented. It can exploit the interdependencies between movements and can discover new series of partial paths. From these partial paths, complete new movements are generated by encoding them as dynamic movement primitives. In this way, the number of example trajectories that must be acquired with the assistance of a human teacher can be reduced. By combining the results of the hierarchical search with statistical generalization techniques, a complete representation of new, not directly demonstrated, movement primitives can be generated.

  4. Non-Trivial Feature Derivation for Intensifying Feature Detection Using LIDAR Datasets Through Allometric Aggregation Data Analysis Applying Diffused Hierarchical Clustering for Discriminating Agricultural Land Cover in Portions of Northern Mindanao, Philippines

    Science.gov (United States)

    Villar, Ricardo G.; Pelayo, Jigg L.; Mozo, Ray Mari N.; Salig, James B., Jr.; Bantugan, Jojemar

    2016-06-01

    Leaning on the derived results conducted by Central Mindanao University Phil-LiDAR 2.B.11 Image Processing Component, the paper attempts to provides the application of the Light Detection and Ranging (LiDAR) derived products in arriving quality Landcover classification considering the theoretical approach of data analysis principles to minimize the common problems in image classification. These are misclassification of objects and the non-distinguishable interpretation of pixelated features that results to confusion of class objects due to their closely-related spectral resemblance, unbalance saturation of RGB information is a challenged at the same time. Only low density LiDAR point cloud data is exploited in the research denotes as 2 pts/m2 of accuracy which bring forth essential derived information such as textures and matrices (number of returns, intensity textures, nDSM, etc.) in the intention of pursuing the conditions for selection characteristic. A novel approach that takes gain of the idea of object-based image analysis and the principle of allometric relation of two or more observables which are aggregated for each acquisition of datasets for establishing a proportionality function for data-partioning. In separating two or more data sets in distinct regions in a feature space of distributions, non-trivial computations for fitting distribution were employed to formulate the ideal hyperplane. Achieving the distribution computations, allometric relations were evaluated and match with the necessary rotation, scaling and transformation techniques to find applicable border conditions. Thus, a customized hybrid feature was developed and embedded in every object class feature to be used as classifier with employed hierarchical clustering strategy for cross-examining and filtering features. This features are boost using machine learning algorithms as trainable sets of information for a more competent feature detection. The product classification in this

  5. Multi-granularity reconstruction of 3D calamity emergency situations based on visual scale space hierarchical clustering%基于VSSHC算法的灾害应急多粒度三维态势重构

    Institute of Scientific and Technical Information of China (English)

    于海心; 陈杰; 张娟

    2012-01-01

    针对现有灾害应急态势系统的三维地貌实时更新和态势多粒度显示的技术瓶颈,研究并设计了应急三维态势重构系统(3D-ESRS),该系统可进行实时三维地貌更新和多粒度显示态势内容.分析了3D-ESRS的需求和功能,设计了3D-ESRS的基于多智能体(MAS)的系统框架结构,研究了3D-ESRS系统更新地貌和多粒度显示原理与工作流程,构建了基于视觉尺度空间分层聚类(VSSHC)算法的多尺度分类模型.以堰塞湖为例,多粒度显示了水面升高过程,该实验结果表明3D-ESRS与传统基于GIS平台的态势系统相比,可以实时进行三维地貌场景更新,并对场景进行多粒度显示.%A calamity-oriented 3D emergency situation reconstruction system (3D-ESRS) was studied, and its architecture was designed using the multi-agent technique.Moreover, an approach to multi-granularity reconstruction of 3D calamity emergency situations based on the visual scale space hierarchical clustering ( VSSHC) algorithm was proposed for calamity emergency-decision supporting systems to make them realize the real-time presentation of dynamic 3D calamity situations.A simulation platform based on high level architecture (HLA) was established to verify this approach.The simulation results illustrate that this approach is applicable to emergency-decision supporting systems, and compared to the traditional situation display system this 3D-ESRS has the superiority in reconstructing real-time 3D scenario models.

  6. Clustering for data mining a data recovery approach

    CERN Document Server

    Mirkin, Boris

    2005-01-01

    Often considered more as an art than a science, the field of clustering has been dominated by learning through examples and by techniques chosen almost through trial-and-error. Even the most popular clustering methods--K-Means for partitioning the data set and Ward's method for hierarchical clustering--have lacked the theoretical attention that would establish a firm relationship between the two methods and relevant interpretation aids.Rather than the traditional set of ad hoc techniques, Clustering for Data Mining: A Data Recovery Approach presents a theory that not only closes gaps in K-Mean

  7. Modeling hierarchical structures - Hierarchical Linear Modeling using MPlus

    CERN Document Server

    Jelonek, M

    2006-01-01

    The aim of this paper is to present the technique (and its linkage with physics) of overcoming problems connected to modeling social structures, which are typically hierarchical. Hierarchical Linear Models provide a conceptual and statistical mechanism for drawing conclusions regarding the influence of phenomena at different levels of analysis. In the social sciences it is used to analyze many problems such as educational, organizational or market dilemma. This paper introduces the logic of modeling hierarchical linear equations and estimation based on MPlus software. I present my own model to illustrate the impact of different factors on school acceptation level.

  8. Cluster analysis technique for assessing variability in cowpea (Vigna unguiculata L. Walp accessions from Nigeria

    Directory of Open Access Journals (Sweden)

    Ajayi Abiola Toyin

    2013-01-01

    Full Text Available The genetic variability among 10 accessions of cowpea, Vigna unguiculata (L. Walp was studied by the use of 13 qualitative and 13 quantitative traits. From the results on qualitative traits, dendrogram grouped the 10 accessions into two major clusters, 1 and 2.Cluster 1 had 3 accessions and cluster 2 had 2 sub-clusters (I and II, having 2 accessions in sub-cluster I and 5 accessions in sub-cluster II. The dendrogram revealed two major clusters, 1 and 2, for quantitative data, for the 10 accessions. At distance of 4 and 6, cluster 1 had two sub-clusters (I and II, with sub-cluster I having 5 accessions, sub-cluster II having 4 accessions while cluster 2 had only 1 accession. This study made the observation that identification of the right agro-morphological traits of high discriminating capacity is essential, before embarking on any genetic diversity; as it was revealed that some traits discriminated more efficiently among the accessions than others. A group of accessions, which are NGSA1, NGSA2, NGSA3, NGSA4, NGSA7, NGSA9 and NGSA10, was identified as being different from the others for number of seeds per pod, pod length, plant height, peduncle length, seed weight and number of pods per plant. These accessions may be good for cowpea improvement programs.

  9. Formation of ordered CoAl alloy clusters by the plasma-gas condensation technique

    Science.gov (United States)

    Konno, Toyohiko J.; Yamamuro, Saeki; Sumiyama, Kenji

    2001-09-01

    CoxAl1-x alloy clusters were synthesized from a mixture of Co and Al metal vapors generated by the sputtering of pure metal targets. We observed that the produced alloy clusters were uniform in size, ranging from approximately 20 nm for Al-rich clusters to 10 nm for Co-rich clusters. For a wide average composition range (x≈0.4-0.7), the alloy clusters have the ordered B2 (CsCl-type) structure. In the Co-rich cluster aggregates (x=0.76), the clusters are composed of face-centered-cubic (fcc) Co and minor CoAl(B2) clusters. In the Al-rich aggregates (x=0.23), the clusters are mainly composed of the fcc-Al phase, although clusters occasionally possess a "core-shell structure" with the CoAl(B2) phase surrounded by an Al-rich amorphous phase. These observations are in general agreement with our prediction based on the equilibrium phase diagram. We also noticed that the average composition depends not only on the relative amount of Co and Al vapors, but also on their absolute amount, and even on the Ar gas flow rate, which promotes mixing and cooling the two vapors. These findings show that the formation of alloy clusters in vapor phase is strongly influenced by the kinetics of cluster formation, and is a competing process between the approach to equilibrium and the quenching of the whole system.

  10. Electric field measurements on Cluster: comparing the double-probe and electron drift techniques

    Directory of Open Access Journals (Sweden)

    A. I. Eriksson

    2006-03-01

    Full Text Available The four Cluster satellites each carry two instruments designed for measuring the electric field: a double-probe instrument (EFW and an electron drift instrument (EDI. We compare data from the two instruments in a representative sample of plasma regions. The complementary merits and weaknesses of the two techniques are illustrated. EDI operations are confined to regions of magnetic fields above 30 nT and where wave activity and keV electron fluxes are not too high, while EFW can provide data everywhere, and can go far higher in sampling frequency than EDI. On the other hand, the EDI technique is immune to variations in the low energy plasma, while EFW sometimes detects significant nongeophysical electric fields, particularly in regions with drifting plasma, with ion energy (in eV below the spacecraft potential (in volts. We show that the polar cap is a particularly intricate region for the double-probe technique, where large nongeophysical fields regularly contaminate EFW measurments of the DC electric field. We present a model explaining this in terms of enhanced cold plasma wake effects appearing when the ion flow energy is higher than the thermal energy but below the spacecraft potential multiplied by the ion charge. We suggest that these conditions, which are typical of the polar wind and occur sporadically in other regions containing a significant low energy ion population, cause a large cold plasma wake behind the spacecraft, resulting in spurious electric fields in EFW data. This interpretation is supported by an analysis of the direction of the spurious electric field, and by showing that use of active potential control alleviates the situation.

  11. DCT-Yager FNN: a novel Yager-based fuzzy neural network with the discrete clustering technique.

    Science.gov (United States)

    Singh, A; Quek, C; Cho, S Y

    2008-04-01

    Earlier clustering techniques such as the modified learning vector quantization (MLVQ) and the fuzzy Kohonen partitioning (FKP) techniques have focused on the derivation of a certain set of parameters so as to define the fuzzy sets in terms of an algebraic function. The fuzzy membership functions thus generated are uniform, normal, and convex. Since any irregular training data is clustered into uniform fuzzy sets (Gaussian, triangular, or trapezoidal), the clustering may not be exact and some amount of information may be lost. In this paper, two clustering techniques using a Kohonen-like self-organizing neural network architecture, namely, the unsupervised discrete clustering technique (UDCT) and the supervised discrete clustering technique (SDCT), are proposed. The UDCT and SDCT algorithms reduce this data loss by introducing nonuniform, normal fuzzy sets that are not necessarily convex. The training data range is divided into discrete points at equal intervals, and the membership value corresponding to each discrete point is generated. Hence, the fuzzy sets obtained contain pairs of values, each pair corresponding to a discrete point and its membership grade. Thus, it can be argued that fuzzy membership functions generated using this kind of a discrete methodology provide a more accurate representation of the actual input data. This fact has been demonstrated by comparing the membership functions generated by the UDCT and SDCT algorithms against those generated by the MLVQ, FKP, and pseudofuzzy Kohonen partitioning (PFKP) algorithms. In addition to these clustering techniques, a novel pattern classifying network called the Yager fuzzy neural network (FNN) is proposed in this paper. This network corresponds completely to the Yager inference rule and exhibits remarkable generalization abilities. A modified version of the pseudo-outer product (POP)-Yager FNN called the modified Yager FNN is introduced that eliminates the drawbacks of the earlier network and yi- elds

  12. Modeling hierarchical structures - Hierarchical Linear Modeling using MPlus

    OpenAIRE

    Jelonek, Magdalena

    2006-01-01

    The aim of this paper is to present the technique (and its linkage with physics) of overcoming problems connected to modeling social structures, which are typically hierarchical. Hierarchical Linear Models provide a conceptual and statistical mechanism for drawing conclusions regarding the influence of phenomena at different levels of analysis. In the social sciences it is used to analyze many problems such as educational, organizational or market dilemma. This paper introduces the logic of m...

  13. 1 Hierarchical Approaches to the Analysis of Genetic Diversity in ...

    African Journals Online (AJOL)

    2015-04-14

    Apr 14, 2015 ... Keywords: Genetic diversity, Hierarchical approach, Plant, Clustering,. Descriptive ... utilization) or by clustering (based on a phonetic analysis of individual ...... Improvement of Food Crop Preservatives for the next Millennium.

  14. 基于改进层次聚类的同家族变压器状态变化规律分析%Condition evolution regularity analysis of power transformer in the same family based on improved hierarchical clustering

    Institute of Scientific and Technical Information of China (English)

    李新叶; 李新芳

    2011-01-01

    Family quality default history affects the healthy condition of power transformer greatly in integrated condition assessment. And now, it is usually subjectively decided by expert's experience. A new quantitatively computing method is proposed, that is, using hierarchical clustering technology to analyze the potential evolution regularity and then computing the influence degree of family quality default history on healthy condition of power transformer. To make the clustering result more accurate, line slope distance of condition evolution is proposed as line shape similarity criterion, both data distance criterion and line slope distance criterion are used to cluster data. The experimental result shows that our method is better than traditional hierarchical clustering method, and it is more reasonable to use clustering analysis to calculate the influence degree of family quality default history on power transformer healthy condition.%在变压器状态综合评估的研究中,家族质量缺陷史对变压器健康状态有重要影响,目前多是凭专家经验主观确定.提出利用层次聚类分析技术对同家族变压器状态变化规律进行分析,根据分析结果定量计算家族质量缺陷史对变压器健康状态的影响程度.为提高聚类的准确性,提出用变压器状态变化曲线的斜率距离作为曲线形状的相似性判据,同时用曲线间点数值距离和斜率距离构成交集约束判据进行聚类.实例分析表明改进的层次聚类算法优于传统的层次聚类算法,由聚类分析结果计算家族质量缺陷史对变压器健康状态的影响得出的结果更合理.

  15. Globular Cluster Abundances from High-resolution, Integrated-light Spectroscopy. II. Expanding the Metallicity Range for Old Clusters and Updated Analysis Techniques

    Science.gov (United States)

    Colucci, Janet E.; Bernstein, Rebecca A.; McWilliam, Andrew

    2017-01-01

    We present abundances of globular clusters (GCs) in the Milky Way and Fornax from integrated-light (IL) spectra. Our goal is to evaluate the consistency of the IL analysis relative to standard abundance analysis for individual stars in those same clusters. This sample includes an updated analysis of seven clusters from our previous publications and results for five new clusters that expand the metallicity range over which our technique has been tested. We find that the [Fe/H] measured from IL spectra agrees to ∼0.1 dex for GCs with metallicities as high as [Fe/H] = ‑0.3, but the abundances measured for more metal-rich clusters may be underestimated. In addition we systematically evaluate the accuracy of abundance ratios, [X/Fe], for Na i, Mg i, Al i, Si i, Ca i, Ti i, Ti ii, Sc ii, V i, Cr i, Mn i, Co i, Ni i, Cu i, Y ii, Zr i, Ba ii, La ii, Nd ii, and Eu ii. The elements for which the IL analysis gives results that are most similar to analysis of individual stellar spectra are Fe i, Ca i, Si i, Ni i, and Ba ii. The elements that show the greatest differences include Mg i and Zr i. Some elements show good agreement only over a limited range in metallicity. More stellar abundance data in these clusters would enable more complete evaluation of the IL results for other important elements. This paper includes data gathered with the 6.5 m Magellan Telescopes located at Las Campanas Observatory, Chile.

  16. Growth of CdTe on Si(100) surface by ionized cluster beam technique: Experimental and molecular dynamics simulation

    Science.gov (United States)

    Araghi, Houshang; Zabihi, Zabiholah; Nayebi, Payman; Ehsani, Mohammad Mahdi

    2016-10-01

    II-VI semiconductor CdTe was grown on the Si(100) substrate surface by the ionized cluster beam (ICB) technique. In the ICB method, when vapors of solid materials such as CdTe were ejected through a nozzle of a heated crucible into a vacuum region, nanoclusters were created by an adiabatic expansion phenomenon. The clusters thus obtained were partially ionized by electron bombardment and then accelerated onto the silicon substrate at 473 K by high potentials. The cluster size was determined using a retarding field energy analyzer. The results of X-ray diffraction measurements indicate the cubic zinc blende (ZB) crystalline structure of the CdTe thin film on the silicon substrate. The CdTe thin film prepared by the ICB method had high crystalline quality. The microscopic processes involved in the ICB deposition technique, such as impact and coalescence processes, have been studied in detail by molecular dynamics (MD) simulation.

  17. Delineation of Stenotrophomonas maltophilia isolates from cystic fibrosis patients by fatty acid methyl ester profiles and matrix-assisted laser desorption/ionization time-of-flight mass spectra using hierarchical cluster analysis and principal component analysis.

    Science.gov (United States)

    Vidigal, Pedrina Gonçalves; Mosel, Frank; Koehling, Hedda Luise; Mueller, Karl Dieter; Buer, Jan; Rath, Peter Michael; Steinmann, Joerg

    2014-12-01

    Stenotrophomonas maltophilia is an opportunist multidrug-resistant pathogen that causes a wide range of nosocomial infections. Various cystic fibrosis (CF) centres have reported an increasing prevalence of S. maltophilia colonization/infection among patients with this disease. The purpose of this study was to assess specific fingerprints of S. maltophilia isolates from CF patients (n = 71) by investigating fatty acid methyl esters (FAMEs) through gas chromatography (GC) and highly abundant proteins by matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS), and to compare them with isolates obtained from intensive care unit (ICU) patients (n = 20) and the environment (n = 11). Principal component analysis (PCA) of GC-FAME patterns did not reveal a clustering corresponding to distinct CF, ICU or environmental types. Based on the peak area index, it was observed that S. maltophilia isolates from CF patients produced significantly higher amounts of fatty acids in comparison with ICU patients and the environmental isolates. Hierarchical cluster analysis (HCA) based on the MALDI-TOF MS peak profiles of S. maltophilia revealed the presence of five large clusters, suggesting a high phenotypic diversity. Although HCA of MALDI-TOF mass spectra did not result in distinct clusters predominantly composed of CF isolates, PCA revealed the presence of a distinct cluster composed of S. maltophilia isolates from CF patients. Our data suggest that S. maltophilia colonizing CF patients tend to modify not only their fatty acid patterns but also their protein patterns as a response to adaptation in the unfavourable environment of the CF lung. © 2014 The Authors.

  18. Colour image segmentation using unsupervised clustering technique for acute leukemia images

    Science.gov (United States)

    Halim, N. H. Abd; Mashor, M. Y.; Nasir, A. S. Abdul; Mustafa, N.; Hassan, R.

    2015-05-01

    Colour image segmentation has becoming more popular for computer vision due to its important process in most medical analysis tasks. This paper proposes comparison between different colour components of RGB(red, green, blue) and HSI (hue, saturation, intensity) colour models that will be used in order to segment the acute leukemia images. First, partial contrast stretching is applied on leukemia images to increase the visual aspect of the blast cells. Then, an unsupervised moving k-means clustering algorithm is applied on the various colour components of RGB and HSI colour models for the purpose of segmentation of blast cells from the red blood cells and background regions in leukemia image. Different colour components of RGB and HSI colour models have been analyzed in order to identify the colour component that can give the good segmentation performance. The segmented images are then processed using median filter and region growing technique to reduce noise and smooth the images. The results show that segmentation using saturation component of HSI colour model has proven to be the best in segmenting nucleus of the blast cells in acute leukemia image as compared to the other colour components of RGB and HSI colour models.

  19. Fuzzy Time Series Forecasting Model Based on Automatic Clustering Techniques and Generalized Fuzzy Logical Relationship

    Directory of Open Access Journals (Sweden)

    Wangren Qiu

    2015-01-01

    Full Text Available In view of techniques for constructing high-order fuzzy time series models, there are three types which are based on advanced algorithms, computational method, and grouping the fuzzy logical relationships. The last type of models is easy to be understood by the decision maker who does not know anything about fuzzy set theory or advanced algorithms. To deal with forecasting problems, this paper presented novel high-order fuzz time series models denoted as GTS (M, N based on generalized fuzzy logical relationships and automatic clustering. This paper issued the concept of generalized fuzzy logical relationship and an operation for combining the generalized relationships. Then, the procedure of the proposed model was implemented on forecasting enrollment data at the University of Alabama. To show the considerable outperforming results, the proposed approach was also applied to forecasting the Shanghai Stock Exchange Composite Index. Finally, the effects of parameters M and N, the number of order, and concerned principal fuzzy logical relationships, on the forecasting results were also discussed.

  20. A Meliorate Routing of Reactive Protocol with Clustering Technique in MANET

    Directory of Open Access Journals (Sweden)

    Zainab Khandsakarwala,

    2014-05-01

    Full Text Available The field of Mobile Adhoc Network (MANET has become very popular because of the deep research done in that area in last few years. MANET has advantage of operating without fixed infrastructure and also it can tolerate many changes in the network topology. The MANET uses different routing protocols for End to End Packet delivery. This paper is subjected to the Reactive routing protocols on the basis of identical environment conditions and evaluates their relative performance with respect to the performance metric Packet delivery ratio, overhead & throughput. In this Reactive routing protocols can spectacularly reduce routing overhead because they do not need to search for and maintain the routes on which there is no data traffic. This property is very invoking in the limited resource. Achieve a good efficient network life and reliability need a variation on the notion of multicasting. Geo-casting is useful for sending messages to nodes in a specified geographical region. This region is called the geo-cast region. For geo-casting in mobile ad hoc networks. The proposed protocol combines any casting with local flooding to implement geo-casting. Thus, Protocol requires two phases for geo-casting. First, it performs any casting from a source to any node in the geo-cast region. Also this Protocol works on large MANET, and to achieve high accuracy and optimize output. To perform geo-cast region we use a proposed clustering technique in Large MANET.

  1. Hierarchical Cluster Analysis of Three-Dimensional Reconstructions of Unbiased Sampled Microglia Shows not Continuous Morphological Changes from Stage 1 to 2 after Multiple Dengue Infections in Callithrix penicillata

    Science.gov (United States)

    Diniz, Daniel G.; Silva, Geane O.; Naves, Thaís B.; Fernandes, Taiany N.; Araújo, Sanderson C.; Diniz, José A. P.; de Farias, Luis H. S.; Sosthenes, Marcia C. K.; Diniz, Cristovam G.; Anthony, Daniel C.; da Costa Vasconcelos, Pedro F.; Picanço Diniz, Cristovam W.

    2016-01-01

    It is known that microglial morphology and function are related, but few studies have explored the subtleties of microglial morphological changes in response to specific pathogens. In the present report we quantitated microglia morphological changes in a monkey model of dengue disease with virus CNS invasion. To mimic multiple infections that usually occur in endemic areas, where higher dengue infection incidence and abundant mosquito vectors carrying different serotypes coexist, subjects received once a week subcutaneous injections of DENV3 (genotype III)-infected culture supernatant followed 24 h later by an injection of anti-DENV2 antibody. Control animals received either weekly anti-DENV2 antibodies, or no injections. Brain sections were immunolabeled for DENV3 antigens and IBA-1. Random and systematic microglial samples were taken from the polymorphic layer of dentate gyrus for 3-D reconstructions, where we found intense immunostaining for TNFα and DENV3 virus antigens. We submitted all bi- or multimodal morphological parameters of microglia to hierarchical cluster analysis and found two major morphological phenotypes designated types I and II. Compared to type I (stage 1), type II microglia were more complex; displaying higher number of nodes, processes and trees and larger surface area and volumes (stage 2). Type II microglia were found only in infected monkeys, whereas type I microglia was found in both control and infected subjects. Hierarchical cluster analysis of morphological parameters of 3-D reconstructions of random and systematic selected samples in control and ADE dengue infected monkeys suggests that microglia morphological changes from stage 1 to stage 2 may not be continuous. PMID:27047345

  2. Selections of data preprocessing methods and similarity metrics for gene cluster analysis

    Institute of Scientific and Technical Information of China (English)

    YANG Chunmei; WAN Baikun; GAO Xiaofeng

    2006-01-01

    Clustering is one of the major exploratory techniques for gene expression data analysis. Only with suitable similarity metrics and when datasets are properly preprocessed, can results of high quality be obtained in cluster analysis. In this study, gene expression datasets with external evaluation criteria were preprocessed as normalization by line, normalization by column or logarithm transformation by base-2, and were subsequently clustered by hierarchical clustering, k-means clustering and self-organizing maps (SOMs) with Pearson correlation coefficient or Euclidean distance as similarity metric. Finally, the quality of clusters was evaluated by adjusted Rand index. The results illustrate that k-means clustering and SOMs have distinct advantages over hierarchical clustering in gene clustering, and SOMs are a bit better than k-means when randomly initialized. It also shows that hierarchical clustering prefers Pearson correlation coefficient as similarity metric and dataset normalized by line. Meanwhile, k-means clustering and SOMs can produce better clusters with Euclidean distance and logarithm transformed datasets. These results will afford valuable reference to the implementation of gene expression cluster analysis.

  3. Hierarchical radial basis function networks and local polynomial un-warping for X-ray image intensifier distortion correction: a comparison with global techniques.

    Science.gov (United States)

    Cerveri, P; Forlani, C; Pedotti, A; Ferrigno, G

    2003-03-01

    Global polynomial (GP) methods have been widely used to correct geometric image distortion of small-size (up to 30 cm) X-ray image intensifiers (XRIIs). This work confirms that this kind of approach is suitable for 40 cm XRIIs (now increasingly used). Nonetheless, two local methods, namely 3rd-order local un-warping polynomials (LUPs) and hierarchical radial basis function (HRBF) networks are proposed as alternative solutions. Extensive experimental tests were carried out to compare these methods with classical low-order local polynomial and GP techniques, in terms of residual error (RMSE) measured at points not used for parameter estimation. Simulations showed that the LUP and HRBF methods had accuracies comparable with that attained using GP methods. In detail, the LUP method (0.353 microm) performed worse than HRBF (0.348 microm) only for small grid spacing (15 x 15 control points); the accuracy of both HRBF (0.157 microm) and LUP (0.160 microm) methods was little affected by local distortions (30 x 30 control points); weak local distortions made the GP method poorer (0.320 microm). Tests on real data showed that LUP and HRBF had accuracies comparable with that of GP for both 30 cm (GP: 0.238 microm; LUP: 0.240 microm; HRBF: 0.238 microm) and 40 cm (GP: 0.164 microm; LUP: 0.164 microm; HRBF: 0.164 microm) XRIIs. The LUP-based distortion correction was implemented in real time for image correction in digital tomography applications.

  4. New techniques for the analysis of fine-scaled clustering phenomena within atom probe tomography (APT) data.

    Science.gov (United States)

    Stephenson, Leigh T; Moody, Michael P; Liddicoat, Peter V; Ringer, Simon P

    2007-12-01

    Nanoscale atomic clusters in atom probe tomographic data are not universally defined but instead are characterized by the clustering algorithm used and the parameter values controlling the algorithmic process. A new core-linkage clustering algorithm is developed, combining fundamental elements of the conventional maximum separation method with density-based analyses. A key improvement to the algorithm is the independence of algorithmic parameters inherently unified in previous techniques, enabling a more accurate analysis to be applied across a wider range of material systems. Further, an objective procedure for the selection of parameters based on approximating the data with a model of complete spatial randomness is developed and applied. The use of higher nearest neighbor distributions is highlighted to give insight into the nature of the clustering phenomena present in a system and to generalize the clustering algorithms used to analyze it. Maximum separation, density-based scanning, and the core linkage algorithm, developed within this study, were separately applied to the investigation of fine solute clustering of solute atoms in an Al-1.9Zn-1.7Mg (at.%) at two distinct states of early phase decomposition and the results of these analyses were evaluated.

  5. A Hierarchical Clustering Method Based on the Threshold of Semantic Feature in Big Data%大数据中一种基于语义特征阈值的层次聚类方法

    Institute of Scientific and Technical Information of China (English)

    罗恩韬; 王国军

    2015-01-01

    云计算、健康医疗、街景地图服务、推荐系统等新兴服务促使数据的种类和规模以前所未有的速度增长,数据量的激增会导致很多共性问题.例如数据的可表示,可处理和可靠性问题.如何有效处理和分析数据之间的关系,提高数据的划分效率,建立数据的聚类分析模型,已经成为学术界和企业界共同亟待解决的问题.该文提出一种基于语义特征的层次聚类方法,首先根据数据的语义特征进行训练,然后在每个子集上利用训练结果进行层次聚类,最终产生整体数据的密度中心点,提高了数据聚类效率和准确性.此方法采样复杂度低,数据分析准确,易于实现,具有良好的判定性.%The type and scale of data has been promoted with a hitherto unknown speed by the emerging services including cloud computing, health care, street view services recommendation system and so on. However, the surge in the volume of data may lead to many common problems, such as the representability, reliability and handlability of data. Therefore, how to effectively handle the relationship between the data and the analysis to improve the efficiency of classification of the data and establish the data clustering analysis model has become an academic and business problem, which needs to be solved urgently. A hierarchical clustering method based on semantic feature is proposed. Firstly, the data should be trained according to the semantic features of data, and then is used the training result to process hierarchical clustering in each subset; finally, the density center point is produced. This method can improve the efficiency and accuracy of data clustering. This algorithm is of low complexity about sampling, high accuracy of data analysis and good judgment. Furthermore, the algorithm is easy to realize.

  6. Functional annotation of hierarchical modularity.

    Directory of Open Access Journals (Sweden)

    Kanchana Padmanabhan

    Full Text Available In biological networks of molecular interactions in a cell, network motifs that are biologically relevant are also functionally coherent, or form functional modules. These functionally coherent modules combine in a hierarchical manner into larger, less cohesive subsystems, thus revealing one of the essential design principles of system-level cellular organization and function-hierarchical modularity. Arguably, hierarchical modularity has not been explicitly taken into consideration by most, if not all, functional annotation systems. As a result, the existing methods would often fail to assign a statistically significant functional coherence score to biologically relevant molecular machines. We developed a methodology for hierarchical functional annotation. Given the hierarchical taxonomy of functional concepts (e.g., Gene Ontology and the association of individual genes or proteins with these concepts (e.g., GO terms, our method will assign a Hierarchical Modularity Score (HMS to each node in the hierarchy of functional modules; the HMS score and its p-value measure functional coherence of each module in the hierarchy. While existing methods annotate each module with a set of "enriched" functional terms in a bag of genes, our complementary method provides the hierarchical functional annotation of the modules and their hierarchically organized components. A hierarchical organization of functional modules often comes as a bi-product of cluster analysis of gene expression data or protein interaction data. Otherwise, our method will automatically build such a hierarchy by directly incorporating the functional taxonomy information into the hierarchy search process and by allowing multi-functional genes to be part of more than one component in the hierarchy. In addition, its underlying HMS scoring metric ensures that functional specificity of the terms across different levels of the hierarchical taxonomy is properly treated. We have evaluated our

  7. 一种基于分层结构的Ad Hoc网络分簇路由协议研究%Research based on the hierarchical structure of the Ad Hoc network clustering routing protocol

    Institute of Scientific and Technical Information of China (English)

    冯永亮

    2015-01-01

    The traditional Ad Hoc network clustering routing protocol has low packet delivery ratio problem, this paper proposes a clustering routing protocol based on hierarchical structure. The advanced network layer using AODV routing protocol based backup, and the lower network layer adopts a smaller delay DSDV protocol. The simulation results show that the improved routing protocol improves the packet delivery rate, Shortening the end to end delay.%传统Ad Hoc网络分簇路由协议存在分组投递率低的问题,论文提出一种基于分层结构的分簇路由协议.高级网络层采用基于备份路由的AODV协议,而低级网络层则采用时延较小的DSDV协议.仿真结果显示,改进后的路由协议提高了分组投递率,缩短了端到端时延.

  8. Hierarchically Structured Electrospun Fibers

    Directory of Open Access Journals (Sweden)

    Nicole E. Zander

    2013-01-01

    Full Text Available Traditional electrospun nanofibers have a myriad of applications ranging from scaffolds for tissue engineering to components of biosensors and energy harvesting devices. The generally smooth one-dimensional structure of the fibers has stood as a limitation to several interesting novel applications. Control of fiber diameter, porosity and collector geometry will be briefly discussed, as will more traditional methods for controlling fiber morphology and fiber mat architecture. The remainder of the review will focus on new techniques to prepare hierarchically structured fibers. Fibers with hierarchical primary structures—including helical, buckled, and beads-on-a-string fibers, as well as fibers with secondary structures, such as nanopores, nanopillars, nanorods, and internally structured fibers and their applications—will be discussed. These new materials with helical/buckled morphology are expected to possess unique optical and mechanical properties with possible applications for negative refractive index materials, highly stretchable/high-tensile-strength materials, and components in microelectromechanical devices. Core-shell type fibers enable a much wider variety of materials to be electrospun and are expected to be widely applied in the sensing, drug delivery/controlled release fields, and in the encapsulation of live cells for biological applications. Materials with a hierarchical secondary structure are expected to provide new superhydrophobic and self-cleaning materials.

  9. A Cluster based Technique for Securing Routing Protocol AODV against Black-hole Attack in MANET

    Directory of Open Access Journals (Sweden)

    Sonam Yadav

    2013-04-01

    Full Text Available Mobile ad-hocnetworks areprone tovarioussecurity vulnerabilitiesbecause of its characteristicsmainlyhigh mobility of nodes,and no well defined architecture.Security measuresare difficult to implement asthere is nocentral administration. Several attackson Mobile ad-hoc networkhavebeen identified so farand Black hole attack is oneof them. In this paper we discussblack hole attackon Ad-hoc network andpropose a solution to the hijacked node behaving as black hole node. A scenario has been consideredwhere anode inside network has been intruded andcompromised tocause blackholeattack. The proposedsecuritysolutionmodifies original AODV using a hierarchical basedintrusion detectionmethod toidentifyhijacked nodeand exclude the particular node from network

  10. Genetic diversity of wheat grain quality and determination the best clustering technique and data type for diversity assessment

    Directory of Open Access Journals (Sweden)

    Khodadadi Mostafa

    2014-01-01

    Full Text Available Wheat is an important staple in human nutrition and improvement of its grain quality characters will have high impact on population's health. The objectives of this study were assessing variation of some grain quality characteristics in the Iranian wheat genotypes and identify the best type of data and clustering method for grouping genotypes. In this study 30 spring wheat genotypes were cultivated through randomized complete block design with three replications in 2009 and 2010 years. High significant difference among genotypes for all traits except for Sulfate, K, Br and Cl content, also deference among two years mean for all traits were no significant. Meanwhile there were significant interaction between year and genotype for all traits except Sulfate and F content. Mean values for crude protein, Zn, Fe and Ca in Mahdavi, Falat, Star, Sistan genotypes were the highest. The Ca and Br content showed the highest and the lowest broadcast heritability respectively. In this study indicated that the Root Mean Square Standard Deviation is efficient than R Squared and R Squared efficient than Semi Partial R Squared criteria for determining the best clustering technique. Also Ward method and canonical scores identified as the best clustering method and data type for grouping genotypes, respectively. Genotypes were grouped into six completely separate clusters and Roshan, Niknejad and Star genotypes from the fourth, fifth and sixth clusters had high grain quality characters in overall.

  11. Nonlinear mapping technique for data visualization and clustering assessment of LIBS data: application to ChemCam data

    Science.gov (United States)

    Lasue, Jeremie; Wiens, Roger; Stepinski, Tom; Forni, Olivier; Clegg, Samuel; Maurice, Sylvestre; Chemcam Team

    2011-02-01

    ChemCam is a remote laser-induced breakdown spectroscopy (LIBS) instrument that will arrive on Mars in 2012, on-board the Mars Science Laboratory Rover. The LIBS technique is crucial to accurately identify samples and quantify elemental abundances at various distances from the rover. In this study, we compare different linear and nonlinear multivariate techniques to visualize and discriminate clusters in two dimensions (2D) from the data obtained with ChemCam. We have used principal components analysis (PCA) and independent components analysis (ICA) for the linear tools and compared them with the nonlinear Sammon's map projection technique. We demonstrate that the Sammon's map gives the best 2D representation of the data set, with optimization values from 2.8% to 4.3% (0% is a perfect representation), together with an entropy value of 0.81 for the purity of the clustering analysis. The linear 2D projections result in three (ICA) and five times (PCA) more stress, and their clustering purity is more than twice higher with entropy values about 1.8. We show that the Sammon's map algorithm is faster and gives a slightly better representation of the data set if the initial conditions are taken from the ICA projection rather than the PCA projection. We conclude that the nonlinear Sammon's map projection is the best technique for combining data visualization and clustering assessment of the ChemCam LIBS data in 2D. PCA and ICA projections on more dimensions would improve on these numbers at the cost of the intuitive interpretation of the 2D projection by a human operator.

  12. Cluster analysis for applications

    CERN Document Server

    Anderberg, Michael R

    1973-01-01

    Cluster Analysis for Applications deals with methods and various applications of cluster analysis. Topics covered range from variables and scales to measures of association among variables and among data units. Conceptual problems in cluster analysis are discussed, along with hierarchical and non-hierarchical clustering methods. The necessary elements of data analysis, statistics, cluster analysis, and computer implementation are integrated vertically to cover the complete path from raw data to a finished analysis.Comprised of 10 chapters, this book begins with an introduction to the subject o

  13. Vibration impact acoustic emission technique for identification and analysis of defects in carbon steel tubes: Part B Cluster analysis

    Energy Technology Data Exchange (ETDEWEB)

    Halim, Zakiah Abd [Universiti Teknikal Malaysia Melaka (Malaysia); Jamaludin, Nordin; Junaidi, Syarif [Faculty of Engineering and Built, Universiti Kebangsaan Malaysia, Bangi (Malaysia); Yahya, Syed Yusainee Syed [Universiti Teknologi MARA, Shah Alam (Malaysia)

    2015-04-15

    Current steel tubes inspection techniques are invasive, and the interpretation and evaluation of inspection results are manually done by skilled personnel. Part A of this work details the methodology involved in the newly developed non-invasive, non-destructive tube inspection technique based on the integration of vibration impact (VI) and acoustic emission (AE) systems known as the vibration impact acoustic emission (VIAE) technique. AE signals have been introduced into a series of ASTM A179 seamless steel tubes using the impact hammer. Specifically, a good steel tube as the reference tube and four steel tubes with through-hole artificial defect at different locations were used in this study. The AEs propagation was captured using a high frequency sensor of AE systems. The present study explores the cluster analysis approach based on autoregressive (AR) coefficients to automatically interpret the AE signals. The results from the cluster analysis were graphically illustrated using a dendrogram that demonstrated the arrangement of the natural clusters of AE signals. The AR algorithm appears to be the more effective method in classifying the AE signals into natural groups. This approach has successfully classified AE signals for quick and confident interpretation of defects in carbon steel tubes.

  14. High-performance supercapacitor and lithium-ion battery based on 3D hierarchical NH4F-induced nickel cobaltate nanosheet-nanowire cluster arrays as self-supported electrodes

    Science.gov (United States)

    Chen, Yuejiao; Qu, Baihua; Hu, Lingling; Xu, Zhi; Li, Qiuhong; Wang, Taihong

    2013-09-01

    A facile hydrothermal method is developed for large-scale production of three-dimensional (3D) hierarchical porous nickel cobaltate nanowire cluster arrays derived from nanosheet arrays with robust adhesion on Ni foam. Based on the morphology evolution upon reaction time, a possible formation process is proposed. The role of NH4F in formation of the structure has also been investigated based on different NH4F amounts. This unique structure significantly enhances the electroactive surface areas of the NiCo2O4 arrays, leading to better interfacial/chemical distributions at the nanoscale, fast ion and electron transfer and good strain accommodation. Thus, when it is used for supercapacitor testing, a specific capacitance of 1069 F g-1 at a very high current density of 100 A g-1 was obtained. Even after more than 10 000 cycles at various large current densities, a capacitance of 2000 F g-1 at 10 A g-1 with 93.8% retention can be achieved. It also exhibits a high-power density (26.1 kW kg-1) at a discharge current density of 80 A g-1. When used as an anode material for lithium-ion batteries (LIBs), it presents a high reversible capacity of 976 mA h g-1 at a rate of 200 mA g-1 with good cycling stability and rate capability. This array material is rarely used as an anode material. Our results show that this unique 3D hierarchical porous nickel cobaltite is promising for electrochemical energy applications.A facile hydrothermal method is developed for large-scale production of three-dimensional (3D) hierarchical porous nickel cobaltate nanowire cluster arrays derived from nanosheet arrays with robust adhesion on Ni foam. Based on the morphology evolution upon reaction time, a possible formation process is proposed. The role of NH4F in formation of the structure has also been investigated based on different NH4F amounts. This unique structure significantly enhances the electroactive surface areas of the NiCo2O4 arrays, leading to better interfacial/chemical distributions

  15. A Survey of Grid Based Clustering Algorithms

    Directory of Open Access Journals (Sweden)

    MR ILANGO

    2010-08-01

    Full Text Available Cluster Analysis, an automatic process to find similar objects from a database, is a fundamental operation in data mining. A cluster is a collection of data objects that are similar to one another within the same cluster and are dissimilar to the objects in other clusters. Clustering techniques have been discussed extensively in SimilaritySearch, Segmentation, Statistics, Machine Learning, Trend Analysis, Pattern Recognition and Classification [1]. Clustering methods can be classified into i Partitioning methods ii Hierarchical methods iii Density-based methods iv Grid-based methods v Model-based methods. Grid based methods quantize the object space into a finite number of cells (hyper-rectangles and then perform the required operations on the quantized space. The main advantage of Grid based method is its fast processing time which depends on number of cells in each dimension in quantized space. In this research paper, we present some of the grid based methods such as CLIQUE (CLustering In QUEst [2], STING (STatistical INformation Grid [3], MAFIA (Merging of Adaptive Intervals Approach to Spatial Data Mining [4], Wave Cluster [5]and O-CLUSTER (Orthogonal partitioning CLUSTERing [6], as a survey andalso compare their effectiveness in clustering data objects. We also present some of the latest developments in Grid Based methods such as Axis Shifted Grid Clustering Algorithm [7] and Adaptive Mesh Refinement [Wei-Keng Liao etc] [8] to improve the processing time of objects.

  16. High-performance supercapacitor and lithium-ion battery based on 3D hierarchical NH4F-induced nickel cobaltate nanosheet-nanowire cluster arrays as self-supported electrodes.

    Science.gov (United States)

    Chen, Yuejiao; Qu, Baihua; Hu, Lingling; Xu, Zhi; Li, Qiuhong; Wang, Taihong

    2013-10-21

    A facile hydrothermal method is developed for large-scale production of three-dimensional (3D) hierarchical porous nickel cobaltate nanowire cluster arrays derived from nanosheet arrays with robust adhesion on Ni foam. Based on the morphology evolution upon reaction time, a possible formation process is proposed. The role of NH4F in formation of the structure has also been investigated based on different NH4F amounts. This unique structure significantly enhances the electroactive surface areas of the NiCo2O4 arrays, leading to better interfacial/chemical distributions at the nanoscale, fast ion and electron transfer and good strain accommodation. Thus, when it is used for supercapacitor testing, a specific capacitance of 1069 F g(-1) at a very high current density of 100 A g(-1) was obtained. Even after more than 10,000 cycles at various large current densities, a capacitance of 2000 F g(-1) at 10 A g(-1) with 93.8% retention can be achieved. It also exhibits a high-power density (26.1 kW kg(-1)) at a discharge current density of 80 A g(-1). When used as an anode material for lithium-ion batteries (LIBs), it presents a high reversible capacity of 976 mA h g(-1) at a rate of 200 mA g(-1) with good cycling stability and rate capability. This array material is rarely used as an anode material. Our results show that this unique 3D hierarchical porous nickel cobaltite is promising for electrochemical energy applications.

  17. Interactive visual exploration and refinement of cluster assignments.

    Science.gov (United States)

    Kern, Michael; Lex, Alexander; Gehlenborg, Nils; Johnson, Chris R

    2017-09-12

    With ever-increasing amounts of data produced in biology research, scientists are in need of efficient data analysis methods. Cluster analysis, combined with visualization of the results, is one such method that can be used to make sense of large data volumes. At the same time, cluster analysis is known to be imperfect and depends on the choice of algorithms, parameters, and distance measures. Most clustering algorithms don't properly account for ambiguity in the source data, as records are often assigned to discrete clusters, even if an assignment is unclear. While there are metrics and visualization techniques that allow analysts to compare clusterings or to judge cluster quality, there is no comprehensive method that allows analysts to evaluate, compare, and refine cluster assignments based on the source data, derived scores, and contextual data. In this paper, we introduce a method that explicitly visualizes the quality of cluster assignments, allows comparisons of clustering results and enables analysts to manually curate and refine cluster assignments. Our methods are applicable to matrix data clustered with partitional, hierarchical, and fuzzy clustering algorithms. Furthermore, we enable analysts to explore clustering results in context of other data, for example, to observe whether a clustering of genomic data results in a meaningful differentiation in phenotypes. Our methods are integrated into Caleydo StratomeX, a popular, web-based, disease subtype analysis tool. We show in a usage scenario that our approach can reveal ambiguities in cluster assignments and produce improved clusterings that better differentiate genotypes and phenotypes.

  18. A clustering technique for digital communications channel equalization using radial basis function networks.

    Science.gov (United States)

    Chen, S; Mulgrew, B; Grant, P M

    1993-01-01

    The application of a radial basis function network to digital communications channel equalization is examined. It is shown that the radial basis function network has an identical structure to the optimal Bayesian symbol-decision equalizer solution and, therefore, can be employed to implement the Bayesian equalizer. The training of a radial basis function network to realize the Bayesian equalization solution can be achieved efficiently using a simple and robust supervised clustering algorithm. During data transmission a decision-directed version of the clustering algorithm enables the radial basis function network to track a slowly time-varying environment. Moreover, the clustering scheme provides an automatic compensation for nonlinear channel and equipment distortion. Computer simulations are included to illustrate the analytical results.

  19. Weighted Clustering

    CERN Document Server

    Ackerman, Margareta; Branzei, Simina; Loker, David

    2011-01-01

    In this paper we investigate clustering in the weighted setting, in which every data point is assigned a real valued weight. We conduct a theoretical analysis on the influence of weighted data on standard clustering algorithms in each of the partitional and hierarchical settings, characterising the precise conditions under which such algorithms react to weights, and classifying clustering methods into three broad categories: weight-responsive, weight-considering, and weight-robust. Our analysis raises several interesting questions and can be directly mapped to the classical unweighted setting.

  20. Rain gauge network design for flood forecasting using multi-criteria decision analysis and clustering techniques in lower Mahanadi river basin, India

    Directory of Open Access Journals (Sweden)

    Anil Kumar Kar

    2015-09-01

    New hydrological insights for the region: This study establishes different possible key RG networks using Hall’s method, analytical hierarchical process (AHP, self organization map (SOM and hierarchical clustering (HC using the characteristics of each rain gauge occupied Thiessen polygon area. Efficiency of the key networks is tested by artificial neural network (ANN, Fuzzy and NAM rainfall-runoff models. Furthermore, flood forecasting has been carried out using the three most effective RG networks which uses only 7 RGs instead of 14 gauges established in the Kantamal sub-catchment, Mahanadi basin. The Fuzzy logic applied on the key RG network derived using AHP has shown the best result for flood forecasting with efficiency of 82.74% for 1-day lead period. This study demonstrates the design procedure of key RG network for effective flood forecasting particularly when there is difficulty in gathering the information from all RGs.

  1. Hierarchical Parallelization of Gene Differential Association Analysis

    Directory of Open Access Journals (Sweden)

    Dwarkadas Sandhya

    2011-09-01

    Full Text Available Abstract Background Microarray gene differential expression analysis is a widely used technique that deals with high dimensional data and is computationally intensive for permutation-based procedures. Microarray gene differential association analysis is even more computationally demanding and must take advantage of multicore computing technology, which is the driving force behind increasing compute power in recent years. In this paper, we present a two-layer hierarchical parallel implementation of gene differential association analysis. It takes advantage of both fine- and coarse-grain (with granularity defined by the frequency of communication parallelism in order to effectively leverage the non-uniform nature of parallel processing available in the cutting-edge systems of today. Results Our results show that this hierarchical strategy matches data sharing behavior to the properties of the underlying hardware, thereby reducing the memory and bandwidth needs of the application. The resulting improved efficiency reduces computation time and allows the gene differential association analysis code to scale its execution with the number of processors. The code and biological data used in this study are downloadable from http://www.urmc.rochester.edu/biostat/people/faculty/hu.cfm. Conclusions The performance sweet spot occurs when using a number of threads per MPI process that allows the working sets of the corresponding MPI processes running on the multicore to fit within the machine cache. Hence, we suggest that practitioners follow this principle in selecting the appropriate number of MPI processes and threads within each MPI process for their cluster configurations. We believe that the principles of this hierarchical approach to parallelization can be utilized in the parallelization of other computationally demanding kernels.

  2. Cluster Oriented Spatio Temporal Multidimensional Data Visualization of Earthquakes in Indonesia

    Directory of Open Access Journals (Sweden)

    Mohammad Nur Shodiq

    2016-03-01

    Full Text Available Spatio temporal data clustering is challenge task. The result of clustering data are utilized to investigate the seismic parameters. Seismic parameters are used to describe the characteristics of earthquake behavior. One of the effective technique to study multidimensional spatio temporal data is visualization. But, visualization of multidimensional data is complicated problem. Because, this analysis consists of observed data cluster and seismic parameters. In this paper, we propose a visualization system, called as IES (Indonesia Earthquake System, for cluster analysis, spatio temporal analysis, and visualize the multidimensional data of seismic parameters. We analyze the cluster analysis by using automatic clustering, that consists of get optimal number of cluster and Hierarchical K-means clustering. We explore the visual cluster and multidimensional data in low dimensional space visualization. We made experiment with observed data, that consists of seismic data around Indonesian archipelago during 2004 to 2014. Keywords: Clustering, visualization, multidimensional data, seismic parameters.

  3. Community detection algorithm based on hierarchical clustering under signal missing in propagating process%传播过程中信号缺失的层次聚类社区发现算法

    Institute of Scientific and Technical Information of China (English)

    康茜; 李德玉; 王素格; 冀庆斌

    2015-01-01

    社区发现是社会网络分析的一个基本任务,而社区结构探测是社区发现的一个关键问题。将社区结构中的结点看作信号源,针对信号传递过程中存在信号缺失情况,提出了一种层次聚类社区发现算法。该算法通过度中心性来度量节点接收信号的概率,用于量化节点接受信号过程中的缺失值。经过信号传递,使网络的拓扑结构转化为向量间的几何关系,在此基础上,使用层次聚类算法用于发现社区。为了验证SMHC算法的有效性,通过在三个数据集上与SHC算法、CNM算法、GN算法、Similar算法进行比较,实验结果表明,SMHC算法在一定程度上提高了社区发现的正确率。%Community identification is a basic task of social network analysis, meanwhile the community structure detec-tion is a key problem of community identification. Each node in the community structure is regarded as the signal source. A hierarchical clustering community algorithm is proposed in order to settle the problem of signal missing in the process of signal transmission. The algorithm measures the probability of receiving signals of nodes by degree centrality to quantify the signal missing values. After the signal transmission, the topology of the network is transformed into geometric relation-ships among the vectors. On the basis, the hierarchical clustering algorithm is used to find the community structure. In order to validate the proposed method, this paper compares it with SHC algorithm, CNM algorithm, GN algorithm and Similar algorithm. Under three real networks, the Zachary Club, American Football and Netscience, the experimental results indi-cate that SMHC algorithm can effectively improve precision.

  4. Improving Web Document Clustering through Employing User-Related Tag Expansion Techniques

    Institute of Scientific and Technical Information of China (English)

    Peng Li; Bin Wang; Wei Jin

    2012-01-01

    As high quality descriptors of web page semantics,social annotations or tags have been used for web document clustering and achieved promising results.However,most web pages have few tags (less than 10).This sparsity seriously limits the usage of tags for clustering.In this work,we propose a user-related tag expansion method to overcome this problem,which incorporates additional useful tags into the original tag document by utilizing user tagging data as background knowledge.Unfortunately,simply adding tags may cause topic drift,i.e.,the dominant topic(s) of the original document may be changed.To tackle this problem,we have designed a novel generative model called Folk-LDA,which jointly models original and expanded tags as independent observations.ExPerimental results show that 1) our user-related tag expansion method can be effectively applied to over 90% tagged web documents; 2) Folk-LDA can alleviate topic drift in expansion,especially for those topic-specific documents; 3) the proposed tag-based clustering methods significantly outperform the word-based methods,which indicates that tags could be a better resource for the clustering task.

  5. Statistical properties of convex clustering

    OpenAIRE

    Tan, Kean Ming; Witten, Daniela

    2015-01-01

    In this manuscript, we study the statistical properties of convex clustering. We establish that convex clustering is closely related to single linkage hierarchical clustering and $k$-means clustering. In addition, we derive the range of the tuning parameter for convex clustering that yields a non-trivial solution. We also provide an unbiased estimator of the degrees of freedom, and provide a finite sample bound for the prediction error for convex clustering. We compare convex clustering to so...

  6. Hierarchical Segmentation of Falsely Touching Characters from Camera Captured Degraded Document Images

    Directory of Open Access Journals (Sweden)

    Satadal Saha

    2011-07-01

    Full Text Available An innovative hierarchical image segmentation scheme is reported in this research communication. Unlike static/ spatially divided sub-images, the current innovation concentrates on object level hierarchy for segmentation of gray scale or color images into constituent component/ sub-parts. As for example, a gray scale document image may be segmented (binarized in case of two-level segmentation into connected foreground components (text/ graphics and background component by hierarchically applying a gray level threshold selection algorithm in the object-space. In any hierarchy, constituent objects are identified as connected foreground pixels, as classified by the gray scale threshold selection algorithm. To preserve the global information, thresholds for each object in any hierarchy are estimated as a weighted aggregate of the current and previous thresholds relevant to the object. The developed technique may be customized as a general purpose hierarchical information clustering algorithm in the domain of pattern analysis, data mining, bioinformatics etc.

  7. Comparison of cluster and principal component analysis techniques to derive dietary patterns in Irish adults.

    Science.gov (United States)

    Hearty, Aine P; Gibney, Michael J

    2009-02-01

    The aims of the present study were to examine and compare dietary patterns in adults using cluster and factor analyses and to examine the format of the dietary variables on the pattern solutions (i.e. expressed as grams/day (g/d) of each food group or as the percentage contribution to total energy intake). Food intake data were derived from the North/South Ireland Food Consumption Survey 1997-9, which was a randomised cross-sectional study of 7 d recorded food and nutrient intakes of a representative sample of 1379 Irish adults aged 18-64 years. Cluster analysis was performed using the k-means algorithm and principal component analysis (PCA) was used to extract dietary factors. Food data were reduced to thirty-three food groups. For cluster analysis, the most suitable format of the food-group variable was found to be the percentage contribution to energy intake, which produced six clusters: 'Traditional Irish'; 'Continental'; 'Unhealthy foods'; 'Light-meal foods & low-fat milk'; 'Healthy foods'; 'Wholemeal bread & desserts'. For PCA, food groups in the format of g/d were found to be the most suitable format, and this revealed four dietary patterns: 'Unhealthy foods & high alcohol'; 'Traditional Irish'; 'Healthy foods'; 'Sweet convenience foods & low alcohol'. In summary, cluster and PCA identified similar dietary patterns when presented with the same dataset. However, the two dietary pattern methods required a different format of the food-group variable, and the most appropriate format of the input variable should be considered in future studies.

  8. Fabrication and gas sensitivity of SnO{sub 2} hierarchical films with interwoven tubular conformation by a biotemplate-directed sol-gel technique

    Energy Technology Data Exchange (ETDEWEB)

    Dong Qun [State Key Lab of Metal Matrix Composites, Shanghai Jiaotong University, Shanghai 200030 (China); Su Huilan [State Key Lab of Metal Matrix Composites, Shanghai Jiaotong University, Shanghai 200030 (China); Zhang Di [State Key Lab of Metal Matrix Composites, Shanghai Jiaotong University, Shanghai 200030 (China); Zhang Fangying [National Key Lab of Surface Physics, Fudan University, Shanghai 200433 (China)

    2006-08-14

    A facile and versatile method is reported to fabricate the interwoven tubular hierarchy of SnO{sub 2} films using a biotemplate eggshell membrane (ESM) combined sol-gel approach. In order to promote the crystallization of SnO{sub 2} films, calcination is necessary and can adjust the size of the building units in the range 2.8-26 nm. Under the direction of ESM biomacromolecules, SnO{sub 2} nanocrystallites come into being and assemble into nanotubes, and further pattern porous hierarchical meshworks to faithfully retain the morphology of natural ESM. The sensor performance of as-prepared biomorphic SnO{sub 2} was measured for ethanol, liquefied petroleum gas (LPG), H{sub 2}S, and gasoline. It is found that the SnO{sub 2} hierarchical films obtained have a good selectivity for LPG with a working temperature above 300 deg. C while for ethanol below 270 deg. C.

  9. A Validation of the Spectral Power Clustering Technique (SPCT by Using a Rogowski Coil in Partial Discharge Measurements

    Directory of Open Access Journals (Sweden)

    Jorge Alfredo Ardila-Rey

    2015-10-01

    Full Text Available Both in industrial as in controlled environments, such as high-voltage laboratories, pulses from multiple sources, including partial discharges (PD and electrical noise can be superimposed. These circumstances can modify and alter the results of PD measurements and, what is more, they can lead to misinterpretation. The spectral power clustering technique (SPCT allows separating PD sources and electrical noise through the two-dimensional representation (power ratio map or PR map of the relative spectral power in two intervals, high and low frequency, calculated for each pulse captured with broadband sensors. This method allows to clearly distinguishing each of the effects of noise and PD, making it easy discrimination of all sources. In this paper, the separation ability of the SPCT clustering technique when using a Rogowski coil for PD measurements is evaluated. Different parameters were studied in order to establish which of them could help for improving the manual selection of the separation intervals, thus enabling a better separation of clusters. The signal processing can be performed during the measurements or in a further analysis.

  10. Block-based logical hierarchical cluster for distributed multimedia architecture on demand server%基于块的逻辑层次集群:一种分布式多媒体点播服务器的体系结构

    Institute of Scientific and Technical Information of China (English)

    熊旭辉; 余胜生; 周敬利

    2006-01-01

    A structure of logical hierarchical cluster for the distributed multimedia on demand server is proposed. The architecture is mainly composed of the network topology and the resource management of all server nodes. Instead of the physical network hierarchy or the independent management hierarchy, the nodes are organized into a logically hierarchical cluster according to the multimedia block they caches in the midderware layer. The process of a member joining/leaving or the structure adjustment cooperatively implemented by all members is concerned with decentralized maintenance of the logical cluster hierarchy. As the root of each logically hierarchical cluster is randomly mapped into the system, the logical structure of a multimedia block is dynamically expanded across some regions by the two replication policies in different load state respectively. The local load diversion is applied to fine-tune the load of nodes within a local region but belongs to different logical hierarchies. Guaranteed by the dynamic expansion of a logical structure and the load diversion of a local region, the users always select a closest idle node from the logical hierarchy under the condition of topology integration with resource management.

  11. Radio-selected Galaxies in Very Rich Clusters at z < 0.25 I. Multi-wavelength Observations and Data Reduction Techniques

    CERN Document Server

    Morrison, G E; Ledlow, M J; Keel, W C; Hill, J M; Voges, W; Herter, T L

    2002-01-01

    Radio observations were used to detect the `active' galaxy population within rich clusters of galaxies in a non-biased manner that is not plagued by dust extinction or the K-correction. We present wide-field radio, optical (imaging and spectroscopy), and ROSAT All-Sky Survey (RASS) X-ray data for a sample of 30 very rich Abell (R > 2) cluster with z 2E22 W/Hz) galaxy population within these extremely rich clusters for galaxies with M_R 5 M_sun/yr) and active galactic nuclei (AGN) populations contained within each cluster. Archival and newly acquired redshifts were used to verify cluster membership for most (~95%) of the optical identifications. Thus we can identify all the starbursting galaxies within these clusters, regardless of the level of dust obscuration that would affect these galaxies being identified from their optical signature. Cluster sample selection, observations, and data reduction techniques for all wavelengths are discussed.

  12. The Bullet Cluster revisited: New results from new constraints and improved strong lensing modeling technique

    CERN Document Server

    Paraficz, D; Richard, J; Morandi, A; Limousin, M; Jullo, E

    2012-01-01

    We present a new detailed parametric strong lensing mass reconstruction of the Bullet Cluster (1E 0657-56) at z=0.296, based on new WFC3 and ACS HST imaging and VLT/FORS2 spectroscopy. The strong lensing constraints undergone deep revision, there are 14 (6 new and 8 previously known) multiply imaged systems, of which 3 have spectroscopically confirmed redshifts (including 2 newly measured). The reconstructed mass distribution includes explicitly for the first time the combination of 3 mass components: i) the intra-cluster gas mass derived from X-ray observation, ii) the cluster galaxies modeled by their Fundamental Plane (elliptical) and Tully-Fisher (spiral) scaling relations and iii) dark matter. The best model has an average rms value of 0.158" between the predicted and measured image positions for the 14 multiple images considered. The derived mass model confirms the spacial offset between the X-ray gas and dark matter peaks. The galaxy halos to total mass fraction is found to be f_s=11+/-5% for a total m...

  13. Hierarchical structure of the countries based on electricity consumption and economic growth

    Science.gov (United States)

    Kantar, Ersin; Aslan, Alper; Deviren, Bayram; Keskin, Mustafa

    2016-07-01

    We investigate the hierarchical structures of countries based on electricity consumption and economic growth by using the real amounts of their consumption over a certain time period. We use electricity consumption data to detect the topological properties of 64 countries from 1971 to 2008. These countries are divided into three clusters: low income group, middle income group and high income group countries. Firstly, a relationship between electricity consumption and economic growth is investigated by using the concept of hierarchical structure methods (minimal spanning tree (MST) and hierarchical tree (HT)). Secondly, we perform bootstrap techniques to investigate a value of the statistical reliability to the links of the MST. Finally, we use a clustering linkage procedure in order to observe the cluster structure more clearly. The results of the structural topologies of these trees are as follows: (i) we identified different clusters of countries according to their geographical location and economic growth, (ii) we found a strong relation between energy consumption and economic growth for all the income groups considered in this study and (iii) the results are in good agreement with the causal relationship between electricity consumption and economic growth.

  14. An introduction to hierarchical linear modeling

    National Research Council Canada - National Science Library

    Woltman, Heather; Feldstain, Andrea; MacKay, J. Christine; Rocchi, Meredith

    2012-01-01

    This tutorial aims to introduce Hierarchical Linear Modeling (HLM). A simple explanation of HLM is provided that describes when to use this statistical technique and identifies key factors to consider before conducting this analysis...

  15. Data Mining Un-Compressed Images from cloud with Clustering Compression technique using Lempel-Ziv-Welch

    Directory of Open Access Journals (Sweden)

    C. Parthasarathy

    2013-07-01

    Full Text Available Cloud computing is a highly discussed topic in the technical and economic world, and many of the big players of the software industry have entered the development of cloud services. Several companies’ and organizations wants to explore the possibilities and benefits of incorporating such cloud computing services in their business, as well as the possibilities to offer own cloud services. We are going to mine the un-compressed image from the cloud and use k-means clustering grouping the uncompressed image and compress it with Lempel-ziv-welch coding technique so that the un-compressed images becomes error-free compression and spatial redundancies.

  16. Applications for edge detection techniques using Chandra and XMM-Newton data: galaxy clusters and beyond

    Science.gov (United States)

    Walker, S. A.; Sanders, J. S.; Fabian, A. C.

    2016-09-01

    The unrivalled spatial resolution of the Chandra X-ray observatory has allowed many breakthroughs to be made in high-energy astrophysics. Here we explore applications of Gaussian gradient magnitude (GGM) filtering to X-ray data, which dramatically improves the clarity of surface brightness edges in X-ray observations, and maps gradients in X-ray surface brightness over a range of spatial scales. In galaxy clusters, we find that this method is able to reveal remarkable substructure behind the cold fronts in Abell 2142 and Abell 496, possibly the result of Kelvin-Helmholtz instabilities. In Abell 2319 and Abell 3667, we demonstrate that the GGM filter can provide a straightforward way of mapping variations in the widths and jump ratios along the lengths of cold fronts. We present results from our ongoing programme of analysing the Chandra and XMM-Newton archives with the GGM filter. In the Perseus cluster, we identify a previously unseen edge around 850 kpc from the core to the east, lying outside a known large-scale cold front, which is possibly a bow shock. In MKW 3s we find an unusual `V' shape surface brightness enhancement starting at the cluster core, which may be linked to the AGN jet. In the Crab nebula a new, moving feature in the outer part of the torus is identified which moves across the plane of the sky at a speed of ˜0.1c, and lies much further from the central pulsar than the previous motions seen by Chandra.

  17. POLYMER COMPOSITE FILMS WITH SIZE-SELECTED METAL NANOPARTICLES FABRICATED BY CLUSTER BEAM TECHNIQUE

    DEFF Research Database (Denmark)

    Ceynowa, F. A.; Chirumamilla, Manohar; Popok, Vladimir

    2017-01-01

    after the deposition. The degree of immersion can be controlled by the annealing temperature and time. Together with control of cluster coverage the described approach represents an efficient method for the synthesis of thin polymer composite layers with either partially or fully embedded metal NPs......, in particular, for the use of phenomenon of localized surface plasmon resonance (LSPR). Unfortunately, it is found that the thermal annealing used in the production process can lead to quenching of plasmonic properties in the case of copper. To solve this problem, it is suggested to treat the samples with ozone...

  18. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    of different types of hierarchical networks. This is supplemented by a review of ring network design problems and a presentation of a model allowing for modeling most hierarchical networks. We use methods based on linear programming to design the hierarchical networks. Thus, a brief introduction to the various....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...... linear programming based methods is included. The thesis is thus suitable as a foundation for study of design of hierarchical networks. The major contribution of the thesis consists of seven papers which are included in the appendix. The papers address hierarchical network design and/or ring network...

  19. Analysis of the effects of the global financial crisis on the Turkish economy, using hierarchical methods

    Science.gov (United States)

    Kantar, Ersin; Keskin, Mustafa; Deviren, Bayram

    2012-04-01

    We have analyzed the topology of 50 important Turkish companies for the period 2006-2010 using the concept of hierarchical methods (the minimal spanning tree (MST) and hierarchical tree (HT)). We investigated the statistical reliability of links between companies in the MST by using the bootstrap technique. We also used the average linkage cluster analysis (ALCA) technique to observe the cluster structures much better. The MST and HT are known as useful tools to perceive and detect global structure, taxonomy, and hierarchy in financial data. We obtained four clusters of companies according to their proximity. We also observed that the Banks and Holdings cluster always forms in the centre of the MSTs for the periods 2006-2007, 2008, and 2009-2010. The clusters match nicely with their common production activities or their strong interrelationship. The effects of the Automobile sector increased after the global financial crisis due to the temporary incentives provided by the Turkish government. We find that Turkish companies were not very affected by the global financial crisis.

  20. Applications for edge detection techniques using Chandra and XMM-Newton data: galaxy clusters and beyond

    CERN Document Server

    Walker, S A; Fabian, A C

    2016-01-01

    The unrivalled spatial resolution of the Chandra X-ray observatory has allowed many breakthroughs to be made in high energy astrophysics. Here we explore applications of Gaussian Gradient Magnitude (GGM) filtering to X-ray data, which dramatically improves the clarity of surface brightness edges in X-ray observations, and maps gradients in X-ray surface brightness over a range of spatial scales. In galaxy clusters, we find that this method is able to reveal remarkable substructure behind the cold fronts in Abell 2142 and Abell 496, possibly the result of Kelvin Helmholtz instabilities. In Abell 2319 and Abell 3667, we demonstrate that the GGM filter can provide a straightforward way of mapping variations in the widths and jump ratios along the lengths of cold fronts. We present results from our ongoing programme of analysing the Chandra and XMM-Newton archives with the GGM filter. In the Perseus cluster we identify a previously unseen edge around 850 kpc from the core to the east, lying outside a known large ...

  1. Solute-Vacancy Clustering In Al-Mg-Si Alloys Studied By Muon Spin Relaxation Technique

    Directory of Open Access Journals (Sweden)

    Nishimura K.

    2015-06-01

    Full Text Available Zero-field muon spin relaxation experiments were carried out with Al-1.6%Mg2Si, Al-0.5%Mg, and Al-0.5%Si alloys. Observed relaxation spectra were compared with the calculated relaxation functions based on the Monte Carlo simulation to extract the dipolar width (Δ, trapping (νt, and detrapping rates (νd, with the initially trapped muon fraction (P0. The fitting analysis has elucidated that the muon trapping rates depended on the heat treatment and solute concentrations. The dissolved Mg in Al dominated the νt at lower temperatures below 120 K, therefore the similar temperature variations of νt were observed with the samples mixed with Mg. The νt around 200 K remarkably reflected the heat treatment effect on the samples, and the largest νt value was found with the sample annealed at 100°C among Al-1.6%Mg2Si alloys. The as-quenched Al-0.5%Si sample showed significant νt values between 80 and 280 K relating with Si-vacancy clusters, but such clusters disappeared with the natural aged Al-0.5%Si sample.

  2. Optimizd Design of Power Scheduling in WSN Based on Sink Root Data Tree with Hierarchical Clustering%Sink根数据聚集树分层的WSN电力调度优化设计

    Institute of Scientific and Technical Information of China (English)

    朱文忠

    2014-01-01

    为提高电力数据调度效率,缩短电力数据调度延时,提出一种改进的无通信冲突的分布式电力数据聚集调度近似算法,采用Sink根数据聚集树对无线传感器网络中各个节点电力资源数据进行分层数据调度,根据分布式数据集对各个电力节点之间的控制信息进行不断融合处理,在最大独立集的基础上建立一棵根在Sink的数据聚集树。每个节点分配一个时间片,使该节点能在无通信冲突的情况下传输数据。仿真实验表明,采用改进算法得到的聚集延时明显减小,有效保证了电力调度控制的实时性,电力信息数据分层融合度能达到90%以上,而改进前的算法只有10%~50%之间。%In order to improve the power data scheduling efficiency, shorten the power data scheduling delay, and improve matching and integration degree, and improved power scheduling optimization design method based on Sink root data tree hierarchical clustering was proposed for improve the management efficiency. We established a tree root in the Sink data ag-gregation tree based on the maximum independent set. Each node was assigned a time slice, so that the node could transmit data in the absence of communication conflict situations. Simulation results show that the improved algorithm has signifi-cantly reduced aggregation delay, and it has effectively ensured the real-time dispatching control, and the data hierarchical fusion degree can reach more than 90%, while the former algorithm is only 10%~50%.

  3. Hierarchical Multiagent Reinforcement Learning

    Science.gov (United States)

    2004-01-25

    In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multiagent tasks. We...introduce a hierarchical multiagent reinforcement learning (RL) framework and propose a hierarchical multiagent RL algorithm called Cooperative HRL. In

  4. Generation of hierarchically correlated multivariate symbolic sequences

    CERN Document Server

    Tumminello, Mi; Mantegna, R N

    2008-01-01

    We introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained by some hierarchical clustering procedure as applied to an empirical matrix of Hamming distances. The algorithm can be interpreted as the finite alphabet equivalent of the recently introduced hierarchically nested factor model (M. Tumminello et al. EPL 78 (3) 30006 (2007)). The algorithm is based on a generating mechanism that is different from the one used in the mutation rate approach. We apply the proposed methodology for investigating the relationship between the bootstrap value associated with a node of a phylogeny and the probability of finding that node in the true phylogeny.

  5. Ultra-Wideband Geo-Regioning: A Novel Clustering and Localization Technique

    Directory of Open Access Journals (Sweden)

    Armin Wittneben

    2007-12-01

    Full Text Available Ultra-wideband (UWB technology enables a high temporal resolution of the propagation channel. Consequently, a channel impulse response between transmitter and receiver can be interpreted as signature for their relative positions. If the position of the receiver is known, the channel impulse response indicates the position of the transmitter and vice versa. This work introduces UWB geo-regioning as a clustering and localization method based on channel impulse response fingerprinting, develops a theoretical framework for performance analysis, and evaluates this approach by means of performance results based on measured channel impulse responses. Complexity issues are discussed and performance dependencies on signal-to-noise ratio, a priori knowledge, observation window, and system bandwidth are investigated.

  6. Using Modified Partitioning Around Medoids Clustering Technique in Mobile Network Planning

    Directory of Open Access Journals (Sweden)

    Lamiaa Fattouh Ibrahim

    2012-11-01

    Full Text Available Optimization mobile radio network planning is a very complex task, as many aspects must be taken into account. Deciding upon the optimum placement for the base stations (BSs to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper introduces the spatial clustering to solve the Mobile Networking Planning problem. It addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original Partitioning Around Medoids PAM algorithm. M-PAM (Modified Partitioning Around Medoids has been proposed to satisfy the requirements and constraints. Implementation of this algorithm to a real case study is presented. Experimental results and analysis indicate that the M-PAM algorithm is effective in case of heavy load distribution, and leads to minimum number of base stations, which directly affected onto the cost of planning the network.

  7. Fault-Tolerant Technique in the Cluster Computation of the Digital Watershed Model

    Institute of Scientific and Technical Information of China (English)

    SHANG Yizi; WU Baosheng; LI Tiejian; FANG Shenguang

    2007-01-01

    This paper describes a parallel computing platform using the existing facilities for the digital watershed model. In this paper, distributed multi-layered structure is applied to the computer cluster system, and the MPI-2 is adopted as a mature parallel programming standard. An agent is introduced which makes it possible to be multi-level fault-tolerant in software development. The communication protocol based on checkpointing and rollback recovery mechanism can realize the transaction reprocessing. Compared with conventional platform, the new system is able to make better use of the computing resource. Experimental results show the speedup ratio of the platform is almost 4 times as that of the conventional one, which demonstrates the high efficiency and good performance of the new approach.

  8. Performance comparison of hierarchical checkpoint protocols grid computing

    Directory of Open Access Journals (Sweden)

    Ndeye Massata NDIAYE

    2012-06-01

    Full Text Available Grid infrastructure is a large set of nodes geographically distributed and connected by a communication. In this context, fault tolerance is a necessity imposed by the distribution that poses a number of problems related to the heterogeneity of hardware, operating systems, networks, middleware, applications, the dynamic resource, the scalability, the lack of common memory, the lack of a common clock, the asynchronous communication between processes. To improve the robustness of supercomputing applications in the presence of failures, many techniques have been developed to provide resistance to these faults of the system. Fault tolerance is intended to allow the system to provide service as specified in spite of occurrences of faults. It appears as an indispensable element in distributed systems. To meet this need, several techniques have been proposed in the literature. We will study the protocols based on rollback recovery. These protocols are classified into two categories: coordinated checkpointing and rollback protocols and log-based independent checkpointing protocols or message logging protocols. However, the performance of a protocol depends on the characteristics of the system, network and applications running. Faced with the constraints of large-scale environments, many of algorithms of the literature showed inadequate. Given an application environment and a system, it is not easy to identify the recovery protocol that is most appropriate for a cluster or hierarchical environment, like grid computing. While some protocols have been used successfully in small scale, they are not suitable for use in large scale. Hence there is a need to implement these protocols in a hierarchical fashion to compare their performance in grid computing. In this paper, we propose hierarchical version of four well-known protocols. We have implemented and compare the performance of these protocols in clusters and grid computing using the Omnet++ simulator

  9. Optimisation by hierarchical search

    Science.gov (United States)

    Zintchenko, Ilia; Hastings, Matthew; Troyer, Matthias

    2015-03-01

    Finding optimal values for a set of variables relative to a cost function gives rise to some of the hardest problems in physics, computer science and applied mathematics. Although often very simple in their formulation, these problems have a complex cost function landscape which prevents currently known algorithms from efficiently finding the global optimum. Countless techniques have been proposed to partially circumvent this problem, but an efficient method is yet to be found. We present a heuristic, general purpose approach to potentially improve the performance of conventional algorithms or special purpose hardware devices by optimising groups of variables in a hierarchical way. We apply this approach to problems in combinatorial optimisation, machine learning and other fields.

  10. Hierarchical matrices algorithms and analysis

    CERN Document Server

    Hackbusch, Wolfgang

    2015-01-01

    This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...

  11. Updated teaching techniques improve CPR performance measures: a cluster randomized, controlled trial.

    Science.gov (United States)

    Ettl, Florian; Testori, Christoph; Weiser, Christoph; Fleischhackl, Sabine; Mayer-Stickler, Monika; Herkner, Harald; Schreiber, Wolfgang; Fleischhackl, Roman

    2011-06-01

    The first-aid training necessary for obtaining a drivers license in Austria has a regulated and predefined curriculum but has been targeted for the implementation of a new course structure with less theoretical input, repetitive training in cardiopulmonary resuscitation (CPR) and structured presentations using innovative media. The standard and a new course design were compared with a prospective, participant- and observer-blinded, cluster-randomized controlled study. Six months after the initial training, we evaluated the confidence of the 66 participants in their skills, CPR effectiveness parameters and correctness of their actions. The median self-confidence was significantly higher in the interventional group [IG, visual analogue scale (VAS:"0" not-confident at all,"100" highly confident):57] than in the control group (CG, VAS:41). The mean chest compression rate in the IG (98/min) was closer to the recommended 100 bpm than in the CG (110/min). The time to the first chest compression (IG:25s, CG:36s) and time to first defibrillator shock (IG:86s, CG:92s) were significantly shorter in the IG. Furthermore, the IG participants were safer in their handling of the defibrillator and started with countermeasures against developing shock more often. The management of an unconscious person and of heavy bleeding did not show a difference between the two groups even after shortening the lecture time. Motivation and self-confidence as well as skill retention after six months were shown to be dependent on the teaching methods and the time for practical training. Courses may be reorganized and content rescheduled, even within predefined curricula, to improve course outcomes. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

  12. 数字电子技术课程实施分层次项目教学的探索与实践%Exploration and application of hierarchical project teaching in digital electronic technique

    Institute of Scientific and Technical Information of China (English)

    邹芳红

    2013-01-01

      In this thesis, the design solutions and implementation principles were put forward according to the furtherance of project teaching applied in vocational education. This thesis, taking digital electronic technique as a course sample, carried on an indepth look into hierarchical project teaching cases, thus explained its implementation procedures and evaluation methods in details, on basis of which came to the conclusion and refinement on the application of the hierarchical project teaching.%  提出了分层次项目教学的设计思路与实施原则,对数字电子技术课程分层次教学项目的案例进行了分析,阐述了分层次项目教学的实施步骤和评价方法,对分层次项目教学的实践进行了提炼与总结。

  13. Investigation of Cu(In,Ga)Se{sub 2} using Monte Carlo and the cluster expansion technique

    Energy Technology Data Exchange (ETDEWEB)

    Ludwig, Christian D.R.; Gruhn, Thomas; Felser, Claudia [Institute of Inorganic and Analytical Chemistry, Johannes Gutenberg-University, Mainz (Germany); Windeln, Johannes [IBM Germany, Mgr. Technology Center ISC EMEA, Mainz (Germany)

    2010-07-01

    CIGS based solar cells are among the most promising thin-film techniques for cheap, yet efficient modules. They have been investigated for many years, but the full potential of CIGS cells has not yet been exhausted and many effects are not understood. For instance, the band gap of the absorber material Cu(In,Ga)Se{sub 2} varies with Ga content. The question why solar cells with high Ga content have low efficiencies, despite the fact that the band gap should have the optimum value, is still unanswered. We are using Monte Carlo simulations in combination with a cluster expansion to investigate the homogeneity of the In-Ga distribution as a possible cause of the low efficiency of cells with high Ga content. The cluster expansion is created by a fit to ab initio electronic structure energies. The results we found are crucial for the processing of solar cells, shed light on structural properties and give hints on how to significantly improve solar cell performance. Above the transition temperature from the separated to the mixed phase, we observe different sizes of the In and Ga domains for a given temperature. The In domains in the Ga-rich compound are smaller and less abundant than the Ga domains in the In-rich compound. This translates into the Ga-rich material being less homogeneous.

  14. Hybrid and hierarchical composite materials

    CERN Document Server

    Kim, Chang-Soo; Sano, Tomoko

    2015-01-01

    This book addresses a broad spectrum of areas in both hybrid materials and hierarchical composites, including recent development of processing technologies, structural designs, modern computer simulation techniques, and the relationships between the processing-structure-property-performance. Each topic is introduced at length with numerous  and detailed examples and over 150 illustrations.   In addition, the authors present a method of categorizing these materials, so that representative examples of all material classes are discussed.

  15. ModEx and Seed-Detective: Two novel techniques for high quality clustering by using good initial seeds in K-Means

    Directory of Open Access Journals (Sweden)

    Md Anisur Rahman

    2015-04-01

    Full Text Available In this paper we present two clustering techniques called ModEx and Seed-Detective. ModEx is a modified version of an existing clustering technique called Ex-Detective. It addresses some limitations of Ex-Detective. Seed-Detective is a combination of ModEx and Simple K-Means. Seed-Detective uses ModEx to produce a set of high quality initial seeds that are then given as input to K-Means for producing the final clusters. The high quality initial seeds are expected to produce high quality clusters through K-Means. The performances of Seed-Detective and ModEx are compared with the performances of Ex-Detective, PAM, Simple K-Means (SK, Basic Farthest Point Heuristic (BFPH and New Farthest Point Heuristic (NFPH. We use three cluster evaluation criteria namely F-measure, Entropy and Purity and four natural datasets that we obtain from the UCI Machine learning repository. In the datasets our proposed techniques perform better than the existing techniques in terms of F-measure, Entropy and Purity. The sign test results suggest a statistical significance of the superiority of Seed-Detective (and ModEx over the existing techniques.

  16. A Hybrid Technique Based on Combining Fuzzy K-means Clustering and Region Growing for Improving Gray Matter and White Matter Segmentation

    Directory of Open Access Journals (Sweden)

    Ashraf Afifi

    2012-07-01

    Full Text Available In this paper we present a hybrid approach based on combining fuzzy k-means clustering, seed region growing, and sensitivity and specificity algorithms to measure gray (GM and white matter (WM tissue. The proposed algorithm uses intensity and anatomic information for segmenting of MRIs into different tissue classes, especially GM and WM. It starts by partitioning the image into different clusters using fuzzy k-means clustering. The centers of these clusters are the input to the region growing (SRG method for creating the closed regions. The outputs of SRG technique are fed to sensitivity and specificity algorithm to merge the similar regions in one segment. The proposed algorithm is applied to challenging applications: gray matter/white matter segmentation in magnetic resonance image (MRI datasets. The experimental results show that the proposed technique produces accurate and stable results.

  17. An Extension of the Fuzzy Possibilistic Clustering Algorithm Using Type-2 Fuzzy Logic Techniques

    Directory of Open Access Journals (Sweden)

    Elid Rubio

    2017-01-01

    Full Text Available In this work an extension of the Fuzzy Possibilistic C-Means (FPCM algorithm using Type-2 Fuzzy Logic Techniques is presented, and this is done in order to improve the efficiency of FPCM algorithm. With the purpose of observing the performance of the proposal against the Interval Type-2 Fuzzy C-Means algorithm, several experiments were made using both algorithms with well-known datasets, such as Wine, WDBC, Iris Flower, Ionosphere, Abalone, and Cover type. In addition some experiments were performed using another set of test images to observe the behavior of both of the above-mentioned algorithms in image preprocessing. Some comparisons are performed between the proposed algorithm and the Interval Type-2 Fuzzy C-Means (IT2FCM algorithm to observe if the proposed approach has better performance than this algorithm.

  18. Automated tetraploid genotype calling by hierarchical clustering

    Science.gov (United States)

    SNP arrays are transforming breeding and genetics research for autotetraploids. To fully utilize these arrays, however, the relationship between signal intensity and allele dosage must be inferred independently for each marker. We developed an improved computational method to automate this process, ...

  19. Study on Cluster Analysis Used with Laser-Induced Breakdown Spectroscopy

    Science.gov (United States)

    He, Li'ao; Wang, Qianqian; Zhao, Yu; Liu, Li; Peng, Zhong

    2016-06-01

    Supervised learning methods (eg. PLS-DA, SVM, etc.) have been widely used with laser-induced breakdown spectroscopy (LIBS) to classify materials; however, it may induce a low correct classification rate if a test sample type is not included in the training dataset. Unsupervised cluster analysis methods (hierarchical clustering analysis, K-means clustering analysis, and iterative self-organizing data analysis technique) are investigated in plastics classification based on the line intensities of LIBS emission in this paper. The results of hierarchical clustering analysis using four different similarity measuring methods (single linkage, complete linkage, unweighted pair-group average, and weighted pair-group average) are compared. In K-means clustering analysis, four kinds of choosing initial centers methods are applied in our case and their results are compared. The classification results of hierarchical clustering analysis, K-means clustering analysis, and ISODATA are analyzed. The experiment results demonstrated cluster analysis methods can be applied to plastics discrimination with LIBS. supported by Beijing Natural Science Foundation of China (No. 4132063)

  20. iHAT: interactive Hierarchical Aggregation Table for Genetic Association Data

    Directory of Open Access Journals (Sweden)

    Heinrich Julian

    2012-05-01

    Full Text Available Abstract In the search for single-nucleotide polymorphisms which influence the observable phenotype, genome wide association studies have become an important technique for the identification of associations between genotype and phenotype of a diverse set of sequence-based data. We present a methodology for the visual assessment of single-nucleotide polymorphisms using interactive hierarchical aggregation techniques combined with methods known from traditional sequence browsers and cluster heatmaps. Our tool, the interactive Hierarchical Aggregation Table (iHAT, facilitates the visualization of multiple sequence alignments, associated metadata, and hierarchical clusterings. Different color maps and aggregation strategies as well as filtering options support the user in finding correlations between sequences and metadata. Similar to other visualizations such as parallel coordinates or heatmaps, iHAT relies on the human pattern-recognition ability for spotting patterns that might indicate correlation or anticorrelation. We demonstrate iHAT using artificial and real-world datasets for DNA and protein association studies as well as expression Quantitative Trait Locus data.

  1. An Efficient Technique to Implement Similarity Measures in Text Document Clustering using Artificial Neural Networks Algorithm

    Directory of Open Access Journals (Sweden)

    K. Selvi

    2014-12-01

    Full Text Available Pattern recognition, envisaging supervised and unsupervised method, optimization, associative memory and control process are some of the diversified troubles that can be resolved by artificial neural networks. Problem identified: Of late, discovering the required information in massive quantity of data is the challenging tasks. The model of similarity evaluation is the central element in accomplishing a perceptive of variables and perception that encourage behavior and mediate concern. This study proposes Artificial Neural Networks algorithms to resolve similarity measures. In order to apply singular value decomposition the frequency of word pair is established in the given document. (1 Tokenization: The splitting up of a stream of text into words, phrases, signs, or other significant parts is called tokenization. (2 Stop words: Preceding or succeeding to processing natural language data, the words that are segregated is called stop words. (3 Porter stemming: The main utilization of this algorithm is as part of a phrase normalization development that is characteristically completed while setting up in rank recovery technique. (4 WordNet: The compilation of lexical data base for the English language is called as WordNet Based on Artificial Neural Networks, the core part of this study work extends n-gram proposed algorithm. All the phonemes, syllables, letters, words or base pair corresponds in accordance to the application. Future work extends the application of this same similarity measures in various other neural network algorithms to accomplish improved results.

  2. A general strategy to determine the congruence between a hierarchical and a non-hierarchical classification

    Directory of Open Access Journals (Sweden)

    Marín Ignacio

    2007-11-01

    Full Text Available Abstract Background Classification procedures are widely used in phylogenetic inference, the analysis of expression profiles, the study of biological networks, etc. Many algorithms have been proposed to establish the similarity between two different classifications of the same elements. However, methods to determine significant coincidences between hierarchical and non-hierarchical partitions are still poorly developed, in spite of the fact that the search for such coincidences is implicit in many analyses of massive data. Results We describe a novel strategy to compare a hierarchical and a dichotomic non-hierarchical classification of elements, in order to find clusters in a hierarchical tree in which elements of a given "flat" partition are overrepresented. The key improvement of our strategy respect to previous methods is using permutation analyses of ranked clusters to determine whether regions of the dendrograms present a significant enrichment. We show that this method is more sensitive than previously developed strategies and how it can be applied to several real cases, including microarray and interactome data. Particularly, we use it to compare a hierarchical representation of the yeast mitochondrial interactome and a catalogue of known mitochondrial protein complexes, demonstrating a high level of congruence between those two classifications. We also discuss extensions of this method to other cases which are conceptually related. Conclusion Our method is highly sensitive and outperforms previously described strategies. A PERL script that implements it is available at http://www.uv.es/~genomica/treetracker.

  3. Hierarchical Reverberation Mapping

    CERN Document Server

    Brewer, Brendon J

    2013-01-01

    Reverberation mapping (RM) is an important technique in studies of active galactic nuclei (AGN). The key idea of RM is to measure the time lag $\\tau$ between variations in the continuum emission from the accretion disc and subsequent response of the broad line region (BLR). The measurement of $\\tau$ is typically used to estimate the physical size of the BLR and is combined with other measurements to estimate the black hole mass $M_{\\rm BH}$. A major difficulty with RM campaigns is the large amount of data needed to measure $\\tau$. Recently, Fine et al (2012) introduced a new approach to RM where the BLR light curve is sparsely sampled, but this is counteracted by observing a large sample of AGN, rather than a single system. The results are combined to infer properties of the sample of AGN. In this letter we implement this method using a hierarchical Bayesian model and contrast this with the results from the previous stacked cross-correlation technique. We find that our inferences are more precise and allow fo...

  4. Applying multivariate clustering techniques to health data: the 4 types of healthcare utilization in the Paris metropolitan area.

    Directory of Open Access Journals (Sweden)

    Thomas Lefèvre

    Full Text Available Cost containment policies and the need to satisfy patients' health needs and care expectations provide major challenges to healthcare systems. Identification of homogeneous groups in terms of healthcare utilisation could lead to a better understanding of how to adjust healthcare provision to society and patient needs.This study used data from the third wave of the SIRS cohort study, a representative, population-based, socio-epidemiological study set up in 2005 in the Paris metropolitan area, France. The data were analysed using a cross-sectional design. In 2010, 3000 individuals were interviewed in their homes. Non-conventional multivariate clustering techniques were used to determine homogeneous user groups in data. Multinomial models assessed a wide range of potential associations between user characteristics and their pattern of healthcare utilisation.We identified four distinct patterns of healthcare use. Patterns of consumption and the socio-demographic characteristics of users differed qualitatively and quantitatively between these four profiles. Extensive and intensive use by older, wealthier and unhealthier people contrasted with narrow and parsimonious use by younger, socially deprived people and immigrants. Rare, intermittent use by young healthy men contrasted with regular targeted use by healthy and wealthy women.The use of an original technique of massive multivariate analysis allowed us to characterise different types of healthcare users, both in terms of resource utilisation and socio-demographic variables. This method would merit replication in different populations and healthcare systems.

  5. 基于主成分与聚类分析的苹果加工品质评价%Evaluation of apple quality based on principal component and hierarchical cluster analysis

    Institute of Scientific and Technical Information of China (English)

    公丽艳; 孟宪军; 刘乃侨; 毕金峰

    2014-01-01

    The purpose of this study was to investigate the variations in physical and chemical characteristics of apple fruit from 30 varieties grown in the same place using pattern recognition tools. Twenty quality parameters of apple samples (e.g. weight,volume, density, color, hardness, sugar-acid ratio, Vitamin C, etc.) were analyzed. Interrelationships between the parameters and the apple variety were investigated by descriptive statistics, principal component analysis (PCA) and hierarchical cluster analysis (HCA). PCA is a mathematical tool which performs a reduction in data dimensionality and allows the visualisation of underlying structure in experimental data and relationships between data and samples.In hierarchical cluster analysis, samples are grouped on the basis of similarities, without taking into account the information about the class membership. The results obtained following HCA are shown as a dendrogram in which five well-defined clusters are visible. Samples will be grouped in clusters in terms of their nearness or similarity. Cluster analysis uses less information (distances only) than PCA. It is interesting to observe what kind of classification can be made on the basis of distances only. The results showed that density, fruit shape index and water content of 30 apple varieties were not significantly different. The remaining seventeen measurements were investigated by principal component analysis. The first six components represented 83.56% of the total variability on the base of the total variance explained and screen plot of principal component analysis. The first principal component was related to titratable acidity, sugar-acid ratio and solid-acid ratio attributes, which were the taste quality factor. The second principal component was related to L,a, andb attributes, which were the color factor. Following that were sweetness factor, texture factor, quality factor and size factor. The sample score plots visually displayed the relationship between

  6. Treatment Protocols as Hierarchical Structures

    Science.gov (United States)

    Ben-Bassat, Moshe; Carlson, Richard W.; Puri, Vinod K.; Weil, Max Harry

    1978-01-01

    We view a treatment protocol as a hierarchical structure of therapeutic modules. The lowest level of this structure consists of individual therapeutic actions. Combinations of individual actions define higher level modules, which we call routines. Routines are designed to manage limited clinical problems, such as the routine for fluid loading to correct hypovolemia. Combinations of routines and additional actions, together with comments, questions, or precautions organized in a branching logic, in turn, define the treatment protocol for a given disorder. Adoption of this modular approach may facilitate the formulation of treatment protocols, since the physician is not required to prepare complex flowcharts. This hierarchical approach also allows protocols to be updated and modified in a flexible manner. By use of such a standard format, individual components may be fitted together to create protocols for multiple disorders. The technique is suited for computer implementation. We believe that this hierarchical approach may facilitate standarization of patient care as well as aid in clinical teaching. A protocol for acute pancreatitis is used to illustrate this technique.

  7. Comparative Study of K-means and Robust Clustering

    Directory of Open Access Journals (Sweden)

    Shashi Sharma

    2013-09-01

    Full Text Available Data mining is the mechanism of implementing patterns in large amount of data sets involving methods at the intersection of artificial intelligence, machine learning, statistics, and database systems. Clustering is the very big area in which grouping of same type of objects in data mining. Clustering has divided into different categories – partitioned clustering and hierarchical clustering. In this paper we study two types of clustering first is Kmeans which is part of partitioned clustering. Kmeans clustering generates a specific number of disjoint, flat (non-hierarchical clusters. Second clustering is robust clustering which is part of hierarchical clustering. This clustering uses Jaccard coefficient instead of using the distance measures to find the similarity between the data or documents to classify the clusters. We show comparison between Kmeans clustering and robust clustering which is better for categorical data.

  8. A new co-operative inversion strategy via fuzzy clustering technique applied to seismic and magnetotelluric data

    Science.gov (United States)

    Thong Kieu, Duy; Kepic, Anton

    2015-04-01

    Geophysical inversion produces very useful images of earth parameters; however, inversion results usually suffer from inherent non-uniqueness: many subsurface models with different structures and parameters can explain the measurements. To reduce the ambiguity, extra information about the earth's structure and physical properties is needed. This prior information can be extracted from geological principles, prior petrophysical information from well logs, and complementary information from other geophysical methods. Any technique used to constrain inversion should be able to integrate the prior information and to guide updating inversion process in terms of the geological model. In this research, we have adopted fuzzy c-means (FCM) clustering technique for this purpose. FCM is a clustering method that allows us to divide the model of physical parameters into a few clusters of representative values that also may relate to geological units based on the similarity of the geophysical properties. This exploits the fact that in many geological environments the earth is comprised of a few distinctive rock units with different physical properties. Therefore FCM can provide a platform to constrain geophysical inversion, and should tend to produce models that are geologically meaningful. FCM was incorporated in both separate and co-operative inversion processing of seismic and magnetotelluric (MT) data with petrophysical constraints. Using petrophysical information through FCM assists the inversion to build a reliable earth model. In this algorithm, FCM plays a role of guider; it uses the prior information to drive the model update process, and also forming an earth model filled with rocks units rather than smooth transitions when the boundary is in doubt. Where petrophysical information from well logs or core measurement is not locally available the cluster petrophysics may be solved for in inversion as well if some knowledge of how many distinctive geological exist. A

  9. 一种基于分层 AP 的视频关键帧提取方法研究%Research on video key-frame extraction based on hierarchical affinity propagation clustering

    Institute of Scientific and Technical Information of China (English)

    党宏社; 白梅

    2016-01-01

    为从大量的视频资源中高效准确地提取关键帧图像来表达视频的主要内容,针对传统AP聚类方法提取关键帧无法适应大规模图像集的问题,提出一种分层AP的关键帧提取方法。提取所有视频序列的颜色和纹理特征,将待聚类的图像集进行分层,用传统AP聚类方法求取每个图像子集的聚类中心;用得到的聚类中心进行自适应的AP聚类,根据Silhouette指标选取最优的聚类结果,即可得到视频序列的关键帧代表。实验表明,该方法能快速准确地提取视频最优关键帧,在保证保真度指标的同时能提高关键帧提取的压缩比,且适用于不同类型的视频资源。%In order to extract key frames from large‐scale different videos more effectively and accurately ,since traditional AP algorithm is inappropriate to the large‐scale pictures cluste‐ring ,a hierarchical AP method for key frame extraction is proposed .First get the color and texture features of all video sequences ,the pictures set is divided into several subsets ,the tra‐ditional AP is used to obtain the exemplars of each subset ;Then the adaptive AP is imple‐mented on the obtained exemplars ,the key frames of video sequences are extracted according to the index of Silhouette for the best clustering result .The experimental result shows that proposed method is efficient in key‐frame extraction and suitable for all types video re‐sources ,has a high fidelity w hile the compression ratio is improved greatly .

  10. Automatic Hierarchical Color Image Classification

    Directory of Open Access Journals (Sweden)

    Jing Huang

    2003-02-01

    Full Text Available Organizing images into semantic categories can be extremely useful for content-based image retrieval and image annotation. Grouping images into semantic classes is a difficult problem, however. Image classification attempts to solve this hard problem by using low-level image features. In this paper, we propose a method for hierarchical classification of images via supervised learning. This scheme relies on using a good low-level feature and subsequently performing feature-space reconfiguration using singular value decomposition to reduce noise and dimensionality. We use the training data to obtain a hierarchical classification tree that can be used to categorize new images. Our experimental results suggest that this scheme not only performs better than standard nearest-neighbor techniques, but also has both storage and computational advantages.

  11. The Nature and Nurture of Star Clusters

    CERN Document Server

    Elmegreen, Bruce G

    2009-01-01

    Star clusters have hierarchical patterns in space and time, suggesting formation processes in the densest regions of a turbulent interstellar medium. Clusters also have hierarchical substructure when they are young, which makes them all look like the inner mixed parts of a pervasive stellar hierarchy. Young field stars share this distribution, presumably because some of them came from dissolved clusters and others formed in a dispersed fashion in the same gas. The fraction of star formation that ends up in clusters is apparently not constant, but may increase with interstellar pressure. Hierarchical structure explains why stars form in clusters and why many of these clusters are self-bound. It also explains the cluster mass function. Halo globular clusters share many properties of disk clusters, including what appears to be an upper cluster cutoff mass. However, halo globulars are self-enriched and often connected with dwarf galaxy streams. The mass function of halo globulars could have initially been like th...

  12. Fuzzy clustering of physicochemical and biochemical properties of amino acids.

    Science.gov (United States)

    Saha, Indrajit; Maulik, Ujjwal; Bandyopadhyay, Sanghamitra; Plewczynski, Dariusz

    2012-08-01

    In this article, we categorize presently available experimental and theoretical knowledge of various physicochemical and biochemical features of amino acids, as collected in the AAindex database of known 544 amino acid (AA) indices. Previously reported 402 indices were categorized into six groups using hierarchical clustering technique and 142 were left unclustered. However, due to the increasing diversity of the database these indices are overlapping, therefore crisp clustering method may not provide optimal results. Moreover, in various large-scale bioinformatics analyses of whole proteomes, the proper selection of amino acid indices representing their biological significance is crucial for efficient and error-prone encoding of the short functional sequence motifs. In most cases, researchers perform exhaustive manual selection of the most informative indices. These two facts motivated us to analyse the widely used AA indices. The main goal of this article is twofold. First, we present a novel method of partitioning the bioinformatics data using consensus fuzzy clustering, where the recently proposed fuzzy clustering techniques are exploited. Second, we prepare three high quality subsets of all available indices. Superiority of the consensus fuzzy clustering method is demonstrated quantitatively, visually and statistically by comparing it with the previously proposed hierarchical clustered results. The processed AAindex1 database, supplementary material and the software are available at http://sysbio.icm.edu.pl/aaindex/ .

  13. 对基因表达数据进行聚类的一种新型自组织映射模型%Clustering gene expression data using a novel model of self-organizing map

    Institute of Scientific and Technical Information of China (English)

    郝伟; 郁松年; 席福利

    2007-01-01

    Clustering is an important technique for analyzing gene expression data. The self-organizing map is one of the most useful clustering algorithms. However, its applicability is limited by the fact that some knowledge about the data is required prior to clustering. This paper introduces a novel model of self-organizing map (SOM) called growing hierarchical self-organizing map (GHSOM) to cluster gene expression data. The training and growth processes of GHSOM are entirely data driven, requiring no prior knowledge or estimates for parameter specification, thus help find not only the appropriate number of clusters but also the hierarchical relations in the data set. Compared with other clustering algorithms, GHSOM has better accuracy. To validate the results, a novel validation technique is used, known as figure of merit (FOM).

  14. A hierarchical linear model for tree height prediction.

    Science.gov (United States)

    Vicente J. Monleon

    2003-01-01

    Measuring tree height is a time-consuming process. Often, tree diameter is measured and height is estimated from a published regression model. Trees used to develop these models are clustered into stands, but this structure is ignored and independence is assumed. In this study, hierarchical linear models that account explicitly for the clustered structure of the data...

  15. Quasi-Likelihood Techniques in a Logistic Regression Equation for Identifying Simulium damnosum s.l. Larval Habitats Intra-cluster Covariates in Togo.

    Science.gov (United States)

    Jacob, Benjamin G; Novak, Robert J; Toe, Laurent; Sanfo, Moussa S; Afriyie, Abena N; Ibrahim, Mohammed A; Griffith, Daniel A; Unnasch, Thomas R

    2012-01-01

    The standard methods for regression analyses of clustered riverine larval habitat data of Simulium damnosum s.l. a major black-fly vector of Onchoceriasis, postulate models relating observational ecological-sampled parameter estimators to prolific habitats without accounting for residual intra-cluster error correlation effects. Generally, this correlation comes from two sources: (1) the design of the random effects and their assumed covariance from the multiple levels within the regression model; and, (2) the correlation structure of the residuals. Unfortunately, inconspicuous errors in residual intra-cluster correlation estimates can overstate precision in forecasted S.damnosum s.l. riverine larval habitat explanatory attributes regardless how they are treated (e.g., independent, autoregressive, Toeplitz, etc). In this research, the geographical locations for multiple riverine-based S. damnosum s.l. larval ecosystem habitats sampled from 2 pre-established epidemiological sites in Togo were identified and recorded from July 2009 to June 2010. Initially the data was aggregated into proc genmod. An agglomerative hierarchical residual cluster-based analysis was then performed. The sampled clustered study site data was then analyzed for statistical correlations using Monthly Biting Rates (MBR). Euclidean distance measurements and terrain-related geomorphological statistics were then generated in ArcGIS. A digital overlay was then performed also in ArcGIS using the georeferenced ground coordinates of high and low density clusters stratified by Annual Biting Rates (ABR). This data was overlain onto multitemporal sub-meter pixel resolution satellite data (i.e., QuickBird 0.61m wavbands ). Orthogonal spatial filter eigenvectors were then generated in SAS/GIS. Univariate and non-linear regression-based models (i.e., Logistic, Poisson and Negative Binomial) were also employed to determine probability distributions and to identify statistically significant parameter

  16. Little effect of transfer technique instruction and physical fitness training in reducing low back pain among nurses: a cluster randomised intervention study

    DEFF Research Database (Denmark)

    Warming, S; Ebbehøj, N E; Wiese, N;

    2008-01-01

    The aim of this study was to evaluate the effect of a transfer technique education programme (TT) alone or in combination with physical fitness training (TTPT) compared with a control group, who followed their usual routine. Eleven clinical hospital wards were cluster randomised to either...... intervention (six wards) or to control (five wards). The intervention cluster was individually randomised to TT (55 nurses) and TTPT (50 nurses), control (76 nurses). The transfer technique programme was a 4-d course of train-the-trainers to teach transfer technique to their colleagues. The physical training...... consisted of supervised physical fitness training 1 h twice per week for 8 weeks. Implementing transfer technique alone or in combination with physical fitness training among a hospital nursing staff did not, when compared to a control group, show any statistical differences according to self-reported low...

  17. Knee kinematics and kinetics during shuttle run cutting: comparison of the assessments performed with and without the point cluster technique.

    Science.gov (United States)

    Ishii, Hideyuki; Nagano, Yasuharu; Ida, Hirofumi; Fukubayashi, Toru; Maruyama, Takeo

    2011-07-07

    The differences between the assessments performed with and without the point cluster technique (PCT) for knee joint motions during the high-risk movements associated with non-contact anterior cruciate ligament (ACL) injuries have not been reported. This study aims to examine the differences between PCT and non-PCT assessments for knee joint angles and moments during shuttle run cutting. Fourteen high school athletes performed a maximal effort shuttle run cutting task. Motion data were collected by an 8-camera motion analysis system at 200 Hz, and ground reaction force data were recorded using a force plate at 1000 Hz. In both PCT and non-PCT approaches, the knee joint angles were calculated using Euler angle rotations, and the knee joint moments were obtained by solving the Newton-Euler equations using an inverse dynamics technique. For the extension/flexion angle, good agreement was measured between PCT and non-PCT assessments. The abduction angle obtained in the non-PCT assessment was smaller than that obtained with the PCT. An internal rotation angle was obtained in the PCT assessment, whereas a small external rotation angle was obtained in the non-PCT assessment. For the knee joint moments, good agreement between PCT and non-PCT assessments was observed for all the components. The differences in the knee joint angles were attributed in part to the differences in the position of the medial femoral epicondyle. The results suggest that the ACL injury risk during shuttle run cutting is estimated lower in the non-PCT assessment than in the PCT assessment.

  18. Study of the applicability of the curlometer technique with the four Cluster spacecraft in regions close to Earth

    Directory of Open Access Journals (Sweden)

    S. Grimald

    2012-03-01

    Full Text Available Knowledge of the inner magnetospheric current system (intensity, boundaries, evolution is one of the key elements for the understanding of the whole magnetospheric current system. In particular, the calculation of the current density and the study of the changes in the ring current is an active field of research as it is a good proxy for the magnetic activity. The curlometer technique allows the current density to be calculated from the magnetic field measured at four different positions inside a given current sheet using the Maxwell-Ampere's law. In 2009, the CLUSTER perigee pass was located at about 2 RE allowing a study of the ring current deep inside the inner magnetosphere, where the pressure gradient is expected to invert direction. In this paper, we use the curlometer in such an orbit. As the method has never been used so deep inside the inner magnetosphere, this study is a test of the curlometer in a part of the magnetosphere where the magnetic field is very high (about 4000 nT and changes over small distances (ΔB = 1nT in 1000 km. To do so, the curlometer has been applied to calculate the current density from measured and modelled magnetic fields and for different sizes of the tetrahedron. The results show that the current density cannot be calculated using the curlometer technique at low altitude perigee passes, but that the method may be accurate in a [3 RE; 5 RE] or a [6 RE; 8.3 RE] L-shell range. It also demonstrates that the parameters used to estimate the accuracy of the method are necessary, but not sufficient conditions.

  19. The Immersive Virtual Reality Experience: A Typology of Users Revealed Through Multiple Correspondence Analysis Combined with Cluster Analysis Technique.

    Science.gov (United States)

    Rosa, Pedro J; Morais, Diogo; Gamito, Pedro; Oliveira, Jorge; Saraiva, Tomaz

    2016-03-01

    Immersive virtual reality is thought to be advantageous by leading to higher levels of presence. However, and despite users getting actively involved in immersive three-dimensional virtual environments that incorporate sound and motion, there are individual factors, such as age, video game knowledge, and the predisposition to immersion, that may be associated with the quality of virtual reality experience. Moreover, one particular concern for users engaged in immersive virtual reality environments (VREs) is the possibility of side effects, such as cybersickness. The literature suggests that at least 60% of virtual reality users report having felt symptoms of cybersickness, which reduces the quality of the virtual reality experience. The aim of this study was thus to profile the right user to be involved in a VRE through head-mounted display. To examine which user characteristics are associated with the most effective virtual reality experience (lower cybersickness), a multiple correspondence analysis combined with cluster analysis technique was performed. Results revealed three distinct profiles, showing that the PC gamer profile is more associated with higher levels of virtual reality effectiveness, that is, higher predisposition to be immersed and reduced cybersickness symptoms in the VRE than console gamer and nongamer. These findings can be a useful orientation in clinical practice and future research as they help identify which users are more predisposed to benefit from immersive VREs.

  20. Exploring clustering in alpha-conjugate nuclei using the thick target inverse kinematic technique for multiple alpha emission

    Science.gov (United States)

    Barbui, M.; Hagel, K.; Gauthier, J.; Wuenschel, S.; Goldberg, V. Z.; Zheng, H.; Giuliani, G.; Rapisarda, G.; Kim, E.-J.; Liu, X.; Natowitz, J. B.; Desouza, R. T.; Hudan, S.; Fang, D.

    2015-10-01

    Searching for alpha cluster states analogous to the 12C Hoyle state in heavier alpha-conjugate nuclei can provide tests of the existence of alpha condensates in nuclear matter. Such states are predicted for 16O, 20Ne, 24Mg, etc. at excitation energies slightly above the decay threshold. The Thick Target Inverse Kinematics (TTIK) technique can be successfully used to study the breakup of excited self-conjugate nuclei into many alpha particles. The reaction 20Ne + α at 11 and 13 AMeV was studied at Cyclotron Institute at Texas A&M University. Here the TTIK method was used to study both single α-particle emission and multiple α-particle decays. Due to the limited statistics, only events with alpha multiplicity up to three were analyzed. The analysis of the three α-particle emission data allowed the identification of the Hoyle state and other 12C excited states decaying into three alpha particles. The results will be shown and compared with other data available in the literature. Another experiment is planned in August 2015 to study the system 28Si + α at 15 AMeV. Preliminary results will be shown. Supported by the U.S. DOE and the Robert A. Welch Foundation, Grant No. A0330.

  1. In-depth discrimination of aerosol types using multiple clustering techniques over four locations in Indo-Gangetic plains

    Science.gov (United States)

    Bibi, Humera; Alam, Khan; Bibi, Samina

    2016-11-01

    Discrimination of aerosol types is essential over the Indo-Gangetic plain (IGP) because several aerosol types originate from different sources having different atmospheric impacts. In this paper, we analyzed a seasonal discrimination of aerosol types by multiple clustering techniques using AERosol RObotic NETwork (AERONET) datasets for the period 2007-2013 over Karachi, Lahore, Jaipur and Kanpur. We discriminated the aerosols into three major types; dust, biomass burning and urban/industrial. The discrimination was carried out by analyzing different aerosol optical properties such as Aerosol Optical Depth (AOD), Angstrom Exponent (AE), Extinction Angstrom Exponent (EAE), Abortion Angstrom Exponent (AAE), Single Scattering Albedo (SSA) and Real Refractive Index (RRI) and their interrelationship to investigate the dominant aerosol types and to examine the variation in their seasonal distribution. The results revealed that during summer and pre-monsoon, dust aerosols were dominant while during winter and post-monsoon prevailing aerosols were biomass burning and urban industrial, and the mixed type of aerosols were present in all seasons. These types of aerosol discriminated from AERONET were in good agreement with CALIPSO (the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation) measurement.

  2. Generation of linear and nonlinear waves in numerical wave tank using clustering technique-volume of fluid method

    Institute of Scientific and Technical Information of China (English)

    H.SAGHI; M.J.KETABDARI; S.BOOSHI

    2012-01-01

    A two-dimensional (2D) numerical model is developed for the wave simulation and propagation in a wave flume.The fluid flow is assumed to be viscous and incompressible,and the Navier-Stokes and continuity equations are used as the governing equations.The standard κ-ε model is used to model the turbulent flow.The NavierStokes equations are discretized using the staggered grid finite difference method and solved by the simplified marker and cell (SMAC) method. Waves are generated and propagated using a piston type wave maker. An open boundary condition is used at the end of the numerical flume.Some standard tests,such as the lid-driven cavity,the constant unidirectional velocity field,the shearing flow,and the dam-break on the dry bed,are performed to valid the model.To demonstrate the capability and accuracy of the present method,the results of generated waves are compared with available wave theories.Finally,the clustering technique (CT) is used for the mesh generation,and the best condition is suggested.

  3. A Mirroring Theorem and its Application to a New Method of Unsupervised Hierarchical Pattern Classification

    CERN Document Server

    Deepthi, Dasika Ratna

    2009-01-01

    In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping which classifies and subclassifies these samples (ii) There exists a hierarchical classifier which can be constructed by using Mirroring Neural Networks (MNNs) in combination with a clustering algorithm that can approximate this mapping. Thus, the proof of the Mirroring theorem provides a theoretical basis for the existence and a practical feasibility of constructing hierarchical classifiers, given the maps. Our proposed Mirroring Theorem can also be considered as an extension to Kolmogrovs theorem in providing a realistic solution for unsupervised classification. The techniques we develop, are general in nature and have led to the construction of learning machines which are (i) tree like in structure, (ii) modular (iii) with each module running on a common algorithm (tandem a...

  4. Hierarchical Classification of Chinese Documents Based on N-grams

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    We explore the techniques of utilizing N-gram informatio n tocategorize Chinese text documents hierarchically so that the classifier can shak e off the burden of large dictionaries and complex segmentation processing, and subsequently be domain and time independent. A hierarchical Chinese text classif ier is implemented. Experimental results show that hierarchically classifying Chinese text documents based N-grams can achieve satisfactory performance and outperforms the other traditional Chinese text classifiers.

  5. Hierarchical models and chaotic spin glasses

    Science.gov (United States)

    Berker, A. Nihat; McKay, Susan R.

    1984-09-01

    Renormalization-group studies in position space have led to the discovery of hierarchical models which are exactly solvable, exhibiting nonclassical critical behavior at finite temperature. Position-space renormalization-group approximations that had been widely and successfully used are in fact alternatively applicable as exact solutions of hierarchical models, this realizability guaranteeing important physical requirements. For example, a hierarchized version of the Sierpiriski gasket is presented, corresponding to a renormalization-group approximation which has quantitatively yielded the multicritical phase diagrams of submonolayers on graphite. Hierarchical models are now being studied directly as a testing ground for new concepts. For example, with the introduction of frustration, chaotic renormalization-group trajectories were obtained for the first time. Thus, strong and weak correlations are randomly intermingled at successive length scales, and a new microscopic picture and mechanism for a spin glass emerges. An upper critical dimension occurs via a boundary crisis mechanism in cluster-hierarchical variants developed to have well-behaved susceptibilities.

  6. Hierarchical auxetic mechanical metamaterials.

    Science.gov (United States)

    Gatt, Ruben; Mizzi, Luke; Azzopardi, Joseph I; Azzopardi, Keith M; Attard, Daphne; Casha, Aaron; Briffa, Joseph; Grima, Joseph N

    2015-02-11

    Auxetic mechanical metamaterials are engineered systems that exhibit the unusual macroscopic property of a negative Poisson's ratio due to sub-unit structure rather than chemical composition. Although their unique behaviour makes them superior to conventional materials in many practical applications, they are limited in availability. Here, we propose a new class of hierarchical auxetics based on the rotating rigid units mechanism. These systems retain the enhanced properties from having a negative Poisson's ratio with the added benefits of being a hierarchical system. Using simulations on typical hierarchical multi-level rotating squares, we show that, through design, one can control the extent of auxeticity, degree of aperture and size of the different pores in the system. This makes the system more versatile than similar non-hierarchical ones, making them promising candidates for industrial and biomedical applications, such as stents and skin grafts.

  7. Hierarchical Auxetic Mechanical Metamaterials

    Science.gov (United States)

    Gatt, Ruben; Mizzi, Luke; Azzopardi, Joseph I.; Azzopardi, Keith M.; Attard, Daphne; Casha, Aaron; Briffa, Joseph; Grima, Joseph N.

    2015-02-01

    Auxetic mechanical metamaterials are engineered systems that exhibit the unusual macroscopic property of a negative Poisson's ratio due to sub-unit structure rather than chemical composition. Although their unique behaviour makes them superior to conventional materials in many practical applications, they are limited in availability. Here, we propose a new class of hierarchical auxetics based on the rotating rigid units mechanism. These systems retain the enhanced properties from having a negative Poisson's ratio with the added benefits of being a hierarchical system. Using simulations on typical hierarchical multi-level rotating squares, we show that, through design, one can control the extent of auxeticity, degree of aperture and size of the different pores in the system. This makes the system more versatile than similar non-hierarchical ones, making them promising candidates for industrial and biomedical applications, such as stents and skin grafts.

  8. Applied Bayesian Hierarchical Methods

    CERN Document Server

    Congdon, Peter D

    2010-01-01

    Bayesian methods facilitate the analysis of complex models and data structures. Emphasizing data applications, alternative modeling specifications, and computer implementation, this book provides a practical overview of methods for Bayesian analysis of hierarchical models.

  9. Programming with Hierarchical Maps

    DEFF Research Database (Denmark)

    Ørbæk, Peter

    This report desribes the hierarchical maps used as a central data structure in the Corundum framework. We describe its most prominent features, ague for its usefulness and briefly describe some of the software prototypes implemented using the technology....

  10. Catalysis with hierarchical zeolites

    DEFF Research Database (Denmark)

    Holm, Martin Spangsberg; Taarning, Esben; Egeblad, Kresten

    2011-01-01

    Hierarchical (or mesoporous) zeolites have attracted significant attention during the first decade of the 21st century, and so far this interest continues to increase. There have already been several reviews giving detailed accounts of the developments emphasizing different aspects of this research...... topic. Until now, the main reason for developing hierarchical zeolites has been to achieve heterogeneous catalysts with improved performance but this particular facet has not yet been reviewed in detail. Thus, the present paper summaries and categorizes the catalytic studies utilizing hierarchical...... zeolites that have been reported hitherto. Prototypical examples from some of the different categories of catalytic reactions that have been studied using hierarchical zeolite catalysts are highlighted. This clearly illustrates the different ways that improved performance can be achieved with this family...

  11. Dynamic Organization of Hierarchical Memories.

    Science.gov (United States)

    Kurikawa, Tomoki; Kaneko, Kunihiko

    2016-01-01

    In the brain, external objects are categorized in a hierarchical way. Although it is widely accepted that objects are represented as static attractors in neural state space, this view does not take account interaction between intrinsic neural dynamics and external input, which is essential to understand how neural system responds to inputs. Indeed, structured spontaneous neural activity without external inputs is known to exist, and its relationship with evoked activities is discussed. Then, how categorical representation is embedded into the spontaneous and evoked activities has to be uncovered. To address this question, we studied bifurcation process with increasing input after hierarchically clustered associative memories are learned. We found a "dynamic categorization"; neural activity without input wanders globally over the state space including all memories. Then with the increase of input strength, diffuse representation of higher category exhibits transitions to focused ones specific to each object. The hierarchy of memories is embedded in the transition probability from one memory to another during the spontaneous dynamics. With increased input strength, neural activity wanders over a narrower state space including a smaller set of memories, showing more specific category or memory corresponding to the applied input. Moreover, such coarse-to-fine transitions are also observed temporally during transient process under constant input, which agrees with experimental findings in the temporal cortex. These results suggest the hierarchy emerging through interaction with an external input underlies hierarchy during transient process, as well as in the spontaneous activity.

  12. [Cluster analysis in biomedical researches].

    Science.gov (United States)

    Akopov, A S; Moskovtsev, A A; Dolenko, S A; Savina, G D

    2013-01-01

    Cluster analysis is one of the most popular methods for the analysis of multi-parameter data. The cluster analysis reveals the internal structure of the data, group the separate observations on the degree of their similarity. The review provides a definition of the basic concepts of cluster analysis, and discusses the most popular clustering algorithms: k-means, hierarchical algorithms, Kohonen networks algorithms. Examples are the use of these algorithms in biomedical research.

  13. Cluster stability scores for microarray data in cancer studies

    Directory of Open Access Journals (Sweden)

    Ghosh Debashis

    2003-09-01

    Full Text Available Abstract Background A potential benefit of profiling of tissue samples using microarrays is the generation of molecular fingerprints that will define subtypes of disease. Hierarchical clustering has been the primary analytical tool used to define disease subtypes from microarray experiments in cancer settings. Assessing cluster reliability poses a major complication in analyzing output from clustering procedures. While most work has focused on estimating the number of clusters in a dataset, the question of stability of individual-level clusters has not been addressed. Results We address this problem by developing cluster stability scores using subsampling techniques. These scores exploit the redundancy in biologically discriminatory information on the chip. Our approach is generic and can be used with any clustering method. We propose procedures for calculating cluster stability scores for situations involving both known and unknown numbers of clusters. We also develop cluster-size adjusted stability scores. The method is illustrated by application to data three cancer studies; one involving childhood cancers, the second involving B-cell lymphoma, and the final is from a malignant melanoma study. Availability Code implementing the proposed analytic method can be obtained at the second author's website.

  14. Enabling the Discovery of Recurring Anomalies in Aerospace System Problem Reports using High-Dimensional Clustering Techniques

    Science.gov (United States)

    Srivastava, Ashok, N.; Akella, Ram; Diev, Vesselin; Kumaresan, Sakthi Preethi; McIntosh, Dawn M.; Pontikakis, Emmanuel D.; Xu, Zuobing; Zhang, Yi

    2006-01-01

    This paper describes the results of a significant research and development effort conducted at NASA Ames Research Center to develop new text mining techniques to discover anomalies in free-text reports regarding system health and safety of two aerospace systems. We discuss two problems of significant importance in the aviation industry. The first problem is that of automatic anomaly discovery about an aerospace system through the analysis of tens of thousands of free-text problem reports that are written about the system. The second problem that we address is that of automatic discovery of recurring anomalies, i.e., anomalies that may be described m different ways by different authors, at varying times and under varying conditions, but that are truly about the same part of the system. The intent of recurring anomaly identification is to determine project or system weakness or high-risk issues. The discovery of recurring anomalies is a key goal in building safe, reliable, and cost-effective aerospace systems. We address the anomaly discovery problem on thousands of free-text reports using two strategies: (1) as an unsupervised learning problem where an algorithm takes free-text reports as input and automatically groups them into different bins, where each bin corresponds to a different unknown anomaly category; and (2) as a supervised learning problem where the algorithm classifies the free-text reports into one of a number of known anomaly categories. We then discuss the application of these methods to the problem of discovering recurring anomalies. In fact the special nature of recurring anomalies (very small cluster sizes) requires incorporating new methods and measures to enhance the original approach for anomaly detection. ?& pant 0-

  15. Improved Fair-Zone technique using Mobility Prediction in WSN

    CERN Document Server

    Ramesh, K; 10.5121/ijassn.2012.2203

    2012-01-01

    The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has led them to be the most popular choice in ubiquitous computing. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. It has some limitation in energy and mobility of nodes. In this paper we propose a mobility prediction technique which tries overcoming above mentioned problems and improves the life time of the network. The technique used here is Exponential Moving Average for online updates of nodal contact probability in cluster based network.

  16. Hierarchical linear regression models for conditional quantiles

    Institute of Scientific and Technical Information of China (English)

    TIAN Maozai; CHEN Gemai

    2006-01-01

    The quantile regression has several useful features and therefore is gradually developing into a comprehensive approach to the statistical analysis of linear and nonlinear response models,but it cannot deal effectively with the data with a hierarchical structure.In practice,the existence of such data hierarchies is neither accidental nor ignorable,it is a common phenomenon.To ignore this hierarchical data structure risks overlooking the importance of group effects,and may also render many of the traditional statistical analysis techniques used for studying data relationships invalid.On the other hand,the hierarchical models take a hierarchical data structure into account and have also many applications in statistics,ranging from overdispersion to constructing min-max estimators.However,the hierarchical models are virtually the mean regression,therefore,they cannot be used to characterize the entire conditional distribution of a dependent variable given high-dimensional covariates.Furthermore,the estimated coefficient vector (marginal effects)is sensitive to an outlier observation on the dependent variable.In this article,a new approach,which is based on the Gauss-Seidel iteration and taking a full advantage of the quantile regression and hierarchical models,is developed.On the theoretical front,we also consider the asymptotic properties of the new method,obtaining the simple conditions for an n1/2-convergence and an asymptotic normality.We also illustrate the use of the technique with the real educational data which is hierarchical and how the results can be explained.

  17. Cluster evaluation of Brazilian and Moroccan goat populations using physical measurements

    Directory of Open Access Journals (Sweden)

    Luanna Chácara Pires

    2013-10-01

    Full Text Available The aim of this study was to compare the genetic diversity of 12 populations of goats in Brazil and Morocco (n = 796 through the use of physical measurements and different multivariate techniques. Traits measured included wither height (WH, distance from the brisket to the ground (BH and ear length (EL. The standardized Euclidean distance (D was adopted. The D values were submitted to clustering analysis using hierarchical methods (from nearest neighbor and UPGMA - Unweighted Pair Group Method with Arithmetic Mean and the numbers of clusters were analyzed using the Tocher optimization method. The population clustering was different depending on the method of analysis used. Among the hierarchical methods, UPGMA showed the best fit (CCC = 0.82. The Tocher method enabled the formation of four different clusters. Although the hierarchical and Tocher methods resulted in different cluster formations, both contributed to the interpretation of the genetic cluster divergence. The results obtained through UPGMA and Tocher optimization enable their use for future studies that may include a larger number of biometric variables on greater numbers of individuals and additional populations.

  18. The association between content of the elements S, Cl, K, Fe, Cu, Zn and Br in normal and cirrhotic liver tissue from Danes and Greenlandic Inuit examined by dual hierarchical clustering analysis

    DEFF Research Database (Denmark)

    Laursen, Jens; Milman, Nils; Pind, N.;

    2014-01-01

    contents according to calculated similarities, one clustering elements according to correlation coefficients between the element contents, both using Euclidian distance and Ward Procedure. RESULTS: One dendrogram separated subjects in 7 clusters showing no differences in ethnicity, gender or age....... The analysis discriminated between elements in normal and cirrhotic livers. The other dendrogram clustered elements in four clusters: sulphur and chlorine; copper and bromine; potassium and zinc; iron. There were significant correlations between the elements in normal liver samples: S was associated with Cl, K...

  19. The relationships between electricity consumption and GDP in Asian countries, using hierarchical structure methods

    Science.gov (United States)

    Kantar, Ersin; Keskin, Mustafa

    2013-11-01

    This study uses hierarchical structure methods (minimal spanning tree (MST) and hierarchical tree (HT)) to examine the relationship between energy consumption and economic growth in a sample of 30 Asian countries covering the period 1971-2008. These countries are categorized into four panels based on the World Bank income classification, namely high, upper middle, lower middle, and low income. In particular, we use the data of electricity consumption and real gross domestic product (GDP) per capita to detect the topological properties of the countries. We show a relationship between electricity consumption and economic growth by using the MST and HT. We also use the bootstrap technique to investigate a value of the statistical reliability to the links of the MST. Finally, we use a clustering linkage procedure in order to observe the cluster structure. The results of the structural topologies of these trees are as follows: (i) we identified different clusters of countries according to their geographical location and economic growth, (ii) we found a strong relationship between energy consumption and economic growth for all income groups considered in this study and (iii) the results are in good agreement with the causal relationship between electricity consumption and economic growth.

  20. Clustering Approach to Stock Market Prediction

    Directory of Open Access Journals (Sweden)

    M.Suresh Babu

    2012-01-01

    Full Text Available Clustering is an adaptive procedure in which objects are clustered or grouped together, based on the principle of maximizing the intra-class similarity and minimizing the inter-class similarity. Various clustering algorithms have been developed which results to a good performance on datasets for cluster formation. This paper analyze the major clustering algorithms: K-Means, Hierarchical clustering algorithm and reverse K means and compare the performance of these three major clustering algorithms on the aspect of correctly class wise cluster building ability of algorithm. An effective clustering method, HRK (Hierarchical agglomerative and Recursive K-means clustering is proposed, to predict the short-term stock price movements after the release of financial reports. The proposed method consists of three phases. First, we convert each financial report into a feature vector and use the hierarchical agglomerative clustering method to divide the converted feature vectors into clusters. Second, for each cluster, we recursively apply the K-means clustering method to partition each cluster into sub-clusters so that most feature vectors in each subcluster belong to the same class. Then, for each sub cluster, we choose its centroid as the representative feature vector. Finally, we employ the representative feature vectors to predict the stock price movements. The experimental results show the proposed method outperforms SVM in terms of accuracy and average profits.

  1. Analyzing security protocols in hierarchical networks

    DEFF Research Database (Denmark)

    Zhang, Ye; Nielson, Hanne Riis

    2006-01-01

    Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus...... capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series...

  2. The star cluster - field star connection in nearby spiral galaxies I. Data analysis techniques and application to NGC 4395

    CERN Document Server

    Silva-Villa, E

    2010-01-01

    It is generally assumed that a large fraction of stars are initially born in clusters. However, a large fraction of these disrupt on short timescales and the stars end up belonging to the field. Understanding this process is of paramount importance if we wish to constrain the star formation histories of external galaxies using star clusters. We attempt to understand the relation between field stars and star clusters by simultaneously studying both in a number of nearby galaxies. As a pilot study, we present results for the late-type spiral NGC 4395 using HST/ACS and HST/WFPC2 images. Different detection criteria were used to distinguish point sources (star candidates) and extended objects (star cluster candidates). Using a synthetic CMD method, we estimated the star formation history. Using simple stellar population model fitting, we calculated the mass and age of the cluster candidates. The field star formation rate appears to have been roughly constant, or to have possibly increased by up to about a factor ...

  3. Strategic games on a hierarchical network model

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Among complex network models, the hierarchical network model is the one most close to such real networks as world trade web, metabolic network, WWW, actor network, and so on. It has not only the property of power-law degree distribution, but growth based on growth and preferential attachment, showing the scale-free degree distribution property. In this paper, we study the evolution of cooperation on a hierarchical network model, adopting the prisoner's dilemma (PD) game and snowdrift game (SG) as metaphors of the interplay between connected nodes. BA model provides a unifying framework for the emergence of cooperation. But interestingly, we found that on hierarchical model, there is no sign of cooperation for PD game, while the frequency of cooperation decreases as the common benefit decreases for SG. By comparing the scaling clustering coefficient properties of the hierarchical network model with that of BA model, we found that the former amplifies the effect of hubs. Considering different performances of PD game and SG on complex network, we also found that common benefit leads to cooperation in the evolution. Thus our study may shed light on the emergence of cooperation in both natural and social environments.

  4. Clustering of resting state networks.

    Directory of Open Access Journals (Sweden)

    Megan H Lee

    Full Text Available BACKGROUND: The goal of the study was to demonstrate a hierarchical structure of resting state activity in the healthy brain using a data-driven clustering algorithm. METHODOLOGY/PRINCIPAL FINDINGS: The fuzzy-c-means clustering algorithm was applied to resting state fMRI data in cortical and subcortical gray matter from two groups acquired separately, one of 17 healthy individuals and the second of 21 healthy individuals. Different numbers of clusters and different starting conditions were used. A cluster dispersion measure determined the optimal numbers of clusters. An inner product metric provided a measure of similarity between different clusters. The two cluster result found the task-negative and task-positive systems. The cluster dispersion measure was minimized with seven and eleven clusters. Each of the clusters in the seven and eleven cluster result was associated with either the task-negative or task-positive system. Applying the algorithm to find seven clusters recovered previously described resting state networks, including the default mode network, frontoparietal control network, ventral and dorsal attention networks, somatomotor, visual, and language networks. The language and ventral attention networks had significant subcortical involvement. This parcellation was consistently found in a large majority of algorithm runs under different conditions and was robust to different methods of initialization. CONCLUSIONS/SIGNIFICANCE: The clustering of resting state activity using different optimal numbers of clusters identified resting state networks comparable to previously obtained results. This work reinforces the observation that resting state networks are hierarchically organized.

  5. Hierarchical Neural Network Structures for Phoneme Recognition

    CERN Document Server

    Vasquez, Daniel; Minker, Wolfgang

    2013-01-01

    In this book, hierarchical structures based on neural networks are investigated for automatic speech recognition. These structures are evaluated on the phoneme recognition task where a  Hybrid Hidden Markov Model/Artificial Neural Network paradigm is used. The baseline hierarchical scheme consists of two levels each which is based on a Multilayered Perceptron. Additionally, the output of the first level serves as a second level input. The computational speed of the phoneme recognizer can be substantially increased by removing redundant information still contained at the first level output. Several techniques based on temporal and phonetic criteria have been investigated to remove this redundant information. The computational time could be reduced by 57% whilst keeping the system accuracy comparable to the baseline hierarchical approach.

  6. A study of hierarchical structure on South China industrial electricity-consumption correlation

    Science.gov (United States)

    Yao, Can-Zhong; Lin, Ji-Nan; Liu, Xiao-Feng

    2016-02-01

    Based on industrial electricity-consumption data of five southern provinces of China from 2005 to 2013, we study the industrial correlation mechanism with MST (minimal spanning tree) and HT (hierarchical tree) models. First, we comparatively analyze the industrial electricity-consumption correlation structure in pre-crisis and after-crisis period using MST model and Bootstrap technique of statistical reliability test of links. Results exhibit that all industrial electricity-consumption trees of five southern provinces of China in pre-crisis and after-crisis time are in formation of chain, and the "center-periphery structure" of those chain-like trees is consistent with industrial specialization in classical industrial chain theory. Additionally, the industrial structure of some provinces is reorganized and transferred in pre-crisis and after-crisis time. Further, the comparative analysis with hierarchical tree and Bootstrap technique demonstrates that as for both observations of GD and overall NF, the industrial electricity-consumption correlation is non-significant clustered in pre-crisis period, whereas it turns significant clustered in after-crisis time. Therefore we propose that in perspective of electricity-consumption, their industrial structures are directed to optimized organization and global correlation. Finally, the analysis of distance of HTs verifies that industrial reorganization and development may strengthen market integration, coordination and correlation of industrial production. Except GZ, other four provinces have a shorter distance of industrial electricity-consumption correlation in after-crisis period, revealing a better performance of regional specialization and integration.

  7. Hierarchical organisation of Britain through percolation theory

    CERN Document Server

    Arcaute, Elsa; Hatna, Erez; Murcio, Roberto; Vargas-Ruiz, Camilo; Masucci, Paolo; Wang, Jiaqiu; Batty, Michael

    2015-01-01

    Urban systems present hierarchical structures at many different scales. These are observed as administrative regional delimitations, which are the outcome of geographical, political and historical constraints. Using percolation theory on the street intersections and on the road network of Britain, we obtain hierarchies at different scales that are independent of administrative arrangements. Natural boundaries, such as islands and National Parks, consistently emerge at the largest/regional scales. Cities are devised through recursive percolations on each of the emerging clusters, but the system does not undergo a phase transition at the distance threshold at which cities can be defined. This specific distance is obtained by computing the fractal dimension of the clusters extracted at each distance threshold. We observe that the fractal dimension presents a maximum over all the different distance thresholds. The clusters obtained at this maximum are in very good correspondence to the morphological definition of...

  8. Hierarchical Porous Structures

    Energy Technology Data Exchange (ETDEWEB)

    Grote, Christopher John [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2016-06-07

    Materials Design is often at the forefront of technological innovation. While there has always been a push to generate increasingly low density materials, such as aero or hydrogels, more recently the idea of bicontinuous structures has gone more into play. This review will cover some of the methods and applications for generating both porous, and hierarchically porous structures.

  9. Zinc oxide's hierarchical nanostructure and its photocatalytic properties

    DEFF Research Database (Denmark)

    Kanjwal, Muzafar Ahmed; Sheikh, Faheem A.; Barakat, Nasser A. M.

    2012-01-01

    In this study, a new hierarchical nanostructure that consists of zinc oxide (ZnO) was produced by the electrospinning process followed by a hydrothermal technique. First, electrospinning of a colloidal solution that consisted of zinc nanoparticles, zinc acetate dihydrate and poly(vinyl alcohol) w...... technique was used. Methylene blue dihydrate was used to check the photocatalytic ability of the produced nanostructures. The results indicated that the hierarchical nanostructure had a better performance than the other form....

  10. Cluster analysis

    CERN Document Server

    Everitt, Brian S; Leese, Morven; Stahl, Daniel

    2011-01-01

    Cluster analysis comprises a range of methods for classifying multivariate data into subgroups. By organizing multivariate data into such subgroups, clustering can help reveal the characteristics of any structure or patterns present. These techniques have proven useful in a wide range of areas such as medicine, psychology, market research and bioinformatics.This fifth edition of the highly successful Cluster Analysis includes coverage of the latest developments in the field and a new chapter dealing with finite mixture models for structured data.Real life examples are used throughout to demons

  11. Very accurate Distances and Radii of Open Cluster Cepheids from a Near-Infrared Surface Brightness Technique

    CERN Document Server

    Gieren, W P; Gomes, M J; Gieren, Wolfgang P.; Fouque, Pascal; Gomez, Matias

    1997-01-01

    We have obtained the radii and distances of 16 galactic Cepheids supposed to be members in open clusters or associations using the new optical and near-infrared calibrations of the surface brightness (Barnes-Evans) method given by Fouque & Gieren (1997). We discuss in detail possible systematic errors in our infrared solutions and conclude that the typical total uncertainty of the infrared distance and radius of a Cepheid is about 3 percent in both infrared solutions, provided that the data are of excellent quality and that the amplitude of the color curve used in the solution is larger than ~0.3 mag. We compare the adopted infrared distances of the Cepheid variables to the ZAMS-fitting distances of their supposed host clusters and associations and find an unweighted mean value of the distance ratio of 1.02 +- 0.04. A detailed discussion of the individual Cepheids shows that the uncertainty of the ZAMS-fitting distances varies considerably from cluster to cluster. We find clear evidence that four Cepheids...

  12. The star cluster-field star connection in nearby spiral galaxies. I. Data analysis techniques and application to NGC 4395

    NARCIS (Netherlands)

    Silva-Villa, E.; Larsen, S.S.

    2010-01-01

    Context. It is generally assumed that a large fraction of stars are initially born in clusters. However, a large fraction of these disrupt on short timescales and the stars end up belonging to the field. Understanding this process is of paramount importance if we wish to constrain the star formation

  13. Infrared absorption of methanol-water clusters (CH3OH)n(H2O), n = 1-4, recorded with the VUV-ionization/IR-depletion technique

    Science.gov (United States)

    Lee, Yu-Fang; Kelterer, Anne-Marie; Matisz, Gergely; Kunsági-Máté, Sándor; Chung, Chao-Yu; Lee, Yuan-Pern

    2017-04-01

    We recorded infrared (IR) spectra in the CH- and OH-stretching regions of size-selected clusters of methanol (M) with one water molecule (W), represented as MnW, n = 1-4, in a pulsed supersonic jet using the photoionization/IR-depletion technique. Vacuum ultraviolet emission at 118 nm served as the source of ionization in a time-of-flight mass spectrometer to detect clusters MnW as protonated forms Mn-1WH+. The variations in intensities of Mn-1WH+ were monitored as the wavelength of the IR laser light was tuned across the range 2700-3800 cm-1. IR spectra of size-selected clusters were obtained on processing of the observed action spectra of the related cluster-ions according to a mechanism that takes into account the production and loss of each cluster due to IR photodissociation. Spectra of methanol-water clusters in the OH region show significant variations as the number of methanol molecules increases, whereas those in the CH region are similar for all clusters. Scaled harmonic vibrational wavenumbers and relative IR intensities predicted with the M06-2X/aug-cc-pVTZ method for the methanol-water clusters are consistent with our experimental results. For dimers, absorption bands of a structure WM with H2O as a hydrogen-bond donor were observed at 3570, 3682, and 3722 cm-1, whereas weak bands of MW with methanol as a hydrogen-bond donor were observed at 3611 and 3753 cm-1. For M2W, the free OH band of H2O was observed at 3721 cm-1, whereas a broad feature was deconvoluted to three bands near 3425, 3472, and 3536 cm-1, corresponding to the three hydrogen-bonded OH-stretching modes in a cyclic structure. For M3W, the free OH shifted to 3715 cm-1, and the hydrogen-bonded OH-stretching bands became much broader, with a weak feature near 3179 cm-1 corresponding to the symmetric OH-stretching mode of a cyclic structure. For M4W, the observed spectrum agrees unsatisfactorily with predictions for the most stable cyclic structure, indicating significant contributions from

  14. Cancer detection based on Raman spectra super-paramagnetic clustering

    Science.gov (United States)

    González-Solís, José Luis; Guizar-Ruiz, Juan Ignacio; Martínez-Espinosa, Juan Carlos; Martínez-Zerega, Brenda Esmeralda; Juárez-López, Héctor Alfonso; Vargas-Rodríguez, Héctor; Gallegos-Infante, Luis Armando; González-Silva, Ricardo Armando; Espinoza-Padilla, Pedro Basilio; Palomares-Anda, Pascual

    2016-08-01

    The clustering of Raman spectra of serum sample is analyzed using the super-paramagnetic clustering technique based in the Potts spin model. We investigated the clustering of biochemical networks by using Raman data that define edge lengths in the network, and where the interactions are functions of the Raman spectra's individual band intensities. For this study, we used two groups of 58 and 102 control Raman spectra and the intensities of 160, 150 and 42 Raman spectra of serum samples from breast and cervical cancer and leukemia patients, respectively. The spectra were collected from patients from different hospitals from Mexico. By using super-paramagnetic clustering technique, we identified the most natural and compact clusters allowing us to discriminate the control and cancer patients. A special interest was the leukemia case where its nearly hierarchical observed structure allowed the identification of the patients's leukemia type. The goal of this study is to apply a model of statistical physics, as the super-paramagnetic, to find these natural clusters that allow us to design a cancer detection method. To the best of our knowledge, this is the first report of preliminary results evaluating the usefulness of super-paramagnetic clustering in the discipline of spectroscopy where it is used for classification of spectra.

  15. The Application of Hierarchical Cluster Analysis to the Prediction of Grain Security of Small Research Areas-A Case Study of Kunshan%谱系聚类法在小区域粮食安全预测中的应用——以昆山市为例

    Institute of Scientific and Technical Information of China (English)

    姚鑫; 杨桂山; 万荣荣

    2011-01-01

    粮食安全对国民经济的可持续发展起着不可替代的基础性作用,小区域由于受政策因素的影响较大,粮食安全相关指标的变化呈一定阶段性,长时间序列的数学规律并不突出,不利于规划工作的展开.论文基于昆山市的研究,提出谱系聚类与数学模型相结合的基本思路,在此基础上推出了聚类结果有效性的量化判定标准并对聚类法运用准则做了深入的探讨.实际数据分析结果表明:昆山的粮食安全相关的社会经济指标变化确实呈明显阶段性;与利用全部时间序列数据建立的模型相比,运用谱系聚类的模型拟合和预测效果都有明显优势;至2015年,昆山市粮食自给率将下降至6%,最小人均耕地面积降低至0.022 hm2.通过进一步的分析、对比及讨论,文章认为,谱系聚类法运用于小区域粮食安全预测,方法可操作性强,结论科学性显著.%Grain security is fundamental to the sustainable development of our society and national economy. As research regions with small area are vulnerable to the impacts of policy changes, indexes related to grain security of these areas often change in the form of stages, which means that the mathematical regularity of long-term datasets is not significant. As a result, it is difficult to implement grain security programming for the future.We put forward a new method of combining hierarchical cluster analysis with traditional mathematical models, and established a quantification standard for the validity judgment of the clustering results. Meanwhile, a criterion for the using of hierarchical cluster analysis was also proposed, but we strongly recommended that mass data from other research areas are needed to calibrate and perfect it.Kunshan ( 1985 -2007 ) was chosen as a study region to prove the new method, because it is small in area but with rapid economic development. The results of analysis showed that: the indexes related to grain security did

  16. Hierarchical State Machines as Modular Horn Clauses

    Directory of Open Access Journals (Sweden)

    Pierre-Loïc Garoche

    2016-07-01

    Full Text Available In model based development, embedded systems are modeled using a mix of dataflow formalism, that capture the flow of computation, and hierarchical state machines, that capture the modal behavior of the system. For safety analysis, existing approaches rely on a compilation scheme that transform the original model (dataflow and state machines into a pure dataflow formalism. Such compilation often result in loss of important structural information that capture the modal behaviour of the system. In previous work we have developed a compilation technique from a dataflow formalism into modular Horn clauses. In this paper, we present a novel technique that faithfully compile hierarchical state machines into modular Horn clauses. Our compilation technique preserves the structural and modal behavior of the system, making the safety analysis of such models more tractable.

  17. Cluster analysis of WIBS single particle bioaerosol data

    Directory of Open Access Journals (Sweden)

    N. H. Robinson

    2012-09-01

    Full Text Available Hierarchical agglomerative cluster analysis was performed on single-particle multi-spatial datasets comprising optical diameter, asymmetry and three different fluorescence measurements, gathered using two dual Waveband Integrated Bioaerosol Sensor (WIBS. The technique is demonstrated on measurements of various fluorescent and non-fluorescent polystyrene latex spheres (PSL before being applied to two separate contemporaneous ambient WIBS datasets recorded in a forest site in Colorado, USA as part of the BEACHON-RoMBAS project. Cluster analysis results between both datasets are consistent. Clusters are tentatively interpreted by comparison of concentration time series and cluster average measurement values to the published literature (of which there is a paucity to represent: non-fluorescent accumulation mode aerosol; bacterial agglomerates; and fungal spores. To our knowledge, this is the first time cluster analysis has been applied to long term online PBAP measurements. The novel application of this clustering technique provides a means for routinely reducing WIBS data to discrete concentration time series which are more easily interpretable, without the need for any a priori assumptions concerning the expected aerosol types. It can reduce the level of subjectivity compared to the more standard analysis approaches, which are typically performed by simple inspection of various ensemble data products. It also has the advantage of potentially resolving less populous or subtly different particle types. This technique is likely to become more robust in the future as fluorescence-based aerosol instrumentation measurement precision, dynamic range and the number of available metrics is improved.

  18. Cluster analysis of WIBS single particle bioaerosol data

    Science.gov (United States)

    Robinson, N. H.; Allan, J. D.; Huffman, J. A.; Kaye, P. H.; Foot, V. E.; Gallagher, M.

    2012-09-01

    Hierarchical agglomerative cluster analysis was performed on single-particle multi-spatial datasets comprising optical diameter, asymmetry and three different fluorescence measurements, gathered using two dual Waveband Integrated Bioaerosol Sensor (WIBS). The technique is demonstrated on measurements of various fluorescent and non-fluorescent polystyrene latex spheres (PSL) before being applied to two separate contemporaneous ambient WIBS datasets recorded in a forest site in Colorado, USA as part of the BEACHON-RoMBAS project. Cluster analysis results between both datasets are consistent. Clusters are tentatively interpreted by comparison of concentration time series and cluster average measurement values to the published literature (of which there is a paucity) to represent: non-fluorescent accumulation mode aerosol; bacterial agglomerates; and fungal spores. To our knowledge, this is the first time cluster analysis has been applied to long term online PBAP measurements. The novel application of this clustering technique provides a means for routinely reducing WIBS data to discrete concentration time series which are more easily interpretable, without the need for any a priori assumptions concerning the expected aerosol types. It can reduce the level of subjectivity compared to the more standard analysis approaches, which are typically performed by simple inspection of various ensemble data products. It also has the advantage of potentially resolving less populous or subtly different particle types. This technique is likely to become more robust in the future as fluorescence-based aerosol instrumentation measurement precision, dynamic range and the number of available metrics is improved.

  19. Modeling the deformation behavior of nanocrystalline alloy with hierarchical microstructures

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Hongxi; Zhou, Jianqiu, E-mail: zhouj@njtech.edu.cn [Nanjing Tech University, Department of Mechanical Engineering (China); Zhao, Yonghao, E-mail: yhzhao@njust.edu.cn [Nanjing University of Science and Technology, Nanostructural Materials Research Center, School of Materials Science and Engineering (China)

    2016-02-15

    A mechanism-based plasticity model based on dislocation theory is developed to describe the mechanical behavior of the hierarchical nanocrystalline alloys. The stress–strain relationship is derived by invoking the impeding effect of the intra-granular solute clusters and the inter-granular nanostructures on the dislocation movements along the sliding path. We found that the interaction between dislocations and the hierarchical microstructures contributes to the strain hardening property and greatly influence the ductility of nanocrystalline metals. The analysis indicates that the proposed model can successfully describe the enhanced strength of the nanocrystalline hierarchical alloy. Moreover, the strain hardening rate is sensitive to the volume fraction of the hierarchical microstructures. The present model provides a new perspective to design the microstructures for optimizing the mechanical properties in nanostructural metals.

  20. Neural Mechanisms of Hierarchical Planning in a Virtual Subway Network.

    Science.gov (United States)

    Balaguer, Jan; Spiers, Hugo; Hassabis, Demis; Summerfield, Christopher

    2016-05-18

    Planning allows actions to be structured in pursuit of a future goal. However, in natural environments, planning over multiple possible future states incurs prohibitive computational costs. To represent plans efficiently, states can be clustered hierarchically into "contexts". For example, representing a journey through a subway network as a succession of individual states (stations) is more costly than encoding a sequence of contexts (lines) and context switches (line changes). Here, using functional brain imaging, we asked humans to perform a planning task in a virtual subway network. Behavioral analyses revealed that humans executed a hierarchically organized plan. Brain activity in the dorsomedial prefrontal cortex and premotor cortex scaled with the cost of hierarchical plan representation and unique neural signals in these regions signaled contexts and context switches. These results suggest that humans represent hierarchical plans using a network of caudal prefrontal structures. VIDEO ABSTRACT.

  1. Classifying hospitals as mortality outliers: logistic versus hierarchical logistic models.

    Science.gov (United States)

    Alexandrescu, Roxana; Bottle, Alex; Jarman, Brian; Aylin, Paul

    2014-05-01

    The use of hierarchical logistic regression for provider profiling has been recommended due to the clustering of patients within hospitals, but has some associated difficulties. We assess changes in hospital outlier status based on standard logistic versus hierarchical logistic modelling of mortality. The study population consisted of all patients admitted to acute, non-specialist hospitals in England between 2007 and 2011 with a primary diagnosis of acute myocardial infarction, acute cerebrovascular disease or fracture of neck of femur or a primary procedure of coronary artery bypass graft or repair of abdominal aortic aneurysm. We compared standardised mortality ratios (SMRs) from non-hierarchical models with SMRs from hierarchical models, without and with shrinkage estimates of the predicted probabilities (Model 1 and Model 2). The SMRs from standard logistic and hierarchical models were highly statistically significantly correlated (r > 0.91, p = 0.01). More outliers were recorded in the standard logistic regression than hierarchical modelling only when using shrinkage estimates (Model 2): 21 hospitals (out of a cumulative number of 565 pairs of hospitals under study) changed from a low outlier and 8 hospitals changed from a high outlier based on the logistic regression to a not-an-outlier based on shrinkage estimates. Both standard logistic and hierarchical modelling have identified nearly the same hospitals as mortality outliers. The choice of methodological approach should, however, also consider whether the modelling aim is judgment or improvement, as shrinkage may be more appropriate for the former than the latter.

  2. A Mirroring Theorem and its Application to a New Method of Unsupervised Hierarchical Pattern Classification

    Directory of Open Access Journals (Sweden)

    Dasika Ratna Deepthi

    2009-10-01

    Full Text Available In this paper, we prove a crucial theorem called “Mirroring Theorem” which affirms that given a collection of samples with enough information in it such that it can be classified into classes and sub-classes then (i There exists a mapping which classifies and subclassifies these samples (ii There exists a hierarchical classifier which can be constructed by using Mirroring Neural Networks (MNNs in combination with a clustering algorithm that can approximate this mapping. Thus, the proof of the Mirroring theorem provides a theoretical basis for the existence and a practical feasibility of constructing hierarchical classifiers, given the maps. Our proposed Mirroring Theorem can also be considered as an extension to Kolmogrov’s theorem in providing a realistic solution for unsupervised classification. The techniques we develop, are general in nature and have led to the construction of learning machines which are (i tree like in structure, (ii modular (iii with each module running on a common algorithm (tandem algorithm and (iv self-supervised. We have actually built the architecture, developed the tandem algorithm of such a hierarchical classifier and demonstrated it on an example problem.

  3. 苏里格气田丛式井组快速钻井技术%Faster Drilling Technique of Cluster Wells in Su Lige Gas Field

    Institute of Scientific and Technical Information of China (English)

    欧阳勇; 吴学升; 高云文; 黄占盈; 白明娜

    2011-01-01

    The unique feature of "low permeable sublayer, low porosity" in Su Iige leads to the low productivity , small well spacing, dense well network of single well, and it is located in the desert, the ecology environment is weak, which is more suitable to be developed with the cluster wells, but the long building cycle time, high drilling cost and something else elements influence the popularization of cluster wells. To achieve the strategic objective of low cost development in Su Lige gas field, it is very important to improve the drilling speed of cluster well. Aimed at the problem of cluster well drilling process in Su Lige, according to the technique research of the amount optimization of well cluster, construction of well cut plane, optimization of PDC drill bit and optimization of make up of string, a faster drilling technique scheme of cluster wells is generated and received the preferable effect in the well site.%苏里格气田“低孔、低渗”的特点决定了其单井产量低、井距小、井网密,而其地处沙漠,生态环境脆弱,更适宜采用丛式井组开发.但从式井施工周期长、钻井成本高等因素影响了从式井组的推广应用.为实现苏里气田低成本开发的战略目标,提高丛式井钻井速度就显得尤为重要.针对苏里格丛式井钻井过程存在的难题,通过井组数优化、井身剖面设计、PDC钻头的优选以及钻具组合的优化等技术研究,形成了一套苏里格气田丛式井组快速钻井的的技术方案,在现场实施中取得了较好的效果.

  4. Spatial access method for urban geospatial database management: An efficient approach of 3D vector data clustering technique

    DEFF Research Database (Denmark)

    Azri, Suhaibah; Ujang, Uznir; Rahman, Alias Abdul

    2014-01-01

    D geospatial data clustering to be used in the construction of 3D R-Tree and respectively could reduce the overlapping among nodes. The proposed method is tested on 3D urban dataset for the application of urban infill development. By using several cases of data updating operations such as building...... infill, building demolition and building modification, the proposed method indicates that the percentage of overlapping coverage among nodes is reduced compared with other existing approaches....

  5. Detection and mapping of water pollution variation in the Nile Delta using multivariate clustering and GIS techniques.

    Science.gov (United States)

    Shaban, M; Urban, B; El Saadi, A; Faisal, M

    2010-08-01

    The limited water resources of Egypt lead to widespread water-stress. Consequently, the use of marginal water sources, such as agricultural drainage waters, provides one of the national feasible solutions to the problem. However, the marginal quality of the drainage waters may restrict their use. The objective of this research is to develop a tool for planning and managing the reuse of agricultural drainage water for irrigation in the Nile Delta. This is achieved by classifying the pollution levels of drainage water into several categories using a statistical clustering approach that may ensure simple but accurate information about the pollution levels and water characteristics at any point within the drainage system. The derived clusters are then visualized by using a Geographical Information System (GIS) to draw thematic maps based on the entire Nile Delta, thus making GIS as a decision support system. The obtained maps may assist the decision makers in managing and controlling pollution in the Nile Delta regions. The clustering process also provides an effective overview of those spots in the Nile Delta where intensified monitoring activities are required. Consequently, the obtained results make a major contribution to the assessment and redesign of the Egyptian national water quality monitoring network.

  6. Collaborative Hierarchical Sparse Modeling

    CERN Document Server

    Sprechmann, Pablo; Sapiro, Guillermo; Eldar, Yonina C

    2010-01-01

    Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is done by solving an l_1-regularized linear regression problem, usually called Lasso. In this work we first combine the sparsity-inducing property of the Lasso model, at the individual feature level, with the block-sparsity property of the group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the hierarchical Lasso, which shows important practical modeling advantages. We then extend this approach to the collaborative case, where a set of simultaneously coded signals share the same sparsity pattern at the higher (group) level but not necessarily at the lower one. Signals then share the same active groups, or classes, but not necessarily the same active set. This is very well suited for applications such as source separation. An efficient optimization procedure, which guarantees convergence to the global opt...

  7. Heuristics for Hierarchical Partitioning with Application to Model Checking

    DEFF Research Database (Denmark)

    Möller, Michael Oliver; Alur, Rajeev

    2001-01-01

    Given a collection of connected components, it is often desired to cluster together parts of strong correspondence, yielding a hierarchical structure. We address the automation of this process and apply heuristics to battle the combinatorial and computational complexity. We define a cost function...

  8. Hierarchical manifold learning.

    Science.gov (United States)

    Bhatia, Kanwal K; Rao, Anil; Price, Anthony N; Wolz, Robin; Hajnal, Jo; Rueckert, Daniel

    2012-01-01

    We present a novel method of hierarchical manifold learning which aims to automatically discover regional variations within images. This involves constructing manifolds in a hierarchy of image patches of increasing granularity, while ensuring consistency between hierarchy levels. We demonstrate its utility in two very different settings: (1) to learn the regional correlations in motion within a sequence of time-resolved images of the thoracic cavity; (2) to find discriminative regions of 3D brain images in the classification of neurodegenerative disease,

  9. HDS: Hierarchical Data System

    Science.gov (United States)

    Pearce, Dave; Walter, Anton; Lupton, W. F.; Warren-Smith, Rodney F.; Lawden, Mike; McIlwrath, Brian; Peden, J. C. M.; Jenness, Tim; Draper, Peter W.

    2015-02-01

    The Hierarchical Data System (HDS) is a file-based hierarchical data system designed for the storage of a wide variety of information. It is particularly suited to the storage of large multi-dimensional arrays (with their ancillary data) where efficient access is needed. It is a key component of the Starlink software collection (ascl:1110.012) and is used by the Starlink N-Dimensional Data Format (NDF) library (ascl:1411.023). HDS organizes data into hierarchies, broadly similar to the directory structure of a hierarchical filing system, but contained within a single HDS container file. The structures stored in these files are self-describing and flexible; HDS supports modification and extension of structures previously created, as well as functions such as deletion, copying, and renaming. All information stored in HDS files is portable between the machines on which HDS is implemented. Thus, there are no format conversion problems when moving between machines. HDS can write files in a private binary format (version 4), or be layered on top of HDF5 (version 5).

  10. Application of Multi-SOM clustering approach to macrophage gene expression analysis.

    Science.gov (United States)

    Ghouila, Amel; Yahia, Sadok Ben; Malouche, Dhafer; Jmel, Haifa; Laouini, Dhafer; Guerfali, Fatma Z; Abdelhak, Sonia

    2009-05-01

    The production of increasingly reliable and accessible gene expression data has stimulated the development of computational tools to interpret such data and to organize them efficiently. The clustering techniques are largely recognized as useful exploratory tools for gene expression data analysis. Genes that show similar expression patterns over a wide range of experimental conditions can be clustered together. This relies on the hypothesis that genes that belong to the same cluster are coregulated and involved in related functions. Nevertheless, clustering algorithms still show limits, particularly for the estimation of the number of clusters and the interpretation of hierarchical dendrogram, which may significantly influence the outputs of the analysis process. We propose here a multi level SOM based clustering algorithm named Multi-SOM. Through the use of clustering validity indices, Multi-SOM overcomes the problem of the estimation of clusters number. To test the validity of the proposed clustering algorithm, we first tested it on supervised training data sets. Results were evaluated by computing the number of misclassified samples. We have then used Multi-SOM for the analysis of macrophage gene expression data generated in vitro from the same individual blood infected with 5 different pathogens. This analysis led to the identification of sets of tightly coregulated genes across different pathogens. Gene Ontology tools were then used to estimate the biological significance of the clustering, which showed that the obtained clusters are coherent and biologically significant.

  11. An Experiment in Automatic Hierarchical Document Classification.

    Science.gov (United States)

    Garland, Kathleen

    1983-01-01

    Describes method of automatic document classification in which documents classed as QA by Library of Congress classification system were clustered at six thresholds by keyword using single link technique. Automatically generated clusters were compared to Library of Congress subclasses, and partial classified hierarchy was formed. Twelve references…

  12. A Cosmic Watershed: the WVF Void Detection Technique

    CERN Document Server

    Platen, Erwin; Jones, Bernard J T

    2007-01-01

    On megaparsec scales the Universe is permeated by an intricate filigree of clusters, filaments, sheets and voids, the Cosmic Web. For the understanding of its dynamical and hierarchical history it is crucial to identify objectively its complex morphological components. One of the most characteristic aspects is that of the dominant underdense Voids, the product of a hierarchical process driven by the collapse of minor voids in addition to the merging of large ones. In this study we present an objective void finder technique which involves a minimum of assumptions about the scale, structure and shape of voids. Our void finding method, the Watershed Void Finder (WVF), is based upon the Watershed Transform, a well-known technique for the segmentation of images. Importantly, the technique has the potential to trace the existing manifestations of a void hierarchy. The basic watershed transform is augmented by a variety of correction procedures to remove spurious structure resulting from sampling noise. This study c...

  13. Heavy hitters via cluster-preserving clustering

    DEFF Research Database (Denmark)

    Larsen, Kasper Green; Nelson, Jelani; Nguyen, Huy L.

    2016-01-01

    , providing correctness whp. In fact, a simpler version of our algorithm for p = 1 in the strict turnstile model answers queries even faster than the "dyadic trick" by roughly a log n factor, dominating it in all regards. Our main innovation is an efficient reduction from the heavy hitters to a clustering...... problem in which each heavy hitter is encoded as some form of noisy spectral cluster in a much bigger graph, and the goal is to identify every cluster. Since every heavy hitter must be found, correctness requires that every cluster be found. We thus need a "cluster-preserving clustering" algorithm......, that partitions the graph into clusters with the promise of not destroying any original cluster. To do this we first apply standard spectral graph partitioning, and then we use some novel combinatorial techniques to modify the cuts obtained so as to make sure that the original clusters are sufficiently preserved...

  14. CLASH-X: A Comparison of Lensing and X-ray Techniques for Measuring the Mass Profiles of Galaxy Clusters

    CERN Document Server

    Donahue, Megan; Mahdavi, Andisheh; Umetsu, Keiichi; Ettori, Stefano; Merten, Julian; Postman, Marc; Hoffer, Aaron; Baldi, Alessandro; Coe, Dan; Czakon, Nicole; Bartelmann, Mattias; Benitez, Narciso; Bouwens, Rychard; Bradley, Larry; Broadhurst, Tom; Ford, Holland; Gastaldello, Fabio; Grillo, Claudio; Infante, Leopoldo; Jouvel, Stephanie; Koekemoer, Anton; Kelson, Daniel; Lahav, Ofer; Lemze, Doron; Medezinski, Elinor; Melchior, Peter; Meneghetti, Massimo; Molino, Alberto; Moustakas, John; Moustakas, Leonidas A; Nonino, Mario; Rosati, Piero; Sayers, Jack; Seitz, Stella; Van der Wel, Arjen; Zheng, Wei; Zitrin, Adi

    2014-01-01

    We present profiles of temperature, gas mass, and hydrostatic mass estimated from X-ray observations of CLASH clusters. We compare measurements from XMM and Chandra and compare both sets to CLASH gravitational lensing mass profiles. We find that Chandra and XMM measurements of electron density and enclosed gas mass as functions of radius are nearly identical, indicating that any differences in hydrostatic masses inferred from X-ray observations arise from differences in gas-temperature estimates. Encouragingly, gas temperatures measured in clusters by XMM and Chandra are consistent with one another at ~100 kpc radii but XMM temperatures systematically decline relative to Chandra temperatures as the radius of the temperature measurement increases. One plausible reason for this trend is large-angle scattering of soft X-ray photons in excess of that amount expected from the standard XMM PSF correction. We present the CLASH-X mass-profile comparisons in the form of cosmology-independent and redshift-independent c...

  15. Understanding the Impact of Human Mobility Patterns on Taxi Drivers’ Profitability Using Clustering Techniques: A Case Study in Wuhan, China

    Directory of Open Access Journals (Sweden)

    Hasan A. H. Naji

    2017-06-01

    Full Text Available Taxi trajectories reflect human mobility over the urban roads’ network. Although taxi drivers cruise the same city streets, there is an observed variation in their daily profit. To reveal the reasons behind this issue, this study introduces a novel approach for investigating and understanding the impact of human mobility patterns (taxi drivers’ behavior on daily drivers’ profit. Firstly, a K-means clustering method is adopted to group taxi drivers into three profitability groups according to their driving duration, driving distance and income. Secondly, the cruising trips and stopping spots for each profitability group are extracted. Thirdly, a comparison among the profitability groups in terms of spatial and temporal patterns on cruising trips and stopping spots is carried out. The comparison applied various methods including the mash map matching method and DBSCAN clustering method. Finally, an overall analysis of the results is discussed in detail. The results show that there is a significant relationship between human mobility patterns and taxi drivers’ profitability. High profitability drivers based on their experience earn more compared to other driver groups, as they know which places are more active to cruise and to stop and at what times. This study provides suggestions and insights for taxi companies and taxi drivers in order to increase their daily income and to enhance the efficiency of the taxi industry.

  16. Analysis of computer-aided detection techniques and signal characteristics for clustered microcalcifications on digital mammography and digital breast tomosynthesis

    Science.gov (United States)

    Samala, Ravi K.; Chan, Heang-Ping; Hadjiiski, Lubomir M.; Helvie, Mark A.

    2016-10-01

    With IRB approval, digital breast tomosynthesis (DBT) images of human subjects were collected using a GE GEN2 DBT prototype system. Corresponding digital mammograms (DMs) of the same subjects were collected retrospectively from patient files. The data set contained a total of 237 views of DBT and equal number of DM views from 120 human subjects, each included 163 views with microcalcification clusters (MCs) and 74 views without MCs. The data set was separated into training and independent test sets. The pre-processing, object prescreening and segmentation, false positive reduction and clustering strategies for MC detection by three computer-aided detection (CADe) systems designed for DM, DBT, and a planar projection image generated from DBT were analyzed. Receiver operating characteristic (ROC) curves based on features extracted from microcalcifications and free-response ROC (FROC) curves based on scores from MCs were used to quantify the performance of the systems. Jackknife FROC (JAFROC) and non-parametric analysis methods were used to determine the statistical difference between the FROC curves. The difference between the CADDM and CADDBT systems when the false positive rate was estimated from cases without MCs did not reach statistical significance. The study indicates that the large search space in DBT may not be a limiting factor for CADe to achieve similar performance as that observed in DM.

  17. Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization

    CERN Document Server

    Gillis, Nicolas

    2011-01-01

    Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing, hyperspectral data analysis, computational biology, and clustering. In this paper, we consider two well-known algorithms designed to solve NMF problems, namely the multiplicative updates of Lee and Seung and the hierarchical alternating least squares of Cichocki et al. We propose a simple way to significantly accelerate their convergence, based on a careful analysis of the computational cost needed at each iteration. This acceleration technique can also be applied to other algorithms, which we illustrate on the projected gradient method of Lin. The efficiency of the accelerated algorithms is empirically demonstrated on image and text datasets, and compares favorably with a state-of-the-art alternating nonnegative least squares algorithm. Finally, we provide a theoretical argument based on the properties of NMF and its solutions that explains in particular the very ...

  18. Detecting gravitational-wave transients at five sigma: a hierarchical approach

    CERN Document Server

    Thrane, Eric

    2015-01-01

    As second-generation gravitational-wave detectors prepare to analyze data at unprecedented sensitivity, there is great interest in searches for unmodeled transients, commonly called bursts. Significant effort has yielded a variety of techniques to identify and characterize such transient signals, and many of these methods have been applied to produce astrophysical results using data from first-generation detectors. However, the computational cost of background estimation remains a challenging problem; it is difficult to claim a 5{\\sigma} detection with reasonable computational resources without paying for efficiency with reduced sensitivity. We demonstrate a hierarchical approach to gravitational-wave transient detection, focusing on long-lived signals, which can be used to detect transients with significance in excess of 5{\\sigma} using modest computational resources. In particular, we show how previously developed seedless clustering techniques can be applied to large datasets to identify high-significance ...

  19. HIERARCHICAL CLASSIFICATION OF POLARIMETRIC SAR IMAGE BASED ON STATISTICAL REGION MERGING

    Directory of Open Access Journals (Sweden)

    F. Lang

    2012-07-01

    Full Text Available Segmentation and classification of polarimetric SAR (PolSAR imagery are very important for interpretation of PolSAR data. This paper presents a new object-oriented classification method which is based on Statistical Region Merging (SRM segmentation algorithm and a two-level hierarchical clustering technique. The proposed method takes full advantage of the polarimetric information contained in the PolSAR data, and takes both effectiveness and efficiency into account according to the characteristic of PolSAR. A modification of over-merging to over-segmentation technique and a post processing of segmentation for SRM is proposed according to the application of classification. And a revised symmetric Wishart distance is derived from the Wishart PDF. Segmentation and classification results of AirSAR L-band PolSAR data over the Flevoland test site is shown to demonstrate the validity of the proposed method.

  20. Detecting Gravitational-Wave Transients at 5σ: A Hierarchical Approach.

    Science.gov (United States)

    Thrane, Eric; Coughlin, Michael

    2015-10-30

    As second-generation gravitational-wave detectors prepare to analyze data at unprecedented sensitivity, there is great interest in searches for unmodeled transients, commonly called bursts. Significant effort has yielded a variety of techniques to identify and characterize such transient signals, and many of these methods have been applied to produce astrophysical results using data from first-generation detectors. However, the computational cost of background estimation remains a challenging problem; it is difficult to claim a 5σ detection with reasonable computational resources without paying for efficiency with reduced sensitivity. We demonstrate a hierarchical approach to gravitational-wave transient detection, focusing on long-lived signals, which can be used to detect transients with significance in excess of 5σ using modest computational resources. In particular, we show how previously developed seedless clustering techniques can be applied to large data sets to identify high-significance candidates without having to trade sensitivity for speed.