• Journal of the Korean Data and Information Science Society
• /
• v.6 no.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?".

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.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
• /
• v.3 no.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
• /
• v.18 no.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
• /
• v.14 no.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
• /
• v.22 no.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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.88-102
• /
• 2006

In multimedia information retrieval, multimedia data are represented as vectors in high dimensional space. To search these vectors effectively, a variety of indexing methods have been proposed. However, the performance of these indexing methods degrades dramatically with increasing dimensionality, which is known as the dimensionality curse. To resolve the dimensionality curse, dimensionality reduction methods have been proposed. They map feature vectors in high dimensional space into the ones in low dimensional space before indexing the data. This paper proposes a method for dimensionality reduction based on a function approximating the Euclidean distance, which makes use of the norm and angle components of a vector. First, we identify the causes of the errors in angle estimation for approximating the Euclidean distance, and discuss basic directions to reduce those errors. Then, we propose a novel method for dimensionality reduction that composes a set of subvectors from a feature vector and maintains only the norm and the estimated angle for every subvector. The selection of a good reference vector is important for accurate estimation of the angle component. We present criteria for being a good reference vector, and propose a method that chooses a good reference vector by using Levenberg-Marquardt algorithm. Also, we define a novel distance function, and formally prove that the distance function lower-bounds the Euclidean distance. This implies that our approach does not incur any false dismissals in reducing the dimensionality effectively. Finally, we verify the superiority of the proposed method via performance evaluation with extensive experiments.

• Communications for Statistical Applications and Methods
• /
• v.7 no.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.

• The Pure and Applied Mathematics
• /
• v.3 no.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.