Evidential relational clustering using medoids

In real clustering applications, proximity data, in which only pairwise similarities or dissimilarities are known, is more general than object data, in which each pattern is described explicitly by a list of attributes. Medoid-based clustering algorithms, which assume the prototypes of classes are objects, are of great value for partitioning relational data sets. In this paper a new prototype-based clustering method, named Evidential C-Medoids (ECMdd), which is an extension of Fuzzy C-Medoids (FCMdd) on the theoretical framework of belief functions is proposed. In ECMdd, medoids are utilized as the prototypes to represent the detected classes, including specific classes and imprecise classes. Specific classes are for the data which are distinctly far from the prototypes of other classes, while imprecise classes accept the objects that may be close to the prototypes of more than one class. This soft decision mechanism could make the clustering results more cautious and reduce the misclassification rates. Experiments in synthetic and real data sets are used to illustrate the performance of ECMdd. The results show that ECMdd could capture well the uncertainty in the internal data structure. Moreover, it is more robust to the initializations compared with FCMdd.Comment: in The 18th International Conference on Information Fusion, July 2015, Washington, DC, USA , Jul 2015, Washington, United State

Detecting sterile neutrinos with KATRIN like experiments

A sterile neutrino with mass in the eV range, mixing with the electron antineutrino, is allowed and possibly even preferred by cosmology and oscillation experiments. If such eV-mass neutrinos exist they provide a much better target for direct detection in beta decay experiments than the active neutrinos which are expected to have sub-eV masses. Their relatively high mass would allow for an easy separation from the primary decay signal in experiments such as KATRIN.Comment: 23 pages, 7 figures. References & Figures updated. Text reviewed and revised. Accepted for publication JCA

SIFTing the relevant from the irrelevant: Automatically detecting objects in training images

Many state-of-the-art object recognition systems rely on identifying the location of objects in images, in order to better learn its visual attributes. In this paper, we propose four simple yet powerful hybrid ROI detection methods (combining both local and global features), based on frequently occurring keypoints. We show that our methods demonstrate competitive performance in two different types of datasets, the Caltech101 dataset and the GRAZ-02 dataset, where the pairs of keypoint bounding box method achieved the best accuracies overall

Statistical Network Analysis for Functional MRI: Summary Networks and Group Comparisons

Comparing weighted networks in neuroscience is hard, because the topological properties of a given network are necessarily dependent on the number of edges of that network. This problem arises in the analysis of both weighted and unweighted networks. The term density is often used in this context, in order to refer to the mean edge weight of a weighted network, or to the number of edges in an unweighted one. Comparing families of networks is therefore statistically difficult because differences in topology are necessarily associated with differences in density. In this review paper, we consider this problem from two different perspectives, which include (i) the construction of summary networks, such as how to compute and visualize the mean network from a sample of network-valued data points; and (ii) how to test for topological differences, when two families of networks also exhibit significant differences in density. In the first instance, we show that the issue of summarizing a family of networks can be conducted by adopting a mass-univariate approach, which produces a statistical parametric network (SPN). In the second part of this review, we then highlight the inherent problems associated with the comparison of topological functions of families of networks that differ in density. In particular, we show that a wide range of topological summaries, such as global efficiency and network modularity are highly sensitive to differences in density. Moreover, these problems are not restricted to unweighted metrics, as we demonstrate that the same issues remain present when considering the weighted versions of these metrics. We conclude by encouraging caution, when reporting such statistical comparisons, and by emphasizing the importance of constructing summary networks.Comment: 16 pages, 5 figure

Energy Disaggregation for SMEs using Recurrence Quantification Analysis

Energy disaggregation determines the energy consumption of individual appliances from the total demand signal, which is recorded using a single monitoring device. There are varied approaches to this problem, which are applied to different settings. Here, we focus on small and medium enterprises (SMEs) and explore useful applications for energy disaggregation from the perspective of SMEs. More precisely, we use recurrence quantification analysis (RQA) of the aggregate and the individual device signals to create a two-dimensional map, which is an outlined region in a reduced information space that corresponds to ‘normal’ energy demand. Then, this map is used to monitor and control future energy consumption within the example business so to improve their energy efficiency practices. In particular, our proposed method is shown to detect when an appliance may be faulty and if an unexpected, additional device is in use