Recently, the proximity-based methods have achieved great success for multiview clustering. Nevertheless, most existing proximity-based methods take the predefined proximity matrices as input and their performance relies heavily on the quality of the predefined proximity matrices. A few multiview proximity learning (MVPL) methods have been proposed to tackle this problem but there are still some limitations, such as only emphasizing the intraview relation but overlooking the inter-view correlation, or not taking the weight differences of different views into account when considering the inter-view correlation. These limitations affect the quality of the learned proximity matrices and therefore influence the clustering performance. With the aim of breaking through these limitations simultaneously, a novel proximity learning method, called adaptively weighted MVPL (AWMVPL), is proposed. In the proposed method, both the intraview relation and the inter-view correlation are considered. Besides, when considering the inter-view correlation, the weights of different views are learned in a self-weighted scheme. Furthermore, through an adaptively weighted scheme, the information of the learned view-specific proximity matrices is integrated into a view-common cluster indicator matrix which outputs the final clustering result. Extensive experiments are conducted on several synthetic and real-world datasets to demonstrate the effectiveness and superiority of our method compared with the existing methods.

BACKGROUND: The random forests algorithm is a type of classifier with prominent universality, a wide application range, and robustness for avoiding overfitting. But there are still some drawbacks to random forests. Therefore, to improve the performance of random forests, this paper seeks to improve imbalanced data processing, feature selection and parameter optimization. RESULTS: We propose the CURE-SMOTE algorithm for the imbalanced data classification problem. Experiments on imbalanced UCI data reveal that the combination of Clustering Using Representatives (CURE) enhances the original synthetic minority oversampling technique (SMOTE) algorithms effectively compared with the classification results on the original data using random sampling, Borderline-SMOTE1, safe-level SMOTE, C-SMOTE, and k-means-SMOTE. Additionally, the hybrid RF (random forests) algorithm has been proposed for feature selection and parameter optimization, which uses the minimum out of bag (OOB) data error as its objective function. Simulation results on binary and higher-dimensional data indicate that the proposed hybrid RF algorithms, hybrid genetic-random forests algorithm, hybrid particle swarm-random forests algorithm and hybrid fish swarm-random forests algorithm can achieve the minimum OOB error and show the best generalization ability. CONCLUSION: The training set produced from the proposed CURE-SMOTE algorithm is closer to the original data distribution because it contains minimal noise. Thus, better classification results are produced from this feasible and effective algorithm. Moreover, the hybrid algorithm's F-value, G-mean, AUC and OOB scores demonstrate that they surpass the performance of the original RF algorithm. Hence, this hybrid algorithm provides a new way to perform feature selection and parameter optimization.

Graph coloring is one of the most significant problems in combinatorial optimization. On the basis of the traditional evolutionary heuristic algorithm, this paper presents a memetic algorithm with partial solutions (MAP) for solving this problem. Moreover, we combine a special crossover operator based on the independent sets and a tabu search algorithm with a strong capacity of local search. Meanwhile the score function for individuals and the fitness function for updating process are improved. The experiment for DIMACS Benchmark shows that this algorithm can not only solve the general graphs, but also figure out the optimal solution to the flat series which cannot be solved well by most evolutionary heuristic algorithms. It proves that the memetic algorithm with partial solutions (MAP) has a good stability.