Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs
نویسندگان
چکیده
منابع مشابه
Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs
Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, semantic graphs support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query can return a large number of ...
متن کاملComputing Semantic Similarity between Skill Statements for Approximate Matching
This paper explores the problem of computing text similarity between verb phrases describing skilled human behavior for the purpose of finding approximate matches. Four parsers are evaluated on a large corpus of skill statements extracted from an enterprise-wide expertise taxonomy. A similarity measure utilizing common semantic role features extracted from parse trees was found superior to an i...
متن کاملApproximate Pattern Matching in Nanotechnology
Approximate pattern matching is comparing an unknown pattern with a database of stored patterns with a specified error tolerance. This ability to compensate for real world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications including fingerprint, picture and bar-code identification, industrial automation, robotics and bioinformatics. This paper show...
متن کاملBlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs
Many de novo assembly tools have been created these last few years to assemble short reads generated by high throughput sequencing platforms. The core of almost all these assemblers is a string graph data structure that links reads together. This motivates our work: BlastGraph, a new algorithm performing intensive approximate string matching between a set of query sequences and a string graph. ...
متن کاملDynamic and Approximate Pattern Matching in 2D
We consider dynamic and online variants of 2D pattern matching between an m×m pattern and an n× n text. All the algorithms we give are randomised and give correct outputs with at least constant probability. – For dynamic 2D exact matching where updates change individual symbols in the text, we show updates can be performed in O(log n) time and queries in O(log m) time. – We then consider a mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Analysis and Data Mining: The ASA Data Science Journal
سال: 2015
ISSN: 1932-1864,1932-1872
DOI: 10.1002/sam.11294