Search results for "clusterin"

Functional linear models for the analysis of similarity of waveforms

2018

In seismology methods based on waveform similarity analysis are adopted to identify sequences of events characterized by similar fault mechanism and prop- agation pattern. Seismic waves can be considered as spatially interdependent three dimensional curves depending on time and the waveform similarity analysis can be configured as a functional clustering approach, on the basis of which the member- ship is assessed by the shape of the temporal patterns. For providing qualitative ex- traction of the most important information from the recorded signals we propose an integration of the metadata, related to the waves, as explicative variables of a func- tional linear models. The temporal pattern…

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.

Gear classification and fault detection using a diffusion map framework

2013

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…

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…

An efficient cluster-based outdoor user positioning using LTE and WLAN signal strengths

2015

In this paper we propose a novel cluster-based RF fingerprinting method for outdoor user-equipment (UE) positioning using both LTE and WLAN signals. It uses a simple cost effective agglomerative hierarchical clustering with Davies-Bouldin criterion to select the optimal cluster number. The positioning method does not require training signature formation prior to UE position estimation phase. It is capable of reducing the search space for clustering operation by using LTE cell-ID searching criteria. This enables the method to estimate UE positioning in short time with less computational expense. To validate the cluster-based positioning real-time field measurements were collected using readi…

Semi-automatic literature mapping of participatory design studies 2006--2016

2018

The paper presents a process of semi-automatic literature mapping of a comprehensive set of participatory design studies between 2006--2016. The data of 2939 abstracts were collected from 14 academic search engines and databases. With the presented method, we were able to identify six education-related clusters of PD articles. Furthermore, we point out that the identified clusters cover the majority of education-related words in the whole data. This is the first attempt to systematically map the participatory design literature. We argue that by continuing our work, we can help to perceive a coherent structure in the body of PD research.

Scalable Hierarchical Clustering: Twister Tries with a Posteriori Trie Elimination

2015

Exact methods for Agglomerative Hierarchical Clustering (AHC) with average linkage do not scale well when the number of items to be clustered is large. The best known algorithms are characterized by quadratic complexity. This is a generally accepted fact and cannot be improved without using specifics of certain metric spaces. Twister tries is an algorithm that produces a dendrogram (i.e., Outcome of a hierarchical clustering) which resembles the one produced by AHC, while only needing linear space and time. However, twister tries are sensitive to rare, but still possible, hash evaluations. These might have a disastrous effect on the final outcome. We propose the use of a metaheuristic algor…