• The Journal of Information Systems
• /
• v.28 no.3
• /
• pp.105-121
• /
• 2019

Purpose One of the reasons for the expansion of information systems in the enterprise is the increased efficiency of data analysis. In particular, the rapidly increasing data types which are complex and unstructured such as video, voice, images, and conversations in and out of social networks. The purpose of this study is the customer needs analysis from customer voices, ie, text data, in the web environment.. Design/methodology/approach As previous study results, the word frequency of the sentence is extracted as a word that interprets the sentence has better affects than frequency analysis. In this study, we applied the TF-IDF method, which extracts important keywords in real sentences, not the TF method, which is a word extraction technique that expresses sentences with simple frequency only, in Korean language research. We visualized the two techniques by cluster analysis and describe the difference. Findings TF technique and TF-IDF technique are applied for Korean natural language processing, the research showed the value from frequency analysis technique to semantic analysis and it is expected to change the technique by Korean language processing researcher.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.81-88
• /
• 2009

Many studies and policies are suggested for customer satisfaction to survive in multimedia content service markets. there are policies like a segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM. The problem of this policy is fixed allocation of media server resources. It is inefficient for costly media server resource. To resolve the problem and enhance the utilization of media server resource, the ACRFA (Adaptive Client Request Filtering Algorithm) was suggested per cluster to allocate media server resources by flexible resource allocation method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.574-576
• /
• 2021

It is necessary to introduce micro-service techniques when constructing large-scale operating systems or systems that take into account scalability. Kafka is a message queue with the pub/sub model, which has features that are well applied to distributed environments and is also suitable for microservices in that it can utilize various data sources. In this paper, we propose a data sharing method for educational video sharing services using Apache's Kafka. The proposed system builds a Kafka cluster for the educational video sharing service to share various data, and also uses a spark cluster to link with recommendation systems based on similarities in educational videos. We also present a way to share various data sources, such as files, various DBMS, etc.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.7
• /
• pp.189-198
• /
• 2023

The phenomenon of climate change is deteriorating which increased heatwaves, typhoons and heavy snowfalls in recent years. Followed by the 25^th United nations framework convention on climate change(COP25), the world countries have achieved a consensus on achieving carbon neutrality. City plays a crucial role in achieving carbon mitigation as well as economic development. Considering economic and environmental factors, we selected 63 cities in South Korea to analyze carbon emission situation by Elbow method and K-means clustering algorithm. The results reflected that cities in South Korea can be categorized into 6 clusters, which are technology-intensive cities, light-manufacturing intensive cities, central-innovation intensive cities, heavy-manufacturing intensive cities, service-intensive cities, rural and household-intensive cities. Specific suggestions are provided to improve city-level carbon mitigation development.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.4
• /
• pp.269-274
• /
• 2010

After introducing many different types of prefilter convergence, we introduce an universal method to define various notions of compactness using cluster point and convergence of a prefilter and to prove the Tychonoff theorem using characterizations of ultra(maximal) prefilters.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.853-861
• /
• 2003

An improved K-means document clustering method has been presented, where a concept vector is manipulated for each cluster on the basis of cosine similarity of text documents. The concept vectors are unit vectors that have been normalized on the n-dimensional sphere. Because the standard K-means method is sensitive to initial starting condition, our improvement focused on starting condition for estimating the modes of a distribution. The improved K-means clustering algorithm has been applied to a set of text documents, called Classic3, to test and prove efficiency and correctness of clustering result, and showed 7% improvements in its worst case.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.143-152
• /
• 2016

We can organize, manage, search, and process the documents efficiently by a document clustering. In general, the documents are clustered in a high dimensional feature space because the documents consist of many terms. In this paper, we propose a new method to cluster the documents efficiently in a low dimensional feature space by finding the core concepts from a domain ontology corresponding to the particular area documents. The experiment shows that our clustering method has a good performance.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.1-15
• /
• 1990

A mathematical definition of the cluster is suggested. A nonlinear 0-1 integer programming formulation for the multi-dimensional entity clustering problem is developed. A heuristic method named MDEC (Multi-Dimensional Entity Clustering) using centroids and the binary partition is developed and the numerical examples are shown. This method has an advantage of providing bottle-neck entity informations.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.603-611
• /
• 2005

We present some geometric applications of extremal length. The method of extremal length leads a simple proofs of theorems. And we consider the applications of extremal length to the boundary behavior of analytic functions and derive theorems in connection with the conformal mappings. It shows us the usefulness of the method of extremal length.

• Korean Journal of Mathematics
• /
• v.14 no.2
• /
• pp.281-289
• /
• 2006

We introduce the resistant length and examine its properties. We also consider the geometric applications of resistant length to the boundary behavior of analytic functions, conformal mappings and derive the theorem in connection with the cluster sets, purely geometric problems. The method of resistant length leads a simple proofs of theorems. So it shows us the usefulness of the method of resistant length.