• Journal of the Korean Data and Information Science Society
• /
• 제6권2호
• /
• pp.9-15
• /
• 1995

In discriminant analysis the procedures commonly used to estimate the dimensionality involve testing a sequence of dimensionality hypotheses. There is a problem with the size of the test since dimensionality hypotheses are tested sequentially and thus they are actually conditional tests. The focus of this paper is "How is the size of the test affected by viewing this sequence of tests as conditional tests?".

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1670-1673
• /
• 2002

For pattern recognition on high-dimensional data, such as images, the dimensionality reduction as a preprocessing is effective. By dimensionality reduction, we can (1) reduce storage capacity or amount of calculation, and (2) avoid "the curse of dimensionality" and improve classification performance. Popular tools for dimensionality reduction are Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Independent Component Analysis (ICA) recently. Among them, only LDA takes the class labels into consideration. Nevertheless, it, has been reported that, the classification performance with ICA is better than that with LDA because LDA has restriction on the number of dimensions after reduction. To overcome this dilemma, we propose a new dimensionality reduction technique based on an information theoretic measure for difference of distribution. It takes the class labels into consideration and still it does not, have restriction on number of dimensions after reduction. Improvement of classification performance has been confirmed experimentally.

• 한국컴퓨터정보학회논문지
• /
• 제23권12호
• /
• pp.21-26
• /
• 2018

As the large amount of data can be efficiently stored, the methods extracting meaningful features from big data has become important. Especially, the techniques of converting high- to low-dimensional data are crucial for the 'Data visualization'. In this study, principal component analysis (PCA; linear dimensionality reduction technique) and Isomap (non-linear dimensionality reduction technique) are introduced and applied to neural big data obtained by the functional magnetic resonance imaging (fMRI). First, we investigate how much the physical properties of stimuli are maintained after the dimensionality reduction processes. We moreover compared the amount of residual variance to quantitatively compare the amount of information that was not explained. As result, the dimensionality reduction using Isomap contains more information than the principal component analysis. Our results demonstrate that it is necessary to consider not only linear but also nonlinear characteristics in the big data analysis.

• Communications for Statistical Applications and Methods
• /
• 제3권3호
• /
• pp.25-30
• /
• 1996

In discriminant analysis the procedures commonly used to estimate the dimensionality involve testing a sequence of dimensionality hypotheses. There is a problem with the size of the test since dimensionality hypotheses are tested sequentially and thus they are actually conditional tests. The focus of this paper is to investigate in asymptotic sense what happens to the sequential testing procedure if the assumption of normality does not hold.

• International Journal of Contents
• /
• 제18권1호
• /
• pp.1-16
• /
• 2022

With the advent of the 5G, networks and information and communication technologies have been continuously developed. In the fields of art galleries, virtual reality (VR) exhibitions that can be visited online have emerged, innovating the way of human-computer interaction and creating new artistic experiences for users. This study explores the three-dimensionality, clarity, and innovative interactions that users experience when viewing a VR exhibit, which affects the exhibit's presence. Besides, in terms of research method, the research sets spatial participation and immersion as dependent variables, with three-dimensionality (high versus low), clarity (high versus low), and innovation (high versus low) in a 2×2×2 design as the base, and explores their interaction effects. The results show that three-dimensionality and innovative interactions affect spatial participation. First of all, in groups with high innovation and low three-dimensionality, spatial participation presents a higher positive factor. Secondly, with regard to immersion, three-dimensionality, clarity and innovation present a tripartite interaction. Groups with low three-dimensionality and high clarity have a higher positive effect on immersion when the level of innovation is low. When the degree of innovation is high, the positive effect on immersion is higher in groups with high three-dimensionality and low clarity. The above results show that in the production of VR exhibitions, it is necessary to increase the three-dimensionality and clarity of exhibited image contents, while taking into account the user's perception and innovativeness. On the other hand, this study puts forward suggestions for the design, content and future development of VR exhibitions, which has important reference significance for the improvement and innovation of future VR exhibitions.

• Industrial Engineering and Management Systems
• /
• 제14권2호
• /
• pp.210-219
• /
• 2015

A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.

• International Journal of Computer Science & Network Security
• /
• 제22권6호
• /
• pp.230-240
• /
• 2022

Sharing of online videos via internet is an emerging and important concept in different types of applications like surveillance and video mobile search in different web related applications. So there is need to manage personalized web video retrieval system necessary to explore relevant videos and it helps to peoples who are searching for efficient video relates to specific big data content. To evaluate this process, attributes/features with reduction of dimensionality are computed from videos to explore discriminative aspects of scene in video based on shape, histogram, and texture, annotation of object, co-ordination, color and contour data. Dimensionality reduction is mainly depends on extraction of feature and selection of feature in multi labeled data retrieval from multimedia related data. Many of the researchers are implemented different techniques/approaches to reduce dimensionality based on visual features of video data. But all the techniques have disadvantages and advantages in reduction of dimensionality with advanced features in video retrieval. In this research, we present a Novel Intent based Dimension Reduction Semi-Supervised Learning Approach (NIDRSLA) that examine the reduction of dimensionality with explore exact and fast video retrieval based on different visual features. For dimensionality reduction, NIDRSLA learns the matrix of projection by increasing the dependence between enlarged data and projected space features. Proposed approach also addressed the aforementioned issue (i.e. Segmentation of video with frame selection using low level features and high level features) with efficient object annotation for video representation. Experiments performed on synthetic data set, it demonstrate the efficiency of proposed approach with traditional state-of-the-art video retrieval methodologies.

• 전자공학회논문지CI
• /
• 제43권4호
• /
• pp.88-102
• /
• 2006

멀티미디어 정보 검색에서 멀티미디어 데이터는 고차원 공간상의 벡터로 표현된다. 이러한 특정 벡터를 효율적으로 검색하기 위하여 다양한 색인 기법이 제안되어 왔다. 그러나 특정 벡터의 차원이 증가하면서 색인 기법의 효율성이 급격히 떨어지는 차원의 저주 문제가 발생한다. 차원의 저주 문제를 해결하기 위하여 색인하기 이전에 원 특정 벡터를 저차원 공간상의 벡터로 사상하는 차원 축소 기법이 제안된 바 있다. 본 연구에서는 벡터의 놈과 각도 성분을 이용하여 유클리드 거리를 근사하는 함수를 기반으로 하는 새로운 차원 축소 기법을 제안한다. 먼저, 유클리드 거리 근사를 위하여 추정된 각도의 오차의 발생 원인을 분석하고 이 오차를 줄이기 위한 기본 방향을 제시한다. 또한, 고차원 특정 벡터를 다수의 특징 서브 벡터들의 집합으로 분리하고 각 특징 서브 벡터로부터 놈과 각도 성분을 근사하여 차원을 축소하는 새로운 기법을 제안한다. 각도 성분을 정확하게 근사하기 위해서는 올바른 기준 벡터의 설정이 필수적이다. 본 연구에서는 최적 기준 벡터의 조건을 제시하고, Levenberg-Marquardt 알고리즘을 이용하여 기준 벡터를 선정하는 방법을 제안한다. 또한, 축소된 저차원 공간상의 벡터틀을 위한 새로운 거리 함수를 정의하고, 이 거리 함수가 유클리드 거리 함수의 하한 함수가 됨을 이론적으로 증명한다. 이는 제안된 기법이 착오 기각의 발생을 허용하지 않으면서 효과적으로 차원을 줄일 수 있음을 의미하는 것이다. 끝으로, 다양한 실험에 의한 성능 평가를 통하여 제안하는 방법의 우수성을 규명한다.

• Communications for Statistical Applications and Methods
• /
• 제7권2호
• /
• pp.597-603
• /
• 2000

A versatile dimensionality assessment index DETECT has been developed for binary item response data by Kim (1994). The present paper extends the use of DETECT to the polytomously scored item data. A simulation study shows DETECT performs well in differentiating multidimensional data from unidimensional one by yielding a greater value of DETECT in the case of multidimensionality. An additional investigation is necessary for the dimensionally meaningful clustering methods, such as HAC for binary data, particularly sensitive to the polytomous data.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제3권2호
• /
• pp.141-154
• /
• 1996

A data-driven index of dimensionality for an educational or psychological test - DETECT, short for Dimensionality Evaluation To Enumerate Contributing Traits, is proposed in this paper. It is based on estimated conditional covariances of item pairs, given score on remaining test items. Its purpose is to detect whatever multidimensionality structure exists, especially in the case of approximate simple structure. It does so by assigning items to relatively dimensionally homogeneous clusters via attempted maximization of the DETECT over all possible item cluster partitions. The performance of DETECT is studied through real and simulated data analyses.