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)

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)

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)

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)

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)

Virtual screening is the most critical process in drug discovery, and it relies on machine learning to facilitate the screening process. It enables the discovery of molecules that bind to a specific protein to form a drug. Despite its benefits, virtual screening generates enormous data and suffers from drawbacks such as high dimensions and imbalance. This paper tackles data imbalance and aims to improve virtual screening accuracy, especially for a minority dataset. For a dataset identified without considering the data’s imbalanced (...) nature, most classification methods tend to have high predictive accuracy for the majority category. However, the accuracy was significantly poor for the minority category. The paper proposes a K-mean algorithm coupled with Synthetic Minority Oversampling Technique to overcome the problem of imbalanced datasets. The proposed algorithm is named as KSMOTE. Using KSMOTE, minority data can be identified at high accuracy and can be detected at high precision. A large set of experiments were implemented on Apache Spark using numeric PaDEL and fingerprint descriptors. The proposed solution was compared to both no-sampling method and SMOTE on the same datasets. Experimental results showed that the proposed solution outperformed other methods. (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)

This paper combines domestic and international research results to analyze and study the difference between the attribute features of English phrase speech and noise to enhance the short-time energy, which is used to improve the threshold judgment sensitivity; noise addition to the discrepancy data set is used to enhance the recognition robustness. The backpropagation algorithm is improved to constrain the range of weight variation, avoid oscillation phenomenon, and shorten the training time. In the real English phrase sound recognition system, (...) there are problems such as massive training data and low training efficiency caused by the super large-scale model parameters of the convolutional neural network. To address these problems, the NWBP algorithm is based on the oscillation phenomenon that tends to occur when searching for the minimum error value in the late training period of the network parameters, using the K-MEANS algorithm to obtain the seed nodes that approach the minimal error value, and using the boundary value rule to reduce the range of weight change to reduce the oscillation phenomenon so that the network error converges as soon as possible and improve the training efficiency. Through simulation experiments, the NWBP algorithm improves the degree of fitting and convergence speed in the training of complex convolutional neural networks compared with other algorithms, reduces the redundant computation, and shortens the training time to a certain extent, and the algorithm has the advantage of accelerating the convergence of the network compared with simple networks. The word tree constraint and its efficient storage structure are introduced, which improves the storage efficiency of the word tree constraint and the retrieval efficiency in the English phrase recognition search. (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)

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)

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)

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)

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)

There are many real-world applications like healthcare systems, job monitoring, well-being and personal fitness tracking, monitoring of elderly and frail people, assessment of rehabilitation and follow-up treatments, affording Fall Detection (FD) and ADL (Activity of Daily Living) identification, separately or even at a time. However, the two main drawbacks of these solutions are that most of the times, the devices deployed are obtrusive (devices worn on not quite common parts of the body like neck, waist and ankle) and the poor (...) battery life. Thus, this work proposes a low-power classification algorithm based on an Ensemble of KNN and K-Means algorithms (EKMeans) to identify Falls and High-Intensity ADL events such as running, jogging and climbing up stairs. The input of EKMeans are triaxial accelerometer data gathered from wrist-wearable devices. The proposal will be validated on the Fall&ADL publicly available datasets UMAFall, UCIFall and FallAllD, considering two kinds of activity labelling: Two-Class and Multi-Class. An exhaustive comparative study between our proposal, and the baseline algorithms KNN and a feed-forward Neural Network (NN) is deployed, where EKMeans outperformed clearly the Specificity (ADL classification) of the KNN and NN for the three datasets. Finally, a comparative battery consumption study has been included deploying the analyzed algorithms in a WearOS smartwatch, where EKMeans drains the battery from 100% to 0% in 27.45 hours, saving 5% and 21% concerning KNN and NN, respectively. Keywords: Human Activity Recognition, ADL Identification, Fall Detection TS Clustering, TS Classification, Wearable Devices, Low-Power HAR. (shrink)

The objective of this work is to categorize the available fly ashes in different parts of the world into distinct groups based on its compositional attributes. Kohonen's self-organizing feature map and radial basis function networks are applied in a cascading fashion for the classification of fly ashes in terms of its chemical parameters. The basic procedure of the methodology consists of three stages: apply self-organizing neural net to ascertain possible number of groups, delineate them and identify the group sensitive attributes; (...) find mean values of sensitive attributes of the elicited groups and augment them as start-up prototypes in k-means algorithm and find the refined centroids of these groups; incorporate the centroids in a two layer radial basis function network and fine-tune the delineated groups and develop an indexing equation using the weights of the stabilized network. Further, to demonstrate the utility of this classification scheme, the so formed groups were correlated with their performance in High Volume Fly Ash Concrete System [HVFAC]. The categorization was found to be excellent and compares well with Canadian Standard Association's [CSA A 3000] classification scheme. (shrink)

Image segmentation in land cover regions which are overlapping in satellite imagery, is one crucial challenge. To detect true belonging of one pixel becomes a challenging problem while classifying mixed pixels in overlapping regions. In current work, we propose one new approach for image segmentation using a hybrid algorithm of K-Means and Cellular Automata algorithms. This newly implemented unsupervised model can detect cluster groups using hybrid 2-Dimensional Cellular-Automata model based on K-Means segmentation approach. This approach detects different (...) land use land cover areas in satellite imagery by existing K-Means algorithm. Since it is a discrete dynamical system, cellular automaton realizes uniform interconnecting cells containing states. In the second stage of current model, we experiment with a 2-dimensional cellular automata to rank allocations of pixels among different land-cover regions. The method is experimented on the watershed area of Ajoy river (India) and Salinas (California) data set with true class labels using two internal and four external validity indices. The segmented areas are then compared with existing FCM, DBSCAN and K-Means methods and verified with the ground truth. The statistical analysis results also show the superiority of the new method. (shrink)

The efficient processing of large-scale data has very important practical value. In this study, a data mining platform based on Hadoop distributed file system was designed, and then K-means algorithm was improved with the idea of max-min distance. On Hadoop distributed file system platform, the parallelization was realized by MapReduce. Finally, the data processing effect of the algorithm was analyzed with Iris data set. The results showed that the parallel algorithm divided more correct samples than the (...) traditional algorithm; in the single-machine environment, the parallel algorithm ran longer; in the face of large data sets, the traditional algorithm had insufficient memory, but the parallel algorithm completed the calculation task; the acceleration ratio of the parallel algorithm was raised with the expansion of cluster size and data set size, showing a good parallel effect. The experimental results verifies the reliability of parallel algorithm in big data processing, which makes some contributions to further improve the efficiency of data mining. (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 order to correct the deficiencies of intrusion detection technology, the entire computer and network security system are needed to be more perfect. This work proposes an improved k-means algorithm and an improved Apriori algorithm applied in data mining technology to detect network intrusion and security maintenance. The classical KDDCUP99 dataset has been utilized in this work for performing the experimentation with the improved algorithms. The algorithm’s detection rate and false alarm rate are compared with the (...) experimental data before the improvement. The outcomes of proposed algorithms are analyzed in terms of various simulation parameters like average time, false alarm rate, absolute error as well as accuracy value. The results show that the improved algorithm advances the detection efficiency and accuracy using the designed detection model. The improved and tested detection model is then applied to a new intrusion detection system. After intrusion detection experiments, the experimental results show that the proposed system improves detection accuracy and reduces the false alarm rate. A significant improvement of 90.57% can be seen in detecting new attack type intrusion detection using the proposed algorithm. (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)

In this paper, to solve the problem of slow design of arts and crafts and to improve design efficiency and aesthetics, the existing big data and 3D technology are used to conduct an in-depth analysis of the optimization of the rapid design system of arts and crafts machine salt baking. In the system requirement analysis, the functional modules of this system are identified as nine functional modules such as design terminology management system and external information import function according to the (...) actual usage requirements. In the system design, the overall structure design, database design, and functional module design of the system are comprehensively elaborated, and the key issues such as 3D display and home layout generation algorithm based on reinforcement learning are analyzed and designed. In the implementation part of the system, the overall construction of the system and the composition of functional modules are introduced in detail and the main functional modules of the system are presented with interface diagrams. In the system implementation part, the overall system construction and functional module composition are introduced in detail, the main functional modules of the system are shown with interface diagrams, codes, and algorithms, and the specific implementation process of 3D display and soft layout algorithms are also explained in detail. The process of Surface Mount Technology big data processing and analysis is designed, and the design of SMT production line data collection scheme and real-time data processing architecture is completed. Based on the characteristics of SMT production line data, the K-means algorithm is used to detect data outliers and verify the accuracy of the method; also, the Spark-based association rule printing parameter recommendation model is designed, and the efficiency of the Apriori algorithm is significantly improved by parallelization. (shrink)

In order to analyze the characteristics of airport flight delayed time series, based on the construction of flight delay time series, firstly, the K-means algorithm is used to cluster the time series of delayed departures. Secondly, combining with R/s analysis method of Fractal theory, Hurst index of the series is calculated, and Fractal characteristics of the series are analyzed. Then, the VAR (Vector Auto Regression) model is constructed, and Impulse Response Function (IRF) and Variance Decomposition are conducted to (...) explore the impact of the fluctuation of flight delay time series on the future delay. The results show that K-means algorithm divides the time series into five categories, and each category has significant characteristics. Hurst index values of different time series are in the interval of (0.5, 1), indicating that the time series have good fractal characteristics. Through the IRF and Variance Decomposition of VAR model, results show that the time series are significantly affected by random pulses, and the prediction changes of the series come from multiple time series fluctuations. The prediction results show that the flight delay time series is predictable. (shrink)

For the safe and economical construction of embankment dams, the mechanical behaviour of the rockfill materials used in the dam’s shell must be analyzed. The characterization of rockfill materials with specified shear strength is difficult and expensive due to the presence of particles greater than 500 mm in diameter. This work investigates the feasibility of using an extreme gradient boosting computing paradigm to estimate the shear strength of rockfill materials. To train and validate the proposed XGBoost model, a total of (...) 165 databases obtained from the literature are chosen. The XGBoost model was compared against support vector machine, adaptive boosting, random forest, and K-nearest neighbor models described in the literature. XGBoost beats SVM, RF, AdaBoost, and KNN models in terms of performance evaluation metrics such as coefficient of determination, Nash–Sutcliffe coefficient, and error in the root mean square ratio to the standard deviation of the measured data. The results demonstrated that the XGBoost model has the highest prediction performance with, followed by the SVM model with, RF, the AdaBoost model with and the KNN model with. A sensitivity analysis has been conducted to ascertain the impact of each investigated input parameter. This study demonstrates that the established XGBoost model for estimating the shear strength of rockfill materials is reliable. (shrink)

The following paper offers a political and philosophical reading of ethically informed technological design practices to critically tackle the implicit regulative ideal in the design of social media as a means to digitally represent the liberal public sphere. The paper proposes that, when it comes to the case of social media platforms, understood along with the machine learning algorithms embedded in them as algorithmic technologies, ethically informed design has an implicit conception of democracy that parallels that of Jürgen Habermas’ (...) procedural democracy (Habermas, J. (1994). THREE NORMATIVE MODELS OF DEMOCRACY. Jurgen Habermas, 1(1).). That is, that democratic practices are encodable as procedures that produce valid discussion forums. Opposed to this, this paper suggests a turn to philosopher Jacques Rancière’s conception of politics as a guiding attitude towards technological design. This is done by, on the one side, using Rancière’s notions of “disagreement” and “distribution of the sensible” as the political starting point for the practice of design of algorithmic technologies. And, on the other, inspired by Karen Barad’s theories on agential realism (Barad, K. (2003). Posthumanist Performativity: Toward an Understanding of How Matter Comes to Matter. Signs: Journal of Women in Culture and Society, 28(3), 801–831. https://doi.org/10.1086/345321), by putting forward a political ontology of algorithmic technologies that reconceptualizes them in terms of how they assemble open-ended practices between human bodies and technological devices. (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)

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)

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)

. This paper illustrates the applications of various ensemble methods for enhanced classification accuracy. The case in point is the Pima Indian Diabetic Dataset. The computational model comprises of two stages. In the first stage, k-means clustering is employed to identify and eliminate wrongly classified instances. In the second stage, a fine tuning in the classification was effected. To do this, ensemble methods such as AdaBoost, bagging, dagging, stacking, decorate, rotation forest, random subspace, MultiBoost and grading were invoked along (...) with five chosen base classifiers, namely support vector machine, radial basis function network, decision tree J48, naïve Bayes and Bayesian network. The k-fold cross validation technique is adopted. Computational experiments with the proposed method showed an improvement of 16.14% to 22.49% in the classification accuracy compared to literature survey. Among the ensemble methods tried, MultiBoost ensemble with SVM classifier and grading ensemble with naïve Bayes showed the best performance followed by MultiBoost, stacking and grading ensemble with Bayesian classifier, rotation forest ensemble with RBF and grading and rotation forest ensemble with J48. This investigation conclusively proves the significance of cascading k-means clustering with ensemble methods in the enhanced accuracy in categorization of diabetic dataset. (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)

A large number of cross-references to various bodies of text are used in legal texts, each serving a different purpose. It is often necessary for authorities and companies to look into certain types of these citations. Yet, there is a lack of automatic tools to aid in this process. Recently, citation graphs have been used to improve the intelligibility of complex rule frameworks. We propose an algorithm that builds the citation graph from a document and automatically labels each edge (...) according to its purpose. Our method uses the citing text only and thus works only on citations who’s purpose can be uniquely identified by their surrounding text. This framework is then applied to the US code. This paper includes defining and evaluating a standard gold set of labels that cover a vast majority of citation types which appear in the “US Code” but are still short enough for practical use. We also proposed a novel linear-chain conditional random field model that extracts the features required for labeling the citations from the surrounding text. We then analyzed the effectiveness of different clustering methods such as K-means and support vector machine to automatically label each citation with the corresponding label. Besides this, we talk about the practical difficulties of this task and give a comparison of human accuracy compared to our end-to-end algorithm. (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)

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)

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)

Precision agriculture is a breakthrough in digital farming technology, which facilitates the application of precise and exact amount of input level of water and fertilizer to the crop at the required time for increasing the yield. Since agriculture relies on direct rainfall than irrigation and the prediction of rainfall date is easily available from web source, the integration of rainfall prediction with precision agriculture helps to regulate the water consumption in farms. In this work, an edge computing model is developed (...) for predicting soil moisture in real time and managing the water usage in accordance with rain prediction. A soil moisture prediction hybrid algorithm has been developed that revolves around the decision-making techniques with live environmental parameters including weather parameters for the prediction of soil moisture through the impact of precipitation. Numerous algorithms with the combination of regression + clustering are estimated, and it is inferred that XGBoost + k-means outperforms other algorithmic combinations that is deployed in edge model. This model is used as an intermediary between the end IoT devices and cloud that results in the saving of computationally intensive processing performed on cloud servers. The servers located on a local edge network perform the developed algorithmic computations. Avoiding transmission over the cloud results in significant latency, response time, and computation power savings and therefore increases the efficiency of data transfer. The proposed edge computing model is implemented in Raspberry Pi as an edge, Heroku as cloud, and edge nodes as the combination of Pi with actuators and sensors. The monitored data from Pi are stored in MongoDB webserver that is controlled by Web dashboard. Finally, the developed model is implemented in cloud and edge where the edge server implementation performs better in terms of latency, bandwidth, throughput, response time, and CPU memory usage. (shrink)

With the development of technology, news media and film and television media are spreading faster and faster, and at the same time, the spread of rumors is also accelerated. This article briefly describes the application of artificial intelligence in news media and film and television media using a back-propagation neural network algorithm to reform refutation of rumors in news media and film and television media, and compared it with K-means and support vector machine algorithms in simulation experiments. The (...) results showed that the BPNN-based rumor recognition model had better recognition performance and shorter recognition time; it was more accurate in recognizing Weibo texts that were complete and faster in recognizing bullet screen comments that were short; the BPNN-based rumor recognition model also had the lowest false detection cost and performed stably when being used in actual Weibo platform and bullet screen video website. (shrink)

With the continuous development of the era of big data, community management plays an important role in people’s mental health. Improve people’s mental health through the use of big data to improve governance of the community. To solve the problem, sequence segmentation is used in feature extraction, histogram absolute difference calculation and K-means intelligent algorithm, to analyze the existing problems one by one. Research shows that it is possible to systematically govern the community through big data and intelligent (...) computing, so that community residents can live a higher quality of life. In order to get rid of psychological problems, it can be solved by establishing special psychological support institutions in the community and strengthening the role of the government in community management. With the continuous development of big data, the application of big data and intelligence in community governance and mental health community is a trend. With the continuous progress of society, it also brings pressure to people, which leads to the decline of people’s mental health quality. We need to do something to improve community governance and people’s mental health. (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)

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)

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)

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)

Based on cloud computing and statistics theory, this paper proposes a reasonable analysis method for big data of film and television. The method selects Hadoop open source cloud platform as the basis, combines the MapReduce distributed programming model and HDFS distributed file storage system and other key cloud computing technologies. In order to cope with different data processing needs of film and television industry, association analysis, cluster analysis, factor analysis, and K-mean + association analysis algorithm training model were applied (...) to model, process, and analyze the full data of film and TV series. According to the film type, producer, production region, investment, box office, audience rating, network score, audience group, and other factors, the film and television data in recent years are analyzed and studied. Based on the study of the impact of each attribute of film and television drama on film box office and TV audience rating, it is committed to the prediction of film and television industry and constantly verifies and improves the algorithm model. (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)

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)