• Journal of Digital Convergence
• /
• v.15 no.4
• /
• pp.191-198
• /
• 2017

It is needed to support intelligent customized health information service for user convenience in PHR based Personal Health Care Service Platform. In this paper, we specify an ontology-based health data model for Personal Health Care Service Platform. We also design a knowledge search algorithm that can be used to figure out similar health record by applying machine learning and data mining techniques. Axis-based mining algorithm, which we proposed, can be performed based on axis-attributes in order to improve relevance of knowledge exploration and to provide efficient search time by reducing the size of candidate item set. And K-Nearest Neighbor algorithm is used to perform to do grouping users byaccording to the similarity of the user profile. These algorithms improves the efficiency of customized information exploration according to the user 's disease and health condition. It can be useful to apply the proposed algorithm to a process of inference in the Personal Health Care Service Platform and makes it possible to recommend customized health information to the user. It is useful for people to manage smart health care in aging society.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.10-14
• /
• 2008

Computer-animated crowd scenes are often observed in computer games and feature films. The common way to model locomotion of large human crowds is to employ agent based methods where the behavior of each person is independently modeled. But for large crowds, it is difficult for a user to control all the individuals using individual behavior model. Instead, crowd behaviors can be controlled more intuitively at the group level than at the individual level. In this paper, we present the group force field model to simulate path following behavior for groups. A group is a set of characters who have the same goals, i.e. the same path to follow. We also define three characteristics of grouping behavior: alignment, cohesion, and distribution. Our group force field model preserves these characteristics while avoiding collisions. By using our model, user can generate desired group behaviors from line-up behavior to lumped one.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5849-5855
• /
• 2011

As application development environment changes rapidly, importance of user interface design is increasing. Usually, most of designers are clustering by subjective method of individual to define objects that have relativity in design interface. But, interface which is designed without particular rules just adds inefficiency and complexity of business to user who use this system. Therefore, in this paper, we propose an object oriented design model that allows for flexible development by formalizing the user interface prototype in any GUI environment. The visual cohesion of the user interface is a new set of criteria which has been studied in relation to the user interface contents, and is founded on the basis of the cohesion of the interface as defined using basic software engineering concepts. The visual cohesion includes the issue of how each unit is arranged and grouped, as well as the cohesion of the business events which appear in the programming unit. The interface will become easier to understand and use if the business events are grouped by their inter-relevance within the user interface.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.585-595
• /
• 2004

A query processing is a critical issue in data warehouse environment since queries on data warehouses often involve hundreds of complex operations over large volumes of data. Data warehouses therefore build a large number of materialized views to increase the system performance. Which views to materialized is an important factor on the view maintenance cost as well as the query performance. The goal of materialized view selection problem is to select an optimal set of views that minimizes total query response time in addition to the view maintenance cost. In this paper, we present an efficient solution for the materialized view selection problem. Although the optimal selection of materialized views is NP-hard problem, we developed a feasible solution by utilizing the characteristics of relational operators such as join, selection, and grouping.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.2
• /
• pp.112-123
• /
• 2005

The latest E-commerce sites provide personalized services to maximize user satisfaction for Internet user The collaborative filtering is an algorithm for personalized item real-time recommendation. Various supplementary methods are provided for improving the accuracy of prediction and performance. It is important to consider these two things simultaneously to implement a useful recommendation system. However, established studies on collaborative filtering technique deal only with the matter of accuracy improvement and overlook the matter of performance. This study considers representative attribute-neighborhood, recommendation textile set, and similarity grouping that are expected to improve performance to the recommendation agent system. Ultimately, this paper suggests empirical applications to verify the adequacy and the validity on this system with the development of Fashion Design Recommendation Agent System (FDRAS ).

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.219-233
• /
• 2008

This paper suggests an intelligent semantic blog model to systematically analyze and manage biogosphere with ontology as its conceptual knowledge base. In the model, the system managers may support users to easily find appropriate blog resources by tracking and analyzing various relationships between ontology - they may intelligently recommend Interest blog communities to relevant users by monitoring interaction activities in blogoshpere, dynamically grouping the communities with the ontology. To systematically specify the functionality of our model, 1) we first express the structure of blog resources in terms of objects and relationships between them and then 2) we formalize a set of operators designed to be applied to the resources. System queries are implemented by the combination of the operators.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.933-940
• /
• 2018

The conversion of the internal combustion engine vehicle to the electric vehicle is suggested as a solution to the problem of global climate change and environmental pollution. Accordingly, this study was started to promote the use of electric vehicles. The purpose of this study is to identify the basic background knowledge and current status of electric vehicles in Korea and abroad, and expand from previous understanding on which factors affect ones choice on electric vehicles by considering individual characteristics and context in detail. In the analysis, a set of demand forecasting models were constructed by grouping the respondents based on the household characteristics as well as the vehicle ownership. At the time in need for better understanding of the feasibility of electric vehicles, it is expected that the research can assist the promotion of electric vehicles. In the follow-up study, I would like to continue the research on the activation of electric vehicles.

• Convergence Security Journal
• /
• v.23 no.4
• /
• pp.61-70
• /
• 2023

Clustering is an unsupervised learning method that involves grouping data based on features such as distance metrics, using data without known labels or ground truth values. This method has the advantage of being applicable to various types of data, including images, text, and audio, without the need for labeling. Traditional clustering techniques involve applying dimensionality reduction methods or extracting specific features to perform clustering. However, with the advancement of deep learning models, research on deep clustering techniques using techniques such as autoencoders and generative adversarial networks, which represent input data as latent vectors, has emerged. In this study, we propose a deep clustering technique based on deep learning. In this approach, we use an autoencoder to transform the input data into latent vectors, and then construct a vector space according to the cluster structure and perform k-means clustering. We conducted experiments using the MNIST and Fashion-MNIST datasets in the PyTorch machine learning library as the experimental environment. The model used is a convolutional neural network-based autoencoder model. The experimental results show an accuracy of 89.42% for MNIST and 56.64% for Fashion-MNIST when k is set to 10.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.612-628
• /
• 2001

This paper presents a methodology to extract classes and inheritance relations from procedural software. The methodology is based on the idea of generating all groups of class candidates, based on the combinatorial groups of object candidates, and their inheritance with all possible combinations and selecting a group of object candidates, and their inheritance with all possible combinations and selecting a group with the best or optimal combination of candidates with respect to the degree of relativity and similarity between class candidates in the group and classes in a domain model. The methodology has innovative features in class candidates in the group and classes in a domain model. The methodology has innovative features in class and inheritance extraction: a clustering method based on both static (attribute) and dynamic (method) clustering, the combinatorial cases of grouping class candidate cases based on abstraction, a signature similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement, that is, the horizontal measurement for overall group similarity between n class candidates and m classes, and the vertical measurement for specific similarity between a set of classes in a group of class candidates and a set of classes with the same class hierarchy in a domain model, etc. This methodology provides reengineering experts with a comprehensive and integrated environment to select the best or optimal group of class candidates.

• Journal of Service Research and Studies
• /
• v.3 no.2
• /
• pp.53-60
• /
• 2013

Datamining from the large data in the form of various techniques for obtaining information have been developed. In recent years one of the most sought areas of pattern recognition and machine learning method is created with most of existing learning algorithms based on categorical attributes to a rule or decision model. However, the real-world data, it may consist of numeric attributes in many cases. In addition it contains attributes with numerical values to the normal categorical attribute. In this case, therefore, it is required processes in order to use the data to learn an appropriate value for the type attribute. In this paper, the domain of the numeric attributes are divided into several segments using learning algorithm techniques of discritization. It is described Clustering with other data mining techniques. Large amount of first cluster with characteristics is similar records from the database into smaller groups that split multiple given finite patterns in the pattern space. It is close to each other of a set of patterns that together make up a bunch. Among the set without specifying a particular category in a given data by extracting a pattern. It will be described similar grouping of data clustering technique to classify the data.