• The Korean Journal of Applied Statistics
• /
• v.19 no.2
• /
• pp.291-303
• /
• 2006

Data mining is the work to extract information from existing data file. So, the one of best important thing in data mining process is the quality of data to be used. In this thesis, we propose the data fusion technique using decision rule for data enrichment that one phase to improve data quality in KDD process. Simulations were performed to compare the proposed data fusion technique with the existing techniques. As a result, our data fusion technique using decision rule is characterized with low MSE or misclassification rate in fusion variables.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.472-476
• /
• 2007

Learning rule affects importantly the performance of neural network. This paper proposes a new fuzzy learning rule that uses the learning rate considering the distance between the input vector and the prototypes of classes. When the learning rule updates the prototypes of classes, this consideration reduces the effect of outlier on the prototypes of classes. This comes from making the effect of the input vector, which locates near the decision boundary, larger than an outlier. Therefore, it can prevents an outlier from deteriorating the decision boundary. This new fuzzy learning rule is integrated into IAFC(Integrated Adaptive Fuzzy Clustering) fuzzy neural network. Iris data set is used to compare the performance of the proposed fuzzy neural network with those of other supervised neural networks. The results show that the proposed fuzzy neural network is better than other supervised neural networks.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.761-767
• /
• 2011

In this paper, to improve performance of spectrum sensing, we propose the method which can find optimal threshold based on power of PU(Primary User) signal. To find optimal threshold value, we will use mathematical method, and find threshold which can has lowest error probability. Each SU(Secondary User) use this threshold and All Su makes local decision. All Su Send local decision to FC(Fusion Center). In this paper we consider K-out-of-n rule to combining local decision. To make global decision value, FC find optimal n. In the FC. FC received local decision which has lowest error probability and using optimal n and these vaule. FC make global decision value. In this paper, to analysis performance proposed scheme, we simulate proposed scheme using matlab and compare with traditional OR Rule. As a result of simulation, we can know that preposed scheme can get a better performance than traditional OR rule.

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.2
• /
• pp.115-128
• /
• 2002

One of the well-studied problems in data mining is the search for association rules. In this paper we consider the statistical decision making of association threshold in association rule. A chi-squared statistic is used to find minimum association threshold. We calculate the range of the value that two item sets are occurred simultaneously, and find the minimum confidence threshold values.

• 한국데이터정보과학회:학술대회논문집
• /
• 2002.06a
• /
• pp.169-182
• /
• 2002

One of the well-studied problems in data mining is the search for association rules. In this paper we consider the statistical decision making of association threshold in association rule. A chi-squared statistic is used to find minimum association threshold. We can calculate the range of the value that two item sets are occurred simultaneously, and can find the minimum confidence threshold values.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.1027-1039
• /
• 2005

Consider the problem of estimating a $p{\times}1$ mean vector $\theta(p\geq4)$ under the quadratic loss, based on a sample $X_1$, $X_2$, $\cdots$, $X_n$. We find a Lindley type decision rule which shrinks the usual one toward the mean of observations when the underlying distribution is that of a variance mixture of normals and when the norm $\parallel\;{\theta}-\bar{{\theta}}1\;{\parallel}$ is restricted to a known interval, where $bar{{\theta}}=\frac{1}{p}\;\sum\limits_{i=1}^{p}{\theta}_i$ and 1 is the column vector of ones. In this case, we characterize a minimal complete class within the class of Lindley type decision rules. We also characterize the subclass of Lindley type decision rules that dominate the sample mean.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.81-86
• /
• 1997

It is proposed, for fuzzy combustion control system of refuse incinerator to find the relationship between inputs and outputs and to generate rules to control by using rough set theory. It is not easy to find out the corresponding inputs for each output and the control rules with incomplete or imprecise information consisting expert knowledge, process and manipulator values in the field, and operation manual for the given system. Most decision problems can be formulated employing decision table formalism. A decision table on fuzzy combustion control system for refuse incinerator is simplified and produces control(rules). The I/O realtions and the control rules found by rough set theory are compared with the previous result.

• Journal of Integrative Natural Science
• /
• v.10 no.1
• /
• pp.33-39
• /
• 2017

Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}(p-q{\geq}3)$, $q=rank(P_V)$ with a projection matrix $P_v$ under the quadratic loss, based on a sample $X_1$, $X_2$, ${\cdots}$, $X_n$. We find a James-Stein type decision rule which shrinks towards projection vector when the underlying distribution is that of a variance mixture of normals and when the norm ${\parallel}{\theta}-P_V{\theta}{\parallel}$ is restricted to a known interval, where $P_V$ is an idempotent and projection matrix and rank $(P_V)=q$. In this case, we characterize a minimal complete class within the class of James-Stein type decision rules. We also characterize the subclass of James-Stein type decision rules that dominate the sample mean.

• Speech Sciences
• /
• v.10 no.1
• /
• pp.71-84
• /
• 2003

In the acoustic modeling for large vocabulary speech recognition, a sparse data problem caused by a huge number of context-dependent (CD) models usually leads the estimated models to being unreliable. In this paper, we develop a new clustering method based on the C45 decision-tree learning algorithm that effectively encapsulates the CD modeling. The proposed scheme essentially constructs a supervised decision rule and applies over the pre-clustered triphones using the C45 algorithm, which is known to effectively search through the attributes of the training instances and extract the attribute that best separates the given examples. In particular, the data driven method is used as a clustering algorithm while its result is used as the learning target of the C45 algorithm. This scheme has been shown to be effective particularly over the database of low unknown-context ratio in terms of recognition performance. For speaker-independent, task-independent continuous speech recognition task, the proposed method reduced the percent accuracy WER by 3.93% compared to the existing rule-based methods.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.33 no.10
• /
• pp.381-386
• /
• 1984

This paper deals with the microcomputer realization of EMG pattern recognition system which provides identification of motion commands from the EMG signals for the on-line control of a prosthetic arm. A probabilistic model of pattern is formulated in the feature space of integral absolute value(IAV) to describe the relation between a motion command and the location of corresponding pattern. This model enables the derivation of sample density function of a command in the feature space of IAV. Classification is caried out through the multiclass sequential decision process, where the decision rule and the stopping rule of the process are designed by using the simple mathematical formulas defined as the likelihood probability and the decision measure, respectively. Some floating point algorithms such as addition, multiplication, division, square root and exponential function are developed for calculating the probability density functions and the decision measure. Only six primitive motions and one no motion are incorporated in this paper.