• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.25-34
• /
• 2022

With the development of online services, the ripple effect of negative comments is increasing, and the damage of cyber violence is rising. Various methods such as filtering based on forbidden words and reporting systems prevent this, but it is challenging to eradicate negative comments. Therefore, this study aimed to increase the accuracy of the classification of negative comments using deep learning and blur the parts corresponding to profanity. Two different conditional training helped decide the number of deep learning layers and filters. The accuracy of 88% confirmed with 90% of the dataset for training and 10% for tests. In addition, Grad-CAM enabled us to find and blur the location of swear words in negative comments. Although the accuracy of classifying comments based on simple forbidden words was 56%, it was found that blurring negative comments through the deep learning model was more effective.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.469-472
• /
• 2006

본 논문은 비음수 행렬 인수분해(NMF, non-negative matrix factorization)를 이용하여 문장을 추출하여 문서를 요약하는 새로운 방법을 제안하였다. 제안된 방법은 문장추출에 사용되는 의미 특징(semantic feature)이 비 음수 값을 갖기 때문에 잠재의미분석에 비해 문서의 내용을 정확하게 요약한다. 또한, 적은 계산비용을 통하여 쉽게 요약 문장을 추출할 수 있는 장점을 갖는다.

• Korean Journal of English Language and Linguistics
• /
• v.1 no.3
• /
• pp.369-386
• /
• 2001

This paper will show that traditional approaches to the derivation of different negative words have been of an essentially hypothetical nature, based on either linguists' intuitions or rather scant evidence, and that native-speaker dictionary entries show meaning potentials (rather than meanings) which are in fact linguistic and cognitive prototypes. The purpose of this paper is to demonstrate that using a large corpus of natural language can provide better answers to questions about word-formation (i.e., with particular reference to negative prefixation) than any other source of information.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.107-110
• /
• 2004

IEEE 802.15.3 is wireless Medium Access Control(MAC) and Physical Layer(PHY) specification for high rate WPAN (Wireless Personal Area Network). IEEE 802.15.3 MAC Layer provides Qos with three kinds of acknowledgements; No acknowledgement, Immediate acknowledgement, and Delayed acknowledgement. This paper presents how to improve QoS with new acknowledgement method called Delayed Negative acknowledgement. This paper describes the method of using Delayed Negative acknowledgement and presents the calculation of QoS improvement by using Delayed Negative acknowledgement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.7
• /
• pp.397-401
• /
• 2004

In an edge-weighted(positive, negative, or zero weights are possible) tree, we want to solve the problem of finding a longest path such that the sum of the weights of the edges in the path is non-negative. We present an algorithm to find a longest non-negative path of a degree 3 tree in Ο(n log n) time, where n is the number of nodes in the tree.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.10 no.2
• /
• pp.7-15
• /
• 1973

The operation behaviors of negative-resistance multivibrators. are described. The oscillation phenomena in monostable and bistable mode negative-resistance circuits are analyzed by using a analog computer. It is presented that voltage-controlled negative -resistance switching circuits may be in oscillation state for a time or parmanently by adding the bias voltage or trigger pulse. The results show that the care must be taken for this fact in the constructions of negative resistance switching circuits.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.880-884
• /
• 2006

In an edge-weighted(positive, negative, or zero weights are possible) tree, we want to solve the problem of finding a longest path such that the sum of the weights of the edges in tile path is non-negative. To find a longest non-negative path of a tree we present a sequential algorithm with O(n logn) time and a CREW PRAM parallel algorithm with $O(log^2n)$ time and O(n) processors. where n is the number of nodes in the tree.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.231-235
• /
• 2004

According to revealing the DNA sequence of human and living things, it increases that a demand on a new computational processing method which utilizes DNA sequence information. In this paper we propose a classification algorithm based on negative selection of the immune system to classify DNA patterns. Negative selection is the process to determine an antigenic receptor that recognize antigens, nonself cells. The immune cells use this antigen receptor to judge whether a self or not. If one composes n group of antigenic receptor for n different patterns, they can classify into n patterns. In this paper we propose a pattern classification algorithm based on negative selection in nucleotide base level and amino acid level.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.11a
• /
• pp.145-151
• /
• 2006

Association rule mining searches for interesting relationships among items in a given database. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary quality measures for association rule support and confidence and lift. Association rule is an interesting rule among purchased items in transaction, but the negative association rule is an interesting rule that includes items which are not purchased. Boolean Analyzer is the method to produce the negative association rule using PIM. But PIM is subjective. In this paper, we present statistical objective criterion in negative association rules using Boolean Analyzer.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.370-382
• /
• 2002

This paper puts forward an analysis of scope interactions between Japanese adverbial quantifiers like mainichi 'everyday'and tokidoki 'sometimes'and a negative morpheme nai 'not'on the basis of f(ocus)-structures. In this analysis, three f-structures are assigned to a sentence with an adverbial quantifier and a negative morpheme. One of them represents a negation-wide reading, and the other two represent quantifier-wide readings. Some f-structures, however, are unacceptable due to semantic or pragmatic factors. Different scope behaviors of the two quantifiers mentioned above can then be ascribed to acceptability of f-structures.