Fractionally Supervised Classification with Maxima Nominated Samples

2026-04-28 · Mohammad Jafari Jozani, Jingyu Wang arxiv

Fractionally supervised classification (FSC) offers a flexible framework for combining labeled and unlabeled data in model-based classification, but existing formulations assume simple random sampling. In many applications, however, the retained observation is an extreme order statistic from a set rather than a randomly selected unit. This is particularly appealing when the target population is rare, since maxima nomination sampling (NS) can enrich the sample with the most informative observations, as in screening, environmental monitoring, repeated testing, and reliability studies. Under such designs, the likelihood function changes fundamentally, and the usual FSC EM construction is no longer valid. We develop FSC for nominated samples by introducing a latent representation that accounts for both the class membership of the observed maximum and the latent composition of the remaining units in the set. The resulting method yields a proper EM algorithm and a coherent weighted-likelihood FSC procedure for NS data. We present the methodology in general form, illustrate it for a rare-event contamination normal mixtures, and show through simulation that it substantially improves on the misspecified alternative by ignoring the extra rank information of such data. A real-data analysis demonstrates its practical value.

📄 PDF Abstract BibTeX arXiv:2604.25145

Code (0)

등록된 구현이 없습니다.

Fractionally-Supervised Classification

2013-07-13 · Irene Vrbik, Paul D. McNicholas

Traditionally, there are three species of classification: unsupervised, supervised, and semi-supervised. Supervised and semi-supervised classification differ by whether or not weight is given to unlabelled observations i…

Classification Clustering General Classification

Unsupervised Learning of the Set of Local Maxima

2020-01-14 · ICLR 2019 5 · Lior Wolf, Sagie Benaim, Tomer Galanti

This paper describes a new form of unsupervised learning, whose input is a set of unlabeled points that are assumed to be local maxima of an unknown value function v in an unknown subset of the vector space. Two function…

Anomaly Detection General Classification One-Class Classification

Chaos in Fractionally Integrated Generalized Autoregressive Conditional Heteroskedastic Processes

2016-02-12

Fractionally integrated generalized autoregressive conditional heteroskedasticity (FIGARCH) arises in modeling of financial time series. FIGARCH is essentially governed by a system of nonlinear stochastic difference equa…

Time Series Time Series Analysis

Time-Series Forecasting: Unleashing Long-Term Dependencies with Fractionally Differenced Data

2023-09-23 · Sarit Maitra, Vivek Mishra, Srashti Dwivedi, Sukanya Kundu 외

This study introduces a novel forecasting strategy that leverages the power of fractional differencing (FD) to capture both short- and long-term dependencies in time series data. Unlike traditional integer differencing m…

Binary Classification Sentiment Analysis Time Series Time Series Forecasting

Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction

2020-06-15 · NeurIPS 2020 12 · Yaodong Yu, Kwan Ho Ryan Chan, Chong You, Chaobing Song 외

To learn intrinsic low-dimensional structures from high-dimensional data that most discriminate between classes, we propose the principle of Maximal Coding Rate Reduction ($\text{MCR}^2$), an information-theoretic measur…

Clustering Contrastive Learning Image Clustering