• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.1-7
• /
• 2001

In this paper, we have investigated the CDMA(Code Division Multiple Access) Cellular System with non-linear equalizer in reverse link channel. In general, due to unknown characteristics of channel in the wireless communication, the distribution of the observables cannot be specified by a finite set of parameters; instead, we partitioned the m-dimensional sample space Into a finite number of disjointed regions by using quantiles and a vector quantizer based on training samples. The algorithm proposed is based on a piecewise approximation to regression function based on quantiles and conditional partition moments which are estimated by Robbins Monro Stochastic Approximation (RMSA) algorithm. The resulting equalizers and detectors are robust in the sense that they are insensitive to variations in noise distributions. The main idea is that the robust equalizers and robust partition detectors yield better performance in equiprobably partitioned subspace of observations than the conventional equalizer in unpartitioned observation space under any condition. And also, we apply this idea to the CDMA system and analyze the BER performance.

• Journal of Digital Convergence
• /
• v.13 no.11
• /
• pp.157-164
• /
• 2015

This paper describes subspace clustering of categorical data for convergence and integration. Because categorical data are not designed for dealing only with numerical data, The conventional evaluation measures are more likely to have the limitations due to the absence of ordering and high dimensional data and scarcity of frequency. Hence, conditional entropy measure is proposed to evaluate close approximation of cohesion among attributes within each cluster. We propose a new objective function that is used to reflect the optimistic clustering so that the within-cluster dispersion is minimized and the between-cluster separation is enhanced. We performed experiments on five real-world datasets, comparing the performance of our algorithms with four algorithms, using three evaluation metrics: accuracy, f-measure and adjusted Rand index. According to the experiments, the proposed algorithm outperforms the algorithms that were considered int the evaluation, regarding the considered metrics.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.31-39
• /
• 2015

This paper deals with a method for estimating variance components on the basis of projections under the assumption of random effects model. It discusses how to use projections for getting sums of squares to estimate variance components. The use of projections makes the vector subspace generated by the model matrix to be decomposed into subspaces that are orthogonal each other. To partition the vector space by the model matrix stepwise procedure is used. It is shown that the suggested method is useful for obtaining Type I sum of squares requisite for the ANOVA method.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.833-841
• /
• 1998

The ann of this study is 10 propose all eff'tcient mclhod for partition of multi-dimensIOnal feature space into pattern subspace for automated generation of fuzzy rule. The suggested mclhod predicates on sequential subdivision of the fuzzy subspacc. and the size of construc1cd pattern space is variable. Under this procedure, n-dimensional pattern space, after considering the distributional characteristic patterns, is partitioned into two different pattern subspaces. From the two subspaces, the pattern space for further subdivision is chosen; then, this subdivision procedure recursively repeats itself until the stopping condition is fulfilled. The result of this study is applied to 2, 4, 7 band of satellite Landsat TM and satisfac10ry result is acquired.

• Spatial Information Research
• /
• v.23 no.3
• /
• pp.113-122
• /
• 2015

Recently, according to developing advanced construction technologies, buildings has been enlarged such as high-rise buildings or complex buildings associated with underground facilities. The number of indoor activity population has increased very quickly. Because of that, technical requirements for Indoor location based service (Indoor LBS) also have been increased. Although indoor networks have to be constructed for efficient LBSs in indoor space based on OGC IndoorGML, it is not suitable for large and complex space to apply the simple network structure to constructing indoor navigation networks. The indoor navigation network has to be constructed according to logical, physical, and functional constraints for indoor space. In order to do that, subspacing methods are required to partition large and complex indoor space into proper size of subspace. In this paper, we proposed the basic requirements of subspacing in indoor space for creating efficient indoor network, as well the work process of subspacing in indoor space.