Extended fast search clustering algorithm: widely density clusters, no density peaks

CFSFDP (clustering by fast search and find of density peaks) is recently developed density-based clustering algorithm. Compared to DBSCAN, it needs less parameters and is computationally cheap for its non-iteration. Alex. at al have demonstrated its power by many applications. However, CFSFDP performs not well when there are more than one density peak for one cluster, what we name as "no density peaks". In this paper, inspired by the idea of a hierarchical clustering algorithm CHAMELEON, we propose an extension of CFSFDP,E_CFSFDP, to adapt more applications. In particular, we take use of original CFSFDP to generating initial clusters first, then merge the sub clusters in the second phase. We have conducted the algorithm to several data sets, of which, there are "no density peaks". Experiment results show that our approach outperforms the original one due to it breaks through the strict claim of data sets.Comment: 18 pages, 10 figures, DBDM 201

Detecting High Impedance Fault in Power Distribution Feeder with Fuzzy Subtractive Clustering Model

An irregular activity on electric power distribution feeder, which does not draw adequate fault current to be detected by general protective devices, is called as High impedance fault (HIF). This paper presents the algorithm for HIF detection based on the amplitude of third and fifth harmonics of current, voltage and power. This paper proposes an intelligent algorithm using the Takagi Sugeno- Kang (TSK) fuzzy modeling approach based on subtractive clustering to detect the high impedance fault. The Fast Fourier Transformation (FFT) is used to extract the feature of the faulted signals and other power system events. The effect of capacitor bank switching, non-linear load current, no-load line switching and other normal event on distribution feeder harmonics is discussed. The HIF and other operation event data were obtained by simulation of a 13.8 kV distribution feeder using PSCAD. It is evident from the outcomes that the proposed algorithm can effectively differentiate the HIFs from other events in power distribution feeder

Angpow: a software for the fast computation of accurate tomographic power spectra

The statistical distribution of galaxies is a powerful probe to constrain cosmological models and gravity. In particular the matter power spectrum $P(k)$ brings information about the cosmological distance evolution and the galaxy clustering together. However the building of $P(k)$ from galaxy catalogues needs a cosmological model to convert angles on the sky and redshifts into distances, which leads to difficulties when comparing data with predicted $P(k)$ from other cosmological models, and for photometric surveys like LSST. The angular power spectrum $C_\ell(z_1,z_2)$ between two bins located at redshift $z_1$ and $z_2$ contains the same information than the matter power spectrum, is free from any cosmological assumption, but the prediction of $C_\ell(z_1,z_2)$ from $P(k)$ is a costly computation when performed exactly. The Angpow software aims at computing quickly and accurately the auto ($z_1=z_2$) and cross ($z_1 \neq z_2$) angular power spectra between redshift bins. We describe the developed algorithm, based on developments on the Chebyshev polynomial basis and on the Clenshaw-Curtis quadrature method. We validate the results with other codes, and benchmark the performance. Angpow is flexible and can handle any user defined power spectra, transfer functions, and redshift selection windows. The code is fast enough to be embedded inside programs exploring large cosmological parameter spaces through the $C_\ell(z_1,z_2)$ comparison with data. We emphasize that the Limber's approximation, often used to fasten the computation, gives wrong $C_\ell$ values for cross-correlations.Comment: Published in Astronomy & Astrophysic

The Lazy Bootstrap. A Fast Resampling Method for Evaluating Latent Class Model Fit

The latent class model is a powerful unsupervised clustering algorithm for categorical data. Many statistics exist to test the fit of the latent class model. However, traditional methods to evaluate those fit statistics are not always useful. Asymptotic distributions are not always known, and empirical reference distributions can be very time consuming to obtain. In this paper we propose a fast resampling scheme with which any type of model fit can be assessed. We illustrate it here on the latent class model, but the methodology can be applied in any situation. The principle behind the lazy bootstrap method is to specify a statistic which captures the characteristics of the data that a model should capture correctly. If those characteristics in the observed data and in model-generated data are very different we can assume that the model could not have produced the observed data. With this method we achieve the flexibility of tests from the Bayesian framework, while only needing maximum likelihood estimates. We provide a step-wise algorithm with which the fit of a model can be assessed based on the characteristics we as researcher find important. In a Monte Carlo study we show that the method has very low type I errors, for all illustrated statistics. Power to reject a model depended largely on the type of statistic that was used and on sample size. We applied the method to an empirical data set on clinical subgroups with risk of Myocardial infarction and compared the results directly to the parametric bootstrap. The results of our method were highly similar to those obtained by the parametric bootstrap, while the required computations differed three orders of magnitude in favour of our method.Comment: This is an adaptation of chapter of a PhD dissertation available at https://pure.uvt.nl/portal/files/19030880/Kollenburg_Computer_13_11_2017.pd

Adaptive Neural Subtractive Clustering Fuzzy Inference System for the Detection of High Impedance Fault on Distribution Power System

High impedance fault (HIF) is abnormal event on electric power distribution feeder which does not draw enough fault current to be detected by conventional protective devices. The algorithm for HIF detection based on the amplitude ratio of second and odd harmonics to fundamental is presented. This paper proposes an intelligent algorithm using an adaptive neural- Takagi Sugeno-Kang (TSK) fuzzy modeling approach based on subtractive clustering to detect high impedance fault. It is integrating the learning capabilities of neural network to the fuzzy logic system robustness in the sense that fuzzy logic concepts are embedded in the network structure. It also provides a natural framework for combining both numerical information in the form of input/output pairs and linguistic information in the form of IF– THEN rules in a uniform fashion. Fast Fourier Transformation (FFT) is used to extract the features of the fault signal and other power system events. The effect of capacitor banks switching, non-linear load current, no-load line switching and other normal event on distribution feeder harmonics is discussed. HIF and other operation event data were obtained by simulation of a 13.8 kV distribution feeder using PSCAD. The results show that the proposed algorithm can distinguish successfully HIFs from other events in distribution power syste

Harnessing machine learning for fiber-induced nonlinearity mitigation in long-haul coherent optical OFDM

© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Coherent optical orthogonal frequency division multiplexing (CO-OFDM) has attracted a lot of interest in optical fiber communications due to its simplified digital signal processing (DSP) units, high spectral-efficiency, flexibility, and tolerance to linear impairments. However, CO-OFDM’s high peak-to-average power ratio imposes high vulnerability to fiber-induced non-linearities. DSP-based machine learning has been considered as a promising approach for fiber non-linearity compensation without sacrificing computational complexity. In this paper, we review the existing machine learning approaches for CO-OFDM in a common framework and review the progress in this area with a focus on practical aspects and comparison with benchmark DSP solutions.Peer reviewe

Compressive Spectral Clustering

Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix to define a feature vector for each object, and run k-means on these features to separate objects into k classes. Each of these three steps becomes computationally intensive for large N and/or k. We propose to speed up the last two steps based on recent results in the emerging field of graph signal processing: graph filtering of random signals, and random sampling of bandlimited graph signals. We prove that our method, with a gain in computation time that can reach several orders of magnitude, is in fact an approximation of spectral clustering, for which we are able to control the error. We test the performance of our method on artificial and real-world network data.Comment: 12 pages, 2 figure