• 제목/요약/키워드: forward selection method

검색결과 110건 처리시간 0.019초

Link Adaptation and Selection Method for OFDM Based Wireless Relay Networks

  • Can, Basak;Yomo, Hiroyuki;Carvalho, Elisabeth De
    • Journal of Communications and Networks
    • /
    • 제9권2호
    • /
    • pp.118-127
    • /
    • 2007
  • We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

전진선택법에 의해 선택된 부분 상관관계의 유전자들을 이용한 암 분류 (Classifying Cancer Using Partially Correlated Genes Selected by Forward Selection Method)

  • 유시호;조성배
    • 대한전자공학회논문지SP
    • /
    • 제41권3호
    • /
    • pp.83-92
    • /
    • 2004
  • 유전 발현 데이터는 생명체의 특정 조직에서 채취한 샘플을 마이크로어레이상에서 측정한 것으로, 유전자들의 발현 정도가 수치로 나타난 데이터이다. 일반적으로 정상조직과 이상조직에서 관련 유전자들의 발현 정도는 차이를 보이기 때문에 유전 발현 데이터를 통하여 암을 분류할 수 있다. 그러나 분류에 모든 유전자가 관여하지는 않으므로 효율적인 암의 분류를 위해서는 관련성 있는 소수의 유전자만을 선별해내는 작업인 특징선택 방법이 필요하다. 본 논문에서는 회귀분석의 변수선택방법중 하나인 전진 선택법(forward selection method)을 사용하여 유전자들을 선하고 분류하는 방법을 제안한다. 이 방법은 선택되는 유전자들의 중복된 정보를 최소화시켜 암의 분류에 있어 보다 효과적인 유전자 선택을 한다. 실험데이터는 대장암 데이터(Colon cancer dataset)를 사용하였고, 분류기는 k-최근접 이웃(KNN)을 사용하였다. 이 방법과 상관계수를 이용한 특징 선택방법인 피어슨 상관계수와 스피어맨 상관계수방법과 비교해본 결과 전진 선택법에 의한 특징선택 방법이 암의 분류에 있어서 더 효과적인 유전자 선택을 한다는 사실을 확인하였다. 실험결과 90.3%의 높은 인식률을 보였다. 추가적으로 림프종 데이터에 대한 실험을 하였고, 그 결과 전진 선택법의 유용성을 확인할 수 있었다.

다중회귀모형에서 전진선택과 후진제거의 기하학적 표현 (Geometrical description based on forward selection & backward elimination methods for regression models)

  • 홍종선;김명진
    • Journal of the Korean Data and Information Science Society
    • /
    • 제21권5호
    • /
    • pp.901-908
    • /
    • 2010
  • 다중회귀모형에서 변수선택법 중에서 전진선택과 후진제거의 과정을 기하학적으로 표현하는 그래픽적 방법을 제안한다. 반지름이 1인 반원의 제1사분면에는 전진선택 과정을, 제2사분면에는 후진제거 과정을 표현한다. 각 단계에서 회귀제곱합을 벡터로 표현하고, 추가제곱합 또는 부분결정계수를 벡터 사이의 각도로 나타내며 벡터의 끝을 연결할 때 통계적으로 유의하면 점선으로 표현하여 부분가설검정의 통계적 분석결과를 인지할 수 있도록 작성한다. 이 방법을 이용하면 전진선택과 후진제거 방법에 의한 최종모형을 비교 분석하고 전체적으로 모형의 적합도를 파악할 수 있다.

Diagnosis of Alzheimer's Disease using Wrapper Feature Selection Method

  • 비슈나비 라미네니;권구락
    • 스마트미디어저널
    • /
    • 제12권3호
    • /
    • pp.30-37
    • /
    • 2023
  • Alzheimer's disease (AD) symptoms are being treated by early diagnosis, where we can only slow the symptoms and research is still undergoing. In consideration, using T1-weighted images several classification models are proposed in Machine learning to identify AD. In this paper, we consider the improvised feature selection, to reduce the complexity by using wrapping techniques and Restricted Boltzmann Machine (RBM). This present work used the subcortical and cortical features of 278 subjects from the ADNI dataset to identify AD and sMRI. Multi-class classification is used for the experiment i.e., AD, EMCI, LMCI, HC. The proposed feature selection consists of Forward feature selection, Backward feature selection, and Combined PCA & RBM. Forward and backward feature selection methods use an iterative method starting being no features in the forward feature selection and backward feature selection with all features included in the technique. PCA is used to reduce the dimensions and RBM is used to select the best feature without interpreting the features. We have compared the three models with PCA to analysis. The following experiment shows that combined PCA &RBM, and backward feature selection give the best accuracy with respective classification model RF i.e., 88.65, 88.56% respectively.

On Performance Evaluation of Hybrid Decode-Amplify-Forward Relaying Protocol with Partial Relay Selection in Underlay Cognitive Networks

  • Duy, Tran Trung;Kong, Hyung Yun
    • Journal of Communications and Networks
    • /
    • 제16권5호
    • /
    • pp.502-511
    • /
    • 2014
  • In this paper, we evaluate performance of a hybrid decode-amplify-forward relaying protocol in underlay cognitive radio. In the proposed protocol, a secondary relay which is chosen by partial relay selection method helps a transmission between a secondary source and a secondary destination. In particular, if the chosen relay decodes the secondary source's signal successfully, it will forward the decoded signal to the secondary destination. Otherwise, it will amplify the signal received from the secondary source and will forward the amplified signal to the secondary destination. We evaluate the performance of our scheme via theory and simulation. Results show that the proposed protocol outperforms the amplify-and-forward and decode-and-forward protocols in terms of outage probability.

Opportunistic Relay Selection for Joint Decode-and-Forward Based Two-Way Relaying with Network Coding

  • Ji, Xiaodong;Zheng, Baoyu;Zou, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권9호
    • /
    • pp.1513-1527
    • /
    • 2011
  • This paper investigates the capacity rate problems for a joint decode-and-forward (JDF) based two-way relaying with network coding. We first characterize the achievable rate region for a conventional three-node network scenario along with the calculation of the corresponding maximal sum-rate. Then, for the goal of maximizing the system sum-rate, opportunistic relay selection is examined for multi-relay networks. As a result, a novel strategy for the implementation of relay selection is proposed, which depends on the instantaneous channel state and allows a single best relay to help the two-way information exchange. The JDF scheme and the scheme using relay selection are analyzed in terms of outage probability, after which the corresponding exact expressions are developed over Rayleigh fading channels. For the purpose of comparison, outage probabilities of the amplify-and-forward (AF) scheme and those of the scheme using relay selection are also derived. Finally, simulation experiments are done and performance comparisons are conducted. The results verify that the proposed strategy is an appropriate method for the implementation of relay selection and can achieve significant performance gains in terms of outage probability regardless of the symmetry or asymmetry of the channels. Compared with the AF scheme and the scheme using relay selection, the conventional JDF scheme and that using relay selection perform well at low signal-to-noise ratios (SNRs).

Secrecy Performances of Multicast Underlay Cognitive Protocols with Partial Relay Selection and without Eavesdropper's Information

  • Duy, Tran Trung;Son, Pham Ngoc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4623-4643
    • /
    • 2015
  • This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

The Admissible Multiperiod Mean Variance Portfolio Selection Problem with Cardinality Constraints

  • Zhang, Peng;Li, Bing
    • Industrial Engineering and Management Systems
    • /
    • 제16권1호
    • /
    • pp.118-128
    • /
    • 2017
  • Uncertain factors in finical markets make the prediction of future returns and risk of asset much difficult. In this paper, a model,assuming the admissible errors on expected returns and risks of assets, assisted in the multiperiod mean variance portfolio selection problem is built. The model considers transaction costs, upper bound on borrowing risk-free asset constraints, cardinality constraints and threshold constraints. Cardinality constraints limit the number of assets to be held in an efficient portfolio. At the same time, threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Because of these limitations, the proposed model is a mix integer dynamic optimization problem with path dependence. The forward dynamic programming method is designed to obtain the optimal portfolio strategy. Finally, to evaluate the model, our result of a meaning example is compared to the terminal wealth under different constraints.

Development of Interactive Feature Selection Algorithm(IFS) for Emotion Recognition

  • Yang, Hyun-Chang;Kim, Ho-Duck;Park, Chang-Hyun;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제6권4호
    • /
    • pp.282-287
    • /
    • 2006
  • This paper presents an original feature selection method for Emotion Recognition which includes many original elements. Feature selection has some merits regarding pattern recognition performance. Thus, we developed a method called thee 'Interactive Feature Selection' and the results (selected features) of the IFS were applied to an emotion recognition system (ERS), which was also implemented in this research. The innovative feature selection method was based on a Reinforcement Learning Algorithm and since it required responses from human users, it was denoted an 'Interactive Feature Selection'. By performing an IFS, we were able to obtain three top features and apply them to the ERS. Comparing those results from a random selection and Sequential Forward Selection (SFS) and Genetic Algorithm Feature Selection (GAFS), we verified that the top three features were better than the randomly selected feature set.

Optimized Relay Selection and Power Allocation by an Exclusive Method in Multi-Relay AF Cooperative Networks

  • Bao, Jianrong;Jiang, Bin;Liu, Chao;Jiang, Xianyang;Sun, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3524-3542
    • /
    • 2017
  • In a single-source and multi-relay amplify-forward (AF) cooperative network, the outage probability and the power allocation are two key factors to influence the performance of an entire system. In this paper, an optimized AF relay selection by an exclusive method and near optimal power allocation (NOPA) is proposed for both good outage probability and power efficiency. Given the same power at the source and the relay nodes, a threshold for selecting the relay nodes is deduced and employed to minimize the average outage probability. It mainly excludes the relay nodes with much higher thresholds over the aforementioned threshold and thus the remainders of the relay nodes participate in cooperative forwarding efficiently. So the proposed scheme can improve the utility of the resources in the cooperative multi-relay system, as well as reduce the computational complexity. In addition, based on the proposed scheme, a NOPA is also suggested to approach sub-optimal power efficiency with low complexity. Simulation results show that the proposed scheme obtains about 2.1dB and 5.8dB performance gain at outage probability of $10^{-4}$, when compared with the all-relay-forward (6 participated relays) and the single-relay-forward schemes. Furthermore, it obtains the minimum outage probability among all selective relay schemes with the same number of the relays. Meanwhile, it approaches closely to the optimal exhaustive scheme, thus reduce much complexity. Moreover, the proposed NOPA scheme achieves better outage probability than those of the equal power allocation schemes. Therefore, the proposed scheme can obtain good outage probability, low computational complexity and high power efficiency, which makes it pragmatic efficiently in the single-source and multi-relay AF based cooperative networks.