One-Class Semi-Supervised Learning: Detecting Linearly Separable Class by its Mean
In this paper, we presented a novel semi-supervised one-class classification algorithm which assumes that class is linearly separable from other elements. We proved theoretically that class is linearly separable if and only if it is maximal by probability within the sets with the same mean. Furthermore, we presented an algorithm for identifying such linearly separable class utilizing linear programming. We described three application cases including an assumption of linear separability, Gaussian distribution, and the case of linear separability in transformed space of kernel functions. Finally, we demonstrated the work of the proposed algorithm on the USPS dataset and analyzed the relationship of the performance of the algorithm and the size of the initially labeled sample.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationOne-Class ClassificationSimilar Papers 제목 키워드 기반
Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalization
Recently there has been increased interest in semi-supervised classification in the presence of graphical information. A new class of learning models has emerged that relies, at its most basic level, on classifying the d…
General ClassificationOut-of-Distribution GeneralizationStochastic Block ModelLSD-C: Linearly Separable Deep Clusters
We present LSD-C, a novel method to identify clusters in an unlabeled dataset. Our algorithm first establishes pairwise connections in the feature space between the samples of the minibatch based on a similarity metric. …
ClusteringData AugmentationDeep ClusteringDocument Classification+2Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
Recent years have witnessed the rapid development of block coordinate update (BCU) methods, which are particularly suitable for problems involving large-sized data and/or variables. In optimization, BCU first appears as …
Next state prediction gives rise to entangled, yet compositional representations of objects
Compositional representations are thought to enable humans to generalize across combinatorially vast state spaces. Models with learnable object slots, which encode information about objects in separate latent codes, have…
ObjectDeep Kernel Supervised Hashing for Node Classification in Structural Networks
Node classification in structural networks has been proven to be useful in many real world applications. With the development of network embedding, the performance of node classification has been greatly improved. Howeve…
ClassificationGeneral ClassificationNetwork EmbeddingNode Classification