• Korean Journal of Remote Sensing
• /
• v.32 no.3
• /
• pp.235-244
• /
• 2016

In large-area crop classification with MODIS data, a mixed pixel problem caused by the low resolution of MODIS data has been one of main issues. To mitigate this problem, this paper proposes a hierarchical classification algorithm that selectively classifies the specific crop class of interest by using their spectral characteristics. This selective classification algorithm can reduce mixed pixel effects between crops and improve classification performance. The methodological developments are illustrated via a case study in Jilin city, China with MODIS Normalized Difference Vegetation Index (NDVI) and Near InfRared (NIR) reflectance datasets. First, paddy fields were extracted from unsupervised classification of NIR reflectance. Non-paddy areas were then classified into corn and bean using time-series NDVI datasets. In the case study result, the proposed classification algorithm showed the best classification performance by selectively classifying crops having similar spectral characteristics, compared with traditional direct supervised classification of time-series NDVI and NIR datasets. Thus, it is expected that the proposed selective hierarchical classification algorithm would be effectively used for producing reliable crop maps.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.125-137
• /
• 2000

A solution of the findpath problem in which a moving object in required to avoid moving obstacles and move to the designated target in the plane is porcided via the second method of Lyapunov. This paper presents an new control designed by a family of piecewise Lyapunov functions to solve a findpath problem and gives some simultion results of that.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.575-588
• /
• 2012

Exploiting unlabeled text data with a relatively small labeled corpus has been an active and challenging research topic in text mining, due to the recent growth of the amount of biomedical literature. Biomedical named-entity recognition is an essential prerequisite task before effective text mining of biomedical literature can begin. This paper proposes an Active Co-Training (ACT) algorithm for biomedical named-entity recognition. ACT is a semi-supervised learning method in which two classifiers based on two different feature sets iteratively learn from informative examples that have been queried from the unlabeled data. We design a new classification problem to measure the informativeness of an example in unlabeled data. In this classification problem, the examples are classified based on a joint view of a feature set to be informative/non-informative to both classifiers. To form the training data for the classification problem, we adopt a query-by-committee method. Therefore, in the ACT, both classifiers are considered to be one committee, which is used on the labeled data to give the informativeness label to each example. The ACT method outperforms the traditional co-training algorithm in terms of f-measure as well as the number of training iterations performed to build a good classification model. The proposed method tends to efficiently exploit a large amount of unlabeled data by selecting a small number of examples having not only useful information but also a comprehensive pattern.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.7
• /
• pp.311-316
• /
• 2019

Classification problem is to predict the class to which an input data belongs. One of the most popular methods to do this is training a machine learning algorithm using the given dataset. In this case, the dataset should have a well-balanced class distribution for the best performance. However, when the dataset has an imbalanced class distribution, its classification performance could be very poor. To overcome this problem, we propose an over-sampling scheme that balances the number of data by using Conditional Generative Adversarial Networks (CGAN). CGAN is a generative model developed from Generative Adversarial Networks (GAN), which can learn data characteristics and generate data that is similar to real data. Therefore, CGAN can generate data of a class which has a small number of data so that the problem induced by imbalanced class distribution can be mitigated, and classification performance can be improved. Experiments using actual collected data show that the over-sampling technique using CGAN is effective and that it is superior to existing over-sampling techniques.

• Journal of Information Science Theory and Practice
• /
• v.5 no.3
• /
• pp.31-47
• /
• 2017

The narrow-down approach, separately composed of search and classification stages, is an effective way of dealing with large-scale hierarchical text classification. Recent approaches introduce methods of incorporating global, local, and path information extracted from web taxonomies in the classification stage. Meanwhile, in the case of utilizing path information, there have been few efforts to address existing limitations and develop more sophisticated methods. In this paper, we propose an expansion method to effectively exploit category path information based on the observation that the existing method is exposed to a term mismatch problem and low discrimination power due to insufficient path information. The key idea of our method is to utilize relevant information not presented on category paths by adding more useful words. We evaluate the effectiveness of our method on state-of-the art narrow-down methods and report the results with in-depth analysis.

• The Journal of Information Technology and Database
• /
• v.2 no.2
• /
• pp.71-85
• /
• 1995

Many research results conducted by neural network researchers have claimed that the classification accuracy of neural networks is superior to, or at least equal to that of conventional methods. However, in series of neural network classifications, it was found that the classification accuracy strongly depends on the characteristics of training data set. Even though there are many research reports that the classification accuracy of neural networks can be different, depending on the composition and architecture of the networks, training algorithm, and test data set, very few research addressed the problem of classification accuracy when the basic assumption of data monotonicity is violated, In this research, development project of automated credit evaluation system is described. The finding was that arrangement of training data is critical to successful implementation of neural training to maintain monotonicity of the data set, for enhancing classification accuracy of neural networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.767-772
• /
• 2005

The Internet is a packet switched network which offers best-effort service, but current IP network provide enhanced services such Quality of Services, Virtual Private Network (VPN) services, Distribute Firewall and IP Security Gateways. All such services need packet classification for determining the flow. The problem is performing scalable packet classification at wire speeds even as rule databases increase in size. Therefore, this research offer packet classification algorithm that increase classifier performance when working with enlarge rules database by rearrange rule structure into Bitmap Intersection Lookup (BIL) tables. It will use packet's header field for looking up BIL tables and take the result with intersection operation by logical AND. This approach will use simple algorithm and rule structure, it make classifier have high search speed and fast updates.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.8-15
• /
• 2016

In recent years, one of deep learning models called Deep Belief Network (DBN) which formed by stacking restricted Boltzman machine in a greedy fashion has beed widely used for classification and recognition. With an ability to extracting features of high-level abstraction and deal with higher dimensional data structure, this model has ouperformed outstanding result on image and speech recognition. In this research, we assess the applicability of deep learning in dna classification level. Since the training phase of DBN is costly expensive, specially if deals with DNA sequence with thousand of variables, we introduce a new encoding method, using decimal-binary vector to represent the sequence as input to the model, thereafter compare with one-hot-vector encoding in two datasets. We evaluated our proposed model with different contrastive algorithms which achieved significant improvement for the training speed with comparable classification result. This result has shown a potential of using decimal-binary vector on DBN for DNA sequence to solve other sequence problem in bioinformatics.

• Journal of Korean Society for Quality Management
• /
• v.23 no.3
• /
• pp.126-139
• /
• 1995

We describe a formal approach to the construction of optimal classification rule for the two-group normal classification with equal population mean problem. Based on the utility function of Bernardo, we suggest a balanced design for the classification and construct the optimal rule under the balanced design condition. The rule is characterized by a constrained minimization of total risk of misclassification, the constraint of which is constructed by the process of equation between expected utilities of the two group conditional densities. The efficacy of the suggested rule is examined through numerical studies. This indicates that, in case little is known about the relative population sizes, dramatic gains in accuracy of classification result can be achieved.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.6
• /
• pp.1-7
• /
• 2018

A multi-label classification is to find multiple labels associated with the input pattern. Multi-label classification can be achieved by extending conventional single-label classification. Common extension techniques are known as Binary relevance, Label powerset, and Classifier chains. However, most of the extended multi-label naive bayes classifier has not been able to accurately estimate posterior probabilities because it does not reflect the label dependency. And the remaining extended multi-label naive bayes classifier has a problem that it is unstable to estimate posterior probability according to the label selection order. To estimate posterior probability well, we propose a new posterior probability estimation method that reflects the probability between all labels and labels efficiently. The proposed method reflects the correlation between labels. And we have confirmed through experiments that the extended multi-label naive bayes classifier using the proposed method has higher accuracy then the existing multi-label naive bayes classifiers.