Search

Multi-dimensional classification (MDC) task can be considered the most inclusive description of all classifications tasks, as it joins multiple class spaces and their multiple class members into a single compound classification problem. The challenges in MDC arise from the possible class dependencies across different class spaces, as well as the imbalance of labels in training datasets due to lack of all possible combinations. In this paper, we propose a straightforward, yet efficient, MDC deep learning classifier, named Deep Self-Organizing Cube (DSOC) that can model dependencies among classes in multiple class spaces, while consolidating its ability to classify rare combinations of labels. DSOC is formed of two n -dimensional components, namely the Hypercube Classifier and the multiple DSOC Neural Networks connected to the hypercube. The multiple neural networks component is responsible for feature selection and segregation of classes, while the Hypercube classifier is responsible for creating the semantics among multiple class spaces and accommodate the model for rare sample classification. DSOC is a multiple-output learning algorithm that successfully classify samples across all class spaces simultaneously. To challenge the proposed DSOC model, we conducted an assessment on seventeen benchmark datasets in the four types of classification tasks, binary, multi-class, multi-label and multi-dimensional. The obtained results were compared to four standard classifiers and eight competitive state-of-the-art approaches reported in literature. The DSOC has achieved superior performance over standard classifiers as well as the state-of-the-art approaches in all the four classification tasks. Moreover, in terms of Exact Match accuracy metrics, DSOC has outperformed all state-of-the-art approaches in 77.8% of the cases, which reflects the superior ability of DSOC to model dependencies and successfully classify rare samples across all dimensions simultaneously. [ABSTRACT FROM AUTHOR]

The quantity of data generated increases daily, which makes it difficult to process. In the case of supervised learning, labeling training examples may represent an especially tedious and costly task. One of the aims of positive and unlabeled (PU) learning is to train a binary classifier from partially labeled data, representing a strategy for combining supervised and semi-supervised learning and alleviating the cost of labeling data fully. Still, the main strength of PU learning arises when the negative data are not directly available or too diverse. Although the generative approaches have shown promising results in this field, they also bring shortcomings, such as high computational cost, training instability, and inability to generate fully labeled datasets. In the paper, we propose a novel Conditional Generative PU framework (CGenPU) with a built-in auxiliary classifier. We develop a novel loss function to learn the distribution of positive and negative examples, which leads to a unique, desirable equilibrium under a nonparametric assumption. Our CGenPU is evaluated against existing generative approaches using both synthetic and real data. The characteristics of various methods, including ours, are depicted with different toy examples. The results demonstrate the state-of-the-art performance on standard positive and unlabeled learning benchmark datasets. Given only ten labeled CIFAR-10 examples, CGenPU achieves classification accuracy of 84%, while current state-of-the-art D-GAN framework achieves 54%. On top of that, CGenPU is the first single-stage generative framework for PU learning. • CGenPU is capable of conditional generation and binary classification. • Auxiliary PU loss enables the generation of positive and negative data distributions. • The objective has a unique, desirable equilibrium under a non-parametric assumption. • CGenPU shows state-of-the-art results in One-vs-One and One-vs-Rest scenarios. [ABSTRACT FROM AUTHOR]

Service composition can quickly build new value-added composite services by combining existing Web services. However, with the complex and changeable Internet environment, composite services need to effectively understand and manage requirements in a flexible and adaptive manner, and also be able to quickly and proactively provide high-quality services through a series of dynamic evolution models. In response to these challenges, in this study, we propose a service composition evolution method that can adaptively select the appropriate service to improve user satisfaction and service quality. First, we introduce a deep clustering method based on the topic model and auto-encoder, which considers the function description documents and parameter information of the services to reduce the search space of the candidate services. Furthermore, we describe a requirement-oriented context-sensitive task model to integrate functional and non-functional user requirements by connecting the context of Web subtasks. Then, we present a dynamic service matching method with QoS threshold judgement to filter and rank the services. We applied the proposed evolution method to the datasets of real-world Web services and measured the performance using standard measurement metrics. The prototype implementation and results of simulation experiments verified the effectiveness of each part of our method. • A novel service composition evolution method is proposed. • A deep clustering method is presented to implement the service clustering process. • RCT model and various evolutionary types are used to satisfy user requirements. • Simulation experiments on prototype system show the effectiveness. [ABSTRACT FROM AUTHOR]

Ideally, Convolutional Neural Networks (CNNs) should be trained with high quality images with minimum noise and correct ground truth labels. Nonetheless, in many real-world scenarios, such high quality is very hard to obtain, and datasets may be affected by any sort of image degradation and mislabelling issues. This negatively impacts the performance of standard CNNs, both during the training and the inference phase. To address this issue we propose Wise2WipedNet (W2WNet), a new two-module Convolutional Neural Network, where a Wise module exploits Bayesian inference to identify and discard spurious images during the training and a Wiped module takes care of the final classification, while broadcasting information on the prediction confidence at inference time. The goodness of our solution is demonstrated on a number of public benchmarks addressing different image classification tasks, as well as on a real-world case study on histological image analysis. Overall, our experiments demonstrate that W2WNet is able to identify image degradation and mislabelling issues both at training and at inference time, with positive impact on the final classification accuracy. • A novel two-module CNN exploiting Bayesian inference is introduced. • We address image degradation and mislabelling both at training and at inference. • Our method overcomes the deterministic counterpart (standard DenseNet121). • We show results on two public benchmarks and a real-world histological case study. [ABSTRACT FROM AUTHOR]