Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “FEATURE”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18

Primordial features and Planck polarization

With the Planck 2015 Cosmic Microwave Background (CMB) temperature and polarization data, we search for possible features in the primordial power spectrum (PPS). We revisit the Wiggly Whipped Inflation (WWI) framework and demonstrate how generation of some particular primordial features can improve the fit to Planck data. WWI potential allows the scalar field to transit from a steeper potential to a nearly flat potential through a discontinuity either in potential or in its derivatives. WWI offers the inflaton potential parametrizations that generate a wide variety of features in the primordial power spectra incorporating most of the localized and non-local inflationary features that are obtained upon reconstruction from temperature and polarization angular power spectrum. At the same time, in a single framework it allows us to have a background parameter estimation with a nearly free-form primordial spectrum. Using Planck 2015 data, we constrain the primordial features in the context of Wiggly Whipped Inflation and present the features that are supported both by temperature and polarization. WWI model provides more than 13 improvement in χ{sup 2} fit to the data with respect to the best fit power law model considering combined temperature and polarization data from Planck and B-mode polarization data from BICEP and Planck dust map. We use 2-4 extra parameters in the WWI model compared to the featureless strict slow roll inflaton potential. We find that the differences between the temperature and polarization data in constraining background cosmological parameters such as baryon density, cold dark matter density are reduced to a good extent if we use primordial power spectra from WWI. We also discuss the extent of bispectra obtained from the best potentials in arbitrary triangular configurations using the BI-spectra and Non-Gaussianity Operator (BINGO).

79 ASTRONOMY AND ASTROPHYSICS↗

The future of primordial features with large-scale structure surveys

Primordial features are one of the most important extensions of the Standard Model of cosmology, providing a wealth of information on the primordial Universe, ranging from discrimination between inflation and alternative scenarios, new particle detection, to fine structures in the inflationary potential. We study the prospects of future large-scale structure (LSS) surveys on the detection and constraints of these features. We classify primordial feature models into several classes, and for each class we present a simple template of power spectrum that encodes the essential physics. We study how well the most ambitious LSS surveys proposed to date, including both spectroscopic and photometric surveys, will be able to improve the constraints with respect to the current Planck data. We find that these LSS surveys will significantly improve the experimental sensitivity on features signals that are oscillatory in scales, due to the 3D information. For a broad range of models, these surveys will be able to reduce the errors of the amplitudes of the features by a factor of 5 or more, including several interesting candidates identified in the recent Planck data. Therefore, LSS surveys offer an impressive opportunity for primordial feature discovery in the next decade or two. We also compare the advantages of both types of surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Classical cosmological collider physics and primordial features

Features in the inflationary landscape can inject extra energies to inflation models and produce on-shell particles with masses much larger than the Hubble scale of inflation. This possibility extends the energy reach of the program of cosmological collider physics, in which signals associated with these particles are generically Boltzmann-suppressed. Here we study the mechanisms of this classical cosmological collider in two categories of primordial features. In the first category, the primordial feature is classical oscillation, which includes the case of coherent oscillation of a massive field and the case of oscillatory features in the inflationary potential. The second category includes any sharp feature in the inflation model. All these classical features can excite unsuppressed quantum modes of other heavy fields which leave observational signatures in primordial non-Gaussianities, including the information about the particle spectra of these heavy degrees of freedom.

79 ASTRONOMY AND ASTROPHYSICS↗

PySFD: comprehensive molecular insights from significant feature differences detected among many simulated ensembles

Motivation Many modeling analyses of molecular dynamics (MD) simulations are based on a definition of states that can be (groups of) clusters of simulation frames in a feature space composed of molecular coordinates. With increasing dimension of this feature space (due to the increasing size or complexity of a simulated molecule), it becomes very difficult to cluster the underlying MD data and estimate a statistically robust model. To mitigate this “curse of dimensionality”, one can reduce the feature space, e.g., with principal component or time-lagged independent component analysis transformations, focusing the analysis on the most important modes of transitions. In practice, however, all these reduction strategies may neglect important molecular details that are susceptible to experimental verification. Results To recover such molecular details, I have developed PySFD (Significant Feature Differences analyzer for Python), a multi-processing software package that efficiently selects significantly different features of any user-defined feature type among potentially many different simulated state ensembles, such as meta-stable states of a Markov State Model (MSM). Applying PySFD on MSMs of an aggregate of 300 microseconds MD simulations recently performed on the major histocompatibility complex class II (MHCII) protein, I demonstrate how this toolkit can extract and visualize valuable mechanistic information from big MD simulation data, e.g., in form of networks of dynamic interaction changes connecting functionally relevant sites of a protein complex.

Biochemistry & Molecular Biology↗

Improved predictions of transcription factor binding sites using physicochemical features of DNA

Typical approaches for predicting transcription factor binding sites (TFBSs) involve use of a position-specific weight matrix (PWM) to statistically characterize the sequences of the known sites. Recently, an alternative physicochemical approach, called SiteSleuth, was proposed. In this approach, a linear support vector machine (SVM) classifier is trained to distinguish TFBSs from background sequences based on local chemical and structural features of DNA. SiteSleuth appears to generally perform better than PWM-based methods. Here, we improve the SiteSleuth approach by considering both new physicochemical features and algorithmic modifications. New features are derived from Gibbs energies of amino acid–DNA interactions and hydroxyl radical cleavage profiles of DNA. Algorithmic modifications consist of inclusion of a feature selection step, use of a nonlinear kernel in the SVM classifier, and use of a consensus-based post-processing step for predictions. We also considered SVM classification based on letter features alone to distinguish performance gains from use of SVM-based models versus use of physicochemical features. The accuracy of each of the variant methods considered was assessed by cross validation using data available in the RegulonDB database for 54 Escherichia coli TFs, as well as by experimental validation using published ChIP-chip data available for Fis and Lrp.

59 BASIC BIOLOGICAL SCIENCES↗

Needlet detection of features in the WMAP CMB sky and the impact on anisotropies and hemispherical asymmetries

We apply spherical needlets to the Wilkinson Microwave Anisotropy Probe 5-year cosmic microwave background (CMB) data set, to search for imprints of nonisotropic features in the CMB sky. We use the needlets' localization properties to resolve peculiar features in the CMB sky and to study how these features contribute to the anisotropy power spectrum of the CMB. In addition to the now well-known 'cold spot' of the CMB map in the southern hemisphere, we also find two hot spots at greater than 99% confidence level, again in the southern hemisphere and closer to the Galactic plane. While the cold spot contributes to the anisotropy power spectrum in the multipoles between l=6 to l=33, the hot spots are found to be dominating the anisotropy power in the range between l=6 and l=18. Masking both the cold and the two hot spots results in a reduction by about 15% in the amplitude of the angular power spectrum of CMB around l=10. The resulting changes to the cosmological parameters when the power spectrum is estimated masking these features (in addition to the WMAP team's KQ85 mask) are within the 1{sigma} errors published with the WMAP mask only. We also study the asymmetry between the angular power spectra evaluated on the northern and southern hemispheres. When the features detected by needlets are masked, we find that the difference in the power, measured in terms of the anisotropy variance between l=4 and l=18, is reduced by a factor 2. We make available a mask related to needlet features for more detailed studies on asymmetries in the CMB anisotropy sky.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗

Hyperparameter Optimization and Feature Inclusion in Graph Neural Networks for Spiking Implementation

Graph convolutional networks leverage both graph structures and features on nodes and edges for improved learning performance in comparison with classical machine learning approaches. Spiking neuromorphic computers natively implement network-like computation and have been shown to be successful at implementing graph learning without features. Incorporating graph features brings the challenge of efficient feature representation and balancing the contribution of topology and features in learning. In this work, we present our design of a simulated network of spiking neurons to perform semi-supervised learning on graph data using both the graph structure and the node features. We explore various design choices, present preliminary results, and discuss the opportunities for using neuromorphic computers for this task in the future.

Cong, Guojing↗

Improvements in intrinsic feature pose measurement for awake animal imaging

Development has continued with intrinsic feature optical motion tracking for awake animal imaging to measure 3D position and orientation (pose) for motion compensated reconstruction. Prior imaging results have been directed towards head motion measurement for SPECT brain studies in awake unrestrained mice. This work improves on those results in extracting and tracking intrinsic features from multiple camera images and computing pose changes from the tracked features over time. Previously, most motion tracking for 3D imaging has been limited to measuring extrinsic features such as retro-reflective markers applied to an animal's head. While this approach has been proven to be accurate, the use of external markers is undesirable for several reasons. The intrinsic feature approach has been further developed from previous work to provide full pose measurements for a live mouse scan. Surface feature extraction, matching, and pose change calculation with point tracking and accuracy results are described. Experimental pose calculation and 3D reconstruction results from live images are presented.

60 APPLIED LIFE SCIENCES↗

A Flang Plugin for Fortran Feature Characterization

As new compute systems are developed, there is still a need to compile and execute codes authored in Fortran on these leading edge systems. In order to achieve this, development of compilers that support the latest hardware is continuously under development. Though the specification of Fortran is extensive, it is helpful to compiler authors to be able to prioritize the development of key features in order to get certain codes deemed important, e.g., applications of interest to leadership computing facilities, executable on leading edge compute systems. Identifying key features though is largely done through querying software experts or users of the Fortran applications of interest, who then manually report what features are and are not present. This exercise can both time consuming and error prone. To automate this process, we present a compiler plugin to Flang, the Fortran frontend for LLVM. This plugin is a tool that operates on the parse tree representation generated by Flang and detects key features based on walking parse tree nodes that correspond to features of interest. We show the result of our tool on four applications, three of which were manually profiled by software experts. We show the discrepancies between our tool and the manual characterization of the three applications, as well as generate a characterization for an application not yet profiled. We intend to open-source our tool in order to invite the community to benefit from the tool and make contributions for other features.

Cabrera, Anthony [ORNL]↗

Evaluating generative networks using Gaussian mixtures of image features

We develop a measure for evaluating the performance of generative networks given two sets of images. A popular performance measure currently used to do this is the Fréchet Inception Distance (FID). However, FID assumes that images featurized using the penultimate layer of Inception follow a Gaussian distribution. This assumption allows FID to be easily computed, since FID uses the 2-Wasserstein distance of two Gaussian distributions fitted to the featurized images. However, we show that Inception features of the ImageNet dataset are not Gaussian; in particular, each marginal is not Gaussian. To remedy this problem, we model the featurized images using Gaussian mixture models (GMMs) and compute the 2-Wasserstein distance restricted to GMMs. We define a performance measure, which we call WaM, on two sets of images by using inception (or another classifier) to featurize the images, estimate two GMMs, and use the restricted 2-Wasserstein distance to compare the GMMs. We experimentally show the advantages of WaM over FID, including how FID is more sensitive than WaM to image perturbations. By modelling the non-Gaussian features obtained from inception as GMMs and using a GMM metric, we can more accurately evaluate generative network performance.

machine learning, genrative adversarial networks↗

MO-G-BRF-01: BEST IN PHYSICS (JOINT IMAGING-THERAPY) - Sensitivity of PET-Based Texture Features to Respiratory Motion in Non-Small Cell Lung Cancer (NSCLC)

Purpose: PET-based texture features are used to quantify tumor heterogeneity due to their predictive power in treatment outcome. We investigated the sensitivity of texture features to tumor motion by comparing whole body (3D) and respiratory-gated (4D) PET imaging. Methods: Twenty-six patients (34 lesions) received 3D and 4D [F-18]FDG-PET scans before chemo-radiotherapy. The acquired 4D data were retrospectively binned into five breathing phases to create the 4D image sequence. Four texture features (Coarseness, Contrast, Busyness, and Complexity) were computed within the the physician-defined tumor volume. The relative difference (δ) in each measure between the 3D- and 4D-PET imaging was calculated. Wilcoxon signed-rank test (p<0.01) was used to determine if δ was significantly different from zero. Coefficient of variation (CV) was used to determine the variability in the texture features between all 4D-PET phases. Pearson correlation coefficient was used to investigate the impact of tumor size and motion amplitude on δ. Results: Significant differences (p<<0.01) between 3D and 4D imaging were found for Coarseness, Busyness, and Complexity. The difference for Contrast was not significant (p>0.24). 4D-PET increased Busyness (∼20%) and Complexity (∼20%), and decreased Coarseness (∼10%) and Contrast (∼5%) compared to 3D-PET. Nearly negligible variability (CV=3.9%) was found between the 4D phase bins for Coarseness and Complexity. Moderate variability was found for Contrast and Busyness (CV∼10%). Poor correlation was found between the tumor volume and δ for the texture features (R=−0.34−0.34). Motion amplitude had moderate impact on δ for Contrast and Busyness (R=−0.64− 0.54) and no impact for Coarseness and Complexity (R=−0.29−0.17). Conclusion: Substantial differences in textures were found between 3D and 4D-PET imaging. Moreover, the variability between phase bins for Coarseness and Complexity was negligible, suggesting that similar quantification can be obtained from all phases. Texture features, blurred out by respiratory motion during 3D-PET acquisition, can be better resolved by 4D-PET imaging with any phase.

60 APPLIED LIFE SCIENCES↗

WE-E-17A-05: Complementary Prognostic Value of CT and 18F-FDG PET Non-Small Cell Lung Cancer Tumor Heterogeneity Features Quantified Through Texture Analysis

Purpose: Previous studies have shown that CT or 18F-FDG PET intratumor heterogeneity features computed using texture analysis may have prognostic value in Non-Small Cell Lung Cancer (NSCLC), but have been mostly investigated separately. The purpose of this study was to evaluate the potential added value with respect to prognosis regarding the combination of non-enhanced CT and 18F-FDG PET heterogeneity textural features on primary NSCLC tumors. Methods: One hundred patients with non-metastatic NSCLC (stage I–III), treated with surgery and/or (chemo)radiotherapy, that underwent staging 18F-FDG PET/CT images, were retrospectively included. Morphological tumor volumes were semi-automatically delineated on non-enhanced CT using 3D SlicerTM. Metabolically active tumor volumes (MATV) were automatically delineated on PET using the Fuzzy Locally Adaptive Bayesian (FLAB) method. Intratumoral tissue density and FDG uptake heterogeneities were quantified using texture parameters calculated from co-occurrence, difference, and run-length matrices. In addition to these textural features, first order histogram-derived metrics were computed on the whole morphological CT tumor volume, as well as on sub-volumes corresponding to fine, medium or coarse textures determined through various levels of LoG-filtering. Association with survival regarding all extracted features was assessed using Cox regression for both univariate and multivariate analysis. Results: Several PET and CT heterogeneity features were prognostic factors of overall survival in the univariate analysis. CT histogram-derived kurtosis and uniformity, as well as Low Grey-level High Run Emphasis (LGHRE), and PET local entropy were independent prognostic factors. Combined with stage and MATV, they led to a powerful prognostic model (p<0.0001), with median survival of 49 vs. 12.6 months and a hazard ratio of 3.5. Conclusion: Intratumoral heterogeneity quantified through textural features extracted from both CT and FDG PET images have complementary and independent prognostic value in NSCLC.

60 APPLIED LIFE SCIENCES↗

TH-E-BRF-05: Comparison of Survival-Time Prediction Models After Radiotherapy for High-Grade Glioma Patients Based On Clinical and DVH Features

Purpose: Although many outcome prediction models based on dose-volume information have been proposed, it is well known that the prognosis may be affected also by multiple clinical factors. The purpose of this study is to predict the survival time after radiotherapy for high-grade glioma patients based on features including clinical and dose-volume histogram (DVH) information. Methods: A total of 35 patients with high-grade glioma (oligodendroglioma: 2, anaplastic astrocytoma: 3, glioblastoma: 30) were selected in this study. All patients were treated with prescribed dose of 30–80 Gy after surgical resection or biopsy from 2006 to 2013 at The University of Tokyo Hospital. All cases were randomly separated into training dataset (30 cases) and test dataset (5 cases). The survival time after radiotherapy was predicted based on a multiple linear regression analysis and artificial neural network (ANN) by using 204 candidate features. The candidate features included the 12 clinical features (tumor location, extent of surgical resection, treatment duration of radiotherapy, etc.), and the 192 DVH features (maximum dose, minimum dose, D95, V60, etc.). The effective features for the prediction were selected according to a step-wise method by using 30 training cases. The prediction accuracy was evaluated by a coefficient of determination (R{sup 2}) between the predicted and actual survival time for the training and test dataset. Results: In the multiple regression analysis, the value of R{sup 2} between the predicted and actual survival time was 0.460 for the training dataset and 0.375 for the test dataset. On the other hand, in the ANN analysis, the value of R{sup 2} was 0.806 for the training dataset and 0.811 for the test dataset. Conclusion: Although a large number of patients would be needed for more accurate and robust prediction, our preliminary Result showed the potential to predict the outcome in the patients with high-grade glioma. This work was partly supported by the JSPS Core-to-Core Program(No. 23003) and Grant-in-aid from the JSPS Fellows.

60 APPLIED LIFE SCIENCES↗

SU-E-I-01: Iterative CBCT Reconstruction with a Feature-Preserving Penalty

Purpose: Low-dose CBCT is desired in various clinical applications. Iterative image reconstruction algorithms have shown advantages in suppressing noise in low-dose CBCT. However, due to the smoothness constraint enforced during the reconstruction process, edges may be blurred and image features may lose in the reconstructed image. In this work, we proposed a new penalty design to preserve image features in the image reconstructed by iterative algorithms. Methods: Low-dose CBCT is reconstructed by minimizing the penalized weighted least-squares (PWLS) objective function. Binary Robust Independent Elementary Features (BRIEF) of the image were integrated into the penalty of PWLS. BRIEF is a general purpose point descriptor that can be used to identify important features of an image. In this work, BRIEF distance of two neighboring pixels was used to weigh the smoothing parameter in PWLS. For pixels of large BRIEF distance, weaker smooth constraint will be enforced. Image features will be better preserved through such a design. The performance of the PWLS algorithm with BRIEF penalty was evaluated by a CatPhan 600 phantom. Results: The image quality reconstructed by the proposed PWLS-BRIEF algorithm is superior to that by the conventional PWLS method and the standard FDK method. At matched noise level, edges in PWLS-BRIEF reconstructed image are better preserved. Conclusion: This study demonstrated that the proposed PWLS-BRIEF algorithm has great potential on preserving image features in low-dose CBCT.

60 APPLIED LIFE SCIENCES↗

SU-E-J-242: Volume-Dependence of Quantitative Imaging Features From CT and CE-CT Images of NSCLC

Purpose: To determine whether tumor volume plays a significant role in the values obtained for texture features when they are extracted from computed tomography (CT) images of non-small cell lung cancer (NSCLC). We also sought to identify whether features can be reliably measured at all volumes or if a minimum volume threshold should be recommended. Methods: Eleven features were measured on 40 CT and 32 contrast-enhanced CT (CECT) patient images for this study. Features were selected for their prognostic/diagnostic value in previous publications. Direct correlations between these textures and volume were evaluated using the Spearman correlation coefficient. Any texture that the Wilcoxon rank-sum test was used to compare the variation above and below a volume cutoff. Four different volume thresholds (5, 10, 15, and 20 cm{sup 3}) were tested. Results: Four textures were found to be significantly correlated with volume in both the CT and CE-CT images. These were busyness, coarseness, gray-level nonuniformity, and run-length nonuniformity with correlation coefficients of 0.92, −0.96, 0.94, and 0.98 for the CT images and 0.95, −0.97, 0.98, and 0.98 for the CE-CT images. After volume normalization, the correlation coefficients decreased substantially. For the data obtained from the CT images, the results of the Wilcoxon rank-sum test were significant when volume thresholds of 5–15 cm3 were used. No volume threshold was shown to be significant for the CE-CT data. Conclusion: Equations for four features that have been used in several published studies were found to be volume-dependent. Future studies should consider implementing normalization factors or removing these features entirely to prevent this potential source of redundancy or bias. This work was supported in part by National Cancer Institute grant R03CA178495-01. Xenia Fave is a recipient of the American Association of Physicists in Medicine Graduate Fellowship.

60 APPLIED LIFE SCIENCES↗

MO-DE-207B-11: Reliability of PET/CT Radiomics Features in Functional and Morphological Components of NSCLC Lesions: A Repeatability Analysis in a Prospective Multicenter Cohort

Purpose: The goal of this study was to evaluate the repeatability of radiomics features (intensity, shape and heterogeneity) in both PET and low-dose CT components of test-retest FDG-PET/CT images in a prospective multicenter cohort of 74 NSCLC patients from ACRIN 6678 and a similar Merck trial. Methods: Seventy-four patients with stage III-IV NCSLC were prospectively included. The primary tumor and up to 3 additional lesions per patient were analyzed. The Fuzzy Locally Adaptive Bayesian algorithm was used to automatically delineate metabolically active volume (MAV) in PET. The 3D SlicerTM software was exploited to delineate anatomical volumes (AV) in CT. Ten intensity first-order features, as well as 26 textural features and four 3D shape descriptors were calculated from tumour volumes in both modalities. The repeatability of each metric was assessed by Bland-Altman analysis. Results: One hundred and five lesions (primary tumors and nodal or distant metastases) were delineated and characterized. The MAV and AV determination had a repeatability of −1.4±11.0% and −1.2±18.7% respectively. Several shape and heterogeneity features were found to be highly or moderately repeatable (e.g., sphericity, co-occurrence entropy or intensity size-zone matrix zone percentage), whereas others were confirmed as unreliable with much higher variability (more than twice that of the corresponding volume determination). Conclusion: Our results in this large multicenter cohort with more than 100 measurements confirm the PET findings in previous studies (with <30 lesions). In addition, our study is the first to explore the repeatability of radiomics features in the low-dose CT component of PET/CT acquisitions (previous studies considered dosimetry CT, CE-CT or CBCT). Several features were identified as reliable in both PET and CT components and could be used to build prognostic models. This work has received a French government support granted to the CominLabs excellence laboratory and managed by the National Research Agency in the “Investing for the Future” program under reference ANR-10-LABX-07-01, and support from the city of Brest.

60 APPLIED LIFE SCIENCES↗

RNA-seq latent featurizer using center loss cost function

Predictive modeling of patient tumor growth response to drug treatment is severely limited by a lack of experimental data for training. Combining experimental data from several studies is an attractive approach, but presents two problems: batch effects and limited data for individual drugs and cell lines. Batch effects are caused by systematic procedural differences among studies, which causes systematic experimental outcome differences. Directly using these experimental results as features for machine learning commonly causes problems when training on one study and testing on another. This severely limits a model's ability to perform well on new experiments. Even after combining studies, predicting outcomes on new patient tumors remains an open challenge. We propose a semi-supervised, autoencoder-based, machine learning procedure, which learns a smaller set of gene expression features that are robust to batch effects using background information on a cell line or tissue's tumor type. We implemented this reduced feature representation and show that the new feature space clusters strongly according to tumor type. This experiment is carried out across multiple studies: CCLE, CTRP, gCSI, GDSC, NCI60, and patient derived tumors. We hypothesize that using a batch effect resistant feature set across studies will improve prediction performance. Genome Data Commons (GDC) gene expression profiles for publicly available human tissues and cell lines from NCI60 and CCLE were processed using the semi-supervised learning procedure. Our autoencoder repurposes the 'center loss' (CL) cost function of Wen et. al. to learn a more generalized set of features using the cell line or tissue's tumor type.

He, Stewart↗