Search results for "Network science"
showing 10 items of 103 documents
Using SOM and PCA for analysing and interpreting data from a P-removal SBR
2008
This paper focuses on the application of Kohonen self-organizing maps (SOM) and principal component analysis (PCA) to thoroughly analyse and interpret multidimensional data from a biological process. The process is aimed at enhanced biological phosphorus removal (EBPR) from wastewater. In this work, SOM and PCA are firstly applied to the data set in order to identify and analyse the relationships among the variables in the process. Afterwards, K-means algorithm is used to find out how the observations can be grouped, on the basis of their similarity, in different classes. Finally, the information obtained using these intelligent tools is used for process interpretation and diagnosis. In the…
Similarity and Consistency in Hotel Online Ratings across Platforms
2019
Online ratings are a major driver of hotel choice. There are many ratings platforms, and the number of evaluations is huge. This article analyzes if hotel ratings vary across platforms, vary over time, and if consistency in ratings can be observed. Longitudinal online ratings taken from 11 platforms over a two-year period were analyzed through Self-Organizing Maps. The findings suggest a similar pattern of online ratings across most of the platforms, except for Yelp and HolidayCheck. In addition, the evaluation patterns are stable over time, and the analyzed attributes do not contribute decisively to explain the overall evaluation of hotels, which implies that tourists use a noncompensator…
Features for Text Comparison
2008
The main purpose of this paper is to deliver appropriate tool to find similarities between texts. The area of interest covers comparing large amount of different texts grouped in various areas of knowledge. Similarity is defined as distance between two texts and as this the measure may be calculated as the set of parameters based on features.
Dissimilarity Measures for the Identification of Earthquake Focal Mechanisms
2013
This work presents a study about dissimilarity measures for seismic signals, and their relation to clustering in the particular problem of the identification of earthquake focal mechanisms, i.e. the physical phenomena which have generated an earthquake. Starting from the assumption that waveform similarity implies similarity in the focal parameters, important details about them can be determined by studying waveforms related to the wave field produced by earthquakes and recorded by a seismic network. Focal mechanisms identification is currently investigated by clustering of seismic events, using mainly cross-correlation dissimilarity in conjunction with hierarchical clustering algorithm. By…
Graph Comparison and Artificial Models for Simulating Real Criminal Networks
2021
Network Science is an active research field, with numerous applications in areas like computer science, economics, or sociology. Criminal networks, in particular, possess specific topologies which allow them to exhibit strong resilience to disruption. Starting from a dataset related to meetings between members of a Mafia organization which operated in Sicily during 2000s, we here aim to create artificial models with similar properties. To this end, we use specific tools of Social Network Analysis, including network models (Barabási-Albert identified to be the most promising) and metrics which allow us to quantify the similarity between two networks. To the best of our knowledge, the DeltaCo…
Soft Topographic Map for Clustering and Classification of Bacteria
2007
In this work a new method for clustering and building a topographic representation of a bacteria taxonomy is presented. The method is based on the analysis of stable parts of the genome, the so-called “housekeeping genes”. The proposed method generates topographic maps of the bacteria taxonomy, where relations among different type strains can be visually inspected and verified. Two well known DNA alignement algorithms are applied to the genomic sequences. Topographic maps are optimized to represent the similarity among the sequences according to their evolutionary distances. The experimental analysis is carried out on 147 type strains of the Gammaprotebacteria class by means of the 16S rRNA…
Dynamic Regret Analysis for Online Tracking of Time-varying Structural Equation Model Topologies
2020
Identifying dependencies among variables in a complex system is an important problem in network science. Structural equation models (SEM) have been used widely in many fields for topology inference, because they are tractable and incorporate exogenous influences in the model. Topology identification based on static SEM is useful in stationary environments; however, in many applications a time-varying underlying topology is sought. This paper presents an online algorithm to track sparse time-varying topologies in dynamic environments and most importantly, performs a detailed analysis on the performance guarantees. The tracking capability is characterized in terms of a bound on the dynamic re…
Inference of Spatio-Temporal Functions over Graphs via Multi-Kernel Kriged Kalman Filtering
2018
Inference of space-time varying signals on graphs emerges naturally in a plethora of network science related applications. A frequently encountered challenge pertains to reconstructing such dynamic processes, given their values over a subset of vertices and time instants. The present paper develops a graph-aware kernel-based kriged Kalman filter that accounts for the spatio-temporal variations, and offers efficient online reconstruction, even for dynamically evolving network topologies. The kernel-based learning framework bypasses the need for statistical information by capitalizing on the smoothness that graph signals exhibit with respect to the underlying graph. To address the challenge o…
A method for quantifying atrial fibrillation organization based on wave-morphology similarity
2002
A new method for quantifying the organization of single bipolar electrograms recorded in the human atria during atrial fibrillation (AF) is presented. The algorithm relies on the comparison between pairs of local activation waves (LAWs) to estimate their morphological similarity, and returns a regularity index (/spl rho/) which measures the extent of repetitiveness over time of the detected activations. The database consisted of endocardial data from a multipolar basket catheter during AF and intraatrial recordings during atrial flutter. The index showed maximum regularity (/spl rho/=1) for all atrial flutter episodes and decreased significantly when increasing AF complexity as defined by W…
New Similarity Rules for Mining Data
2006
Variability and noise in data-sets entries make hard the discover of important regularities among association rules in mining problems. The need exists for defining flexible and robust similarity measures between association rules. This paper introduces a new class of similarity functions, SF's, that can be used to discover properties in the feature space X and to perform their grouping with standard clustering techniques. Properties of the proposed SF's are investigated and experiments on simulated data-sets are also shown to evaluate the grouping performance.