• Korean Journal of Remote Sensing
• /
• v.33 no.5_2
• /
• pp.689-698
• /
• 2017

In this paper, a new classification method based on the combination of semi-supervised learning with spatial similarity of adjacent pixels is presented for crop classification in inaccessible areas. Iterative classification based on semi-supervised learning is applied to extract reliable training data from both the initial classification result with a small number of training data, and classification results of adjacent pixels are also considered to extract new training pixels with less uncertainty. To evaluate the applicability of the proposed method, a case study of the classification of field crops was carried out using multi-temporal Landsat-8 OLI acquired in the Daehongdan region, North Korea. From a case study, the misclassification of crops and forests, and isolated pixels in the initial classification result were greatly reduced by applying the proposed semi-supervised learning method. In addition, the combination of classification results of adjacent pixels for the extraction of new training data led to the great reduction of both misclassification results and isolated pixels, compared to the initial classification and traditional semi-supervised learning results. Therefore, it is expected that the proposed method would be effectively applied to classify areas in which it is difficult to collect sufficient training data.

• The Korean Journal of Applied Statistics
• /
• v.34 no.2
• /
• pp.167-175
• /
• 2021

Semi-supervised learning uses both labeled data and unlabeled data. Recently consistency regularization is very popular in semi-supervised learning. Unsupervised data augmentation (UDA) that uses unlabeled data augmentation is also based on the consistency regularization. The Kullback-Leibler divergence is used for the loss of unlabeled data and cross-entropy for the loss of labeled data through UDA learning. UDA uses techniques such as training signal annealing (TSA) and confidence-based masking to promote performance. In this study, we propose to use Jensen-Shannon divergence instead of Kullback-Leibler divergence, reverse-TSA and not to use confidence-based masking for performance improvement. Through experiment, we show that the proposed technique yields better performance than those of UDA.

• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.23-30
• /
• 2021

Sentiment Analysis has become very important field of research because posting of reviews is becoming a trend. Supervised, unsupervised and semi supervised machine learning methods done lot of work to mine this data. Feature engineering is complex and technical part of machine learning. Deep learning is a new trend, where this laborious work can be done automatically. Many researchers have done many works on Deep learning Convolutional Neural Network (CNN) and Long Shor Term Memory (LSTM) Neural Network. These requires high processing speed and memory. Here author suggested two models simple & bidirectional deep leaning, which can work on text data with normal processing speed. At end both models are compared and found bidirectional model is best, because simple model achieve 50% accuracy and bidirectional deep learning model achieve 99% accuracy on trained data while 78% accuracy on test data. But this is based on 10-epochs and 40-batch size. This accuracy can also be increased by making different attempts on epochs and batch size.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3790-3803
• /
• 2018

Content-based image retrieval is an approach used to query images based on their semantics. Semantic based retrieval has its application in all fields including medicine, space, computing etc. Semantically generated binary hash codes can improve content-based image retrieval. These semantic labels / binary hash codes can be generated from unlabeled data using convolutional autoencoders. Proposed approach uses semi-supervised deep hashing with semantic learning and binary code generation by minimizing the objective function. Convolutional autoencoders are basis to extract semantic features due to its property of image generation from low level semantic representations. These representations of images are more effective than simple feature extraction and can preserve better semantic information. Proposed activation and loss functions helped to minimize classification error and produce better hash codes. Most widely used datasets have been used for verification of this approach that outperforms the existing methods.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1375-1385
• /
• 2022

In this paper, we propose a semi-supervised domain adaptation solution to deal with practical face recognition (FR) scenarios where a single face image for each target identity (to be recognized) is only available in the training phase. Main goal of the proposed method is to reduce the discrepancy between the target and the source domain face images, which ultimately improves FR performances. The proposed method is based on the Domain Adatation network (DAN) using an MMD loss function to reduce the discrepancy between domains. In order to train more effectively, we develop a novel loss function learning strategy in which MMD loss and cross-entropy loss functions are adopted by using different weights according to the progress of each epoch during the learning. The proposed weight adoptation focuses on the training of the source domain in the initial learning phase to learn facial feature information such as eyes, nose, and mouth. After the initial learning is completed, the resulting feature information is used to training a deep network using the target domain images. To evaluate the effectiveness of the proposed method, FR performances were evaluated with pretrained model trained only with CASIA-webface (source images) and fine-tuned model trained only with FERET's gallery (target images) under the same FR scenarios. The experimental results showed that the proposed semi-supervised domain adaptation can be improved by 24.78% compared to the pre-trained model and 28.42% compared to the fine-tuned model. In addition, the proposed method outperformed other state-of-the-arts domain adaptation approaches by 9.41%.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.6
• /
• pp.578-586
• /
• 2021

We propose a semi-supervised learning method based on Variational AutoEncoder (VAE) and Unsupervised Data Augmentation (UDA) to improve the performance of an end-to-end speech recognizer. In the proposed method, first, the VAE-based augmentation model and the baseline end-to-end speech recognizer are trained using the original speech data. Then, the baseline end-to-end speech recognizer is trained again using data augmented from the learned augmentation model. Finally, the learned augmentation model and end-to-end speech recognizer are re-learned using the UDA-based semi-supervised learning method. As a result of the computer simulation, the augmentation model is shown to improve the Word Error Rate (WER) of the baseline end-to-end speech recognizer, and further improve its performance by combining it with the UDA-based learning method.

• International Journal of Computer Science & Network Security
• /
• v.23 no.11
• /
• pp.83-92
• /
• 2023

The majority of product users rely on the reviews that are posted on the appropriate website. Both users and the product's manufacturer could benefit from these reviews. Daily, thousands of reviews are submitted; how is it possible to read them all? Sentiment analysis has become a critical field of research as posting reviews become more and more common. Machine learning techniques that are supervised, unsupervised, and semi-supervised have worked very hard to harvest this data. The complicated and technological area of feature engineering falls within machine learning. Using deep learning, this tedious process may be completed automatically. Numerous studies have been conducted on deep learning models like LSTM, CNN, RNN, and GRU. Each model has employed a certain type of data, such as CNN for pictures and LSTM for language translation, etc. According to experimental results utilizing a publicly accessible dataset with reviews for all of the models, both positive and negative, and CNN, the best model for the dataset was identified in comparison to the other models, with an accuracy rate of 81%.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.963-973
• /
• 2023

Non-orthogonal multiple access (NOMA) is considered a key candidate technology for next-generation wireless communication systems due to its high spectral efficiency and massive connectivity. Incorporating the concepts of multiple-input-multiple-output (MIMO) into NOMA can further improve the system efficiency, but the hardware complexity increases. This study develops an energy-efficient (EE) subchannel assignment framework for MIMO-NOMA systems under the quality-of-service and interference constraints. This framework handles an energy-efficient co-training-based semi-supervised learning (EE-CSL) algorithm, which utilizes a small portion of existing labeled data generated by numerical iterative algorithms for training. To improve the learning performance of the proposed EE-CSL, initial assignment is performed by a many-to-one matching (MOM) algorithm. The MOM algorithm helps achieve a low complex solution. Simulation results illustrate that a lower computational complexity of the EE-CSL algorithm helps significantly minimize the energy consumption in a network. Furthermore, the sum rate of NOMA outperforms conventional orthogonal multiple access.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.15-21
• /
• 2018

Low-Rank Representation (LRR) based methods are widely used in many practical applications, such as face clustering and object detection, because they can guarantee high prediction accuracy when used to constructing graphs in graph - based semi-supervised learning. However, in order to solve the LRR problem, it is necessary to perform singular value decomposition on the square matrix of the number of data points for each iteration of the algorithm; hence the calculation is inefficient. To solve this problem, we propose an improved and faster LRR method based on the recently published Fast LRR (FaLRR) and suggests ways to introduce and optimize additional constraints on the underlying optimization goals in order to address the fact that the FaLRR is fast but actually poor in classification problems. Our experiments confirm that the proposed method finds a better solution than LRR does. We also propose Fast MLRR (FaMLRR), which shows better results when the goal of minimizing is added.

• Journal of KIISE:Software and Applications
• /
• v.35 no.5
• /
• pp.325-334
• /
• 2008

The goal of text categorization is to classify documents into a certain number of pre-defined categories. The previous studies in this area have used a large number of labeled training documents for supervised learning. One problem is that it is difficult to create the labeled training documents. While it is easy to collect the unlabeled documents, it is not so easy to manually categorize them for creating training documents. In this paper, we propose a new text categorization method based on semi-supervised learning. The proposed method uses only unlabeled documents and keywords of each category, and it automatically constructs training data from them. Then a text classifier learns with them and classifies text documents. The proposed method shows a similar degree of performance, compared with the traditional supervised teaming methods. Therefore, this method can be used in the areas where low-cost text categorization is needed. It can also be used for creating labeled training documents.