• Title/Summary/Keyword: Too selection

검색결과 195건 처리시간 0.023초

Selection probability of multivariate regularization to identify pleiotropic variants in genetic association studies

  • Kim, Kipoong;Sun, Hokeun
    • Communications for Statistical Applications and Methods
    • /
    • 제27권5호
    • /
    • pp.535-546
    • /
    • 2020
  • In genetic association studies, pleiotropy is a phenomenon where a variant or a genetic region affects multiple traits or diseases. There have been many studies identifying cross-phenotype genetic associations. But, most of statistical approaches for detection of pleiotropy are based on individual tests where a single variant association with multiple traits is tested one at a time. These approaches fail to account for relations among correlated variants. Recently, multivariate regularization methods have been proposed to detect pleiotropy in analysis of high-dimensional genomic data. However, they suffer a problem of tuning parameter selection, which often results in either too many false positives or too small true positives. In this article, we applied selection probability to multivariate regularization methods in order to identify pleiotropic variants associated with multiple phenotypes. Selection probability was applied to individual elastic-net, unified elastic-net and multi-response elastic-net regularization methods. In simulation studies, selection performance of three multivariate regularization methods was evaluated when the total number of phenotypes, the number of phenotypes associated with a variant, and correlations among phenotypes are different. We also applied the regularization methods to a wild bean dataset consisting of 169,028 variants and 17 phenotypes.

극치값 추정에 적합한 비매개변수적 핵함수 개발 (A Development of Noparamtric Kernel Function Suitable for Extreme Value)

  • 차영일;김순범;문영일
    • 한국수자원학회논문집
    • /
    • 제39권6호
    • /
    • pp.495-502
    • /
    • 2006
  • 비매개변수적 빈도해석을 위해 제시되는 핵밀도함수 방법에서 내삽법은 외삽법보다 더 신뢰적이기 때문에 내삽법과 관련된 광역폭의 선택이 외삽 문제와 연관되는 핵함수의 선택보다 중요하다. 그러나, 재현기간이 자료구간보다 커지거나 또는 $200{\sim}500$년 빈도 발생과 같은 확률 값에 대한 추정을 하는 경우는 자료의 외삽이 중요한 문제이며 따라서 이에 따른 핵함수의 선택도 중요시된다. 핵함수에 따라서는 외삽에 대해 상대적으로 작거나 큰 값이 제시 될 수 있으므로 극치값 추정에는 어려운 점이 있다. 따라서 본 논문에서는 일반적으로 내삽 및 외삽에도 적합한 핵함수로 Modified Cauchy 핵함수를 제시하였다.

IEEE 802.11 RSSI 기반 무인비행로봇 실내측위를 위한 AP 선택 기법 (AP Selection Criteria for UAV High-precision Indoor Positioning based on IEEE 802.11 RSSI Measurement)

  • 황준규;박준구
    • 제어로봇시스템학회논문지
    • /
    • 제20권12호
    • /
    • pp.1204-1208
    • /
    • 2014
  • As required performance of UAV (Unmanned Aerial Vehicle) becomes more complex and complicated, required positioning accuracy is becoming more and more higher. GPS is a reliable world wide positioning providing system. Therefore, UAV generally acquires position information from GPS. But when GPS is not available such as too weak signal or too less GPS satellites environments, UAV needs alternative positioning system such as network positioning system. RSSI (Received Signal Strength Indicator) based positioning, which is one method of network positioning technologies, determines its position using RSSI measurements containing distance information from AP (Access Point)s. In that method, a selected AP's configuration has strong and tight relationship with its positioning errors. In this paper, for, we additionally account AP's configuration information by adopting DOP (Dilution of Precision) into AP selection procedures and provide more accurate RSSI based positioning results.

A Low-Complexity Antenna Selection Algorithm for Quadrature Spatial Modulation Systems

  • Kim, Sangchoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제9권1호
    • /
    • pp.72-80
    • /
    • 2017
  • In this work, an efficient transmit antenna selection approach for the quadrature spatial modulation (QSM) systems is proposed. The conventional Euclidean distance antenna selection (EDAS)-based schemes in QSM have too high computational complexity for practical use. The proposed antenna selection algorithm is based on approximation of the EDAS decision metric employed for QSM. The elimination of imaginary parts in the decision metric enables decoupling of the approximated decision metric, which enormously reduces the complexity. The proposed method is also evaluated via simulations in terms of symbol error rate (SER) performance and compared with the conventional EDAS methods in QSM systems.

선삭가공에서 황삭 및 정삭용 절삭공구선정방법에 관한 연구 (A Study on Cutting Tool Selection Techniques for Rough and Finish Turning Operations)

  • 김인호
    • 한국CDE학회논문집
    • /
    • 제3권4호
    • /
    • pp.236-242
    • /
    • 1998
  • This paper presents a development of computer aided cutting tool selection techniques for rough and finish turning operations. The developed system,. which is one of important activities for computer aided operation planning, firstly implements operation sequencing. Then, from relations of the size of machined area, recommended finishing allowance and maximum depth of cut, a main machining method is selected, a number of cut is calculated, cutting tools including toolholders and inserts are selected, and values for cutting parameters are determined. A cutting tool selection procedure is proposed for toolholders and inserts of ISO code in rough cutting, and some important parameters such as holder style, tool approach angle, tool function and its direction are described in detail. In order to demonstrate the validity of the system a case study is performed.

  • PDF

PBS(Pairwise Broadcast Synchronization)를 위한 노드 쌍 선택 알고리즘 (Pair-nodes Selection Algorithm for PBS (Pairwise Broadcast Synchronization))

  • 배시규
    • 한국멀티미디어학회논문지
    • /
    • 제21권11호
    • /
    • pp.1288-1296
    • /
    • 2018
  • PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.

중고등학교 필독도서목록에 관한 연구 (A study on the list of must books in middle schools)

  • 변우열
    • 한국도서관정보학회지
    • /
    • 제24권
    • /
    • pp.243-274
    • /
    • 1996
  • The purpose of this study is to investigate the necessity, selection, organization and management of Must Books List in middle schools. A great book can change a person's life and future. Especially, reading in the juvenile period is important because of their intellectual curiosity and sensitivity. The results of the study were as follows: 1. The necessity of Must Books can be considered in two perspectives : One is the cultivation of emotion and sense of value and the other is the development of information abilities. 2. The general criteria for the selection of Must Books are whether a book is su n.0, pportive of learning activities, of extracurricular activities, and of activities for school festivals. And whether a book is contributing to the building of good characters of students or not should be considered, too. 3. The special attention should be given to such matters as the organizational and distributional ratio among subjects of the Must Books, the degree of difficulties, the ratio of books for both male and female students, the ratio of foreign books to domestics, the possibilities of further reading and the bibliographical matters. 4. The points to be duly considered for the management of Must Books List are the educational considerations, clearness of objectives, the elimination of commercialism and authoritarianism in the book selection. The Must Books List should be managed autonomously, depending on the characteristics of each school and be updated annually. However, the most important thing is that the teacher should be a good reader himself. 5. It is better to include short stories than the long one in the Must Book List. Students should be guided to read explanatory text first and then to move to the original text. And they should be exposed to books in various subjects and not to be too dependent on the Must Books List. They should be able to develop the problem solving ability through the reading of the Must Books. 6. Finally, the Must Books selection committee should be composed of both teacher librarian and subject teachers. It is desirable that books for the cultivation of emotion, for the establishment of sense of value, and for the development of information ability should be selected by consulting the various reading lists compiled by the Ministry of Education, the Board of Local Education and other authorities concerned.

  • PDF

Software Effort Estimation in Rapidly Changing Computng Environment

  • Eung S. Jun;Lee, Jae K.
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
    • /
    • pp.133-141
    • /
    • 2001
  • Since the computing environment changes very rapidly, the estimation of software effort is very difficult because it is not easy to collect a sufficient number of relevant cases from the historical data. If we pinpoint the cases, the number of cases becomes too small. However is we adopt too many cases, the relevance declines. So in this paper we attempt to balance the number of cases and relevance. Since many researches on software effort estimation showed that the neural network models perform at least as well as the other approaches, so we selected the neural network model as the basic estimator. We propose a search method that finds the right level of relevant cases for the neural network model. For the selected case set. eliminating the qualitative input factors with the same values can reduce the scale of the neural network model. Since there exists a multitude of combinations of case sets, we need to search for the optimal reduced neural network model and corresponding case, set. To find the quasi-optimal model from the hierarchy of reduced neural network models, we adopted the beam search technique and devised the Case-Set Selection Algorithm. This algorithm can be adopted in the case-adaptive software effort estimation systems.

  • PDF

Vibronically Induced Two-Photon Transitions in Benzene

  • Chung, Gyu-Sung;Lee, Duck-Kwan
    • Bulletin of the Korean Chemical Society
    • /
    • 제10권3호
    • /
    • pp.298-302
    • /
    • 1989
  • The strengths of two-photon transitions from the ground state to excited vibronic states in benzene are calculated by using the CNDO/2-U wave functions. The role of vibronic coupling in two-photon absorption process is discussed. The $A_{1{\bar{g}}}-A_{2g}^+$ two-photon transitions, which are forbidden by the identity-forbidden selection rule in single frequency two-photon absorption, are too weak to be experimentally observed even when two photons of different energies are used. It is because the transitions are forbidden also by the pseudo-parity selection rule which are applicable for alternant hydrocarbons such as benzene. It is also shown that the vibronic coupling is not very effective in altering the pseudo-parity property of the electronic state. The strength of the vibronically induced two-photon absorption is strongly affected by the presence of an electronic state from which two-photon absorption can borrow the intensity. It is pointed out that the pseudo-parity selection rule may be violated in such cases.

Two-stage imputation method to handle missing data for categorical response variable

  • Jong-Min Kim;Kee-Jae Lee;Seung-Joo Lee
    • Communications for Statistical Applications and Methods
    • /
    • 제30권6호
    • /
    • pp.577-587
    • /
    • 2023
  • Conventional categorical data imputation techniques, such as mode imputation, often encounter issues related to overestimation. If the variable has too many categories, multinomial logistic regression imputation method may be impossible due to computational limitations. To rectify these limitations, we propose a two-stage imputation method. During the first stage, we utilize the Boruta variable selection method on the complete dataset to identify significant variables for the target categorical variable. Then, in the second stage, we use the important variables for the target categorical variable for logistic regression to impute missing data in binary variables, polytomous regression to impute missing data in categorical variables, and predictive mean matching to impute missing data in quantitative variables. Through analysis of both asymmetric and non-normal simulated and real data, we demonstrate that the two-stage imputation method outperforms imputation methods lacking variable selection, as evidenced by accuracy measures. During the analysis of real survey data, we also demonstrate that our suggested two-stage imputation method surpasses the current imputation approach in terms of accuracy.