• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.392-393
• /
• 2012

This paper proposes a new document clustering method using clustering and Wikipedia. The proposed method can well represent the concept of cluster topics by means of NMF. It can solve the problem of "bags of words" to be not considered the meaningful relationships between documents and clusters, which expands the important terms of cluster by using of the synonyms of Wikipedia. The experimental results demonstrate that the proposed method achieves better performance than other document clustering methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.37-47
• /
• 2013

Text Mining is a research area of retrieving high quality hidden information such as patterns, trends, or distributions through analyzing unformatted text. Basically, since text mining assumes an unstructured text, it needs to be represented as a simple text model for analyzing it. So far, most frequently used model is VSM(Vector Space Model), in which a text is represented as a bag of words. However, recently much researches tried to apply a graph-based text model for representing semantic relationships between words. In this paper, we survey research trends of graph-based text representation models for text mining. Additionally, we also discuss about future models of graph-based text mining.

• Horticultural Science & Technology
• /
• v.32 no.1
• /
• pp.10-17
• /
• 2014

This study was conducted to elucidate the relationship between light and coloring and to obtain basic results for promoting redness expression in 'Kalle' (Pyrus communis L.) pear skin. It was investigated in location of anthocyanin layer by microscopic observation and differences in skin color expression of 'Kalle' bagged with paper bag which has different light transmittance rate and inside temperature. However, there was no anthocyanin layer in the brown skin and golden yellow color, anthocyanin layer was distributed in epidermins or hyperdermis of red skin pear and apple. Dark red colored 'Kalle' had more anthocyanin content, $29.8mg{\cdot}100g^{-1}$ FW than light red colored apple 'Hongro'. Light transmittance rate of physical characteristics used paper bags was the highest in white paper bag, 42.2% and it also had more light quantity, $8.9{\mu}mol$ than any other tested paper bags in specific wave length 650-655 nm. The maximum temperature of inner bag was higher about $3^{\circ}C$ in yellow paper bag. The red coloration and anthocyanin contents in no bagged fruits were higher than in any other bagged fruit. However, red color expression among the bagged fruits was higher in white paper bag than in double layered black paper bag and yellow paper bag. Also, chromaticity value seemd to be a good index to explain variation of fruit skin color, because anthocyanin content and chromaticity value were higher. Based on these results, it is desirable to cultivate 'Kalle' without bag for stable redness expression but bagging is essential for decreasing damage by insect in Korea. Further examination to find suitable time of removing paperbag for redness expression and decreasing insect damage. In addition, it is required to develop paperbag whose transmittance rate is high in specific light wavelength or temperature of inner bags is low. Additional key words: anthocyanin, bagging, chromaticity value, light transmittance, Pyrus communis L.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.581-587
• /
• 2013

In this paper, we propose a method of sentiment classification which uses Levenshtein distance. We generate BOW(Bag-Of-Word) applying Levenshtein daistance in sentiment features and used it as the training set. Then the machine learning algorithms we used were SVMs(Support Vector Machines) and NB(Naive Bayes). As the data set, we gather 2,385 reviews of movies from an online movie community (Daum movie service). From the collected reviews, we pick sentiment words up manually and sorted 778 words. In the experiment, we perform the machine learning using previously generated BOW which was applied Levenshtein distance in sentiment words and then we evaluate the performance of classifier by a method, 10-fold-cross validation. As the result of evaluation, we got 85.46% using Multinomial Naive Bayes as the accuracy when the Levenshtein distance was 3. According to the result of the experiment, we proved that it is less affected to performance of the classification in spelling errors in documents.

• International journal of advanced smart convergence
• /
• v.12 no.3
• /
• pp.75-88
• /
• 2023

In a specific domain, experts have different understanding of domain knowledge or different purpose of constructing ontology. These will lead to multiple different ontologies in the domain. This phenomenon is called the ontology heterogeneity. For research fields that require cross-ontology operations such as knowledge fusion and knowledge reasoning, the ontology heterogeneity has caused certain difficulties for research. In this paper, we propose a novel ontology matching model that combines word embedding and a concatenated continuous bag-of-words model. Our goal is to improve word vectors and distinguish the semantic similarity and descriptive associations. Moreover, we make the most of textual and structural information from the ontology and external resources. We represent the ontology as a graph and use the SimRank algorithm to calculate the structural similarity. Our approach employs a similarity queue to achieve one-to-many matching results which provide a wider range of insights for subsequent mining and analysis. This enhances and refines the methodology used in ontology matching.

• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.143-150
• /
• 2012

Computational techniques for topic classification can support qualitative research by automatically applying labels in preparation for qualitative analyses. This paper presents an evaluation of supervised learning techniques applied to one such use case, namely, that of labeling emotions, instructions and information in suicide notes. We train a collection of one-versus-all binary support vector machine classifiers, using cost-sensitive learning to deal with class imbalance. The features investigated range from a simple bag-of-words and n-grams over stems, to information drawn from syntactic dependency analysis and WordNet synonym sets. The experimental results are complemented by an analysis of systematic errors in both the output of our system and the gold-standard annotations.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.66-74
• /
• 2017

Patent classification is becoming more critical as patent filings have been increasing over the years. Despite comprehensive studies in the area, there remain several issues in classifying patents on IPC hierarchical levels. Not only structural complexity but also shortage of patents in the lower level of the hierarchy causes the decline in classification performance. Therefore, we propose a new method of classification based on different criteria that are categories defined by the domain's experts mentioned in trend analysis reports, i.e. Patent Landscape Report (PLR). Several experiments were conducted with the purpose of identifying type of features and weighting methods that lead to the best classification performance using Support Vector Machine (SVM). Two types of features (noun and noun phrases) and five different weighting schemes (TF-idf, TF-rf, TF-icf, TF-icf-based, and TF-idcef-based) were experimented on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2590-2606
• /
• 2017

Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.283-287
• /
• 2022

Machine Learning is the most popular method used in data science. Growth of data is not only numeric data but also text data. Most of the algorithm of supervised and unsupervised machine learning algorithms use numeric data. Now it is required to convert text data into numeric. There are many techniques for this conversion. Researcher confuses which technique is best in what situation. Here in proposed work BOW (Bag-of-Words) and TF-IDF (Term-Frequency-Inverse-Document-Frequency) has been studied based on different features to determine best method. After experimental results on text data, TF-IDF and BOW both provide better performance at range from 100 to 150 number of features.

• Journal of Korea Multimedia Society
• /
• v.23 no.9
• /
• pp.1181-1190
• /
• 2020

Detection of an anomaly pattern deviating normal data distribution in streaming data is an important technique in many application areas. In this paper, a method for detection of an newly emerging pattern in text streaming data which is an ordered sequence of texts is proposed based on text embedding and anomaly pattern detection. Using text embedding methods such as BOW(Bag Of Words), Word2Vec, and BERT, the detection performance of the proposed method is compared. Experimental results show that anomaly pattern detection using BERT embedding gave an average F1 value of 0.85 and the F1 value of 1 in three cases among five test cases.