81,472 research outputs found
Graph-Based Change-Point Detection
We consider the testing and estimation of change-points -- locations where
the distribution abruptly changes -- in a data sequence. A new approach, based
on scan statistics utilizing graphs representing the similarity between
observations, is proposed. The graph-based approach is non-parametric, and can
be applied to any data set as long as an informative similarity measure on the
sample space can be defined. Accurate analytic approximations to the
significance of graph-based scan statistics for both the single change-point
and the changed interval alternatives are provided. Simulations reveal that the
new approach has better power than existing approaches when the dimension of
the data is moderate to high. The new approach is illustrated on two
applications: The determination of authorship of a classic novel, and the
detection of change in a network over time
Geosocial Graph-Based Community Detection
We apply spectral clustering and multislice modularity optimization to a Los
Angeles Police Department field interview card data set. To detect communities
(i.e., cohesive groups of vertices), we use both geographic and social
information about stops involving street gang members in the LAPD district of
Hollenbeck. We then compare the algorithmically detected communities with known
gang identifications and argue that discrepancies are due to sparsity of social
connections in the data as well as complex underlying sociological factors that
blur distinctions between communities.Comment: 5 pages, 4 figures Workshop paper for the IEEE International
Conference on Data Mining 2012: Workshop on Social Media Analysis and Minin
Graph-Based CPE Matching for Identification of Vulnerable Asset Configurations
In this manuscript, we propose a graph-based approach for identification of vulnerable asset configurations via Common Platform Enumeration matching. The approach consists of a graph model and insertion procedure that is able to represent and store information about CVE vulnerabilities and different configurations of CPE-classified asset components. These building blocks are accompanied with a search query in Gremlin graph traversal language that is able to find all vulnerable pairs of CVEs and asset configurations in a single traversal, as opposed to a conventional brute-force approach
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
- …