An empirical comparison of classification algorithms for diagnosis of depression from brain sMRI scans

To be diagnostically effective, structural magnetic resonance imaging (sMRI) must reliably distinguish a depressed individual from a healthy individual at individual scans level. One of the tasks in the automated diagnosis of depression from brain sMRI is the classification. It determines the class to which a sample belongs (i.e., depressed/not depressed, remitted/not-remitted depression) based on the values of its features. Thus far, very limited works have been reported for identification of a suitable classification algorithm for depression detection. In this paper, different types of classification algorithms are compared for effective diagnosis of depression. Ten independent classification schemas are applied and a comparative study is carried out. The algorithms are: Naïve Bayes, Support Vector Machines (SVM) with Radial Basis Function (RBF), SVM Sigmoid, J48, Random Forest, Random Tree, Voting Feature Intervals (VFI), LogitBoost, Simple KMeans Classification Via Clustering (KMeans) and Classification Via Clustering Expectation Minimization (EM) respectively. The performances of the algorithms are determined through a set of experiments on sMRI brain scans. An experimental procedure is developed to measure the performance of the tested algorithms. A classification accuracy evaluation method was employed for evaluation and comparison of the performance of the examined classifiers.

Three algorithms for learning artificial neural network: A comparison for induction motor flux estimation

This paper presents a comparative study of three algorithms for learning artificial neural network. As neural estimator, back-propagation (BP) algorithm, uncorrelated real time recurrent learning (URTRL) algorithm and correlated real time recurrent learning (CRTRL) algorithm are used in the present work to learn the artificial neural network (ANN). The approach proposed here is based on the flux estimation of high performance induction motor drives. Simulation of the drive system was carried out to study the performance of the motor drive. It is observed that the proposed CRTRL algorithm based methodology provides better performance than the BP and URTRL algorithm based technique. The proposed method can be used for accurate measurement of the rotor flux.

An electrochemical method for measuring localized corrosion under cathodic protection

 A new method has been developed to measure metal corrosion rates and their distribution under cathodic protection (CP). This method uses an electrochemically integrated multi-electrode array to take local measurements of cathodic current density while simulating a continuous metallic surface. The distribution of cathodic current densities obtained under CP was analyzed to estimate the anodic current component at each electrode of the array. Corrosion patterns determined by this new method have shown good correlation with visual inspection and surface profilometry of the multi-electrode array surface.

Effects of type reduction algorithms on forecasting accuracy of IT2FLS models

Type reduction (TR) is one of the key components of interval type-2 fuzzy logic systems (IT2FLSs). Minimizing the computational requirements has been one of the key design criteria for developing TR algorithms. Often researchers give more rewards to computationally less expensive TR algorithms. This paper evaluates and compares five frequently used TR algorithms based on their contribution to the forecasting performance of IT2FLS models. Algorithms are judged based on the generalization power of IT2FLS models developed using them. Synthetic and real world case studies with different levels of uncertainty are considered to examine effects of TR algorithms on forecasts' accuracies. As per obtained results, Coupland-Jonh TR algorithm leads to models with a higher and more stable forecasting performance. However, there is no obvious and consistent relationship between the widths of the type reduced set and the TR algorithm. © 2013 Elsevier B.V.

Localized learning by emerging multinational enterprises in developed host countries: a fuzzy-set analysis of Chinese foreign direct investment in Australia

Firms learn general international management and foreign market specific knowledge in their internationalization process. Firms' strategic emphasis on generalized vs. localized learning is an important yet underexplored issue in the extant literature. Drawing on the theoretical framework of dynamic capability, and in the context of emerging multinational enterprises' FDI into developed host countries, this study examines the equifinal process-position-path configurations of firms that will motivate them to engage in localized learning (as opposed to generalized learning). Utilizing primary and secondary data of eleven Chinese foreign direct investments in Australia, collected at both headquarters and subsidiary levels, we conducted fuzzy-set qualitative comparative analysis (fsQCA) that provided substantial support to our propositions. This study contributes to the internationalization process model by identifying equifinal process-position-path configurations, as well as their core and peripheral conditions that motivate localized learning at both the headquarters and the subsidiary levels.

On the multicast lifetime of WANETs with multibeam antennas : Formulation, algorithms, and analysis

We explore the multicast lifetime capacity of energy-limited wireless ad hoc networks using directional multibeam antennas by formulating and solving the corresponding optimization problem. In such networks, each node is equipped with a practical smart antenna array that can be configured to support multiple beams with adjustable orientation and beamwidth. The special case of this optimization problem in networks with single beams have been extensively studied and shown to be NP-hard. In this paper, we provide a globally optimal solution to this problem by developing a general MILP formulation that can apply to various configurable antenna models, many of which are not supported by the existing formulations. In order to study the multicast lifetime capacity of large-scale networks, we also propose an efficient heuristic algorithm with guaranteed theoretical performance. In particular, we provide a sufficient condition to determine if its performance reaches optimum based on the analysis of its approximation ratio. These results are validated by experiments as well. The multicast lifetime capacity is then quantitatively studied by evaluating the proposed exact and heuristic algorithms using simulations. The experimental results also show that using two-beam antennas can exploit most lifetime capacity of the networks for multicast communications. © 2013 IEEE.

New variable step-sizes minimizing mean-square deviation for the lms-type algorithms

The least-mean-square-type (LMS-type) algorithms are known as simple and effective adaptation algorithms. However, the LMS-type algorithms have a trade-off between the convergence rate and steady-state performance. In this paper, we investigate a new variable step-size approach to achieve fast convergence rate and low steady-state misadjustment. By approximating the optimal step-size that minimizes the mean-square deviation, we derive variable step-sizes for both the time-domain normalized LMS (NLMS) algorithm and the transform-domain LMS (TDLMS) algorithm. The proposed variable step-sizes are simple quotient forms of the filtered versions of the quadratic error and very effective for the NLMS and TDLMS algorithms. The computer simulations are demonstrated in the framework of adaptive system modeling. Superior performance is obtained compared to the existing popular variable step-size approaches of the NLMS and TDLMS algorithms. © 2014 Springer Science+Business Media New York.