• Title/Summary/Keyword: Fisher Criterion

Search Result 42, Processing Time 0.031 seconds

A Bayesian Test Criterion for the Multivariate Behrens-Fisher Problem

  • Kim, Hea-Jung
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.1
    • /
    • pp.107-124
    • /
    • 1999
  • An approximate Bayes criterion for multivariate Behrens-Fisher problem is proposed and examined. Development of the criterion involves derivation of approximate Bayes factor using the imaginary training sample approach introduced by Speigelhalter and Smith (1982). The criterion is designed to develop a Bayesian test, so that it provides an alternative test to other tests based upon asymptotic sampling theory (such as the tests suggested by Bennett(1951), James(1954) and Yao(1965). For the derived criterion, numerical studies demonstrate routine application and give comparisons with the classical tests.

  • PDF

Identifying Statistically Significant Gene-Sets by Gene Set Enrichment Analysis Using Fisher Criterion (Fisher Criterion을 이용한 Gene Set Enrichment Analysis 기반 유의 유전자 집합의 검출 방법 연구)

  • Kim, Jae-Young;Shin, Mi-Young
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.4
    • /
    • pp.19-26
    • /
    • 2008
  • Gene set enrichment analysis (GSEA) is a computational method to identify statistically significant gene sets showing significant differences between two groups of microarray expression profiles and simultaneously uncover their biological meanings in an elegant way by employing gene annotation databases, such as Cytogenetic Band, KEGG pathways, gene ontology, and etc. For the gone set enrichment analysis, all the genes in a given dataset are first ordered by the signal-to-noise ratio between the groups and then further analyses are proceeded. Despite of its impressive results in several previous studies, however, gene ranking by the signal-to-noise ratio makes it difficult to consider highly up-regulated genes and highly down-regulated genes at the same time as the candidates of significant genes, which possibly reflect certain situations incurred in metabolic and signaling pathways. To deal with this problem, in this article, we investigate the gene set enrichment analysis method with Fisher criterion for gene ranking and also evaluate its effects in Leukemia related pathway analyses.

A Bayesian Test Criterion for the Behrens-Firsher Problem

  • Kim, Hea-Jung
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.1
    • /
    • pp.193-205
    • /
    • 1999
  • An approximate Bayes criterion for Behrens-Fisher problem (testing equality of means of two normal populations with unequal variances) is proposed and examined. Development of the criterion involves derivation of approximate Bayes factor using the imaginary training sample approachintroduced by Spiegelhalter and Smith (1982). The proposed criterion is designed to develop a Bayesian test criterion having a closed form, so that it provides an alternative test to those based upon asymptotic sampling theory (such as Welch's t test). For the suggested Bayes criterion, numerical study gives comparisons with a couple of asymptotic classical test criteria.

  • PDF

Low Resolution Face Recognition with Photon-counting Linear Discriminant Analysis (포톤 카운팅 선형판별법을 이용한 저해상도 얼굴 영상 인식)

  • Yeom, Seok-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.64-69
    • /
    • 2008
  • This paper discusses low resolution face recognition using the photon-counting linear discriminant analysis (LDA). The photon-counting LDA asymptotically realizes the Fisher criterion without dimensionality reduction since it does not suffer from the singularity problem of the fisher LDA. The linear discriminant function for optimal projection is determined in high dimensional space to classify unknown objects, thus, it is more efficient in dealing with low resolution facial images as well as conventional face distortions. The simulation results show that the proposed method is superior to Eigen face and Fisher face in terms of the accuracy and false alarm rates.

Development of Feature Selection Method for Neural Network AE Signal Pattern Recognition and Its Application to Classification of Defects of Weld and Rotating Components (신경망 AE 신호 형상인식을 위한 특징값 선택법의 개발과 용접부 및 회전체 결함 분류에의 적용 연구)

  • Lee, Kang-Yong;Hwang, In-Bom
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.21 no.1
    • /
    • pp.46-53
    • /
    • 2001
  • The purpose of this paper is to develop a new feature selection method for AE signal classification. The neural network of back propagation algorithm is used. The proposed feature selection method uses the difference between feature coordinates in feature space. This method is compared with the existing methods such as Fisher's criterion, class mean scatter criterion and eigenvector analysis in terms of the recognition rate and the convergence speed, using the signals from the defects in welding zone of austenitic stainless steel and in the metal contact of the rotary compressor. The proposed feature selection methods such as 2-D and 3-D criteria showed better results in the recognition rate than the existing ones.

  • PDF

Feature Vector Extraction using Time-Frequency Analysis and its Application to Power Quality Disturbance Classification (시간-주파수 해석 기법을 이용한 특징벡터 추출 및 전력 외란 신호 식별에의 응용)

  • 이주영;김기표;남상원
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.619-622
    • /
    • 2001
  • In this paper, an efficient approach to classification of transient and harmonic disturbances in power systems is proposed. First, the Stop-and-Go CA CFAR Detector is utilized to detect a disturbance from the power signals which are mixed with other disturbances and noise. Then, (i) Wigner Distribution, SVD(Singular Value Decomposition) and Fisher´s Criterion (ii) DWT and Fisher´s Criterion, are applied to extract an efficient feature vector. For the classification procedure, a combined neural network classifier is proposed to classify each corresponding disturbance class. Finally, the 10 class data simulated by Matlab power system blockset are used to demonstrate the performance of the proposed classification system.

  • PDF

Automatic Classification of Power System Harmonic Disturbances (전력시스템 고조파 외란의 자동식별)

  • Kim, Byoung-Chul;Kim, Hyun-Soo;Nam, Sang-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.7
    • /
    • pp.551-558
    • /
    • 2000
  • In this paper a systematic approach to automatic classificationi of power system harmonic disturbances is proposed where the proposed approach consists of the following three steps:(i) detecting and localizing each harmonic disturbance by applying discrete wavelet transform(DWT) (ii) extracting an efficient feature vector from each detected disturbance waveform by utilizing FFT and principal component analysis (PCA) along with Fisher's criterion and (iii) classifying the corresponding type of each harmonic disturbance by recognizing the pattern of each feature vector. To demonstrate the performance and applicability of the proposed classification procedure some simulation results obtained by analyzing 8-class power system harmonic disturbances being generated with Matlab power system blockset are also provided.

  • PDF

Behrens-Fisher Problem from a Model Selection Point of View

  • Jeon, Jong-Woo;Lee, Kee-Won
    • Journal of the Korean Statistical Society
    • /
    • v.20 no.2
    • /
    • pp.99-107
    • /
    • 1991
  • Behrens-Fisher problem is viewed from a model selection approach. Normal distribution is regarded as an approximating model, A criterion, called TIC, is derived and is compared with selection criteria such as AIC and a bootstrap estimator. Stochastic approximation is used since no closed form expression is available for the bootstrap estimator.

  • PDF

Photon-counting linear discriminant analysis for face recognition at a distance

  • Yeom, Seok-Won
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.250-255
    • /
    • 2012
  • Face recognition has wide applications in security and surveillance systems as well as in robot vision and machine interfaces. Conventional challenges in face recognition include pose, illumination, and expression, and face recognition at a distance involves additional challenges because long-distance images are often degraded due to poor focusing and motion blurring. This study investigates the effectiveness of applying photon-counting linear discriminant analysis (Pc-LDA) to face recognition in harsh environments. A related technique, Fisher linear discriminant analysis, has been found to be optimal, but it often suffers from the singularity problem because the number of available training images is generally much smaller than the number of pixels. Pc-LDA, on the other hand, realizes the Fisher criterion in high-dimensional space without any dimensionality reduction. Therefore, it provides more invariant solutions to image recognition under distortion and degradation. Two decision rules are employed: one is based on Euclidean distance; the other, on normalized correlation. In the experiments, the asymptotic equivalence of the photon-counting method to the Fisher method is verified with simulated data. Degraded facial images are employed to demonstrate the robustness of the photon-counting classifier in harsh environments. Four types of blurring point spread functions are applied to the test images in order to simulate long-distance acquisition. The results are compared with those of conventional Eigen face and Fisher face methods. The results indicate that Pc-LDA is better than conventional facial recognition techniques.

COMMON FIXED POINTS FOR COMPATIBLE MAPPINGS OF TYPE(A) IN 2-METRIC SPACES

  • WANG, WEN-ZUO
    • Honam Mathematical Journal
    • /
    • v.22 no.1
    • /
    • pp.91-97
    • /
    • 2000
  • In this paper we obtain a criterion for the existence of a common fixed point of a pair of mappings in 2-metric spaces. Our result generalizes a number of fixed point theorems given by Imdad, Khan and Khan [1], Kahn and Fisher [2], Kubiak [3], Rhoades [5], and Singh, Tiwari and Gupta [6].

  • PDF