For the application of the standard genetic algorithm in illustration art design, there are still problems such as low search efficiency and high complexity. This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the algorithm, (...) then the k-medoids algorithm is introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. In addition, a multiobjective optimization genetic algorithm with complex constraints based on group classification is proposed. This algorithm focuses on the problem of group diversity and uses k-means cluster analysis operation to solve the problem of group diversity. The algorithm divides the entire group into four subgroups and assigns appropriate fitness values to reflect the optimal preservation strategy. A large number of computer simulation calculations show that the algorithm can obtain a widely distributed and uniform Pareto optimal solution, the evolution speed is fast, usually only a few iterations can achieve a good optimization effect, and finally the improved genetic algorithm is used to design the random illustration art. The example simulation shows that the improved algorithm proposed in this paper can achieve higher artistic and innovative illustration art design. (shrink)

The fuzzy clustering algorithm has been widely used in the research area and production and life. However, the conventional fuzzy algorithms have a disadvantage of high computational complexity. This article proposes an improved fuzzy C-means algorithm based on K-means and principle of granularity. This algorithm is aiming at solving the problems of optimal number of clusters and sensitivity to the data initialization in the conventional FCM methods. The initialization stage of the K-medoid cluster, which is (...) different from others, has a strong representation and is capable of detecting data with different sizes. Meanwhile, through the combination of the granular computing and FCM, the optimal number of clusters is obtained by choosing accurate validity functions. Finally, the detailed clustering process of the proposed algorithm is presented, and its performance is validated by simulation tests. The test results show that the proposed improved FCM algorithm has enhanced clustering performance in the computational complexity, running time, cluster effectiveness compared with the existing FCM algorithms. (shrink)

This study investigates the performance of 21 monolingual and 56 bilingual children aged 5;6-9;0 on German-LITMUS-sentence-repetition (SRT; Hamann et al., 2013) and nonword-repetition-tasks (NWRT; Grimm et al., 2014), which were constructed according to the LITMUS-principles (Language Impairment Testing in Multilingual Settings; Armon-Lotem et al., 2015). Both tasks incorporate complex structures shown to be cross-linguistically challenging for children with Specific Language Impairment (SLI) and aim at minimizing bias against bilingual children while still being indicative of the presence of language impairment across (...) language combinations. Given the great variability in bilingual language exposure and the potential effect of language experience on language performance in bilingual children, we examined whether background variables related to bilingualism, particularly, the degree language dominance as measured by relative amount of use and exposure, could compromise the diagnostic accuracy of the German-LITMUS-SRT and NWRT. We further investigated whether a combination of the two tasks provides better diagnostic accurracy. To address this, we used an unsupervised machine learning algorithm, the Partitioning-Around-Medoids (PAM), for deriving a clinical category for the children as ±language-impaired based on performance scores on SRT and/or NWRT while withholding information about their clinical status based on standardized assessment in L1/L2. Subsequently, we calculated diagnostic accuracy and investigated which background variables (age of onset, length of exposure, degree of language-dominance, socio-economic-status, and risk factors for SLI) best explained clinical-group-membership yielded from the PAM-analysis based on NWRT and/or SRT scores. Results show that although language-dominance influences the performance of bilingual typically-developing children, especially in the SRT, the diagnostic accuracy of the tools is not compromised by language dominance: while risk factors for SLI were significant predictors for clinical group membership in all models, language dominance did not contribute at all to explaining clinical cluster membership as typically-developing or SLI based on any of the combinations of the SRT and NWRT variables. Additionally, results confirm that a combination of SRT scored by correct target structure and the structurally more complex language-dependent part of the NWRT yields better diagnostic accuracy than single measures and is only sensitive for risk factors for SLI and not to dominance levels or SES. (shrink)

Under “the Belt and Road” initiative, China promoted cooperation between domestic enterprises and international ports vigorously, which brought back fruitful results, while the rational selection of strategic pivots ports and the optimization of the layout of the port network are important guarantees to a further promotion to the economic development of “the Belt and Road” ports and give full play to the driving and radiation role of strategic pivots ports. On the basis of constructing a network of 155 ports in (...) the world, according to the number of ports crossed by the shortest path and betweenness centrality in the network, this paper uses K-Medoids clustering algorithm to train the strategic importance of ports and verifies the reliability of the analysis results. On this basis, the joint coverage analysis of strategically important ports is carried out, 17 ports are identified as strategic pivots ports of the global port network, and, finally, based on the two attributes of “the Belt and Road” and “Chinese enterprise participation” of strategic pivots ports, the leading role of strategic pivots ports in geographical location, path coverage, development potential, cooperation stability, and control is analyzed, and instructive suggestions are put forward. (shrink)

The early warning of financial risk is to identify and analyze existing financial risk factors, determine the possibility and severity of occurring risks, and provide scientific basis for risk prevention and management. The fragility of financial system and the destructiveness of financial crisis make it extremely important to build a good financial risk early-warning mechanism. The main idea of the K-means clustering algorithm is to gradually optimize clustering results and constantly redistribute target dataset to each clustering (...) center to obtain optimal solution; its biggest advantage lies in its simplicity, speed, and objectivity, being widely used in many research fields such as data processing, image recognition, market analysis, and risk evaluation. On the basis of summarizing and analyzing previous research works, this paper expounded the current research status and significance of financial risk early-warning, elaborated the development background, current status and future challenges of the K-means clustering algorithm, introduced the related works of similarity measure and item clustering, proposed a financial risk indicator system based on the K-means clustering algorithm, performed indicator selection and data processing, constructed a financial risk early-warning model based on the K-means clustering algorithm, conducted the classification of financial risk types and optimization of financial risk control, and finally carried out an empirical experiments and its result analysis. The study results show that the K-means clustering method can effectively avoid the subjective negative impact caused by artificial division thresholds, continuously optimize the prediction process of financial risk and redistribute target dataset to each cluster center for obtaining optimized solution, so the algorithm can more accurately and objectively distinguish the state interval of different financial risks, determine risk occurrence possibility and its severity, and provide a scientific basis for risk prevention and management. The study results of this paper provide a reference for further researches on financial risk early-warning based on K-means clustering algorithm. (shrink)

Data mining’s primary clustering method has several uses, including gene analysis. A set of unlabeled data is divided into clusters using data features in a clustering study, which is an unsupervised learning problem. Data in a cluster are more comparable to one another than to those in other groups. However, the number of clusters has a direct impact on how well the K-means algorithm performs. In order to find the best solutions for these real-world optimization issues, it (...) is necessary to use techniques that properly explore the search spaces. In this research, an enhancement of K-means clustering is proposed by applying an equilibrium optimization approach. The suggested approach adjusts the number of clusters while simultaneously choosing the best attributes to find the optimal answer. The findings establish the usefulness of the suggested method in comparison to existing algorithms in terms of intra-cluster distances and Rand index based on five datasets. Through the results shown and a comparison of the proposed method with the rest of the traditional methods, it was found that the proposal is better in terms of the internal dimension of the elements within the same cluster, as well as the Rand index. In conclusion, the suggested technique can be successfully employed for data clustering and can offer significant support. (shrink)

Aiming at the problem of inaccurate classification of big data information in traditional English teaching ability evaluation algorithms, an English teaching ability evaluation algorithm based on big data fuzzy K-means clustering and information fusion is proposed. Firstly, the author uses the idea of K-means clustering to analyze the collected original error data, such as teacher level, teaching facility investment, and policy relevance level, removes the data that the algorithm considers unreliable, uses the remaining valid data to (...) calculate the weighting factor of the modified fuzzy logic algorithm, and evaluates the weighted average with the node measurement data and gets the final fusion value. Secondly, the author integrates the big data information fusion and K-means clustering algorithm, realizes the clustering and integration of the index parameters of English teaching ability, compiles the corresponding English teaching resource allocation plan, and realizes the evaluation of English teaching ability. Finally, the results show that using this method to evaluate English teaching ability has better information fusion analysis ability, which improves the accuracy of teaching ability evaluation and the efficiency of teaching resources application. (shrink)

In synthetic aperture radar image segmentation field, regional algorithms have shown great potential for image segmentation. The SAR images have a multiplicity of complex texture, which are difficult to be divided as a whole. Existing algorithm may cause mixed super-pixels with different labels due to speckle noise. This study presents the technique based on organization evolution algorithm to improve ISODATA in pixels. This approach effectively filters out the useless local information and successfully introduces the effective information. To verify (...) the accuracy of OEA-ISO data algorithm, the segmentation effect of this algorithm is tested on SAR image and compared with other techniques. The results demonstrate that the OEA-ISO data algorithm is 10.16% more accurate than the WIPFCM algorithm, 23% more accurate than the K-means algorithm, and 27.14% more accurate than the fuzzy C-means algorithm in the light-colored farmland category. It can be seen that the OEA-ISO data algorithm introduces the pixel block strategy, which successfully reduces the noise interference in the image, and the effect is more obvious when the image background is complex. (shrink)

In user cluster analysis, users with the same or similar behavior characteristics are divided into the same group by iterative update clustering, and the core and larger user groups are detected. In this paper, we present the formulation and data mining of the correlation rules based on the clustering algorithm through the definition and procedure of the algorithm. In addition, based on the idea of the K-mode clustering algorithm, this paper proposes a clustering (...) method combining related rules with multivalued discrete features. In this paper, we construct a method to calculate the similarity between users using Jaccard distance and combine correlation rules with Jaccard distances to improve the similarity between users. Next, we propose a clustering method suitable for MDF. Finally, the basic K-mode algorithm is improved by the similarity measure method combining the correlation rule with the Jaccard distance and the cluster center update method which is the ARMDKM algorithm proposed in this paper. This method solves the problem that the MDF cannot be effectively processed in the traditional model and demonstrates its theoretical correctness. This experiment verifies the correctness of the new method by clustering purity, entropy, contour, and other indicators. (shrink)

This study focused on the identification problems of two-input single-output system with moving average noises based on unsupervised learning methods applied to the input signals. The input signal to the autoregressive moving average model is proposed to be arriving from a source with continuous technical and environmental changes as two separate featured input signals. These two input signals were grouped in a number of clusters using the K-means clustering algorithm. The clustered input signals were supplied to the model (...) in an orderly fashion from cluster-1 up to cluster-K. To ensure that the output signal can be best predicted from the input signal which in turn leads to selecting good enough model for its intended use, the magnitude-squared coherence measure is applied to the input/output signals in the cases of clustered and nonclustered inputs, which indicates best correlation coefficient when measured with clustered inputs. From collected input-output signals, we deduce a K-means clustering based recursive least squares method for estimating the parameter of autoregressive moving average system. The simulation results indicate that the suggested method is effective. (shrink)

Among the data clustering algorithms, the k-means (KM) algorithm is one of the most popular clustering techniques because of its simplicity and efficiency. However, KM is sensitive to initial centers and it has a local optima problem. The k-harmonic means (KHM) clustering algorithm solves the initialization problem of the KM algorithm, but it also has a local optima problem. In this paper, we develop a new algorithm for solving this problem based on a (...) modified version of particle swarm optimization (MPSO) algorithm and KHM clustering. In the proposed algorithm, MPSO is equipped with the cuckoo search algorithm and two new concepts used in PSO in order to improve the efficiency, fast convergence, and escape from local optima. MPSO updates the positions of particles based on a combination of global worst, global best with personal worst, and personal best to dynamically be used in each iteration of the MPSO. The experimental result on eight real-world data sets and two artificial data sets confirms that this modified version is superior to KHM and the regular PSO algorithm. The results of the simulation show that the new algorithm is able to create promising solutions with fast convergence, high accuracy, and correctness while markedly improving the processing time. (shrink)

To better reflect the precise clustering results of the data samples with different shapes and densities for affinity propagation clustering algorithm, an improved integrated clustering learning strategy based on three-stage affinity propagation algorithm with density peak optimization theory was proposed in this paper. DPKT-AP combined the ideology of integrated clustering with the AP algorithm, by introducing the density peak theory and k-means algorithm to carry on the three-stage clustering process. In the (...) first stage, the clustering center point was selected by density peak clustering. Because the clustering center was surrounded by the nearest neighbor point with lower local density and had a relatively large distance from other points with higher density, it could help the k-means algorithm in the second stage avoiding the local optimal situation. In the second stage, the k-means algorithm was used to cluster the data samples to form several relatively small spherical subgroups, and each of subgroups had a local density maximum point, which is called the center point of the subgroup. In the third stage, DPKT-AP used the AP algorithm to merge and cluster the spherical subgroups. Experiments on UCI data sets and synthetic data sets showed that DPKT-AP improved the clustering performance and accuracy for the algorithm. (shrink)

The paper presents different clustering approaches in legal judgments from the Special Civil Court located at the Federal University of Santa Catarina. The subject is Consumer Law, specifically cases in which consumers claim moral and material compensation from airlines for service failures. To identify patterns from the dataset, we apply four types of clustering algorithms: Hierarchical and Lingo, K-means and Affinity Propagation. We evaluate the results based on the following criteria: entropy and purity; algorithm's ability in providing (...) labels; legal expert’s evaluation; and experimental complexity. The results demonstrate that the most advantageous approach is Hierarchical Clustering, since it has the best entropy and purity numbers, as well as the least difficulty for the expert to analyze the clusters, and the least experimental complexity. The main contribution of the paper is to show the advantages and disadvantages of each approach, especially to identify labels in unstructured and non-indexed legal texts. (shrink)

Automatically clustering web pages into semantic groups promises improved search and browsing on the web. In this paper, we demonstrate how user-generated tags from largescale social bookmarking websites such as del.icio.us can be used as a complementary data source to page text and anchor text for improving automatic clustering of web pages. This paper explores the use of tags in 1) K-means clustering in an extended vector space model that includes tags as well as page text and (...) 2) a novel generative clustering algorithm based on latent Dirichlet allocation that jointly models text and tags. We evaluate the models by comparing their output to an established web directory. We find that the naive inclusion of tagging data improves cluster quality versus page text alone, but a more principled inclusion can substantially improve the quality of all models with a statistically signifi- cant absolute F-score increase of 4%. The generative model outperforms K-means with another 8% F-score increase. (shrink)

The clustering of mixed-attribute data is a vital and challenging issue. The density peaks clustering algorithm brings us a simple and efficient solution, but it mainly focuses on numerical attribute data clustering and cannot be adaptive. In this paper, we studied the adaptive improvement method of such an algorithm and proposed an adaptive mixed-attribute data clustering method based on density peaks called AMDPC. In this algorithm, we used the unified distance metric of mixed-attribute (...) data to construct the distance matrix, calculated the local density based on K-nearest neighbors, and proposed the automatic determination method of cluster centers based on three inflection points. Experimental results on real University of California-Irvine datasets showed that the proposed AMDPC algorithm could realize adaptive clustering of mixed-attribute data, can automatically obtain the correct number of clusters, and improved the clustering accuracy of all datasets by more than 22.58%, by 24.25%, by 28.03%, by 22.5%, and by 10.12% for the Heart, Cleveland, Credit, Acute, and Adult datasets compared to that of the traditional K-prototype algorithm, respectively. It also outperformed a modified density peaks clustering algorithm for mixed-attribute data algorithms. (shrink)

Effective and personalized treatment relies heavily on skin disease categorization. In the stratification of skin disorders, it is crucial to identify the subtypes of illnesses to provide an efficient therapy. To attain this aim, researchers have focused their attention on cluster algorithms for the stratification of skin disorders in recent decades. But, cluster algorithms have real-world drawbacks, including experimental noises, a large number of dimensions, and a poor ability to comprehend. Cluster algorithms, in particular, determine the quality of clusters using (...) a single internal evaluation operation in the majority of cases. A single internal assessment procedure is difficult to design and robust for all datasets, which is a problem. The multi-objective particle swarm obtained high sensitivity in the existing work, but it is not able to anticipate all kinds of classes. An optimized cluster distance parameter for K-means clustering is determined using a hybrid particle swarm and moth flame optimization. Multi-objective is guided by two cluster value indices, including the K-means clustering misclassification rate and neural network classification rate. Hybrid PSO will solve the multi-objective problem to identify the optimal cluster for clustering. On the dermatological dataset from the UCI repository, MATLAB R2020a will be used to evaluate the proposed method. This will be followed by an evaluation of the proposed method’s performance using the cluster evaluation indices. (shrink)

In this study, we focus on the problem of information expiration when using the traditional collaborative filtering algorithm and propose a new collaborative filtering algorithm by integrating the time factor. This algorithm considers information influence attenuation over time, introduces an information retention period based on the information half-value period, and proposes a time-weighted function, which is applied to the nearest neighbor selection and score prediction to assign different time weights to the scores. In addition, to further improve (...) the quality of the nearest neighbor selection and alleviate the problem of data sparsity, a method of calculating users’ sentiment tendency by analysis of user review features is proposed to mine users’ attitudes about the reviewed items, which expands the score matrix. The time factor and sentiment tendency are then integrated into the K-means clustering algorithm to select the nearest neighbor. A hybrid collaborative filtering model based on the improved K-means clustering algorithm is then proposed, by combining item-based and user-based collaborative filtering. Finally, the experimental results show that the proposed algorithm can address the time effect and sentiment analysis in recommendations and improve the predictive performance of the model. (shrink)

Intrauterine insemination is one of many treatments provided to infertility patients. Many factors such as, but not limited to, quality of semen, the age of a woman, and reproductive hormone levels contribute to infertility. Therefore, the aim of our study is to establish a statistical probability concerning the prediction of which groups of patients have a very good or poor prognosis for pregnancy after IUI insemination. For that purpose, we compare the results of two analyses: Cluster Analysis and Kohonen Neural (...) Networks. The k-means algorithm from the clustering methods was the best to use for selecting patients with a good prognosis but the Kohonen Neural Networks was better for selecting groups of patients with the lowest chances for pregnancy. (shrink)

In the article the problem of recognizing users of social networks, chats and other virtual spaces that are provoked by other users, inciting conflicts between participants of various online communities is investigated. In this work the authors give a brief description of the trolling concept. The relevance of solving the problem of trolling in the social communities of the Internet is shown in connection with the widespread aggressive provocative behavior of individual users in the virtual space, as well as the (...) influence of such behavior on the psyche and general condition of a person. The paper uses the theory of trust functions to process expert observations, estimates or measurements. The proposed approach involves the use of this theory in conjunction with the input of a value that determines the conflict between two combined trust functions. The goal of the work is to test a new approach for calculating potential trolls using a method based on the degree of conflict of trust functions between different messages of the discussion branch in question-answer communities. It is concluded that the possibility of assessing the user’s conflict with the help of a parameter called the measure of the conflict of his messages in relation to the messages of all other users. To simplify the calculation process, the k-means clustering algorithm is applied. (shrink)

Cloud computing deals with voluminous heterogeneous data, and there is a need to effectively distribute the load across clusters of nodes to achieve optimal performance in terms of resource usage, throughput, response time, reliability, fault tolerance, and so on. The swarm intelligence methodologies use artificial intelligence to solve computationally challenging problems like load balancing, scheduling, and resource allocation at finite time intervals. In literature, sufficient works are being carried out to address load balancing problem in the cloud using traditional swarm (...) intelligence techniques like ant colony optimization, particle swarm optimization, cuckoo search, bat optimization, and so on. But the traditional swarm intelligence techniques have issues with respect to convergence rate, arriving at the global optimum solution, complexity in implementation and scalability, which limits the applicability of such techniques in cloud domain. In this paper, we look into performance modeling aspects of some of the recent competitive swarm artificial intelligence based techniques like the whale, spider, dragonfly, and raven which are used for load balancing in the cloud. The results and analysis are presented over performance metrics such as total execution time, response time, resource utilization rate, and throughput achieved, and it is found that the performance of the raven roosting algorithm is high compared to other techniques. (shrink)

Dual innovation, which includes exploratory innovation and exploitative innovation, is crucial for firms to obtain a sustainable competitive advantage. The knowledge base of firms greatly influences or even determines the scope, direction, and path of their dual-innovation activities, which drive their innovation process and produce different innovation performances. This study uses data source patents obtained by 285 focal firms in the Chinese new-energy vehicle industry in the period 2015–2020. Five knowledge-base features are selected by analyzing the correlation and multicollinearity, and (...) four different firm clusters are found by using the k-means clustering algorithm. Based on the classification and regression tree algorithm, we mine the potential decision rules governing the dual-innovation performance of firms. The results show that the exploratory innovation performance of firms in different clusters is mainly affected by two different knowledge-base features. Knowledge-base scale is a key factor affecting the exploitative innovation performance of firms. Firms in different clusters can improve their dual-innovation performance by rationally tuning the combination of knowledge-base features. (shrink)

Misinformation and biased information significantly impact public perception and political decisions, especially on critical issues such as climate change and environmental conservation. This study aims to understand how indeterminacy and contradiction influence public perception and policy formulation by applying neutrosophic theory to model the complexity and multi-dimensionality of ignorance. Using neutrosophic Likert scales, we capture a nuanced spectrum of opinions on the scientific certainty of human impact on climate change. The results are analyzed through a k-means clustering algorithm (...) to identify patterns and segment participants into groups based on their levels of truth, indeterminacy, and falsehood. This approach reveals deeper insights into public perceptions and aids in evaluating their implications for effective communication and policy-making. (shrink)

Through the recognition of ocean sediment sonar images, the texture in the image can be classified, which provides an important basis for the classification of ocean sediment. Aiming at the problems of low efficiency, waste of human resources, and low accuracy in the traditional manual side-scan sonar image discrimination, this paper studies the application of image recognition technology in sonar image substrate texture discrimination, which is popular in many fields. At the same time, considering the scale complexity, diversity, multisources, and (...) small sample characteristics of the marine sediment sonar image texture, the transfer learning is introduced into the image recognition, and the K-means clustering algorithm is used to reset the prior frame parameters to improve the speed and accuracy of image recognition. Through the experimental comparison between the original model and the new model based on transfer learning, the AP value of the yolov3 model based on transfer learning can reach 84.39%, which is 0.97% higher than that of the original model, with considerable accuracy and room for improvement; it takes less than 0.2 seconds. This shows the applicability and development of image recognition technology in texture discrimination of bottom sonar images. (shrink)

Sensation is the reflection of the brain on the individual attributes of objective things that directly act on the sense organs. Feeling is the most elementary cognitive process and the simplest psychological phenomenon. Vision is a kind of sense, and sense is produced by objective things acting on the sense organs. But at present, it is rare to analyze interior design exhibition from the perspective of visual psychology, an emerging science, as an interdisciplinary attempt, only in interior design research. Therefore, (...) the study of sensory process should start from its external stimuli, in order to first understand how it acts on the sensory organs to produce sensory phenomena. This paper mainly studies the visual performance of psychological factors in interior design under the background of artificial intelligence. This paper proposes a K-means clustering algorithm and a localization algorithm fused with visual and inertial navigation. The distance thresholds corresponding to the SIFT feature descriptors of threshold T1, 128D, 96D, 64D, and 32D are 170, 160, 150, and 90, respectively. This verifies that the candidate image with the highest number of matching points is considered the best matching image. (shrink)

With the rapid development of China’s social economy and the improvement of the level of urbanization, urban transportation has also been greatly developed. With the booming development of the internet and the sharing economy industry, shared bicycles have emerged as the times requirement. Shared bicycles are a new type of urban transportation without piles. As a green way of travel, shared bicycles have the advantages of convenience, fashion, green, and environmental protection. However, many problems have also arisen in the use (...) of shared bicycles, such as man-made damage to the vehicle, the expiration of the service life of the vehicle, etc. These problems are unavoidable, and the occurrence of these failure problems will also cause serious harm to the use of shared bicycles. This article aims to study the path optimization of shared bicycles considering the recovery of faulty vehicles during dispatching. Based on the K-means spatial data clustering algorithm, a path optimization experiment of shared bicycle recycling scheduling considering the recycling of faulty vehicles is carried out. The experiment concluded that the shared bicycle recycling scheduling path based on K-means clustering planning significantly reduces the total time spent and the total cost of performing recycling scheduling tasks. Among them, the unit price of recycling and dispatching of each faulty shared bicycle has dropped by 4.1 yuan compared with the market unit price. The conclusion shows that the shared bicycle recycling scheduling path considering faulty vehicle recycling based on K-means clustering algorithm has been greatly optimized. (shrink)

To solve the problem that traditional trajectory prediction methods cannot meet the requirements of high-precision, multi-dimensional and real-time prediction, a 4D trajectory prediction model based on the backpropagation (BP) neural network was studied. First, the hierarchical clustering algorithm and the k-means clustering algorithm were adopted to analyze the total flight time. Then, cubic spline interpolation was used to interpolate the flight position to extract the main trajectory feature. The 4D trajectory prediction model was based on the (...) BP neural network. It was trained by Automatic Dependent Surveillance – Broadcast trajectory from Qingdao to Beijing and used to predict the flight trajectory at future moments. In this paper, the model is evaluated by the common measurement index such as maximum absolute error, mean absolute error and root mean square error. It also gives an analysis and comparison of the predicted over-point time, the predicted over-point altitude, the actual over-point time and the actual over-point altitude. The results indicate that the predicted 4D trajectory is close to the real flight data, and the time error at the crossing point is no more than 1 min and the altitude error at the crossing point is no more than 50 m, which is of high accuracy. (shrink)

The analysis of the operation of tourism companies will provide valid information for the design of policies to reactivate the tourism industry, which has been strongly affected during the pandemic generated by COVID-19. The objective of this paper is to use soft computing techniques to analyse tourism companies in Ecuador. First of all, dimensionality reduction methods are applied: principal component analysis, isometric feature mapping and locally linear embedding, on data of tourism enterprises in Ecuador for the year 2015. In addition, (...) to verify the trend of operational variables, the data of tourism companies in Ecuador in 2019 and 2020 are analysed with dimensionality reduction methods that improve the interpretation by minimizing the loss of information. The data sets are analysed with k-means, k-medoids and Hierarchical Clustering, generating groups according to similar characteristics. The optimal number of clusters is determined with the following: Elbow Method, Silhouette Coefficient, Davies-Bouldin Index and Dunn Index. In addition, an analysis of the operation of tourism companies in the year 2020 concerning previous years is included. The study allows exploring Soft Computing techniques to identify important information for the definition of strategies that contribute to an effective reactivation of the tourist industry of Ecuador. (shrink)

Clustering algorithm is one of the important research topics in the field of machine learning. Neutrosophic clustering is the generalization of fuzzy clustering and has been applied to many fields. This paper presents a new neutrosophic clustering algorithm with the help of regularization. Firstly, the regularization term is introduced into the FC-PFS algorithm to generate sparsity, which can reduce the complexity of the algorithm on large data sets. Secondly, we propose a method (...) to simplify the process of determining regularization parameters. Finally, experiments show that the clustering results of this algorithm on artificial data sets and real data sets are mostly better than other clustering algorithms. Our clustering algorithm is effective in most cases. (shrink)

The traditional recognition method of whitewash behavior of accounting statements needs to analyze a large number of special data samples. The learning rate of the algorithm is low, resulting in low recognition accuracy. To solve the aforementioned problems, this article proposes a method to identify the whitewash behavior of university accounting statements based on the FCM clustering algorithm. This article analyzes the motivation of university accounting statement whitewashing behavior, studies the common means of statement whitewashing, and establishes (...) a fuzzy set for the identification of university accounting statement whitewashing behavior. By calculating the fuzzy partition coefficient, the membership matrix of whitewash behavior recognition is established, and the whitewash behavior is classified through the iteration of the FCM algorithm. The comparative experimental results show that the recognition method has good recognition performance, low recognition error rate, and recognition accuracy of 82%. (shrink)

Decisions are taken by humans very often during professional as well as leisure activities. It is particularly evident during surfing the Internet: selecting web sites to explore, choosing needed information in search engine results or deciding which product to buy in an on-line store. Recommender systems are electronic applications, the aim of which is to support humans in this decision making process. They are widely used in many applications: adaptive WWW servers, e-learning, music and video preferences, internet stores etc. In (...) on-line solutions, such as e-shops or libraries, the aim of recommendations is to show customers the products which they are probably interested in. As input data the following are taken: shopping basket archives, ratings of the products or servers log files.The article presents a solution of recommender system which helps users to select an interesting product. The system analyses data from other customers' ratings of the products. It uses clustering methods to find similarities among the users and proposed techniques to identify users' profiles. The system was implemented in Apache Mahout environment and tested on a movie database. Selected similarity measures are based on: Euclidean distance, cosine as well as correlation coefficient and loglikehood function. (shrink)

In cloud security, intrusion detection system (IDS) is one of the challenging research areas. In a cloud environment, security incidents such as denial of service, scanning, malware code injection, virus, worm, and password cracking are getting usual. These attacks surely affect the company and may develop a financial loss if not distinguished in time. Therefore, securing the cloud from these types of attack is very much needed. To discover the problem, this paper suggests a novel IDS established on a combination (...) of a leader-based k-means clustering (LKM), optimal fuzzy logic system. Here, at first, the input dataset is grouped into clusters with the use of LKM. Then, cluster data are afforded to the fuzzy logic system (FLS). Here, normal and abnormal data are inquired by the FLS, while FLS training is done by the grey wolf optimization algorithm through maximizing the rules. The clouds simulator and NSL-Knowledge Discovery and DataBase (KDD) Cup 99 dataset are applied to inquire about the suggested method. Precision, recall, and F-measure are conceived as evaluation criteria. The obtained results have denoted the superiority of the suggested method in comparison with other methods. (shrink)

BackgroundAlthough gait patterns disturbances are known to be related to cognitive decline, there is no consensus on the possibility of predicting one from the other. It is necessary to find the optimal gait features, experimental protocols, and computational algorithms to achieve this purpose.PurposesTo assess the efficacy of the Stable Sparse Classifiers procedure for discriminating young and healthy older adults, as well as healthy and cognitively impaired elderly groups from their gait patterns. To identify the walking tasks or combinations of tasks (...) and specific spatio-temporal gait features that allow the best prediction with SSC.MethodsA sample of 125 participants was studied. They underwent assessment with five neuropsychological tests that explore different cognitive domains. A summarized cognitive index, based on the Mahalanobis distance from normative data, was calculated. The sample was divided into three groups using k-means clustering of MDCog in addition to Age. The participants executed four walking tasks and their gait patterns, measured with a body-fixed Inertial Measurement Unit, were used to calculate 16 STGF and dual-task costs. SSC was then employed to predict which group the participants belonged to. The classification's performance was assessed using the area under the receiver operating curves and the stable biomarkers were identified.ResultsThe discrimination HE vs. MCI-E revealed that the combination of the easy dual-task and the fast walking task had the best prediction performance. The features related to gait variability and to the amplitude of vertical acceleration had the largest predictive power. SSC prediction accuracy was better than the accuracies obtained with linear discriminant analysis and support vector machine classifiers.ConclusionsThe study corroborated that the changes in gait patterns can be used to discriminate between young and healthy older adults and more importantly between healthy and cognitively impaired adults. A subset of gait tasks and STGF optimal for achieving this goal with SSC were identified, with the latter method superior to other classification techniques. (shrink)

The article considers the method of factor cluster analysis which allows automatically retrain the onboard recognition system of an unmanned aerial system. The task of informational synthesis of an on-board system for identifying frames is solved within the information-extreme intellectual technology of data analysis, based on maxi- mizing the informational ability of the system during machine learning. Based on the functional approach to modeling cognitive processes inherent to humans during forming and making classification decisions, it was proposed a categorical model (...) in the form of a direct graph. According to this model, the algorithmic support of the information extreme factor cluster analysis is developed. It allows automatically retrain the system when expanding the alphabet of recognition classes. According to this algorithm, the on-board recognition system preliminarily carries out the information-extremal machine learning of recognition classes of relatively low power. When new classes appear, their unclassified structured recognition attribute vectors form additional learning matrixes. After reaching a representational volume, additional learning matrix joins the input learning matrix and the on-board recognition system is retrained. Forming additional learning matrixes of new recognition classes is carried out by the agglomerative algorithm of cluster analysis of unclassified vectors by k-means clustering. As a criterion of optimizing machine-learning parameters, we used the modified Kullback criterion which is a functional of the exact characteristics of classification solutions. To increase the functional efficiency of factor cluster analysis, it is proposed to increase the depth of machine learning by optimizing the parameters of image processing frames. (shrink)

With the rapid development of the market economy, there are more and more projects in the financial industry, and their complexity and technical requirements are getting higher and higher. The development of computer technology has promoted the birth of robot consultants, and it is of great significance to use robot consultants to manage and supervise financial industry projects. In order to further analyze the development and supervision of robo-advisors under the digital inclusive financial system, this paper uses complex systems and (...) clustering algorithms as technical support to carry out research. First, the traditional K-means algorithm is used to select the initial clustering center, to improve the noise and outlier processing capabilities, and to build a data mining system based on the improved algorithm. Then, a product design model for robo-advisors is built and the risks of robo-advisors are analyzed from three aspects: technology, market, and law. Analyzing the performance of the improved K-means algorithm, in the operation of the experimental dataset B, the accuracy of the clustering result after 6 iterations reached 97.08%, which shows that the algorithm has good performance. During the trial operation of the data mining system, the four types of customers of financial institutions were accurately clustered, and it was concluded that the main type of customers who brought benefits to financial institutions was high-income customers accounting for 10.75%. Robo-advisory product models are used to build five risk-level investment portfolios and conduct risk backtests. Except for the growth and income portfolio, other portfolios have consistently outperformed the performance benchmark during the analyzed time period. Running the research system of this paper in a financial institution, comparing the capital budget before and after the operation, found that the system can improve the accuracy of the budget and reduce the risk of the robo-advisor for the financial institution. (shrink)

International large-scale assessments, such as PISA, provide structured and static data. However, due to its extensive databases, several researchers place it as a reference in Big Data in Education. With the goal of exploring which factors at country, school and student level have a higher relevance in predicting student performance, this paper proposes an Educational Data Mining approach to detect and analyze factors linked to academic performance. To this end, we conducted a secondary data analysis and built decision trees (C4.5 (...) algorithm) to obtain a predictive model of school performance. Specifically, we selected as predictor variables a set of socioeconomic, process and outcome variables from PISA 2018 and other sources (World Bank, 2020). Since the unit of analysis were schools from all the countries included in PISA 2018 (n= 21,903), student and teacher predictor variables were imputed to the school database. Based on the available student performance scores in Reading, Math, and Science, we applied k-means clustering to obtain a categorized (three categories) target variable of global school performance. Results show the existence of two main branches in the decision tree, split according to the schools’ mean socioeconomic status (SES). While performance in high-SES schools is influenced by educational factors such as metacognitive strategies or achievement motivation, performance in low-SES schools is affected in greater measure by country-level socioeconomic indicators such as GDP, and individual educational indicators are relegated to a secondary level. Since these evidences are in line and delve into previous research, this work concludes by analyzing its potential contribution to support the decision making processes regarding educational policies. (shrink)

Comprehensive analysis of proteins to evaluate their genetic diversity, study their differences, and respond to the tensions is the main subject of an interdisciplinary field of study called proteomics. The main objective of the proteomics is to detect and quantify proteins and study their post-translational modifications and interactions using protein chemistry, bioinformatics, and biology. Any disturbance in proteins interactive network can act as a source for biological disorders and various diseases such as Alzheimer and cancer. Most current computational methods for (...) discovering protein complexes are usually based on specific topological characteristics of protein-protein networks. To identify the protein complexes, in this paper, we, first, present a new encoding method to represent solutions; we then propose a new clustering algorithm based on the genetic algorithm, named PPI-GA, employing a new multiobjective quality function. The proposed algorithm is evaluated on two gold standard and real-world datasets. The result achieved demonstrates that the proposed algorithm can detect important protein complexes, and it provides more accurate results compared with state-of-the-art protein complex identification algorithms. (shrink)

Abnormal behavior detection of social security funds is a method to analyze large-scale data and find abnormal behavior. Although many methods based on spectral clustering have achieved many good results in the practical application of clustering, the research on the spectral clustering algorithm is still in the early stage of development. Many existing algorithms are very sensitive to clustering parameters, especially scale parameters, and need to manually input the number of clustering. Therefore, a density-sensitive (...) similarity measure is introduced in this paper, which is obtained by introducing new parameters to transform the Gaussian function. Under this metric, the distance between data points belonging to different classes will be effectively amplified, while the distance between data points belonging to the same class will be reduced, and finally, the distribution of data will be effectively clustered. At the same time, the idea of Eigen gap is introduced into the spectral clustering algorithm, and the verified gap sequence is constructed on the basis of Laplace matrix, so as to solve the problem of the number of initial clustering. The strong global search ability of artificial bee colony algorithm is used to make up for the shortcoming of spectral clustering algorithm that is easy to fall into local optimal. The experimental results show that the adaptive spectral clustering algorithm can better identify the initial clustering center, perform more effective clustering, and detect abnormal behavior more accurately. (shrink)

With the continuous improvement of the level of science and technology, the popularization of the Internet and the development of applications, online consumption has become a major force in personal consumption. As a result, digital consumption is born, and digital consumption is not only reflected in transaction consumption at the monetary level. Like some intangible services similar to the use of dating software, it can also become digital consumption. In this environment, a new economic concept, the digital economy, has emerged (...) as the times require. The digital economy helps to achieve the rapid optimal allocation and regeneration of resources and achieve high-quality economic development. Therefore, as a new economic form, the digital economy has penetrated into all fields of human society. The Canopy algorithm is a fast clustering technique that requires only one pass through the data technology to get the results. But it is inaccurate for large-scale data clustering. Therefore, when analyzing the data, it is necessary to use the Canopy algorithm for preliminary clustering, and then combine with other algorithms or model software for refinement. This article introduces the development of the digital economy in the Internet era. It conducts a theoretical discussion on consumer psychology in the context of the digital economy. It introduces the basic calculation formula of the clustering algorithm and the algorithm flow of the Canopy clustering algorithm. It does model optimization for the Canopy clustering algorithm. On this basis, it designs questionnaires for experimental design. The indicators are divided into commodity attributes and consumer psychology. It builds a consumer psychology prediction model and tests the prediction results. The results show that the maximum difference between the prediction results of digital economy consumption psychology based on the Canopy clustering algorithm and the actual results is 0.047. It can be shown that the psychological prediction model of digital economy consumption based on the Canopy clustering algorithm has certain practicability. (shrink)

We developed an on-line intelligent argumentation system which facilitates stakeholders in exchanging dialogues. It provides decision support by capturing stakeholders’ rationale through arguments. As part of the argumentation process, stakeholders tend to both polarise their opinions and form polarisation groups. The challenging issue of assessing argumentation polarisation had not been addressed in argumentation systems until recently. Arvapally, Liu, and Jiang [, ‘Identification of Faction Groups and Leaders in Web-Based Intelligent Argumentation System for Collaborative Decision Support’, in Proceedings of International Conference (...) on Collaborative Technologies and Systems] earlier developed a method to identify polarisation groups. These groups, however, tend to overlap to a certain degree; each stakeholder may be a member of multiple polarisation groups to varied degrees. Quantifying stakeholders’ membership in multiple polarisation groups is an important issue in the argumentation for collaborative decision-making, which is not addressed earlier. We present a novel approach using fuzzy clustering algorithm to address this issue in this article. The method is evaluated using data sets produced from the discussions of 24 stakeholders. Experimental results indicate that our method is effective for both identifying polarisation groups and quantifying stakeholders’ degree of membership in each polarisation group. (shrink)

This article starts with the environmental changes in human cognition, analyzes the virtual as the main feature of visual perception under digital technology, and explores the transition from passive to active human cognitive activities. With the diversified understanding of visual information, human contradiction of memory also began to become prominent. Aiming at the problem that the existing multimodal TV media recognition methods have low recognition rate of unknown application layer protocols, an adaptive clustering method for identifying unknown application layer (...) protocols is proposed. This method clusters application layer protocols based on similarity of the load characteristics of network stream application layer protocol data. The method divides the similarity calculation in the clustering algorithm to improve the clustering efficiency of the algorithm. Experimental results show that the proposed method can efficiently and accurately recognize unknown visual communication. This article proposes that, in the interactive multimodal visual information transmission, human visual perception experience has changed, the diversity of visual information content expression makes the aesthetic subject more personalized and stylized. (shrink)

Data mining is a new technology developed in recent years. Through data mining, people can discover the valuable and potential knowledge hidden behind the data and provide strong support for scientifically making various business decisions. This paper applies data mining technology to the college student information management system, mines student evaluation information data, uses data mining technology to design student evaluation information modules, and digs out the factors that affect student development and the various relationships between these factors. Predictive assessment (...) of knowledge and personalized teaching decision-making provide the basis. First, the general situation of genetic algorithm and fuzzy genetic algorithm is introduced, and then, an improved genetic fuzzy clustering algorithm is proposed. Compared with traditional clustering algorithm and improved genetic fuzzy clustering algorithm, the effectiveness of the algorithm proposed in this paper is proved. Based on the analysis system development related tools and methods, in response to the needs of the student information management system, a simple student information management system is designed and implemented, which provides a platform and data source for the next application of clustering algorithm for performance analysis. Finally, clustering the students’ scores with a clustering algorithm based on fuzzy genetic algorithm, the experimental results show that this method can better analyze the students’ scores and help relevant teachers and departments make decisions. (shrink)

In order to improve the integrity of the social network behavior feature extraction results for sports college students, this study proposes to be based on the clustering algorithm. This study analyzes the social network information dissemination mechanism in the field of college students’ sports, obtains the real-time social behavior data in the network environment combined with the analysis results, and processes the obtained social network behavior data from two aspects of data cleaning and de-duplication. Using clustering (...) class='Hi'>algorithm to determine the type of social network user behavior, setting the characteristics of social network behavior attributes, and finally through quantitative and standardized processing, get the results of college students’ sports field social network behavior characteristics extraction. The experimental results showed that the completeness of the method feature extraction results improved to 9.93%, and the average extraction time cost was 0.344 s, with high result integrity and obvious advantages in the extraction speed. (shrink)

erative clustering. First, we show formally that the common heuristic agglomerative clustering algorithms – Ward’s method, single-link, complete-link, and a variant of group-average – are each equivalent to a hierarchical model-based method. This interpretation gives a theoretical explanation of the empirical behavior of these algorithms, as well as a principled approach to resolving practical issues, such as number of clusters or the choice of method. Second, we show how a model-based viewpoint can suggest variations on these basic agglomerative (...) algorithms. We introduce adjusted complete-link, Mahalanobis-link, and line-link as variants, and demonstrate their utility. (shrink)

This work is devoted to the testing, research and comparative analysis of the most well-known and widely used methods and algorithms for clustering numerical data sets. Multidimensional scaling was applied to evaluate the results of solving the clustering problem by visualizing datasets at all stages of the implementation of the studied algorithms. All algorithms were tested for artificial and real data sets. As a result, for each of the investigated algorithms, the main characteristics were formulated in the form (...) of their relative strengths and weaknesses. Based on the test results, conclusions and recommendations for using these algorithms are formulated. (shrink)