Search

Rural and urban America have becoming increasingly divided, both politically and economically. Entrepreneurship can help rural communities catch back up by jumpstarting economic growth, creating jobs, and building resilience to economic shocks. However, less is known about firm creation in rural areas compared to urban areas. To that end, in this paper we ask: What factors predict firm creation in rural America? Our analysis, based on a comparative framework involving multiple machine learning modeling techniques, helps addresses three gaps in academic literature on rural firm creation. First, entrepreneurship research stretches across disciplines, often using econometric methods to identify the effect of a specific variable, rather than comparing the predictive importance of multiple variables. Second, research on firm creation centers on high-tech, urban firms. Third, modern machine learning techniques have not yet been applied in an integrated way to address rural entrepreneurship, a complex economic and policy problem that defies simple, monocausal claims. In this paper, we apply four machine learning methods (subset selection, lasso, random forest, and extreme gradient boosting) to a novel dataset to examine what social and economic factors are predictive of firm growth in rural Texas counties from 2008–2018. Our results suggest that some factors commonly discussed as promoting entrepreneurship (e.g., access to broadband and patents) may not be as predictive as socioeconomic ones (age distribution, ethnic diversity, social capital, and immigration). We also find that the strength of specific industries (oil, wind, healthcare, and elder/childcare) predicts firm growth, as does the number of local banks. Most factors predictive of firm growth in rural counties are distinct from those in urban counties, supporting the argument that rural entrepreneurship is a distinct phenomenon worthy of distinct focus. More broadly, this multi-model approach can offer initial, focusing guidance to policymakers seeking to address similarly complex policy problems. [ABSTRACT FROM AUTHOR]

Time series sensor data classification tasks often suffer from training data scarcity issue due to the expenses associated with the expert-intervened annotation efforts. For example, Electrocardiogram (ECG) data classification for cardio-vascular disease (CVD) detection requires expensive labeling procedures with the help of cardiologists. Current state-of-the-art algorithms like deep learning models have shown outstanding performance under the general requirement of availability of large set of training examples. In this paper, we propose Shapley Attributed Ablation with Augmented Learning: ShapAAL, which demonstrates that deep learning algorithm with suitably selected subset of the seen examples or ablating the unimportant ones from the given limited training dataset can ensure consistently better classification performance under augmented training. In ShapAAL, additive perturbed training augments the input space to compensate the scarcity in training examples using Residual Network (ResNet) architecture through perturbation-induced inputs, while Shapley attribution seeks the subset from the augmented training space for better learnability with the goal of better general predictive performance, thanks to the "efficiency" and "null player" axioms of transferable utility games upon which Shapley value game is formulated. In ShapAAL, the subset of training examples that contribute positively to a supervised learning setup is derived from the notion of coalition games using Shapley values associated with each of the given inputs' contribution into the model prediction. ShapAAL is a novel push-pull deep architecture where the subset selection through Shapley value attribution pushes the model to lower dimension while augmented training augments the learning capability of the model over unseen data. We perform ablation study to provide the empirical evidence of our claim and we show that proposed ShapAAL method consistently outperforms the current baselines and state-of-the-art algorithms for time series sensor data classification tasks from publicly available UCR time series archive that includes different practical important problems like detection of CVDs from ECG data. [ABSTRACT FROM AUTHOR]

In low-dimensional data and within the framework of a classical linear regression model, we intend to compare variable selection methods and investigate the role of shrinkage of regression estimates in a simulation study. Our primary aim is to build descriptive models that capture the data structure parsimoniously, while our secondary aim is to derive a prediction model. Simulation studies are an important tool in statistical methodology research if they are well designed, executed, and reported. However, bias in favor of an "own" preferred method is prevalent in most simulation studies in which a new method is proposed and compared with existing methods. To overcome such bias, neutral comparison studies, which disregard the superiority or inferiority of a particular method, have been proposed. In this paper, we designed a simulation study with key principles of neutral comparison studies in mind, though certain unintentional biases cannot be ruled out. To improve the design and reporting of a simulation study, we followed the recently proposed ADEMP structure, which entails defining the aims (A), data-generating mechanisms (D), estimand/target of analysis (E), methods (M), and performance measures (P). To ensure the reproducibility of results, we published the protocol before conducting the study. In addition, we presented earlier versions of the design to several experts whose feedback influenced certain aspects of the design. We will compare popular penalized regression methods (lasso, adaptive lasso, relaxed lasso, and nonnegative garrote) that combine variable selection and shrinkage with classical variable selection methods (best subset selection and backward elimination) with and without post-estimation shrinkage of parameter estimates. [ABSTRACT FROM AUTHOR]

Compositional data, which is data consisting of fractions or probabilities, is common in many fields including ecology, economics, physical science and political science. If these data would otherwise be normally distributed, their spread can be conveniently represented by a multivariate normal distribution truncated to the non-negative space under a unit simplex. Here this distribution is called the simplex-truncated multivariate normal distribution. For calculations on truncated distributions, it is often useful to obtain rapid estimates of their integral, mean and covariance; these quantities characterising the truncated distribution will generally possess different values to the corresponding non-truncated distribution. In this paper, three different approaches that can estimate the integral, mean and covariance of any simplex-truncated multivariate normal distribution are described and compared. These three approaches are (1) naive rejection sampling, (2) a method described by Gessner et al. that unifies subset simulation and the Holmes-Diaconis-Ross algorithm with an analytical version of elliptical slice sampling, and (3) a semi-analytical method that expresses the integral, mean and covariance in terms of integrals of hyperrectangularly-truncated multivariate normal distributions, the latter of which are readily computed in modern mathematical and statistical packages. Strong agreement is demonstrated between all three approaches, but the most computationally efficient approach depends strongly both on implementation details and the dimension of the simplex-truncated multivariate normal distribution. For computations in low-dimensional distributions, the semi-analytical method is fast and thus should be considered. As the dimension increases, the Gessner et al. method becomes the only practically efficient approach of the methods tested here. [ABSTRACT FROM AUTHOR]

We introduce the statistical concept of 'compensatory selection', which arises when selecting a subset of applicants based on multiple predictors, such as when standardized test scores are used in combination with other predictors required in a school application (e.g., previous grades, references letters, and personal statements). Post-hoc analyses often fail to find a positive correlation between test scores and subsequent success, and this failure is sometimes taken as evidence against the predictive validity of the standardized test. The present analysis reveals that the failure to find a negative correlation indicates that the standardized test is in fact a valid predictor of success. This is due to compensation between predictors during selection: Some students are admitted despite a low test score because their application is exceptional in other respects, while other students are admitted primarily based on a high test score despite weakness in the rest of their application. This compensatory selection process introduces a negative correlation between test scores and other predictors among those admitted (a 'collider bias' or 'Berkson's paradox' effect). If test scores are valid predictors of success, this negative correlation between the predictors counteracts the positive correlation between test scores and success that would have been observed if all applicants were admitted. If test scores are not predictive of success, but were nevertheless used in a compensatory selection process, there would be a spurious negative correlation between test scores and success (i.e., an admitted student with a weak application except for a high test score would be unlikely to succeed). The selection effect that is described here is fundamentally different from the well-known 'restricted range' problem and can powerfully alter results even in situations that accept most applicants. [ABSTRACT FROM AUTHOR]

Raman spectroscopy has shown to be a promising method for the examination of biomedical samples. However, until now, its efficacy has not been established in clinical diagnostics. In this study, Raman spectroscopy's potential application in medical laboratories is evaluated for a large variety (38) of biomarkers. Given 234 serum samples from a cohort of patients with different stages of liver disease, we performed Raman spectroscopy at 780nm excitation wavelength. The Raman spectra were analyzed in combination with the results of routine diagnostics using specifically developed complex mathematical algorithms, including fluorescence filtering, frequency subset selection and several overfitting circumventing strategies, such as independent validation. With the results of this cohort, which were validated in 328 independent samples, a significant proof-of-concept study was completed. This study highlights the need to prevent overfitting and to use independent data for validation. The results reveal that Raman spectroscopy has high potential for use in medical laboratory diagnostics to simultaneously quantify multiple biomarkers. [ABSTRACT FROM AUTHOR]

Feature selection is an important task in big data analysis and information retrieval processing. It reduces the number of features by removing noise, extraneous data. In this paper, one feature subset selection algorithm based on damping oscillation theory and support vector machine classifier is proposed. This algorithm is called the Maximum Kendall coefficient Maximum Euclidean Distance Improved Gray Wolf Optimization algorithm (MKMDIGWO). In MKMDIGWO, first, a filter model based on Kendall coefficient and Euclidean distance is proposed, which is used to measure the correlation and redundancy of the candidate feature subset. Second, the wrapper model is an improved grey wolf optimization algorithm, in which its position update formula has been improved in order to achieve optimal results. Third, the filter model and the wrapper model are dynamically adjusted by the damping oscillation theory to achieve the effect of finding an optimal feature subset. Therefore, MKMDIGWO achieves both the efficiency of the filter model and the high precision of the wrapper model. Experimental results on five UCI public data sets and two microarray data sets have demonstrated the higher classification accuracy of the MKMDIGWO algorithm than that of other four state-of-the-art algorithms. The maximum ACC value of the MKMDIGWO algorithm is at least 0.5% higher than other algorithms on 10 data sets. [ABSTRACT FROM AUTHOR]

We present a mixed-integer optimization (MIO) approach to sparse Poisson regression. The MIO approach to sparse linear regression was first proposed in the 1970s, but has recently received renewed attention due to advances in optimization algorithms and computer hardware. In contrast to many sparse estimation algorithms, the MIO approach has the advantage of finding the best subset of explanatory variables with respect to various criterion functions. In this paper, we focus on a sparse Poisson regression that maximizes the weighted sum of the log-likelihood function and the L2-regularization term. For this problem, we derive a mixed-integer quadratic optimization (MIQO) formulation by applying a piecewise-linear approximation to the log-likelihood function. Optimization software can solve this MIQO problem to optimality. Moreover, we propose two methods for selecting a limited number of tangent lines effective for piecewise-linear approximations. We assess the efficacy of our method through computational experiments using synthetic and real-world datasets. Our methods provide better log-likelihood values than do conventional greedy algorithms in selecting tangent lines. In addition, our MIQO formulation delivers better out-of-sample prediction performance than do forward stepwise selection and L1-regularized estimation, especially in low-noise situations. [ABSTRACT FROM AUTHOR]

Feature selection on high dimensional data along with the interaction effects is a critical challenge for classical statistical learning techniques. Existing feature selection algorithms such as random LASSO leverages LASSO capability to handle high dimensional data. However, the technique has two main limitations, namely the inability to consider interaction terms and the lack of a statistical test for determining the significance of selected features. This study proposes a High Dimensional Selection with Interactions (HDSI) algorithm, a new feature selection method, which can handle high-dimensional data, incorporate interaction terms, provide the statistical inferences of selected features and leverage the capability of existing classical statistical techniques. The method allows the application of any statistical technique like LASSO and subset selection on multiple bootstrapped samples; each contains randomly selected features. Each bootstrap data incorporates interaction terms for the randomly sampled features. The selected features from each model are pooled and their statistical significance is determined. The selected statistically significant features are used as the final output of the approach, whose final coefficients are estimated using appropriate statistical techniques. The performance of HDSI is evaluated using both simulated data and real studies. In general, HDSI outperforms the commonly used algorithms such as LASSO, subset selection, adaptive LASSO, random LASSO and group LASSO. [ABSTRACT FROM AUTHOR]

Environmental and anthropogenic factors are known to drive fish community structure in aquatic systems across the world. This study investigates fish assemblages in lower order streams across contrasting landscapes in central and eastern India. We documented the species diversity of these monsoon driven lower order streams in the two regions. We also investigated the potential common environmental drivers of richness and diversity and effect of season in these tropical streams. The study was based on seasonal data on abundance of fishes and environmental parameters collected between 2015–2017 from streams in states of Madhya Pradesh and West Bengal. Species diversity were compared across regions and seasons, based on their richness (SR) as well as diversity (Shannon index H'). Drivers of overall richness and diversity were analyzed using multiple linear regression methods, based on best subset selection. Analysis of data revealed high diversity in these streams in both regions. Cyprinidae, Bagridae and Channidae were the most dominant families in both regions. Despite the geographical and local ecological differences across the regions, common environmental parameters were found to influence richness and diversity across the two regions, indicating these as being key drivers of fish community structure. Water flow was a common factor driving both richness and diversity across both regions. Our study revealed a lack of seasonal effect in structuring fish communities in tropical streams. With stream and river ecosystems facing increasing threats due to habitat alterations and water quality degradation in countries such as India, a clear understanding of regional and local drivers of community structure of aquatic fauna is crucial. These results on the role of common environmental factors across ecoregions provides baseline information for understanding their ecological roles and developing management plans for important river basins and fish conservation in future. [ABSTRACT FROM AUTHOR]

The pathophysiology of osteoarthritis (OA) involves dysregulation of anabolic and catabolic processes associated with a broad panel of proteins that ultimately lead to cartilage degradation. An increased understanding about these protein interactions with systematic in vitro analyses may give new ideas regarding candidates for treatment of OA related cartilage degradation. Therefore, an ex vivo tissue model of cartilage degradation was established by culturing tissue explants with bacterial collagenase II. Responses of healthy and degrading cartilage were analyzed through protein abundance in tissue supernatant with a 26-multiplex protein profiling assay, after exposing the samples to a panel of 55 protein stimulations present in synovial joints of OA patients. Multivariate data analysis including exhaustive pairwise variable subset selection identified the most outstanding changes in measured protein secretions. MMP9 response to stimulation was outstandingly low in degrading cartilage and there were several protein pairs like IFNG and MMP9 that can be used for successful discrimination between degrading and healthy samples. The discovered changes in protein responses seem promising for accurate detection of degrading cartilage. The ex vivo model seems interesting for drug discovery projects related to cartilage degradation, for example when trying to uncover the unknown interactions between secreted proteins in healthy and degrading tissues. [ABSTRACT FROM AUTHOR]

We address gene selection and machine learning methods for cancer classification using microarray gene expression data. Due to the high dimensionality of microarray data, traditional gene selection algorithms are filter-based, focusing on intrinsic properties of the data such as distance, dependency, and correlation. These methods are fast but select far too many genes to use for the classification task. In this work, we present a new hybrid filter-wrapper gene subset selection algorithm that is an improved modification of our prior algorithm. Our proposed method employs interaction information to rank candidate genes to add into a gene subset. It then conditionally adds one gene at a time into the current subset and verifies whether the resultant subset improves the classification performance significantly. Only significant genes are selected, and the candidate gene list is updated every time a gene is added to the subset. Thus, our gene selection algorithm is very dynamic. Experimental results on ten public cancer microarray data sets show that our method consistently outperforms prior gene selection algorithms in terms of classification accuracy, while requiring a small number of selected genes. [ABSTRACT FROM AUTHOR]

Analysis of single-cell RNA sequencing (scRNA-Seq) data often involves filtering out uninteresting or poorly measured genes and dimensionality reduction to reduce noise and simplify data visualization. However, techniques such as principal components analysis (PCA) fail to preserve non-negativity and sparsity structures present in the original matrices, and the coordinates of projected cells are not easily interpretable. Commonly used thresholding methods to filter genes avoid those pitfalls, but ignore collinearity and covariance in the original matrix. We show that a deterministic column subset selection (DCSS) method possesses many of the favorable properties of common thresholding methods and PCA, while avoiding pitfalls from both. We derive new spectral bounds for DCSS. We apply DCSS to two measures of gene expression from two scRNA-Seq experiments with different clustering workflows, and compare to three thresholding methods. In each case study, the clusters based on the small subset of the complete gene expression profile selected by DCSS are similar to clusters produced from the full set. The resulting clusters are informative for cell type. [ABSTRACT FROM AUTHOR]

Selecting core subsets from plant genotype datasets is important for enhancing cost-effectiveness and to shorten the time required for analyses of genome-wide association studies (GWAS), and genomics-assisted breeding of crop species, etc. Recently, a large number of genetic markers (>100,000 single nucleotide polymorphisms) have been identified from high-density single nucleotide polymorphism (SNP) arrays and next-generation sequencing (NGS) data. However, there is no software available for picking out the efficient and consistent core subset from such a huge dataset. It is necessary to develop software that can extract genetically important samples in a population with coherence. We here present a new program, GenoCore, which can find quickly and efficiently the core subset representing the entire population. We introduce simple measures of coverage and diversity scores, which reflect genotype errors and genetic variations, and can help to select a sample rapidly and accurately for crop genotype dataset. Comparison of our method to other core collection software using example datasets are performed to validate the performance according to genetic distance, diversity, coverage, required system resources, and the number of selected samples. GenoCore selects the smallest, most consistent, and most representative core collection from all samples, using less memory with more efficient scores, and shows greater genetic coverage compared to the other software tested. GenoCore was written in R language, and can be accessed online with an example dataset and test results at . [ABSTRACT FROM AUTHOR]

Game theory based methods designed to solve the problem of community structure detection in complex networks have emerged in recent years as an alternative to classical and optimization based approaches. The Mixed Nash Extremal Optimization uses a generative relation for the characterization of Nash equilibria to identify the community structure of a network by converting the problem into a non-cooperative game. This paper proposes a method to enhance this algorithm by reducing the number of payoff function evaluations. Numerical experiments performed on synthetic and real-world networks show that this approach is efficient, with results better or just as good as other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Human monocytes have been grouped into classical (CD14++CD16−), non-classical (CD14dimCD16++), and intermediate (CD14++CD16+) subsets. Documentation of normal function and variation in this complement of subtypes, particularly their differentiation potential to dendritic cells (DC) or macrophages, remains incomplete. We therefore phenotyped monocytes from peripheral blood of healthy subjects and performed functional studies on high-speed sorted subsets. Subset frequencies were found to be tightly controlled over time and across individuals. Subsets were distinct in their secretion of TNFα, IL-6, and IL-1β in response to TLR agonists, with classical monocytes being the most producers and non-classical monocytes the least. Monocytes, particularly those of the non-classical subtype, secreted interferon-α (IFN-α) in response to intracellular TLR3 stimulation. After incubation with IL-4 and GM-CSF, classical monocytes acquired monocyte-derived DC (mo-DC) markers and morphology and stimulated allogeneic T cell proliferation in MLR; intermediate and non-classical monocytes did not. After incubation with IL-3 and Flt3 ligand, no subset differentiated to plasmacytoid DC. After incubation with GM-CSF (M1 induction) or macrophage colony-stimulating factor (M-CSF) (M2 induction), all subsets acquired macrophage morphology, secreted macrophage-associated cytokines, and displayed enhanced phagocytosis. From these studies we conclude that classical monocytes are the principal source of mo-DCs, but all subsets can differentiate to macrophages. We also found that monocytes, in particular the non-classical subset, represent an alternate source of type I IFN secretion in response to virus-associated TLR agonists. [ABSTRACT FROM AUTHOR]