Classification Models for Partially Ordered Sequences
نویسندگان
چکیده
Many models such as Long Short Term Memory (LSTMs), Gated Recurrent Units (GRUs) and transformers have been developed to classify time series data with the assumption that events in a sequence are ordered. On other hand, fewer for set based inputs, where order does not matter. There several use cases is given partially-ordered sequences because of granularity or uncertainty stamps. We introduce novel transformer model prediction tasks, benchmark against extensions existing invariant models. also discuss how transition probabilities between can be used improve performance. show transformer-based equal-time outperforms on three sets.
منابع مشابه
Tripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملSequential Classification on Partially Ordered Sets
A general theorem on asymptotically optimal sequential selection of experiments is presented and applied to a Bayesian classification problem when the parameter space is a finite partially ordered set. The main results include establishing conditions under which the posterior probability of the true state converges to one almost surely, and determining optimal rates of convergence. Properties o...
متن کاملOrdinal Classification Using Partially Ordered Feature Sets
This paper presents a method to solve an ordinal classification problem where the objects are described with a set of partially ordered features. To construct an ordinal classification model we aggregate partial orders of features by weighting the incidence matrices of partial order graphs. To describe set of possible solutions we use partial order cones corresponding to the incidence matrices ...
متن کاملAn Optimal Strategy for Sequential Classification on Partially Ordered Sets
A decision-theoretic framework is described for sequential classification when the parameter space is a finite partially ordered set. An example of an optimal strategy is then presented. This example establishes that an asymptotically optimal class of experiment selection rules is not necessarily optimal in the given decision-theoretic setting.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86362-3_24