scholarly journals Multi-level Generative Models for Partial Label Learning with Non-random Label Noise

2021 ◽  
Author(s):  
Yan Yan ◽  
Yuhong Guo
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Random Noise ◽  
Generative Models ◽  
The State ◽  
Inverse Mapping ◽  
True Label ◽  
Generation Network ◽  
Multi Level ◽  
Partial Label Learning

Partial label (PL) learning tackles the problem where each training instance is associated with a set of candidate labels that include both the true label and some irrelevant noise labels. In this paper, we propose a novel multi-level generative model for partial label learning (MGPLL), which tackles the PL problem by learning both a label level adversarial generator and a feature level adversarial generator under a bi-directional mapping framework between the label vectors and the data samples. MGPLL uses a conditional noise label generation network to model the non-random noise labels and perform label denoising, and uses a multi-class predictor to map the training instances to the denoised label vectors, while a conditional data feature generator is used to form an inverse mapping from the denoised label vectors to data samples. Both the noise label generator and the data feature generator are learned in an adversarial manner to match the observed candidate labels and data features respectively. We conduct extensive experiments on both synthesized and real-world partial label datasets. The proposed approach demonstrates the state-of-the-art performance for partial label learning.

scholarly journals Partial Label Learning with Batch Label Correction

2020 ◽  
Vol 34 (04) ◽  
pp. 6575-6582
Author(s):  
Yan Yan ◽  
Yuhong Guo
Keyword(s):  
Real World ◽  
Data Augmentation ◽  
Learning Algorithm ◽  
State Of The Art ◽  
Learning Problem ◽  
True Label ◽  
Network Update ◽  
The Stability ◽  
Partial Label Learning ◽  
Noisy Labels

Partial label (PL) learning tackles the problem where each training instance is associated with a set of candidate labels, among which only one is the true label. In this paper, we propose a simple but effective batch-based partial label learning algorithm named PL-BLC, which tackles the partial label learning problem with batch-wise label correction (BLC). PL-BLC dynamically corrects the label confidence matrix of each training batch based on the current prediction network, and adopts a MixUp data augmentation scheme to enhance the underlying true labels against the redundant noisy labels. In addition, it introduces a teacher model through a consistency cost to ensure the stability of the batch-based prediction network update. Extensive experiments are conducted on synthesized and real-world partial label learning datasets, while the proposed approach demonstrates the state-of-the-art performance for partial label learning.

scholarly journals Particle Swarm Contour Search Algorithm

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 407 ◽  
Author(s):  
Dominik Weikert ◽  
Sebastian Mai ◽  
Sanaz Mostaghim
Keyword(s):  
Image Processing ◽  
Real World ◽  
State Of The Art ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Search Space ◽  
Local Information ◽  
The State ◽  
Complete Knowledge ◽  
Real World Applications

In this article, we present a new algorithm called Particle Swarm Contour Search (PSCS)—a Particle Swarm Optimisation inspired algorithm to find object contours in 2D environments. Currently, most contour-finding algorithms are based on image processing and require a complete overview of the search space in which the contour is to be found. However, for real-world applications this would require a complete knowledge about the search space, which may not be always feasible or possible. The proposed algorithm removes this requirement and is only based on the local information of the particles to accurately identify a contour. Particles search for the contour of an object and then traverse alongside using their known information about positions in- and out-side of the object. Our experiments show that the proposed PSCS algorithm can deliver comparable results as the state-of-the-art.

scholarly journals Scene text removal via cascaded text stroke detection and erasing

2021 ◽  
Vol 8 (2) ◽  
pp. 273-287
Author(s):  
Xuewei Bian ◽  
Chaoqun Wang ◽  
Weize Quan ◽  
Juntao Ye ◽  
Xiaopeng Zhang ◽  
...  
Keyword(s):  
Performance Improvement ◽  
Real World ◽  
Large Scale ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Processing Unit ◽  
Final Model ◽  
Scene Text ◽  
End To End

AbstractRecent learning-based approaches show promising performance improvement for the scene text removal task but usually leave several remnants of text and provide visually unpleasant results. In this work, a novel end-to-end framework is proposed based on accurate text stroke detection. Specifically, the text removal problem is decoupled into text stroke detection and stroke removal; we design separate networks to solve these two subproblems, the latter being a generative network. These two networks are combined as a processing unit, which is cascaded to obtain our final model for text removal. Experimental results demonstrate that the proposed method substantially outperforms the state-of-the-art for locating and erasing scene text. A new large-scale real-world dataset with 12,120 images has been constructed and is being made available to facilitate research, as current publicly available datasets are mainly synthetic so cannot properly measure the performance of different methods.

scholarly journals Waste generation prediction under uncertainty in smart cities through deep neuroevolution

2019 ◽  
pp. 128-138 ◽  
Author(s):  
Andrés Camero ◽  
Jamal Toutouh ◽  
Javier Ferrer ◽  
Enrique Alba
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Smart Cities ◽  
Uncertain Data ◽  
Recurrent Network ◽  
The State ◽  
Waste Generation ◽  
Waste Collection ◽  
The Way

The unsustainable development of countries has created a problem due to the unstoppable waste generation. Moreover, waste collection is carried out following a pre-defined route that does not take into account the actual level of the containers collected. Therefore, optimizing the way the waste is collected presents an interesting opportunity. In this study, we tackle the problem of predicting the waste generation ratio in real-world conditions, i.e., under uncertainty. Particularly, we use a deep neuroevolutionary technique to automatically design a recurrent network that captures the filling level of all waste containers in a city at once, and we study the suitability of our proposal when faced to noisy and faulty data. We validate our proposal using a real-world case study, consisting of more than two hundred waste containers located in a city in Spain, and we compare our results to the state-of-the-art. The results show that our approach exceeds all its competitors and that its accuracy in a real-world scenario, i.e., under uncertain data, is good enough for optimizing the waste collection planning.

scholarly journals App Download Forecasting: An Evolutionary Hierarchical Competition Approach

2017 ◽  
Author(s):  
Yingzi Wang ◽  
Nicholas Jing Yuan ◽  
Yu Sun ◽  
Chuan Qin ◽  
Xing Xie
Keyword(s):  
Time Series ◽  
Future Development ◽  
Real World ◽  
State Of The Art ◽  
Time Series Forecasting ◽  
Comprehensive Understanding ◽  
Competition Analysis ◽  
Multi Scale ◽  
Multi Level ◽  
Product Sales

Product sales forecasting enables comprehensive understanding of products' future development, making it of particular interest for companies to improve their business, for investors to measure the values of firms, and for users to capture the trends of a market. Recent studies show that the complex competition interactions among products directly influence products' future development. However, most existing approaches fail to model the evolutionary competition among products and lack the capability to organically reflect multi-level competition analysis in sales forecasting. To address these problems, we propose the Evolutionary Hierarchical Competition Model (EHCM), which effectively considers the time-evolving multi-level competition among products. The EHCM model systematically integrates hierarchical competition analysis with multi-scale time series forecasting. Extensive experiments using a real-world app download dataset show that EHCM outperforms state-of-the-art methods in various forecasting granularities.

scholarly journals A Survey of Machine Learning-Based Physics Event Generation

2021 ◽  
Author(s):  
Yasir Alanazi ◽  
Nobuo Sato ◽  
Pawel Ambrozewicz ◽  
Astrid Hiller-Blin ◽  
Wally Melnitchouk ◽  
...  
Keyword(s):  
Machine Learning ◽  
Particle Physics ◽  
State Of The Art ◽  
Super Resolution ◽  
High Energy ◽  
Generative Models ◽  
The State ◽  
Open Questions ◽  
Event Generation ◽  
Building Physics

Event generators in high-energy nuclear and particle physics play an important role in facilitating studies of particle reactions. We survey the state of the art of machine learning (ML) efforts at building physics event generators. We review ML generative models used in ML-based event generators and their specific challenges, and discuss various approaches of incorporating physics into the ML model designs to overcome these challenges. Finally, we explore some open questions related to super-resolution, fidelity, and extrapolation for physics event generation based on ML technology.

scholarly journals Partial Label Learning with Self-Guided Retraining

2019 ◽  
Vol 33 ◽  
pp. 3542-3549 ◽  
Author(s):  
Lei Feng ◽  
Bo An
Keyword(s):  
Real World ◽  
Optimization Problem ◽  
State Of The Art ◽  
Ground Truth ◽  
Learning Approaches ◽  
High Confidence ◽  
Infinity Norm ◽  
Real World Datasets ◽  
Partial Label Learning ◽  
Optimization Efficiency

Partial label learning deals with the problem where each training instance is assigned a set of candidate labels, only one of which is correct. This paper provides the first attempt to leverage the idea of self-training for dealing with partially labeled examples. Specifically, we propose a unified formulation with proper constraints to train the desired model and perform pseudo-labeling jointly. For pseudo-labeling, unlike traditional self-training that manually differentiates the ground-truth label with enough high confidence, we introduce the maximum infinity norm regularization on the modeling outputs to automatically achieve this consideratum, which results in a convex-concave optimization problem. We show that optimizing this convex-concave problem is equivalent to solving a set of quadratic programming (QP) problems. By proposing an upper-bound surrogate objective function, we turn to solving only one QP problem for improving the optimization efficiency. Extensive experiments on synthesized and real-world datasets demonstrate that the proposed approach significantly outperforms the state-of-the-art partial label learning approaches.

scholarly journals A FRAMEWORK FOR COMMUNITY DETECTION IN HETEROGENEOUS MULTI-RELATIONAL NETWORKS

2014 ◽  
Vol 17 (06) ◽  
pp. 1450018 ◽  
Author(s):  
XIN LIU ◽  
WEICHU LIU ◽  
TSUYOSHI MURATA ◽  
KEN WAKITA
Keyword(s):  
Community Detection ◽  
Real World ◽  
State Of The Art ◽  
General Structure ◽  
The State ◽  
New Method ◽  
World Systems ◽  
Relational Networks ◽  
Relational Network ◽  
Art Techniques

There has been a surge of interest in community detection in homogeneous single-relational networks which contain only one type of nodes and edges. However, many real-world systems are naturally described as heterogeneous multi-relational networks which contain multiple types of nodes and edges. In this paper, we propose a new method for detecting communities in such networks. Our method is based on optimizing the composite modularity, which is a new modularity proposed for evaluating partitions of a heterogeneous multi-relational network into communities. Our method is parameter-free, scalable, and suitable for various networks with general structure. We demonstrate that it outperforms the state-of-the-art techniques in detecting pre-planted communities in synthetic networks. Applied to a real-world Digg network, it successfully detects meaningful communities.

A Novel Tagging Augmented LDA Model for Clustering

2019 ◽  
Vol 16 (3) ◽  
pp. 59-77
Author(s):  
Yi Zhao ◽  
Yu Qiao ◽  
Keqing He
Keyword(s):  
Transfer Learning ◽  
Real World ◽  
Latent Dirichlet Allocation ◽  
State Of The Art ◽  
Positive Influence ◽  
The State ◽  
Clustering Methods ◽  
Automatic Clustering ◽  
Real World Datasets ◽  
High Representation

Clustering has become an increasingly important task in the analysis of large documents. Clustering aims to organize these documents, and facilitate better search and knowledge extraction. Most existing clustering methods that use user-generated tags only consider their positive influence for improving automatic clustering performance. The authors argue that not all user-generated tags can provide useful information for clustering. In this article, the authors propose a new solution for clustering, named HRT-LDA (High Representation Tags Latent Dirichlet Allocation), which considers the effects of different tags on clustering performance. For this, the authors perform a tag filtering strategy and a tag appending strategy based on transfer learning, Word2vec, TF-IDF and semantic computing. Extensive experiments on real-world datasets demonstrate that HRT-LDA outperforms the state-of-the-art tagging augmented LDA methods for clustering.

Sign in / Sign up

Export Citation Format

Share Document