Search

The evaluation of scientific journals poses challenges owing to the existence of various impact measures. This is because journal ranking is a multidimensional construct that may not be assessed effectively using a single metric such as an impact factor. A few studies have proposed an ensemble of metrics to prevent the bias induced by an individual metric. In this study, a multi-metric journal ranking method based on the standardized average index (SA index) was adopted to develop an extended standardized average index (ESA index). The ESA index utilizes six metrics: the CiteScore, Source Normalized Impact per Paper (SNIP), SCImago Journal Rank (SJR), Hirsh index (H-index), Eigenfactor Score, and Journal Impact Factor from three well-known databases (Scopus, SCImago Journal & Country Rank, and Web of Science). Experiments were conducted in two computer science subject areas: (1) artificial intelligence and (2) computer vision and pattern recognition. Comparing the results of the multi-metric-based journal ranking system with the SA index, it was demonstrated that the multi-metric ESA index exhibited high correlation with all other indicators and significantly outperformed the SA index. To further evaluate the performance of the model and determine the aggregate impact of bibliometric indices with the ESA index, we employed unsupervised machine learning techniques such as clustering coupled with principal component analysis (PCA) and t-distributed stochastic neighbor embedding (t-SNE). These techniques were utilized to measure the clustering impact of various bibliometric indicators on both the complete set of bibliometric features and the reduced set of features. Furthermore, the results of the ESA index were compared with those of other ranking systems, including the internationally recognized Scopus, SJR, and HEC Journal Recognition System (HJRS) used in Pakistan. These comparisons demonstrated that the multi-metric-based ESA index can serve as a valuable reference for publishers, journal editors, researchers, policymakers, librarians, and practitioners in journal selection, decision making, and professional assessment. [ABSTRACT FROM AUTHOR]

This paper, based on differential privacy protecting K-means clustering algorithm, realizes privacy protection by adding data-disturbing Laplace noise to cluster center point. In order to solve the problem of Laplace noise randomness which causes the center point to deviate, especially when poor availability of clustering results appears because of small privacy budget parameters, an improved differential privacy protecting K-means clustering algorithm was raised in this paper. The improved algorithm uses the contour coefficients to quantitatively evaluate the clustering effect of each iteration and add different noise to different clusters. In order to be adapted to the huge number of data, this paper provides an algorithm design in MapReduce Framework. Experimental finding shows that the new algorithm improves the availability of the algorithm clustering results under the condition of ensuring individual privacy without significantly increasing its operating time. [ABSTRACT FROM AUTHOR]

This paper proposes a new unsupervised learning algorithm called jackknife entropy-based clustering algorithm for grouping families of probability density functions (pdfs). The fitness function is used to choose the best threshold values of similarity in the proposed algorithm. We demonstrate the correctness and robustness of the proposed algorithm on a synthetic data set. Finally, we apply the algorithm to texture clustering. [ABSTRACT FROM AUTHOR]

The paper presents the results of the development and testing of the system for constructing neurosemantic maps of the human brain based on fMRI data. The method of modeling the reaction of brain regions to the presentation of stimulus material has been developed and implemented, and neurosemantic maps in the gray matter of the human brain have been visualized. Personally and emotionally significant texts in Russian were used as a testing stimulus material. The results of semantic clustering analysis of the obtained model at individual and group level will be considered in the study. [ABSTRACT FROM AUTHOR]

Background: Insomnia as one of the dominant diseases of traditional Chinese medicine (TCM) has been extensively studied in recent years. To explore the novel approaches of research on TCM diagnosis and treatment, this paper presents a strategy for the research of insomnia based on machine learning. Methods: First of all, 654 insomnia cases have been collected from an experienced doctor of TCM as sample data. Secondly, in the light of the characteristics of TCM diagnosis and treatment, the contents of research samples have been divided into four parts: the basic information, the four diagnostic methods, the treatment based on syndrome differentiation and the main prescription. And then, these four parts have been analyzed by three analysis methods, including frequency analysis, association rules and hierarchical cluster analysis. Finally, a comprehensive study of the whole four parts has been conducted by random forest. Results: Researches of the above four parts revealed some essential connections. Simultaneously, based on the algorithm model established by the random forest, the accuracy of predicting the main prescription by the combinations of the four diagnostic methods and the treatment based on syndrome differentiation was 0.85. Furthermore, having been extracted features through applying the random forest, the syndrome differentiation of five zang-organs was proven to be the most significant parameter of the TCM diagnosis and treatment. Conclusions: The results indicate that the machine learning methods are worthy of being adopted to study the dominant diseases of TCM for exploring the crucial rules of the diagnosis and treatment. [ABSTRACT FROM AUTHOR]

One of the first decisions to be made when building a mineral resource model is the definition of geological/geostatistical domains. Cluster analysis is a set of techniques in machine learning that can be especially suited for this matter. In order to compare different approaches, two clustering algorithms were investigated in this study: k-means and the dual-space clustering algorithm. Choosing the most appropriate method and the number of clusters can be challenging and some metrics are needed to support these decisions, including the validation of the spatial distribution of the clusters, which is not always appropriately discussed in the literature. We introduce the use of correlograms of the indicators for that matter. Although clustering techniques can be robust for an application in resource modelling, expert knowledge is still necessary when applying cluster analysis to resource modeling, since final decisions should not be based solely on statistical indexes, but also on experience. In this paper, the proposed methodology was tested in a three-dimensional dataset related to a phosphate/titanium deposit. [ABSTRACT FROM AUTHOR]

Currently, the athletes' post-match scores are mostly manual methods, and artificial intelligence is still less used in athletes' post-match scores. Based on this, this study is based on machine learning algorithms and combined with athletes' scores for analysis. At the same time, this study uses the reptile technology to conduct real-time mining of athletes' data and proposes a model-based regression algorithm in the construction of scoring algorithm. Moreover, based on the actual situation, a comprehensive model combining clustering and regression is proposed. In addition, in order to study the validity of the model, this paper designs a performance simulation test, compares the proposed algorithm model with the traditional algorithm model, and collects relevant experimental data and draws the corresponding statistical graph. The experimental results show that the combination of clustering and regression can improve the model's effect and the results are like the expert scores, which verifies the practicality of the proposed algorithm and provides a theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

Sensor network intrusion detection has attracted extensive attention. However, previous intrusion detection methods face the highly imbalanced attack class distribution problem, and they may not achieve a satisfactory performance. To solve this problem, we propose a new intrusion detection algorithm based on normalized cut spectral clustering for sensor network in this paper. The main aim is to reduce the imbalance degree among classes in an intrusion detection system. First, we design a normalized cut spectral clustering to reduce the imbalance degree between every two classes in the intrusion detection data set. Second, we train a network intrusion detection classifier on the new data set. Finally, we do extensive experiments and analyze the experimental results in detail. Simulation experiments show that our algorithm can reduce the imbalance degree among classes and reserves the distribution of the original data on the one hand, and improve effectively the detection performance on the other hand. [ABSTRACT FROM AUTHOR]

In this paper, we propose a human action recognition method using HOIRM (histogram of oriented interest region motion) feature fusion and a BOW (bag of words) model based on AP (affinity propagation) clustering. First, a HOIRM feature extraction method based on spatiotemporal interest points ROI is proposed. HOIRM can be regarded as a middle-level feature between local and global features. Then, HOIRM is fused with 3D HOG and 3D HOF local features using a cumulative histogram. The method further improves the robustness of local features to camera view angle and distance variations in complex scenes, which in turn improves the correct rate of action recognition. Finally, a BOW model based on AP clustering is proposed and applied to action classification. It obtains the appropriate visual dictionary capacity and achieves better clustering effect for the joint description of a variety of features. The experimental results demonstrate that by using the fused features with the proposed BOW model, the average recognition rate is 95.75% in the KTH database, and 88.25% in the UCF database, which are both higher than those by using only 3D HOG+3D HOF or HOIRM features. Moreover, the average recognition rate achieved by the proposed method in the two databases is higher than that obtained by other methods. [ABSTRACT FROM AUTHOR]

The performance of data clustering algorithms is mainly dependent on their ability to balance between the exploration and exploitation of the search process. Although some data clustering algorithms have achieved reasonable quality solutions for some datasets, their performance across real-life datasets could be improved. This paper proposes an adaptive memetic differential evolution optimisation algorithm (AMADE) for addressing data clustering problems. The memetic algorithm (MA) employs an adaptive differential evolution (DE) mutation strategy, which can offer superior mutation performance across many combinatorial and continuous problem domains. By hybridising an adaptive DE mutation operator with the MA, we propose that it can lead to faster convergence and better balance the exploration and exploitation of the search. We would also expect that the performance of AMADE to be better than MA and DE if executed separately. Our experimental results, based on several real-life benchmark datasets, shows that AMADE outperformed other compared clustering algorithms when compared using statistical analysis. We conclude that the hybridisation of MA and the adaptive DE is a suitable approach for addressing data clustering problems and can improve the balance between global exploration and local exploitation of the optimisation algorithm. [ABSTRACT FROM AUTHOR]