Analysis of injuries and deaths from road traffic accidents in Iran: bivariate regression approach.

BACKGROUNDS: This study aims to estimate and compare the parameters of some univariate and bivariate count models to identify the factors affecting the number of mortality and the number of injured in road accidents. METHODS: The accident data used in this study are related to Kermanshah province in march2020 to march2021. Accidents areas were divided into 125 areas based on density characteristics. In a one-year period, 3090 accidents happened on the suburban roads of Kermanshah province, which resulted in 398 deaths and 4805 injuries. Accident information, including longitude and latitude of accident location, type of accident (fatal and injury), number of deaths, number of injuries, accident type, the reason of the accident, and the kind of accident were all included as population-level variables in the regression models. We investigated four frequently used bivariate count regression models for accident data in the literature. RESULTS: In bivariate analysis, except for the DNM model, there is a reasonable decrease in the AIC measures of the saturated model compared to the reduced model for the other three models. For the injury models, MSE is lowest, respectively for DIBP (137.87), BNB (289.46), BP (412.36) and DNM (3640.89) models. These results are also established for death models. But, in univariate analysis, only injury models almost present reasonable results. CONCLUSIONS: Our findings show that the IDBP model is better suitable for evaluating accident datasets than other models. Motorcycle accidents, pedestrian accidents, left turn deviance, and dangerous speeding were all significant variables in the IDBP death model, and these parameters were linked to accident mortality.

Gene selection for microarray data classification via multi-objective graph theoretic-based method.

In recent decades, the improvement of computer technology has increased the growth of high-dimensional microarray data. Thus, data mining methods for DNA microarray data classification usually involve samples consisting of thousands of genes. One of the efficient strategies to solve this problem is gene selection, which improves the accuracy of microarray data classification and also decreases computational complexity. In this paper, a novel social network analysis-based gene selection approach is proposed. The proposed method has two main objectives of the relevance maximization and redundancy minimization of the selected genes. In this method, on each iteration, a maximum community is selected repetitively. Then among the existing genes in this community, the appropriate genes are selected by using the node centrality-based criterion. The reported results indicate that the developed gene selection algorithm while increasing the classification accuracy of microarray data, will also decrease the time complexity.