Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Construction of a reliable similarity matrix is fundamental for graph-based clustering methods. However, most of the current work is built upon some simple manifold structure, whereas limited work has been conducted on nonlinear data sets where data reside in a union of manifolds rather than a union of subspaces. Therefore, we construct a similarity graph to capture both global and local manifold...
This paper studies feasibility and scalable computing processes for visualizing big high dimensional data in a 3 dimensional space by using dimension reduction techniques. More specifically, we propose an unsupervised approach to compute a measure that is called visualizability in a 3 dimensional space for a high dimensional data. This measure of visualizability is computed based on the comparison...
Open64 is an open source compiler with powerful analysis and widely used as a research and commercial development platform. However, it has not been designed and developed to realize MPI parallelization. There are many contributions in the paper. Firstly, the Open64 compiler infrastructure is showed. Secondly, the location of MPI code generation in the Open64 compiler architecture is analyzed. Thirdly,...
Estimation of bias field together with the tissue class of a noisy Magnetic Resonance image has been a challenging task because of the nonlinear nature of bias field. In order to address this issue we have proposed two new schemes. The first one is the recursive framework, where class labels and bias fields have been estimated simultaneously. In one part of the recursion, a variable variance Adaptive...
Anomaly detection in hyperspectral images aims at detecting small size objects of unknown spectra. The major problem with anomaly detection is the absence of prior knowledge. Consequently, the extraction of true anomalies from the background and noise is a challenging task. In fact, the image scene already contains the background, noises and anomalous pixels and even in presence of prior knowledge,...
The density peak based clustering algorithm is a recently proposed clustering approach. It uses the local density of each data and the distance to the nearest neighbor with higher density to isolate and identify the cluster centers. After the cluster centers are identified, the other data are assigned labels equaling to those of their nearest neighbors with higher density. This algorithm is simple...
The density peak based clustering algorithm is a simple yet effective clustering approach. This algorithm firstly calculates the local density of each data and the distance to the nearest neighbor with higher density. Based on the assumption that cluster centers are density peaks and they are relatively far from each other, this algorithm isolates the candidates of cluster centers from the non-center...
The clustering algorithm by fast search and find of density peaks is shown to be a promising clustering approach. However, this algorithm involves manual selection of cluster centers, which is not convenient in practical applications. In this paper we discuss the correlation between density peaks and cluster centers. As a result, we present a new local density estimation method to highlight the uniqueness...
The recently proposed clustering algorithm based on density peaks is reported to generate very good clustering results. This algorithm is simple and efficient, and can be used to generate clusters of arbitrary shapes. However, the performance of this algorithm relies on the selection of the kernel in local density calculation. The original density peak based algorithm uses the cutoff kernel and Gaussian...
Environmental sensors monitor supercomputing facility health, generating massive data in the largest facilities. Current state-of-the-art is for human operators to evaluate environmental data by hand. This approach will not be viable on Exascale machines, nor is it ideal on current systems. We evaluate effectiveness of the DBSCAN algorithm for identifying anomalies in supercomputing sensor data. We...
In clustering applications, multiple views of the data are often available. Although clustering could be done within each view independently, exploiting information across views is promising to gain clustering accuracy improvement. A common assumption in the field of multi-view learning is that the clustering results from multiple views should be consistent with a latent clustering. However, the potential...
Kernel-based K-means clustering has gained popularity due to its simplicity and the power of its implicit non-linear representation of the data. A dominant concern is the memory requirement since memory scales as the square of the number of data points. We provide a new analysis of a class of approximate kernel methods that have more modest memory requirements, and propose a specific one-pass randomized...
Support vector clustering (SVC) is a versatile clustering technique that is able to identify clusters of arbitrary shapes by exploiting the kernel trick. However, one hurdle that restricts the application of SVC lies in its sensitivity to the kernel parameter and the trade-off parameter. Although many extensions of SVC have been developed, to the best of our knowledge, there is still no algorithm...
Data can encapsulate different object groupings in subspaces of arbitrary dimension and orientation. Finding such subspaces and the groupings within them is the goal of generalized subspace clustering. In this work we present a generalized subspace clustering technique capable of finding multiple non-redundant clusterings in arbitrarily-oriented subspaces. We use Independent Subspace Analysis (ISA)...
We consider a task of classifying normal and pathological brain networks. These networks (called connectomes) represent macroscale connections between predefined brain regions, hence, the nodes of connectomes are uniquely labeled and the set of labels (brain regions) is the same across different brains. We make use of this property and hypothesize that connectomes obtained from normal and pathological...
This paper discusses the Correntropy Induced Metric (CIM) based Growing Neural Gas (GNG) architecture. CIM is a kernel method based similarity measurement from the information theoretic learning perspective, which quantifies the similarity between probability distributions of input and reference vectors. We apply CIM to find a maximum error region and node insert criterion, instead of euclidean distance...
In this paper the problem of segmentation of vol- umetric medical images is considered. The fast and effective segmentation is obtained by applying the proposed approach which combines the idea of supervoxels and the Fuzzy C-Means algorithm. In particular, Fuzzy C-Means is used to cluster supervoxels produced by the fast 3D region growing. Additional acceleration of the method is achieved with the...
Data explosion drives data analysis tools to update faster and faster, while clustering plays an indispensable role in knowledge discovery. Whereas, most of the clustering algorithms only effect on those linear separable data. Kernel-based clustering methods perform well on data sets with non-linear inner structure, but at the same time, the requirement of large memory and running time induce poor...
This article introduces a spectral method for statistical subspace clustering. The method is built upon standard kernel spectral clustering techniques, however carefully tuned by theoretical understanding arising from random matrix findings. We show in particular that our method provides high clustering performance while standard kernel choices provably fail. An application to user grouping based...
Non-negative Matrix Factorization (NMF) has been widely studied and applied to variant computer vision tasks, such as image clustering and pattern classification. Meanwhile, real world stimuli for human neural system (e.g., face images) are usually represented as high-dimensional data vectors rely on graph embedding in original Euclidean space. Thus, the traditional NMF and its variants exhibit weakness...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.