• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.363-370
• /
• 2018

Ransomware detection has become a hot topic in computer security for protecting digital contents. Unfortunately, current signature-based and static detection models are often easily evadable by compress, and encryption. For overcoming the lack of these detection approach, we have proposed the dynamic ransomware detection system using data mining techniques such as RF, SVM, SL and NB algorithms. We monitor the actual behaviors of software to generate API calls flow graphs. Thereafter, data normalization and feature selection were applied to select informative features. We improved this analysis process. Finally, the data mining algorithms were used for building the detection model for judging whether the software is benign software or ransomware. We conduct our experiment using more suitable real ransomware samples. and it's results show that our proposed system can be more effective to improve the performance for ransomware detection.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.120-127
• /
• 2002

The common problems found in the data mining methods current in use have following problems. First: It is ineffective in searching for frequent items due to changing of minimal support values. Second: It is not adaptable to occurring of unuseful relation rules. Third: It is very difficult to re-use preceding results while adding new transactions. In this paper, we introduce a new method named as SPM-IRG(Selective Patters Mining using item Relation Graph), that is designed to solve above listed problems. SPM-IRG method creates a frequent items using minimal support values obtained by investigating direct or indirect relation of all items in transaction. Moreover, the new method can minimize inefficiency of existing method by constructing frequent items using only the items that we are interested.

• Journal of Korean Society for Quality Management
• /
• v.47 no.3
• /
• pp.597-613
• /
• 2019

Purpose: The purpose of this study is to analyze the trend of quality research by analyzing the entire JKSQM(Journal of the Korean Society for Quality Management). Methods: This study is to analyze the frequency of words used in the abstract of the all JKSQM by applying the text mining processing. We use wordcrowd among text mining techniques. Results: 22 words of high frequency were presented in the abstract of the paper published in the JKSQM for 42 years. The frequency of words was shown on a 10 year basis, and the four important words were plotted on a change graph for each Vol. Frequent words of each Vol. are added in the appendix. Conclusion: The main research results are as follows. First, there has been no significant change in research trends over the last 40 years. Second, the early SQC words have been widely used, and since 1990, many words such as service-oriented words have been used, indicating a change in the times. Third, the use of the words of the 4th industrial revolution since 2010 is weak. In the above analysis, the trend of quality research in Korea is within the quality category and can be considered conservative. Now, it is expected that everything will be changed in the period of the 4th Industrial Revolution, and it is time to study the direction of quality in Korea.

• The Journal of Information Systems
• /
• v.30 no.2
• /
• pp.189-214
• /
• 2021

Purpose This paper aims to effectively utilize user-generated content (UGC) and analyze the market structure of a relatively new market which lacks rich user review information. Specifically, we propose a domain-specific text mining tool for the domestic craft beer market and visualize the market structure by incorporating how individual beer products are positioned in the perceptual map of consumers. Design/methodology/approach We collect user review information from Naver blogs, and extract words that describe beers. We identify semantic relationships between beer products through text mining, and then depending on these semantic relationships, construct a graph representing the market structure of the domestic craft beer market based on the consumer's perceptual map. Findings First, beer products produced in the same brewery are perceived as very similar to consumers. Second, only two products, 'Heukdang Milky Stout' and 'Gompyo', was noticeably distinguishable from other products. Third, even though 'Gyeongbokgung' is from a different brewery, it is located very close to the products of 'Jeju Beer' brewery such as 'Jeju Baeknokdam Ale' and 'Seongsan Ilchulbong Ale', which suggests the influence of 'landmark series.' We successfully show that our methodology effectively describes the market structure of the craft beer market.

• Asia pacific journal of information systems
• /
• v.29 no.4
• /
• pp.838-855
• /
• 2019

Online product reviews are a vital source for companies in that they contain consumers' opinions of products. The earlier methods of opinion mining, which involve drawing semantic information from text, have been mostly applied in one dimension. This is not sufficient in itself to elicit reviewers' comprehensive views on products. In this paper, we propose a novel approach in opinion mining by projecting online consumers' reviews in a multidimensional framework to improve review interpretation of products. First of all, we set up a new framework consisting of six dimensions based on a marketing management theory. To calculate the distances of review sentences and each dimension, we embed words in reviews utilizing Google's pre-trained word2vector model. We classified each sentence of the reviews into the respective dimensions of our new framework. After the classification, we measured the sentiment degrees for each sentence. The results were plotted using a radar graph in which the axes are the dimensions of the framework. We tested the strategy on Amazon product reviews of the iPhone and Galaxy smartphone series with a total of around 21,000 sentences. The results showed that the radar graphs visually reflected several issues associated with the products. The proposed method is not for specific product categories. It can be generally applied for opinion mining on reviews of any product category.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.11a
• /
• pp.70-73
• /
• 2017

페이스북 SNS 플랫폼에서 제공하는 데이터 수집 프로토콜을 이용해 콘텐츠들의 인기 점수와 사용자 의견들을 수집하고 수집된 정보를 가공하여 기계학습을 진행한다. 오피니언 데이터를 학습함으로 인해 인간의 관점을 모방하게 되며 결과적으로 콘텐츠의 질을 판단하는 요소로써 작용하도록 한다. 데이터의 수집은 페이스북 측에서 제공하는 Graph API 와 Python 을 이용하여 진행한다. Graph API 는 HTTP GET 방식의 프로토콜을 이용하여 요청 하고 JSON 형식으로 결과를 반환한다. 학습은 Multiple Linear Regression 과 Gradient Descent Algorithm(GDA)을 사용하여 진행한다. 이후 학습이 진행된 프로그램에 사용자 의견 데이터를 건네주면 최종인기 점수를 예측하는 시스템을 설명한다.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.130-138
• /
• 2023

The traffic flow in an urban area is affected by the date, weather, and regional traffic flow. The existing methods are weak to model the dynamic road network features, which results in inadequate long-term prediction performance. To solve the problems regarding insufficient capacity for dynamic modeling of road network structures and insufficient mining of dynamic spatio-temporal features. In this study, we propose a novel traffic flow prediction framework called shared spatio-temporal attention convolution optimization network (SSTACON). The shared spatio-temporal attention convolution layer shares a spatio-temporal attention structure, that is designed to extract dynamic spatio-temporal features from historical traffic conditions. Subsequently, the graph optimization module is used to model the dynamic road network structure. The experimental evaluation conducted on two datasets shows that the proposed method outperforms state-of-the-art methods at all time intervals.

• Journal of the HCI Society of Korea
• /
• v.10 no.1
• /
• pp.5-17
• /
• 2015

Nowadays various public data have been serviced to the public. Through the opening of public data, the transparency and effectiveness of public policy developed by governments are increased and users can lead to the growth of industry related to public data. Since end-users of using public data are citizens, it is very important for everyone to figure out the meaning of public data using proper visualization techniques. In this work, to indicate the significance of widespread public data, we consider UN voting record as public data in which many people may be interested. In general, it has high utilization value by diplomatic and educational purposes, and is available in public. If we use proper data mining and visualization algorithms, we can get an insight regarding the voting patterns of UN members. To visualize, it is necessary to measure the voting similarity values among UN members and then a social graph is created by the similarity values. Next, using a graph layout algorithm, the social graph is rendered on the screen. If we use the existing method for visualizing the social graph, it is hard to understand the meaning of the social graph because the graph is usually dense. To improve the weak point of the existing social graph visualization, we propose Friend-Matching, Friend-Rival Matching, and Bubble Heap algorithms in this paper. We also validate that our proposed algorithms can improve the quality of visualizing social graphs displayed by the existing method. Finally, our prototype system has been released in http://datalab.kunsan.ac.kr/politiz/un/. Please, see if it is useful in the aspect of public data utilization.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.327-332
• /
• 2015

Constructing a k-nearest neighbor (k-NN) graph is a primitive operation in the field of recommender systems, information retrieval, data mining and machine learning. Although there have been many algorithms proposed for constructing a k-NN graph, either the existing approaches cannot be used for various types of similarity measures, or the performance of the approaches is decreased as the number of nodes or dimensions increases. In this paper, we present a novel algorithm for k-NN graph construction based on "balanced" canopy clustering. The experimental results show that irrespective of the number of nodes or dimensions, our algorithm is at least five times faster than the brute-force approach while retaining an accuracy of approximately 92%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3197-3218
• /
• 2012

Compared with traditional itinerary planning, intention-oriented itinerary recommendations can provide more flexible activity planning without requiring the user's predetermined destinations and is especially helpful for those in unfamiliar environments. The rank and classification of points of interest (POI) from location-based social networks (LBSN) are used to indicate different user intentions. The mining of vehicles' physical trajectories can provide exact civil traffic information for path planning. This paper proposes a POI category-based itinerary recommendation framework combining physical trajectories with LBSN. Specifically, a Voronoi graph-based GPS trajectory analysis method is utilized to build traffic information networks, and an ant colony algorithm for multi-object optimization is implemented to locate the most appropriate itineraries. We conduct experiments on datasets from the Foursquare and GeoLife projects. A test of users' satisfaction with the recommended items is also performed. Our results show that the satisfaction level reaches an average of 80%.