One-class classification (OCC) is a machine learning problem where training data has only one class. Recently, self-supervised OCC algorithms have been increasing attention. These train the model for pretext tasks and use error OCC. However, these are specialized images, applying them to feature not practical or appropriate such purpose. The motivation of this study apply data. For purpose, pap...

Administration of a birth dose of hepatitis B vaccine (HepB vaccine) to neonates is recommended to prevent mother-to-infant transmission and chronic infection with the hepatitis B virus (HBV). Although manufacturers recommend HepB vaccine distribution and storage at 2-8 degrees C, recognition of the heat stability of hepatitis B surface antigen stimulated research into its use after storage at,...

In the problem of one-class classification (OCC) one of the classes, the target class, has to be distinguished from all other possible objects, considered as nontargets. In many biomedical problems this situation arises, for example, in diagnosis, image based tumor recognition or analysis of electrocardiogram data. In this paper an approach to OCC based on a typicality test is experimentally co...

In this article we examine the relation between the Rorschach Comprehensive System's Suicide Constellation (S-CON; Exner, 1993; Exner & Wiley, 1977) and lethality of suicide attempts during the course of patients' hospitalization at the Austen Riggs Center (Stockbridge, MA). Patient records were rated as nonsuicidal (n = 37), parasuicidal (n = 37), or near-lethal (n = 30) based on the presence ...

This paper revisits the problem of indexing a text S[1..n] to support searching substrings in S that match a given pattern P [1..m] with at most k errors. A naive solution either has a worst-case matching time complexity of Ω(m) or requires Ω(n) space. Devising a solution with better performance has been a challenge until Cole et al. [5] showed an O(n log n)-space index that can support k-error...

Ontogenetic colour change (OCC) may signal a switch in defensive strategies across development. Commonly, juveniles use cryptic colours and transition to conspicuous coloration as adults. Extensive theoretical and empirical work suggest such a transition is more likely than the converse. Oreophryne ezra, a newly discovered frog from New Guinea, however, undergoes OCC that belies expectations. W...

In this paper, we propose a novel approach to combine compact directed acyclic word graphs (CDAWGs) and grammar-based compression. This leads us to an efficient self-index, called Linear-size CDAWGs (LCDAWGs), which can be represented with O(ẽT log n) bits of space allowing for O(log n)-time random and O(1)-time sequential accesses to edge labels, and O(m log σ+ occ)-time pattern matching. Here...

This paper revisits the problem of indexing a text for approximate string matching. Specifically, given a text T of length n and a positive integer k, we want to construct an index of T such that for any input pattern P , we can find all its k-error matches in T efficiently. This problem is well-studied in the internal-memory setting. Here, we extend some of these recent results to external-mem...

Two equal-length strings S and S′ are a parameterized-match (p-match) iff there exists a one-toone function that renames the characters in S to those in S′. Let P be a collection of d patterns of total length n characters that are chosen from an alphabet Σ of cardinality σ. The task is to index P such that we can support the following operations: search(T ): given a text T , report all occurren...