• Journal of Korean Academy of Nursing
• /
• v.36 no.4
• /
• pp.652-661
• /
• 2006

Purpose. The purposes of this study were to apply data mining tool to nursing specific knowledge discovery process and to identify the utilization of data mining skill for clinical decision making. Methods. Data mining based on rough set model was conducted on a large clinical data set containing NMDS elements. Randomized 1000 patient data were selected from year 1998 database which had at least one of the five most frequently used nursing diagnoses. Patient characteristics and care service characteristics including nursing diagnoses, interventions and outcomes were analyzed to derive the meaningful decision rules. Results. Number of comorbidity, marital status, nursing diagnosis related to risk for infection and nursing intervention related to infection protection, and discharge status were the predictors that could determine the length of stay. Four variables (age, impaired skin integrity, pain, and discharge status) were identified as valuable predictors for nursing outcome, relived pain. Five variables (age, pain, potential for infection, marital status, and primary disease) were identified as important predictors for mortality. Conclusions. This study demonstrated the utilization of data mining method through a large data set with stan dardized language format to identify the contribution of nursing care to patient's health.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1275-1281
• /
• 2011

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding a element of the core.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.140-149
• /
• 2004

Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.288-295
• /
• 1998

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.185-197
• /
• 2022

Recently, deep learning networks with high performance for object recognition are emerging. In the case of object recognition using deep learning, it is important to build a training data set to improve performance. To build a data set, we need to collect and label the images. This process requires a lot of time and manpower. For this reason, open data sets are used. However, there are objects that do not have large open data sets. One of them is data required for license plate detection and recognition. Therefore, in this paper, we propose an artificial license plate generator system that can create large data sets by minimizing images. In addition, the detection rate according to the artificial license plate arrangement structure was analyzed. As a result of the analysis, the best layout structure was FVC_III and B, and the most suitable network was D2Det. Although the artificial data set performance was 2-3% lower than that of the actual data set, the time to build the artificial data was about 11 times faster than the time to build the actual data set, proving that it is a time-efficient data set building system.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.891-897
• /
• 2002

A symmetric minimal complement at infinity for a given symmetric Silvester data set in the complex plane is contructed.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1041-1044
• /
• 1999

This paper propose a solution to resolve data overflow or leakage when a subscriber receive data to service provider. The set-top box can communicate with a service provider and can inform the service provider its data overflow or leakage. When service provider received this control signal, it changes data transmit rate and transmits data with changed rate. The buffer of set-top box is important because incoming data from a service provider are stored by it.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.86-92
• /
• 2015

A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.1
• /
• pp.46-51
• /
• 2007

In this paper, we propose a new data clustering method using local probability and hypothesis theory. To cluster the test data set we analyze the local area of the test data set using local probability distribution and decide the candidate class of the data set using mean standard deviation and variance etc. To decide each class of the test data, statistical hypothesis theory is applied to the decided candidate class of the test data set. For evaluating, the proposed classification method is compared to the conventional fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm. The simulation results show more accuracy than results of fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.15-20
• /
• 2009

Much amount of data which demand fuzzy information system requires various analysis through the fuzzy set visualization. Therefore, this study proposes how to visualize fuzzy data set using variation of Venn diagram. For the fuzzy data which are related to many topics and have ranking of relation, this way gives results that users want by visualizing intersection, union and complementary set. That is, it visualizes the set of fuzzy data which have many topics at once, or the set of all fuzzy data which has topics, or the set of fuzzy data not related to a topic. Users control these sets by overlapping or piling them; visualized with Venn diagram, which is user-oriented. One distinct advantage of this visualization is the fact that it delivers web documents which users of search engine and web developers want much quickly. Furthermore, its possibility can be expanded to several purposes by using for information retrieval.