• The Korean Journal of Applied Statistics
• /
• v.34 no.3
• /
• pp.507-521
• /
• 2021

Detecting outliers among high-dimensional data encounters a challenging problem of screening the variables since relevant information is often contained in only a few of the variables. Otherwise, when a number of irrelevant variables are included in the data, the distances between all observations tend to become similar which leads to making the degree of outlierness of all observations alike. The subspace outlier detection method overcomes the problem by measuring the degree of outlierness of the observation based on the relevant subsets of the entire variables. In this paper, we survey recent subspace outlier detection techniques, classifying them into three major types according to the subspace selection method. And we summarize the techniques of each type based on how to select the relevant subspaces and how to measure the degree of outlierness. In addition, we introduce some computing tools for implementing the subspace outlier detection techniques and present results from the simulation study and real data analysis.

• ETRI Journal
• /
• v.37 no.2
• /
• pp.317-327
• /
• 2015

A reliable analysis of consumer preference from a large amount of purchase data acquired in real time and an accurate customer characterization technique are essential for successful direct marketing campaigns. In this study, an optimal segmentation of post office customers in Korea is performed using a subspace projection-based clustering method to generate an accurate customer characterization from a high-dimensional census dataset. Moreover, a traditional temporal mining method is extended to an algorithm using the MapReduce framework for a consumer preference analysis. The experimental results show that it is possible to use parallel mining through a MapReduce-based algorithm and that the execution time of the algorithm is faster than that of a traditional method.

• Smart Structures and Systems
• /
• v.7 no.2
• /
• pp.153-167
• /
• 2011

The Subspace based System Identification Techniques (SSIT) have been very popular within the research circles in the last decade due to their proven superiority over the other existing system identification techniques. For operational (output only) modal analysis, the stochastic SSIT and for operational modal analysis in the presence of exogenous inputs, the combined deterministic stochastic SSIT have been used in the literature. This study compares the application of the two alternative techniques on a typical school building in Istanbul using 100 Monte Carlo simulations. The study clearly shows that the combined deterministic stochastic SSIT performs superior to the stochastic SSIT when the techniques are applied on noisy data from low to mid rise stiff structures.

• Structural Engineering and Mechanics
• /
• v.38 no.3
• /
• pp.315-332
• /
• 2011

The Combined Deterministic Stochastic Subspace based System Identification Technique (CDSSSIT) is a powerful input-output system identification technique which is known to be always convergent and numerically stable. The technique determines a Kalman state sequence from the projection of the output-input data. The state space matrices are determied subsequently from this Kalman state sequence using least squares. The objective of this paper is to examine the efficiency of the CDSSSIT in identifying the modal parameters (frequencies and mode shapes) of a stiff structure. The results show that the CDSSSIT predicts the modal parameters of stiff buildings quite accurately but is very sensitive to the location of sensors.

• Journal of Korean Association for Spatial Structures
• /
• v.3 no.4 s.10
• /
• pp.53-58
• /
• 2003

In order to control seismic responses of building structures effectively and stably, it is very important to estimate the dynamic characteristics of target structure exactly based on input-output signal data. In this paper, it is shown that Subspace Identification Method is able to be applied effectively to system identification of building structures. To verify the efficiency of Subspace Identification Method, the vibration experiments were conducted on a specimen structure which is a 5-storied building structure model consisted of H-shaped steel beam, and the simulated seismic responses of the identified structure model were compared with the observed ones under the same excitation. It was observed that the experimental results coincided with the analyzed ones proposed in this paper.

• Journal of Industrial Technology
• /
• v.31 no.B
• /
• pp.3-7
• /
• 2011

This paper addresses a computationally simple adaptive beamforming method to cancel interferences arriving onto a sensor array. In the proposed method, an estimate of the interference subspace is extracted from a submatrix of the sample covariance matrix and an orthonormal basis for the estimated subspace is efficiently found, one basis vector being updated every sample. Its computational burden is just $O(M{\eta})$ in an M-sensor array when ${\eta}$ directional signals are present. The new method does not make any premises of the geometrical structure of arrays, and can be applied to arbitrary arrays.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.408-410
• /
• 2009

We present an efficient and robust measurement model for visual tracking. This approach builds on and extends work on subspace representations of measurement model. Subspace-based tracking algorithms have been introduced to visual tracking literature for a decade and show considerable tracking performance due to its robustness in matching. However the measures used in their measurement models are often restricted to few approaches. We propose a novel measure of object matching using Angle In Feature Space, which aims to improve the discriminability of matching in subspace. Therefore, our tracking algorithm can distinguish target from similar background clutters which often cause erroneous drift by conventional Distance From Feature Space measure. Experiments demonstrate the effectiveness of the proposed tracking algorithm under severe cluttered background.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.9
• /
• pp.863-871
• /
• 2004

In this paper, we propose a subspace channel estimation technique for DS/CDMA DMB down link system, which can obtain reduction in numerical complexity by using of matched filtering outputs. The complexity reduction is considerable when the channel length is small and the system is moderately loaded. Previously proposed subspace-based blind channel estimation algorithm suffer from high numerical complexity for systems with large spreading gains. Although the proposed algerian suffers a slight performance loss, it becomes negligible for large observation length. Performance is evaluated through simulations and the derivation of the analytical MSE.

• Structural Engineering and Mechanics
• /
• v.59 no.1
• /
• pp.187-207
• /
• 2016

Practical ambient excitations of engineering structures usually do not comply with the stationary-white-noise assumption in traditional operational modal analysis methods due to heavy traffic, wind guests, and other disturbances. In order to eliminate spurious modes induced by non-white noise inputs, the improved stochastic subspace identification based on a delay index is proposed in this paper for a representative kind of stationary non-white noise ambient excitations, which have nonzero autocorrelation values near the vertical axis. It relaxes the stationary-white-noise assumption of inputs by avoiding corresponding unqualified elements in the Hankel matrix. Details of the improved stochastic subspace identification algorithms and determination of the delay index are discussed. Numerical simulations on a four-story frame and laboratory vibration experiments on a simply supported beam have demonstrated the accuracy and reliability of the proposed method in eliminating spurious modes under non-white noise ambient excitations.

• Journal of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.847-868
• /
• 2016

Let M be an invariant subspace of $H^2$ over the bidisk. Associated with M, we have the fringe operator $F^M_z$ on $M{\ominus}{\omega}M$. It is studied the Fredholmness of $F^M_z$ for (generalized) zero based invariant subspaces M. Also ker $F^M_z$ and ker $(F^M_z)^*$ are described.