Search results for "CLUSTER"

Modelling Systemic Cojumps with Hawkes Factor Models

2013

Instabilities in the price dynamics of a large number of financial assets are a clear sign of systemic events. By investigating a set of 20 high cap stocks traded at the Italian Stock Exchange, we find that there is a large number of high frequency cojumps. We show that the dynamics of these jumps is described neither by a multivariate Poisson nor by a multivariate Hawkes model. We introduce a Hawkes one factor model which is able to capture simultaneously the time clustering of jumps and the high synchronization of jumps across assets.

Towards Controlled Synthesis of Water-Soluble Gold Nanoclusters : Synthesis and Analysis

2019

Water-soluble gold nanoclusters with well-defined molecular structures and stability possess particular biophysical properties making them excellent candidates for biological applications as well as for fundamental spectroscopic studies. The currently existing synthetic protocols for atomically monodisperse thiolate-protected gold nanoclusters (AuMPCs) have been widely expanded with organothiolates, yet the direct synthesis reports for water-soluble AuMPCs are still deficient. Here, we demonstrate a wet-chemistry pH-controlled synthesis of two large water-soluble nanoclusters utilizing p-mercaptobenzoic acid (pMBA), affording different sizes of plasmonic AuMPCs on the preparative scale (∼7 …

Gear classification and fault detection using a diffusion map framework

2013

Adaptive framework for network traffic classification using dimensionality reduction and clustering

2012

Information security has become a very important topic especially during the last years. Web services are becoming more complex and dynamic. This offers new possibilities for attackers to exploit vulnerabilities by inputting malicious queries or code. However, these attack attempts are often recorded in server logs. Analyzing these logs could be a way to detect intrusions either periodically or in real time. We propose a framework that preprocesses and analyzes these log files. HTTP queries are transformed to numerical matrices using n-gram analysis. The dimensionality of these matrices is reduced using principal component analysis and diffusion map methodology. Abnormal log lines can then …

A novel heuristic memetic clustering algorithm

2013

In this paper we introduce a novel clustering algorithm based on the Memetic Algorithm meta-heuristic wherein clusters are iteratively evolved using a novel single operator employing a combination of heuristics. Several heuristics are described and employed for the three types of selections used in the operator. The algorithm was exhaustively tested on three benchmark problems and compared to a classical clustering algorithm (k-Medoids) using the same performance metrics. The results show that our clustering algorithm consistently provides better clustering solutions with less computational effort.

Gear classification and fault detection using a diffusion map framework

2015

This article proposes a system health monitoring approach that detects abnormal behavior of machines. Diffusion map is used to reduce the dimensionality of training data, which facilitates the classification of newly arriving measurements. The new measurements are handled with Nyström extension. The method is trained and tested with real gear monitoring data from several windmill parks. A machine health index is proposed, showing that data recordings can be classified as working or failing using dimensionality reduction and warning levels in the low dimensional space. The proposed approach can be used with any system that produces high-dimensional measurement data. peerReviewed

Twister Tries

2015

Many commonly used data-mining techniques utilized across research fields perform poorly when used for large data sets. Sequential agglomerative hierarchical non-overlapping clustering is one technique for which the algorithms’ scaling properties prohibit clustering of a large amount of items. Besides the unfavorable time complexity of O(n 2 ), these algorithms have a space complexity of O(n 2 ), which can be reduced to O(n) if the time complexity is allowed to rise to O(n 2 log2 n). In this paper, we propose the use of locality-sensitive hashing combined with a novel data structure called twister tries to provide an approximate clustering for average linkage. Our approach requires only lin…

A Hybrid Multigroup Coclustering Recommendation Framework Based on Information Fusion

2015

Collaborative Filtering (CF) is one of the most successful algorithms in recommender systems. However, it suffers from data sparsity and scalability problems. Although many clustering techniques have been incorporated to alleviate these two problems, most of them fail to achieve further significant improvement in recommendation accuracy. First of all, most of them assume each user or item belongs to a single cluster. Since usually users can hold multiple interests and items may belong to multiple categories, it is more reasonable to assume that users and items can join multiple clusters (groups), where each cluster is a subset of like-minded users and items they prefer. Furthermore, most of…

Cluster-Based RF Fingerprint Positioning Using LTE and WLAN Outdoor Signals

2015

In this paper we evaluate user-equipment (UE) positioning performance of three cluster-based RF fingerprinting methods using LTE and WLAN signals. Real-life LTE and WLAN data were collected for the evaluation purpose using consumer cellular-mobile handset utilizing ‘Nemo Handy’ drive test software tool. Test results of cluster-based methods were compared to the conventional grid-based RF fingerprinting. The cluster-based methods do not require grid-cell layout and training signature formation as compared to the gridbased method. They utilize LTE cell-ID searching technique to reduce the search space for clustering operation. Thus UE position estimation is done in short time with less comput…

BioImageXD: an open, general-purpose and high-throughput image-processing platform

2012

BioImageXD puts open-source computer science tools for three-dimensional visualization and analysis into the hands of all researchers, through a user-friendly graphical interface tuned to the needs of biologists. BioImageXD has no restrictive licenses or undisclosed algorithms and enables publication of precise, reproducible and modifiable workflows. It allows simple construction of processing pipelines and should enable biologists to perform challenging analyses of complex processes. We demonstrate its performance in a study of integrin clustering in response to selected inhibitors.