scholarly journals Computation of exact probabilities associated with overlapping pattern occurrences

2019 ◽  
Vol 11 (5) ◽  
Author(s):  
Donald E. K. Martin
Keyword(s):  
Pattern Occurrences

Outliers Detection in Multivariate Time Series by Independent Component Analysis

2007 ◽  
Vol 19 (7) ◽  
pp. 1962-1984 ◽  
Author(s):  
Roberto Baragona ◽  
Francesco Battaglia
Keyword(s):  
Time Series ◽  
Independent Component Analysis ◽  
Model Building ◽  
Multivariate Time Series ◽  
Component Analysis ◽  
Independent Component ◽  
Level Shifts ◽  
The Common ◽  
Identification Techniques ◽  
Pattern Occurrences

In multivariate time series, outlying data may be often observed that do not fit the common pattern. Occurrences of outliers are unpredictable events that may severely distort the analysis of the multivariate time series. For instance, model building, seasonality assessment, and forecasting may be seriously affected by undetected outliers. The structure dependence of the multivariate time series gives rise to the well-known smearing and masking phenomena that prevent using most outliers' identification techniques. It may be noticed, however, that a convenient way for representing multiple outliers consists of superimposing a deterministic disturbance to a gaussian multivariate time series. Then outliers may be modeled as nongaussian time series components. Independent component analysis is a recently developed tool that is likely to be able to extract possible outlier patterns. In practice, independent component analysis may be used to analyze multivariate observable time series and separate regular and outlying unobservable components. In the factor models framework too, it is shown that independent component analysis is a useful tool for detection of outliers in multivariate time series. Some algorithms that perform independent component analysis are compared. It has been found that all algorithms are effective in detecting various types of outliers, such as patches, level shifts, and isolated outliers, even at the beginning or the end of the stretch of observations. Also, there is no appreciable difference in the ability of different algorithms to display the outlying observations pattern.

Pattern Occurrences in Multicomponent Models

2005 ◽  
pp. 680-692 ◽  
Author(s):  
Massimiliano Goldwurm ◽  
Violetta Lonati
Keyword(s):  
Pattern Occurrences

The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach

2003 ◽  
Vol 40 (4) ◽  
pp. 881-892 ◽  
Author(s):  
Valeri T. Stefanov
Keyword(s):  
Markov Processes ◽  
Waiting Time ◽  
Generating Functions ◽  
Continuous Time ◽  
Finite Alphabet ◽  
Algorithmic Approach ◽  
First Occurrence ◽  
Semi Markov Processes ◽  
Pattern Occurrences ◽  
Continuous Time Models

The formation of patterns from letters of a finite alphabet is considered. The strings of letters are generated by general discrete- and continuous-time models which embrace as particular cases all models considered in the literature. The letters of the alphabet are identified by the states of either discrete- or continuous-time semi-Markov processes. A new and unifying method is introduced for evaluation of the generating functions of both the intersite distance between occurrences of an arbitrary, but fixed, pattern and the waiting time until the first occurrence of that pattern. Our method also covers in a unified way relevant and important joint generating functions. Furthermore, our results lead to an easy and efficient implementation of the relevant evaluations.

scholarly journals Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing

2005 ◽  
Vol 42 (3) ◽  
pp. 661-683 ◽  
Author(s):  
Larry Goldstein
Keyword(s):  
Fixed Points ◽  
Uniform Distribution ◽  
Central Limit ◽  
Limit Theorems ◽  
Extreme Values ◽  
Random Permutation ◽  
Central Limit Theorems ◽  
Finite Graphs ◽  
Size Bias ◽  
Pattern Occurrences

Berry-Esseen-type bounds to the normal, based on zero- and size-bias couplings, are derived using Stein's method. The zero biasing bounds are illustrated in an application to combinatorial central limit theorems in which the random permutation has either the uniform distribution or one that is constant over permutations with the same cycle type, with no fixed points. The size biasing bounds are applied to the occurrences of fixed, relatively ordered subsequences (such as rising sequences) in a random permutation, and to the occurrences of patterns, extreme values, and subgraphs in finite graphs.

A Stitch in Time Saves Nine: Early Improving Code-First Web Services Discoverability

2015 ◽  
Vol 24 (02) ◽  
pp. 1550004 ◽  
Author(s):  
Cristian Mateos ◽  
Marco Crasso ◽  
Alejandro Zunino ◽  
José Luis Ordiales Coscia
Keyword(s):  
Web Services ◽  
Web Service ◽  
Real World ◽  
Service Discovery ◽  
Statistical Correlation ◽  
Web Service Discovery ◽  
Computing Paradigm ◽  
Service Oriented ◽  
Wsdl Documents ◽  
Pattern Occurrences

Web Services represent a number of standard technologies and methodologies that allow developers to build applications under the Service-Oriented Computing paradigm. Within these, the WSDL language is used for representing Web Service interfaces, while code-first remains the de facto standard for building such interfaces. Previous studies with contract-first Web Services have shown that avoiding a specific catalog of bad WSDL specification practices, or anti-patterns, can reward Web Service publishers as service understandability and discoverability are considerably improved. In this paper, we study a number of simple and well-known code service refactorings that early reduce anti-pattern occurrences in WSDL documents. This relationship relies upon a statistical correlation between common OO metrics taken on a service's code and the anti-pattern occurrences in the generated WSDL document. We quantify the effects of the refactorings — which directly modify OO metric values and indirectly alter anti-pattern occurrences — on service discovery. All in all, we show that by applying the studied refactorings, anti-patterns are reduced and Web Service discovery is significantly improved. For the experiments, a dataset of real-world Web Services and an academic service registry have been employed.

The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach

2003 ◽  
Vol 40 (04) ◽  
pp. 881-892 ◽  
Author(s):  
Valeri T. Stefanov
Keyword(s):  
Markov Processes ◽  
Waiting Time ◽  
Generating Functions ◽  
Continuous Time ◽  
Finite Alphabet ◽  
Algorithmic Approach ◽  
First Occurrence ◽  
Semi Markov Processes ◽  
Pattern Occurrences ◽  
Continuous Time Models

The formation of patterns from letters of a finite alphabet is considered. The strings of letters are generated by general discrete- and continuous-time models which embrace as particular cases all models considered in the literature. The letters of the alphabet are identified by the states of either discrete- or continuous-time semi-Markov processes. A new and unifying method is introduced for evaluation of the generating functions of both the intersite distance between occurrences of an arbitrary, but fixed, pattern and the waiting time until the first occurrence of that pattern. Our method also covers in a unified way relevant and important joint generating functions. Furthermore, our results lead to an easy and efficient implementation of the relevant evaluations.

scholarly journals Normal and Compound Poisson Approximations for Pattern Occurrences in NGS Reads

2012 ◽  
Vol 19 (6) ◽  
pp. 839-854 ◽  
Author(s):  
Zhiyuan Zhai ◽  
Gesine Reinert ◽  
Kai Song ◽  
Michael S. Waterman ◽  
Yihui Luan ◽  
...  
Keyword(s):  
Compound Poisson ◽  
Pattern Occurrences ◽  
Poisson Approximations

scholarly journals A symbolic method to compute the probability distribution of the number of pattern occurences in random texts generated by stochastic 0L-systems

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Cedric Loi ◽  
Paul-Henry Cournède ◽  
Jean Françon
Keyword(s):  
Generating Functions ◽  
Functional Equations ◽  
Branching Process ◽  
Specific Pattern ◽  
Multitype Branching Process ◽  
Transformation Rules ◽  
Symbolic Method ◽  
International Audience ◽  
Pattern Occurrences ◽  
Random Text

International audience The analysis of pattern occurrences has numerous applications, in particular in biology. In this article, a symbolic method is proposed to compute the distribution associated to the number of occurences of a specific pattern in a random text generated by a stochastic 0L-system. To that purpose, a semiring structure is set for combinatorial classes composed of weighted words. This algebraic structure relies on new union and concatenation operators which, under some assumptions, are admissible constructions. Decomposing the combinatorial classes of interest by using these binary operators enables the direct translation of specifications into a set of functional equations relating generating functions thanks to transformation rules. The article ends with two examples. The first one deals with unary patterns and the connection with multitype branching process is established. The second one is about a pattern composed of two letters and underlines the importance of writing a proper specification.

Sign in / Sign up

Export Citation Format

Share Document