Rank Aggregation Algorithm Selection Meets Feature Selection

In credit risk evaluation the accuracy of a classifier is very significant for classifying the high-risk loan applicants correctly. Feature selection is one way of improving the accuracy of a classifier. It provides the classifier with important and relevant features for model development. This study uses the ensemble of multiple feature ranking techniques for feature selection of credit data. It uses five individual rank based feature selection methods. It proposes a novel rank aggregation algorithm for combining the ranks of the individual feature selection methods of the ensemble. This algorithm uses the rank order along with the rank score of the features in the ranked list of each feature selection method for rank aggregation. The ensemble of multiple feature selection techniques uses the novel rank aggregation algorithm and selects the relevant features using the 80%, 60%, 40% and 20% thresholds from the top of the aggregated ranked list for building the C4.5, MLP, C4.5 based Bagging and MLP based Bagging models. It was observed that the performance of models using the ensemble of multiple feature selection techniques is better than the performance of 5 individual rank based feature selection methods. The average performance of all the models was observed as best for the ensemble of feature selection techniques at 60% threshold. Also, the bagging based models outperformed the individual models most significantly for the 60% threshold. This increase in performance is more significant from the fact that the number of features were reduced by 40% for building the highest performing models. This reduces the data dimensions and hence the overall data size phenomenally for model building. The use of the ensemble of feature selection techniques using the novel aggregation algorithm provided more accurate models which are simpler, faster and easy to interpret.

This paper presents novel approaches for combining re-ranking and rank aggregation methods aiming at improving the effectiveness of Content-Based Image Retrieval (CBIR) systems. Given a query image as input, CBIR systems retrieve the most similar images in a collection by taking into account image visual properties. In this scenario, accurately ranking collection images is of great relevance. Aiming at improving the effectiveness of CBIR systems, re-ranking and rank aggregation algorithms have been proposed. However, different re-ranking and rank aggregation approaches, applied to different image descriptors, may produce different and complementary image rankings. In this paper, we present four novel approaches for combining these rankings aiming at obtaining more effective results. Several experiments were conducted involving shape, color, and texture descriptors. The proposed approaches are also evaluated on multimodal retrieval tasks, considering visual and textual descriptors. Experimental results demonstrate that our approaches can improve significantly the effectiveness of image retrieval systems.

With the rapid advancement of wireless technologies and mobile devices, mobile services offer great convenience and huge opportunities for service creation. However, information overload make service recommendation become a crucial issue in mobile services. Although traditional single-criteria recommendation systems have been successful in a number of personalization applications, obviously individual criterion cannot satisfy consumers’ demands. Relying on multi-criteria ratings, this paper presents a novel recommendation system using the multi-agent technology. In this system, the ratings with respect to the three criteria are aggregated into an overall service ranking list by a rank aggregation algorithm. Furthermore, all of the services are classified into several clusters to reduce information overload further. Finally, Based on multi-criteria rank aggregation, the prototype of a recommendation system is implemented. Successful applications of this recommendation system have demonstrated the efficiency of the proposed approach.

Due to the raising awareness towards the detrimental effects of internal combustion engine (ICE) vehicles on the environment, the electric vehicle (EV) market in India has been growing rapidly. EVs are now seen as a significant technology in the automotive industry that can contribute to sustainable development by reducing greenhouse emissions and pollution due to the burning of fossil fuels. This study aims to explore the several factors that affect the customer’s purchasing decision of battery electric vehicle (BEV). A total of 10 broad factors have been procured from an extensive literature review. Further, these were validated through a pool of experts, and general customers who also linguistically scored them as attributes based on their importance on a 7-point linguistic scale. Fuzzy Analytical Hierarchy Process (F-AHP) model was used to translate collected data to attribute weights. In a case study, the five major BEVs in the Indian context were considered as alternatives, for which the data was collected through the companies’ published brochures and public reports. A novel framework of a combination of 4 multi-criteria decision-making (MCDM) techniques, namely: TOPSIS, SAW, COPRAS, and ELECTRE and robust rank aggregation (RRA) algorithm was proposed for the ranking problem. These rankings obtained from the MCDM combination were finally combined using the robust rank aggregation algorithm to provide a final consolidated ranking of the BEVs. The results show that the purchasing price, full charge time were the most highly weighted factors. These were followed by the quick charge time, range, ground clearance, and acceleration in that order. Based on the ranking model for the considered case MG ZS EV is the highest ranked alternative followed by Hyundai Kona EV, Tata Nexon EV, Tata Tigor EV, and lastly by Mahindra e-Verito. Since the findings of this study are in the Indian context where the EV market is at an initial stage, these may be applicable to other nations where the EV market is developing and is in the nascent stages. The proposed methodology can help aid customers with a more comprehensive purchasing approach while formulating their decision.

High dynamic range (HDR) photography is an emerging technology that has the potential to dramatically enhance the visual quality and realism of digital photos. One of the key technical challenges of HDR photography is displaying HDR photos on conventional devices through tone mapping or dynamic range compression. Although many different tone mapping techniques have been developed in recent years, evaluating tone mapping operators prove to be extremely difficult. Web2.0, social media and crowd-sourcing are emerging Internet technologies which can be harnessed to harvest the brain power of the mass to solve difficult problems in science, engineering and businesses. Paired comparison is used in the scientific study of preferences and attitudes and has been shown to be capable of obtaining an interval-scale ordering of items along a psychometric dimension such as preference or importance. In this paper, we exploit these technologies for evaluating HDR tone mapping algorithms. We have developed a Web2.0 style system that enables Internet users from anywhere to evaluate tone mapped HDR photos at any time. We adopt a simple paired comparison protocol, Internet users are presented a pair of tone mapped images and are simply asked to select the one that they think is better or click a "no difference" button. These user inputs are collected in the web server and analyzed by a rank aggregation algorithm which ranks the tone mapped photos according to the votes they received. We present experimental results which demonstrate that the emerging Internet technologies can be exploited as a new paradigm for evaluating HDR tone mapping algorithms. The advantages of this approach include the potential of collecting large user inputs under a variety of viewing environments rather than limited user participation under controlled laboratory environments thus enabling more robust and reliable quality assessment. We also present data analysis to correlate user generated qualitative indices with quantitative image statistics which may provide useful guidance for developing better tone mapping operators.

<p>Classification problems often have a large number of features, but not all of them are useful for classification. Irrelevant and redundant features may even reduce the classification accuracy. Feature selection is a process of selecting a subset of relevant features, which can decrease the dimensionality, shorten the running time, and/or improve the classification accuracy. There are two types of feature selection approaches, i.e. wrapper and filter approaches. Their main difference is that wrappers use a classification algorithm to evaluate the goodness of the features during the feature selection process while filters are independent of any classification algorithm. Feature selection is a difficult task because of feature interactions and the large search space. Existing feature selection methods suffer from different problems, such as stagnation in local optima and high computational cost. Evolutionary computation (EC) techniques are well-known global search algorithms. Particle swarm optimisation (PSO) is an EC technique that is computationally less expensive and can converge faster than other methods. PSO has been successfully applied to many areas, but its potential for feature selection has not been fully investigated. The overall goal of this thesis is to investigate and improve the capability of PSO for feature selection to select a smaller number of features and achieve similar or better classification performance than using all features. This thesis investigates the use of PSO for both wrapper and filter, and for both single objective and multi-objective feature selection, and also investigates the differences between wrappers and filters. This thesis proposes a new PSO based wrapper, single objective feature selection approach by developing new initialisation and updating mechanisms. The results show that by considering the number of features in the initialisation and updating procedures, the new algorithm can improve the classification performance, reduce the number of features and decrease computational time. This thesis develops the first PSO based wrapper multi-objective feature selection approach, which aims to maximise the classification accuracy and simultaneously minimise the number of features. The results show that the proposed multi-objective algorithm can obtain more and better feature subsets than single objective algorithms, and outperform other well-known EC based multi-objective feature selection algorithms. This thesis develops a filter, single objective feature selection approach based on PSO and information theory. Two measures are proposed to evaluate the relevance of the selected features based on each pair of features and a group of features, respectively. The results show that PSO and information based algorithms can successfully address feature selection tasks. The group based method achieves higher classification accuracies, but the pair based method is faster and selects smaller feature subsets. This thesis proposes the first PSO based multi-objective filter feature selection approach using information based measures. This work is also the first work using other two well-known multi-objective EC algorithms in filter feature selection, which are also used to compare the performance of the PSO based approach. The results show that the PSO based multiobjective filter approach can successfully address feature selection problems, outperform single objective filter algorithms and achieve better classification performance than other multi-objective algorithms. This thesis investigates the difference between wrapper and filter approaches in terms of the classification performance and computational time, and also examines the generality of wrappers. The results show that wrappers generally achieve better or similar classification performance than filters, but do not always need longer computational time than filters. The results also show that wrappers built with simple classification algorithms can be general to other classification algorithms.</p>

In the present state of affairs, the motive behind every educational organization is to uplift the academic achievement of students. Educational data mining (EDM) is an upward field of research, and it is very helpful for academic institutions to predict the academic performance of the students. Educational datasets are the basis of various predictive models. Quality of these models can be improved by using feature selection (FS). To get the required benefits from the available data, there must be some tools for analysis and prediction. In lieu of the above, machine learning/data mining are most suitable. In educational data mining, for better accuracy of prediction models’ and quality of various educational datasets, feature selection (FS) plays a vital role. Feature selection (FS) algorithms abolish inappropriate information from the repositories of educational background so that performance of classifier in terms of accuracy could be increased and the same could be used for better decision. In lieu of the above, a best feature selection algorithm must be selected. In this paper, two filter selection approaches namely correlation feature selection (CFS) and wrapper-based feature selection have been used to demonstrate the importance of selection of a feature subset for a classification problem. The present paper aims to find the detailed investigation of filter feature selection algorithms along with the classification algorithms on a given dataset. We found result with numerous numbers of features from various Feature selection algorithms and classifiers which will help the researcher to discover the most excellent mixture of filter feature selection algorithms and its associated classifiers. The result indicates that SMO and J48 have the highest accuracy measures with the correlation feature selection algorithms, while Naïve Bayes has the highest accuracy measures with the wrapper subset feature selection algorithms for predicting high, medium and low grade for the students.

Due to increasing risks mainly in surveillance, security, and authentication, it has become imperative to pay more attention to Face Recognition (FR) system. Any FR system consists of three main subdivisions—Feature Extraction, Feature Selection, and Classification. This paper uses a combination of DCT (Discrete Cosine Transform) and PCA (Principal Component Analysis), i.e., DCTPCA for feature extraction followed by Bat and Cuckoo Search Algorithms for Feature Selection. The aim here is to use different classifiers such as Euclidean Distance (ED), Manhattan Distance (MD), Canberra Distance (CD), and Chebyshev Distance (ChD) for classification purpose and to compare them to find as to which, among these, suits best for a given dataset. The results not only reveal the efficiency of Bat-based feature selection algorithm over Cuckoo Search but also show how effective Euclidean Distance classifier is over other classifiers for Yale_Original database and Manhattan Distance classifier for Yale_Extended database.

<p>Classification aims to identify a class label of an instance according to the information from its characteristics or features. Unfortunately, many classification problems have a large feature set containing irrelevant and redundant features, which reduce the classification performance. In order to address the above problem, feature selection is proposed to select a small subset of relevant features. There are three main types of feature selection methods, i.e. wrapper, embedded and filter approaches. Wrappers use a classification algorithm to evaluate candidate feature subsets. In embedded approaches, the selection process is embedded in the training process of a classification algorithm. Different from the other two approaches, filters do not involve any classification algorithm during the selection process. Feature selection is an important process but it is not an easy task due to its large search space and complex feature interactions. Because of the potential global search ability, Evolutionary Computation (EC), especially Particle Swarm Optimization (PSO), has been widely and successfully applied to feature selection. However, there is potential to improve the effectiveness and efficiency of EC-based feature selection. The overall goal of this thesis is to investigate and improve the capability of EC for feature selection to select small feature subsets while maintaining or even improving the classification performance compared to using all features. Different aspects of feature selection are considered in this thesis such as the number of objectives (single-objective/multi-objective), the fitness function (filter/wrapper), and the searching mechanism. This thesis introduces a new fitness function based on mutual information which is calculated by an estimation approach instead of the traditional counting approach. Results show that the estimation approach works well on both continuous and discrete data. More importantly, mutual information calculated by the estimation approach can capture feature interactions better than the traditional counting approach. This thesis develops a novel binary PSO algorithm, which is the first work to redefine some core concepts of PSO such as velocity and momentum to suit the characteristics of binary search spaces. Experimental results show that the proposed binary PSO algorithm evolve better solutions than other binary EC algorithms when the search spaces are large and complex. Specifically, on feature selection, the proposed binary PSO algorithm can select smaller feature subsets with similar or better classification accuracies, especially when there are a large number of features. This thesis proposes surrogate models for wrapper-based feature selection. The surrogate models use surrogate training sets which are subsets of informative instances selected from the training set. Experimental results show that the proposed surrogate models assist PSO to reduce the computational cost while maintaining or even improving the classification performance compared to using only the original training set. The thesis develops the first wrapper-based multi-objective feature selection algorithm using MOEA/D. A new decomposition strategy using multiple reference points for MOEA/D is designed, which can deal with different characteristics of multi-objective feature selection such as highly discontinuous Pareto fronts and complex relationships between objectives. The experimental results show that the proposed algorithm can evolve more diverse non-dominated sets than other multi-objective algorithms. This thesis introduces the first PSO-based feature selection algorithm for transfer learning. In the proposed algorithm, the fitness function uses classification performance to reduce the differences between domains while maintaining the discriminative ability on the target domain. The experimental results show that the proposed algorithm can select feature subsets which achieve better classification performance than four state-of-the-art feature-based transfer learning algorithms.</p>

In this work, we study the rank aggregation problem based on election voting model. In addition to classical voting rules: Borda, some elimination voting algorithms, including Kemeny methods, are analyzed in a graph theoretic approach. As the Kemeny ranking problem is NP-hard, a new heuristic elimination voting algorithm is proposed in this work. Some experiments have been carried out on TREC data for evaluating these voting algorithms on rank aggregation. The experiments indicate that these elimination algorithms have comparable performance with Borda algorithms, and sometimes outperform it

Aggregating multiple rankings in a database is an important task well studied by the database community. High-stakes application domains include hiring, lending, and education where multiple decision makers rank candidates and their input is then combined into an overall consensus ranking. While state-of-art aggregation methods succeed in giving equal say to each decision maker, to date no methods ensure fair representation for groups of candidates being ranked, who risk being impacted by discriminatory bias. We present the first solution to this open problem of guaranteeing fairness for disadvantaged groups of candidates, while still producing a good consensus of the base rankings. We design a family of exact fair algorithms achieving optimality for fair rank aggregation. We also develop approximate methods achieving fairness with guaranteed minimal approximation error scaling to millions of candidates in the rankings. A comparative study evaluates our proposed methods, revealing trade-offs between aggregation accuracy and different degrees of unfair bias in a rich variety of rank aggregation scenarios. Our real-world case study demonstrates that our solutions mitigate unfair bias using real-world data.

Identification of potential tissue-specific biomarkers involved in pig fat deposition through integrated bioinformatics analysis and machine learning

Pancreatic cancer (PC) has a dismal prognosis despite advancing scientific and technological knowledge. The exploration of novel genes is critical to improving current therapeutic measures. This research is aimed at selecting hub genes that can act as candidate therapeutic target genes and as prognostic biomarkers in PC. Gene expression profiles of datasets GSE101448, GSE15471, and GSE62452 were extracted from the GEO database. The “limma” package was performed to select differentially expressed genes (DEGs) between PC and normal tissue samples in each dataset. Robust rank aggregation (RRA) algorithm was conducted to integrate multiple expression profiles and identify robust DEGs. GO analysis and KEGG analysis were conducted to identify the functional correlation of the DEGs. The CIBERSORT algorithm was conducted to estimate the immune cell composition of each tissue sample. STRING and Cytoscape were used to establish the protein-protein interaction (PPI) network. The cytoHubba plugin in Cytoscape was performed to identify hub genes. Survival analysis based on hub gene expression was performed with clinical information from TCGA database. 566 robust DEGs (338 upregulated genes and 226 downregulated genes) were identified. Tumor tissue had a higher infiltration of resting dendritic cells and tumor-associated macrophages (TAM), including M0, M1, and M2 macrophages, while infiltration levels of B memory cells, plasma cells, T cells CD8, T follicular helper cells, and NK cells in normal tissue were relatively higher. GO terms and KEGG pathway analysis results revealed enrichment in tumor-associated pathways, including the extracellular matrix organization, cell−substrate adhesion cytokine−cytokine receptor interaction, calcium signaling pathway, and glycine, serine, and threonine metabolism, to name a few. Finally, FN1, MSLN, PLAU, and VCAN were selected as hub genes. High expression of FN1, MSLN, PLAU, and VCAN in PC significantly correlated with poor prognosis. Integrated transcriptomic analysis was used to provide new insights into PC pathogenesis. FN1, MSLN, PLAU, and VCAN may be considered as novel biomarkers of PC.

Background Although the expression of RNA-binding protein (RBP) genes in hepatocellular carcinoma (HCC) varies and is associated with tumor progression, there has been no overview study with multiple cohorts and large samples. The HCC-associated RBP genes need to be more accurately identified, and their clinical application value needs to be further explored. Methods First, we used the robust rank aggregation (RRA) algorithm to extract HCC-associated RBP genes from nine HCC microarray datasets and verified them in The Cancer Genome Atlas Liver Hepatocellular Carcinoma (TCGA-LIHC) cohort and International Cancer Genome Consortium (ICGC) Japanese liver cancer (ICGC-LIRI-JP) cohort. In addition, the copy number variation (CNV), single-nucleotide variant (SNV), and promoter-region methylation data of HCC-associated RBP genes were analyzed. Using the random forest algorithm, we constructed an RBP gene–based prognostic score system (RBP-score). We then evaluated the ability of RBP-score to predict the prognosis of patients. The relationships between RBP-score and other clinical characteristics of patients were analyzed. Results The RRA algorithm identified 30 RBP mRNAs with consistent expression patterns across the nine HCC microarray datasets. These 30 RBP genes were defined as HCC-associated RBP genes. Their mRNA expression patterns were further verified in the TCGA-LIHC and ICGC-LIRI-JP cohorts. Among these 30 RBP genes, some showed significant copy number gain or loss, while others showed differences in the methylation levels of their promoter regions. Some RBP genes were risk factors or protective factors for the prognosis of patients. We extracted 10 key HCC-associated RBP genes using the random forest algorithm and constructed an RBP-score system. RBP-score effectively predicted the overall survival (OS) and disease-free survival (DFS) of HCC patients and was associated with the tumor, node, metastasis (TNM) stage, α-fetoprotein (AFP), and metastasis risk. The clinical value of RBP-score was validated in datasets from different platforms. Cox analysis suggested that a high RBP-score was an independent risk factor for poor prognosis in HCC patients. We also successfully established a combined RBP-score+TNM LASSO-Cox model that more accurately predicted the prognosis. Conclusion The RBP-score system constructed based on HCC-associated RBP genes is a simple and highly effective prognostic evaluation tool. It is suitable for different subgroups of HCC patients and has cross-platform characteristics. Combining RBP-score with the TNM staging system or other clinical parameters can lead to an even greater clinical benefit. In addition, the identified HCC-associated RBP genes may serve as novel targets for HCC treatment.

Background Although the expression of RNA-binding protein (RBP) genes in hepatocellular carcinoma (HCC) varies and is associated with tumor progression, there has been no overview study with multiple cohorts and large samples. The HCC-associated RBP genes need to be more accurately identified, and their clinical application value needs to be further explored. Methods First, we used the robust rank aggregation (RRA) algorithm to extract HCC-associated RBP genes from nine HCC microarray datasets and verified them in The Cancer Genome Atlas Liver Hepatocellular Carcinoma (TCGA-LIHC) cohort and International Cancer Genome Consortium (ICGC) Japanese liver cancer (ICGC-LIRI-JP) cohort. In addition, the copy number variation (CNV), single-nucleotide variant (SNV), and promoter-region methylation data of HCC-associated RBP genes were analyzed. Using the random forest algorithm, we constructed an RBP gene–based prognostic score system (RBP-score). We then evaluated the ability of RBP-score to predict the prognosis of patients. The relationships between RBP-score and other clinical characteristics of patients were analyzed. Results The RRA algorithm identified 30 RBP mRNAs with consistent expression patterns across the nine HCC microarray datasets. These 30 RBP genes were defined as HCC-associated RBP genes. Their mRNA expression patterns were further verified in the TCGA-LIHC and ICGC-LIRI-JP cohorts. Among these 30 RBP genes, some showed significant copy number gain or loss, while others showed differences in the methylation levels of their promoter regions. Some RBP genes were risk factors or protective factors for the prognosis of patients. We extracted 10 key HCC-associated RBP genes using the random forest algorithm and constructed an RBP-score system. RBP-score effectively predicted the overall survival (OS) and disease-free survival (DFS) of HCC patients and was associated with the tumor, node, metastasis (TNM) stage, α-fetoprotein (AFP), and metastasis risk. The clinical value of RBP-score was validated in datasets from different platforms. Cox analysis suggested that a high RBP-score was an independent risk factor for poor prognosis in HCC patients. We also successfully established a combined RBP-score+TNM LASSO-Cox model that more accurately predicted the prognosis. Conclusion The RBP-score system constructed based on HCC-associated RBP genes is a simple and highly effective prognostic evaluation tool. It is suitable for different subgroups of HCC patients and has cross-platform characteristics. Combining RBP-score with the TNM staging system or other clinical parameters can lead to an even greater clinical benefit. In addition, the identified HCC-associated RBP genes may serve as novel targets for HCC treatment.