A simple test for nonstationarity in mixed panels: A further investigation

The test of Ng (2008) is one of the few that enables general inference regarding the proportion of non-stationary units in panel data. The current paper furthers the investigation of Ng (2008) in two directions. First, the existing sequential limit analysis is generalized to a very flexible asymptotic framework in which the number of time periods, T, can be either fixed or tending to infinity jointly with the number of cross-section units, N. Second, the test statistic is evaluated not only under the null hypothesis, but also under alternatives that can be either fixed or local.

Extension of bivariate means to weighted means of several arguments by using binary trees

ABSTRACTAveraging aggregation functions are valuable in building decision making and fuzzy logic systems and in handling uncertainty. Some interesting classes of averages are bivariate and not easily extended to the multivariate case. We propose a generic method for extending bivariate symmetric means to n-variate weighted means by recursively applying the specified bivariate mean in a binary tree construction. We prove that the resulting extension inherits many desirable properties of the base mean and design an efficient numerical algorithm by pruning the binary tree. We show that the proposed method is numerically competitive to the explicit analytical formulas and hence can be used in various computational intelligence systems which rely on aggregation functions.

Testing for predictability in panels of any time series dimension

The few panel data tests for the predictability of returns that exist are based on the prerequisite that both the number of time series observations, T, and the number of cross-section units, N, are large. As a result, it is impossible to apply these tests to stock markets, where lengthy time series of data are scarce. In response to this, the current paper develops a new test for predictability in panels where N is large and T≥. 2 can be either small or large, or indeed anything in between. This consideration represents an advancement relative to the usual large-. N and large-. T requirement. The new test is also very general, especially when it comes to allowable predictors, and is easy to implement. As an illustration, we consider the Chinese stock market, for which data are available for only 17 years, but where the number of firms is relatively large, 160.

Testing for predictability in panels with general predictors

The difficulty of predicting returns has recently motivated researchers to start looking for tests that are either more powerful or robust to more features of the data. Unfortunately, the way that these tests work typically involves trading robustness for power or vice versa. The current paper takes this as its starting point to develop a new panel-based approach to predictability that is both robust and powerful. Specifically, while the panel route to increased power is not new, the way in which the cross-section variation is exploited also to achieve robustness with respect to the predictor is. The result is two new tests that enable asymptotically standard normal and chi-squared inference across a wide range of empirically relevant scenarios in which the predictor may be stationary, moderately non-stationary, nearly non-stationary, or indeed unit root non-stationary. The type of cross-section dependence that can be permitted in the predictor is also very general, and can be weak or strong, although we do require that the cross-section dependence in the regression errors is of the strong form. What is more, this generality comes at no cost in terms of complicated test construction. The new tests are therefore very user-friendly.

Idempotent weighted aggregation based on binary aggregation trees

We propose weighted aggregation algorithms for creating general idempotent weighted aggregators of n variables derived from related symmetric idempotent aggregators of two variables. This computational method, together with interpolative aggregation, can be used for the development of general idempotent logic aggregators that satisfy a variety of conditions necessary for building decision models in the area of weighted compensative logic.

An IV test for a unit root in generally trending and correlated panels

This paper proposes an IV-based panel unit root test that is general enough to accommodate general error serial and cross-section dependence, and a potentially nonlinear deterministic trend function. These allowances make the new test one of the most general around. It is also very simple to implement. Indeed, the IV statistic is asymptotically invariant to not only to all nuisance parameters characterizing the dependence of the errors and the true trend function, but also the deterministic specification of the fitted test regression.

Error correction testing in panels with common stochastic trends

This paper develops panel data tests for the null hypothesis of no error correction in a model with common stochastic trends. The asymptotic distributions of the new test statistics are derived and simulation results are provided to suggest that they perform well in small samples. Copyright © 2015 John Wiley & Sons, Ltd.

A fast malware feature selection approach using a hybrid of multi-linear and stepwise binary logistic regression

Malware replicates itself and produces offspring with the same characteristics but different signatures by using code obfuscation techniques. Current generation anti-virus engines employ a signature-template type detection approach where malware can easily evade existing signatures in the database. This reduces the capability of current anti-virus engines in detecting malware. In this paper, we propose a stepwise binary logistic regression-based dimensionality reduction techniques for malware detection using application program interface (API) call statistics. Finding the most significant malware feature using traditional wrapper-based approaches takes an exponential complexity of the dimension (m) of the dataset with a brute-force search strategies and order of (m-1) complexity with a backward elimination filter heuristics. The novelty of the proposed approach is that it finds the worst case computational complexity which is less than order of (m-1). The proposed approach uses multi-linear regression and the p-value of each individual API feature for selection of the most uncorrelated and significant features in order to reduce the dimensionality of the large malware data and to ensure the absence of multi-collinearity. The stepwise logistic regression approach is then employed to test the significance of the individual malware feature based on their corresponding Wald statistic and to construct the binary decision the model. When the selected most significant APIs are used in a decision rule generation systems, this approach not only reduces the tree size but also improves classification performance. Exhaustive experiments on a large malware data set show that the proposed approach clearly exceeds the existing standard decision rule, support vector machine-based template approach with complete data and provides a better statistical fitness.