A brief survey on semantic segmentation with deep learning
S Hao, Y Zhou, Y Guo - Neurocomputing, 2020 - Elsevier
Semantic segmentation is a challenging task in computer vision. In recent years, the
performance of semantic segmentation has been greatly improved by using deep learning …
performance of semantic segmentation has been greatly improved by using deep learning …
Feature selection for text classification: A review
Big multimedia data is heterogeneous in essence, that is, the data may be a mixture of
video, audio, text, and images. This is due to the prevalence of novel applications in recent …
video, audio, text, and images. This is due to the prevalence of novel applications in recent …
Simple unsupervised graph representation learning
In this paper, we propose a simple unsupervised graph representation learning method to
conduct effective and efficient contrastive learning. Specifically, the proposed multiplet loss …
conduct effective and efficient contrastive learning. Specifically, the proposed multiplet loss …
A brief review on multi-task learning
KH Thung, CY Wee - Multimedia Tools and Applications, 2018 - Springer
Abstract Multi-task learning (MTL), which optimizes multiple related learning tasks at the
same time, has been widely used in various applications, including natural language …
same time, has been widely used in various applications, including natural language …
One-step multi-view spectral clustering
Previous multi-view spectral clustering methods are a two-step strategy, which first learns a
fixed common representation (or common affinity matrix) of all the views from original data …
fixed common representation (or common affinity matrix) of all the views from original data …
Low-rank sparse subspace for spectral clustering
Traditional graph clustering methods consist of two sequential steps, ie, constructing an
affinity matrix from the original data and then performing spectral clustering on the resulting …
affinity matrix from the original data and then performing spectral clustering on the resulting …
A novel kNN algorithm with data-driven k parameter computation
This paper studies an example-driven k-parameter computation that identifies different k
values for different test samples in kNN prediction applications, such as classification …
values for different test samples in kNN prediction applications, such as classification …
Cost-sensitive KNN classification
S Zhang - Neurocomputing, 2020 - Elsevier
Abstract KNN (K Nearest Neighbors) classification is one of top-10 data mining algorithms. It
is significant to extend KNN classifiers sensitive to costs for imbalanced data classification …
is significant to extend KNN classifiers sensitive to costs for imbalanced data classification …
Aspect sentiment analysis with heterogeneous graph neural networks
G Lu, J Li, J Wei - Information Processing & Management, 2022 - Elsevier
Aspect-based sentiment analysis technologies may be a very practical methodology for
securities trading, commodity sales, movie rating websites, etc. Most recent studies adopt …
securities trading, commodity sales, movie rating websites, etc. Most recent studies adopt …
Local and global structure preservation for robust unsupervised spectral feature selection
This paper proposes a new unsupervised spectral feature selection method to preserve both
the local and global structure of the features as well as the samples. Specifically, our method …
the local and global structure of the features as well as the samples. Specifically, our method …