Search

Interactions have greatly influenced recent scientific discoveries, but the identification of interactions is challenging in ultra-high dimensions. In this study, we propose an interaction identification method for classification with ultra-high dimensional discrete features. We utilize clique sets to capture interactions among features, where features in a common clique have interactions that can be used for classification. The number of features related to the interaction is the size of the clique. Hence, our method can consider interactions caused by more than two feature variables. We propose a Kullback-Leibler divergence-based approach to correctly identify the clique sets with a probability that tends to 1 as the sample size tends to infinity. A clique screening method is then proposed to filter out clique sets that are useless for classification, and the strong sure screening property can be guaranteed. Finally, a clique naïve Bayes classifier is proposed for classification. Numerical studies demonstrate that our proposed approach performs very well. [ABSTRACT FROM AUTHOR]

The use of image covariates to build a classification model has lots of impact in various fields, such as computer science, medicine, and so on. The aim of this paper is to develop an estimation method for logistic regression model with image covariates. We propose a novel regularized estimation approach, where the regularization is a combination of L1 regularization and Sobolev norm regularization. The L1 penalty can perform variable selection, while the Sobolev norm penalty can capture the shape edges information of image data. We develop an efficient algorithm for the optimization problem. We also establish a nonasymptotic error bound on parameter estimation. Simulated studies and a real data application demonstrate that our proposed method performs very well. [ABSTRACT FROM AUTHOR]

The aim of this article is to develop a low-rank linear regression model to correlate a high-dimensional response matrix with a high-dimensional vector of covariates when coefficient matrices have low-rank structures. We propose a fast and efficient screening procedure based on the spectral norm of each coefficient matrix to deal with the case when the number of covariates is extremely large. We develop an efficient estimation procedure based on the trace norm regularization, which explicitly imposes the low rank structure of coefficient matrices. When both the dimension of response matrix and that of covariate vector diverge at the exponential order of the sample size, we investigate the sure independence screening property under some mild conditions. We also systematically investigate some theoretical properties of our estimation procedure including estimation consistency, rank consistency, and nonasymptotic error bound under some mild conditions. We further establish a theoretical guarantee for the overall solution of our two-step screening and estimation procedure. We examine the finite-sample performance of our screening and estimation methods using simulations and a large-scale imaging genetic dataset collected by the Philadelphia Neurodevelopmental Cohort study. for this article are available online. [ABSTRACT FROM AUTHOR]

The clustering of time series has attracted growing research interest in recent years. The most popular clustering methods assume that the time series are only linearly dependent but this assumption usually fails in practice. To overcome this limitation, in this paper, we study clustering methods applicable to time series with a general and dependent structure. We propose a copula-based distance to measure dissimilarity among time series and consider an estimator for it, where the strong consistency of the estimator is guaranteed. Once the pairwise distance matrix for time series has been obtained, we apply a hierarchical clustering algorithm to cluster the time series and ensure its consistency. Numerical studies, including a large number of simulations and analysis of practical data, show that our method performs well. [ABSTRACT FROM AUTHOR]

Bile acids and salts have been shown to play a role in liver carcinogenesis through DNA damage, inflammation, and tumor proliferation. However, the correlation between bile acid metabolism and hepatocellular carcinoma (HCC) prognosis remains unclear. This study aimed to identify a predictive signature of bile acid and bile salt metabolism-related long non-coding RNAs (lncRNAs) for HCC prognosis and treatment response. The study used HCC RNA-sequencing data and corresponding clinical and prognostic data from The Cancer Genome Atlas. A prognostic model consisting of five bile acid and bile salt metabolism-related lncRNAs was developed and evaluated in a training set, a validation set and an external set. The model demonstrated good performance in predicting HCC prognosis and was shown to be an independent biomarker for prognosis. Additionally, our study revealed a significant association between the signature and immune cell infiltration, as well as its predictive value for therapeutic responses to both immunotherapy and chemotherapy. Furthermore, three LncRNAs (LUCAT1, AL031985.3 and AC015908.3) expression levels in our signature were validated through qRT-PCR in a cohort of 50 pairs of HCC patient tumor samples and corresponding adjacent non-tumor samples, along with 10 samples of normal liver tissue adjacent to benign lesions. These findings suggest that this novel bile acid and bile salt metabolism-related lncRNA signature can independently predict the prognosis of patients with HCC and may be utilized as a potential predictor of response to treatment in this setting. [ABSTRACT FROM AUTHOR]

Many statistical analysis procedures require a good estimator for a high-dimensional covariance matrix or its inverse, the precision matrix. When the precision matrix is banded, the Cholesky-based method often yields a good estimator of the precision matrix. One important aspect of this method is determination of the band size of the precision matrix. In practice, crossvalidation is commonly used; however, we show that crossvalidation not only is computationally intensive but can be very unstable. In this paper, we propose a new hypothesis testing procedure to determine the band size in high dimensions. Our proposed test statistic is shown to be asymptotically normal under the null hypothesis, and its theoretical power is studied. Numerical examples demonstrate the effectiveness of our testing procedure. [ABSTRACT FROM PUBLISHER]

Backgroud: Fetus in fetu (FIF) is a rare malformation in which a parasitic twin within its more mature twin. Most of the FIF locate in the retroperitoneum and are acardiac and anencephalic.Case Presentation: Here, we describe a unique case of oropharyngeal fetus in fetu with a rudimentary two-chambered heart detected by prenatal ultrasonography. The parents terminated this pregnancy after counseling. Macroscopic examination found a solid mass between the oral and fetal chest, with a rudimentary two-chambered heart at the lowest part of the mass. Microscopic findings showed amniotic membrane, skin, cartilage, gastrointestinal and neural tissue.Conclusions: Prenatal ultrasound can identify rudimentary organs suspecting FIF from early pregnancy. Detection of fetal heart beat facilitates differential diagnosis with teratomas, providing essential information for parental consulting and management. [ABSTRACT FROM AUTHOR]

Feature selection is a practical approach for improving the performance of text classification methods by optimizing the feature subsets input to classifiers. In traditional feature selection methods such as information gain and chi-square, the number of documents that contain a particular term (i.e. the document frequency) is often used. However, the frequency of a given term appearing in each document has not been fully investigated, even though it is a promising feature to produce accurate classifications. In this paper, we propose a new feature selection scheme based on a term event Multinomial naive Bayes probabilistic model. According to the model assumptions, the matching score function, which is based on the prediction probability ratio, can be factorized. Finally, we derive a feature selection measurement for each term after replacing inner parameters by their estimators. On a benchmark English text datasets (20 Newsgroups) and a Chinese text dataset (MPH-20), our numerical experiment results obtained from using two widely used text classifiers (naive Bayes and support vector machine) demonstrate that our method outperformed the representative feature selection methods. [ABSTRACT FROM AUTHOR]