• Journal of the Korean Society for information Management
• /
• v.40 no.4
• /
• pp.329-349
• /
• 2023

With the rapid development of information and communication technology, the speed of data production has increased rapidly, and this is represented by the concept of big data. Discussions on quality and reliability are also underway for big data whose data scale has rapidly increased in a short period of time. On the other hand, small data is minimal data of excellent quality and means data necessary for a specific problem situation. In the field of culture and arts, data of various types and topics exist, and research using big data technology is being conducted. However, research on whether basic information about culture and arts institutions is accurately provided and utilized is insufficient. The basic information of an institution can be an essential basis used in most big data analysis and becomes a starting point for identifying an institution. This study collected data dealing with the basic information of culture and arts institutions to define common metadata and constructed small data in the form of a knowledge graph linking institutions around common metadata. This can be a way to explore the types and characteristics of culture and arts institutions in an integrated way.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• Journal of Elementary Mathematics Education in Korea
• /
• v.24 no.1
• /
• pp.1-30
• /
• 2020

This study was carried out in order to identify the error types of statistical graphs for statistical literacy education. We analyze the meaning of using graphs in statistical problem solving, and identify categories, frequencies, and contexts as the components of statistical graphs. Error types of representing categories and frequencies make statistics consumers see incorrect distributions of data by subjective point of view of statistics producers and visual illusion. Error types of providing contexts hinder the interpretation of statistical information by concealing or twisting the contexts of data. Moreover, the findings show that tasks provide standardized frame already for drawing graphs in order to avoid errors and pay attention to the process of drawing the graph rather than statistical literacy for analyzing data. We suggest some implications about statistical literacy education, ethical problems, and knowledge for teaching to be considered when teaching the statistical graph in elementary mathematics classes.

• Journal of Cadastre & Land InformatiX
• /
• v.46 no.1
• /
• pp.117-131
• /
• 2016

The development of LBS(location-based services) due to the widespread mobile environment highlights the importance of POI(point of interest) information. The accurate and up-to-date POI has to be ensured to reflect the information of rapidly changing places. For the efficient construction of POI, here we propose the novel construction system for t he place information. This system is based on crowd-sourcing in which a great number of users participate. In addition, we utilize the graph data model to build the new concept of the place information covering the wide areas extending from the specific point. Moreover, the implementation of the new system applying the graph data model and crowd-sourcing is realized in this paper. That is, this study suggests the whole new concept of the place information and shows the clustering and the renewal of the place information through crowd-sourcing.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.4
• /
• pp.11-20
• /
• 2018

Applications about systems integration of sensors and virtual environments have been developed increasingly. Accordingly, there is a need for the ability to represent, control, and manage physical sensors directly in a 3D virtual environment. In this research, a method of representing physical sensor devices in a 3D virtual environment has been defined using mixed and augmented reality, including virtual and real worlds, where sensors and virtual objects co-exist. The research is intended to control and manage various physical sensors through data sharing and interchange between heterogeneous computing environments. In order to achieve this, general sensor types have been classified, and a sensor based 3D scene graph for representing the functions of sensors has been defined. In addition, a sensor data model has been defined using the scene graph. Finally, a sensor 3D viewer has been implemented based on the scene graph and the data model so as to simulate the functions of sensors in indoor and outdoor 3D environments.

• Journal of Acupuncture Research
• /
• v.25 no.6
• /
• pp.67-76
• /
• 2008

Objectives : The 7-zone-diagnostic system is a diagnostic device to predetermine bodily locations by measuring the energy of body. This study was to investigate the relation between the different patterns of Zone 1, 2, 3 of Factor AA in CP-6000A(VEGA, Germany), 7-zone-diagnostic system and clinical parameters. The purpose of this study was relation Korean traditional medicine and western medicine with the data from 7-zone-diagnostic system and the clinical parameters. Methods : This study was carried out with the data from some clinical parameters. We made three groups according to the Factor AA patterns of CP-6000A. The Factor AA pattern of Group A is that the red bar graph of zone 1, 2, 3 were higher than the normal range and the others were the normal range. The Factor AA pattern of Group B was that the red bar graph of zone 1, 2, 3 was the normal range and the others were the normal range. The Factor AA pattern of Group C was that the red bar graph of zone 1, 2, 3 was lower than the normal range and the others were the normal range. After the data from clinical parameters to correspond with conditions of each group were selected, the data from clinical parameters among each groups analyzed statistically. Results : The values of GOT, GPT, r-GPT, Triglyceride, BUN, Uric acid of group A was higher than group C. Gastroscope of group A and B was higher than group C. Conclusions : It is thought that the red bar graph of zone 1, 2, 3 is higher, the group has the higher energy and the energy has a character of fire(熱). Those patterns have a high risk of hyperlipermia and liver, stomach disease.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3598-3614
• /
• 2020

With the increase of motor vehicles and tourism demand, some traffic problems gradually appear, such as traffic congestion, safety accidents and insufficient allocation of traffic resources. Facing these challenges, a model of Spatio-Temporal Dilated Convolutional Network (STDGCN) is proposed for assistance of extracting highly nonlinear and complex characteristics to accurately predict the future traffic flow. In particular, we model the traffic as undirected graphs, on which graph convolutions are built to extract spatial feature informations. Furthermore, a dilated convolution is deployed into graph convolution for capturing multi-scale contextual messages. The proposed STDGCN integrates the dilated convolution into the graph convolution, which realizes the extraction of the spatial and temporal characteristics of traffic flow data, as well as features of road occupancy. To observe the performance of the proposed model, we compare with it with four rivals. We also employ four indicators for evaluation. The experimental results show STDGCN's effectiveness. The prediction accuracy is improved by 17% in comparison with the traditional prediction methods on various real-world traffic datasets.

• The Journal of the Korea Contents Association
• /
• v.18 no.7
• /
• pp.449-458
• /
• 2018

As the usage of social network services increases, event information occurring offline is spreading more rapidly. Therefore, studies have been conducted to detect events by analyzing social data. In this paper, we propose a graph based event detection scheme considering user interest in social networks. The proposed scheme constructs a keyword graph by analyzing tweets posted by users. We calculates the interest measure from users' social activities and uses it to identify events by considering changes in interest. Therefore, it is possible to eliminate events that are repeatedly posted without meaning and improve the reliability of the results. We conduct various performance evaluations to demonstrate the superiority of the proposed event detection scheme.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.285-292
• /
• 2014

Intelligent systems are systems that mainly use knowledge rather than data or information. Therefore, knowledge representation is an important factor for intelligent system construction. Conceptual graph is a logical knowledge representation language which has graphical form and it can represent knowledge efficiently. It is, however, cumbersome to use conceptual graphs directly for programming. Various tools were developed to overcome this difficulties. In this paper, we survey on functions and characteristics of conceptual graph tools that can be utilized for constructing intelligent systems by using conceptual graphs. The result of this survey will be very helpful to use conceptual graphs for development of intelligent systems.