Search

Big data pertains to extensive and intricate compilations of information that necessitate the implementation of proficient and cost-effective evaluation and analysis tools to derive insights and support decision making. The Fermatean fuzzy set theory possesses remarkable capability in capturing imprecision due to its capacity to accommodate complex and ambiguous problem descriptions. This paper presents the study of the concepts of dynamic ordered weighted aggregation operators in the context of Fermatean fuzzy environment. In numerous practical decision making scenarios, the term "dynamic" frequently denotes the capability of obtaining decision-relevant data at various time intervals. In this study, we introduce two novel aggregation operators: Fermatean fuzzy dynamic ordered weighted averaging and geometric operators. We investigate the attributes of these operators in detail, offering a comprehensive description of their salient features. We present a step-by-step mathematical algorithm for decision making scenarios in the context of proposed methodologies. In addition, we highlight the significance of these approaches by presenting the solution to the decision making problem and determining the most effective big data analytics platform for YouTube data analysis. Finally, we perform a thorough comparative analysis to assess the effectiveness of the suggested approaches in comparison to a variety of existing techniques., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Alghazzawi et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

With the rapid development of sensor technology, structural health monitoring data have tended to become more massive. Deep learning has advantages when handling big data, and has therefore been widely researched for diagnosing structural anomalies. However, for the diagnosis of different structural abnormalities, the model hyperparameters need to be adjusted according to different application scenarios, which is a complicated process. In this paper, a new strategy for building and optimizing 1D-CNN models is proposed that is suitable for diagnosing damage to different types of structure. This strategy involves optimizing hyperparameters with the Bayesian algorithm and improving model recognition accuracy using data fusion technology. Under the condition of sparse sensor measurement points, the entire structure is monitored, and the high-precision diagnosis of structural damage is performed. This method improves the applicability of the model to different structure detection scenarios, and avoids the shortcomings of traditional hyperparameter adjustment methods based on experience and subjectivity. In preliminary research on the simply supported beam test case, the efficient and accurate identification of parameter changes in small local elements was achieved. Furthermore, publicly available structural datasets were utilized to verify the robustness of the method, and a high identification accuracy rate of 99.85% was achieved. Compared with other methods described in the literature, this strategy shows significant advantages in terms of sensor occupancy rate, computational cost, and identification accuracy.

Traditionally, cyber-attack detection relies on reactive, assistive techniques, where pattern-matching algorithms help human experts to scan system logs and network traffic for known virus or malware signatures. Recent research has introduced effective Machine Learning (ML) models for cyber-attack detection, promising to automate the task of detecting, tracking and blocking malware and intruders. Much less effort has been devoted to cyber-attack prediction, especially beyond the short-term time scale of hours and days. Approaches that can forecast attacks likely to happen in the longer term are desirable, as this gives defenders more time to develop and share defensive actions and tools. Today, long-term predictions of attack waves are mostly based on the subjective perceptiveness of experienced human experts, which can be impaired by the scarcity of cyber-security expertise. This paper introduces a novel ML-based approach that leverages unstructured big data and logs to forecast the trend of cyber-attacks at a large scale, years in advance. To this end, we put forward a framework that utilises a monthly dataset of major cyber incidents in 36 countries over the past 11 years, with new features extracted from three major categories of big data sources, namely the scientific research literature, news, blogs, and tweets. Our framework not only identifies future attack trends in an automated fashion, but also generates a threat cycle that drills down into five key phases that constitute the life cycle of all 42 known cyber threats., (© 2023. Crown.)

This paper studies the flexible large-scale supplier selection and order allocation problem with various quantity discounts, i.e., no discount, all-unit discount, incremental discount, and carload discount. It fills a literature gap that models usually formulate one or seldom two types because of the modeling and solution difficulty. All suppliers offering the same discount are far from reality, especially when the number of suppliers is large. The proposed model is a variant of the NP-hard knapsack problem. The greedy algorithm, which solves the fractional knapsack problem optimally, is applied to cope with the challenge. Three greedy algorithms are developed using a problem property and two sorted lists. Simulations show the average optimality gaps are 0.1026%, 0.0547%, and 0.0234% and the model can be solved in centiseconds, densiseconds, and seconds for supplier numbers 1000, 10000, and 100000. This allows the full use of data in the big data era., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Qing Wang. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Smart indoor living advances in the recent decade, such as home indoor localization and positioning, has seen a significant need for low-cost localization systems based on freely available resources such as Received Signal Strength Indicator by the dense deployment of Wireless Local Area Networks (WLAN). The off-the-shelf user equipment (UE's) available at an affordable price across the globe are well equipped with the functionality to scan the radio access network for hearable single strength; in complex indoor environments, multiple signals can be received at a particular reference point with no consideration of the height of the transmitter and possible broadcasting coverage. Most effective fingerprinting algorithm solutions require specialized labor, are time-consuming to carry out site surveys, training of the data, big data analysis, and in most cases, additional hardware requirements relatively increase energy consumption and cost, not forgetting that in case of changes in the indoor environment will highly affect the fingerprint due to interferences. This paper experimentally evaluates and proposes a novel technique for Received Signal Indicator (RSSI) distance prediction, leveraging transceiver height, and Fresnel ranging in a complex indoor environment to better suit the path loss of RSSI at a particular Reference Point (RP) and time, which further contributes greatly to indoor localization. The experimentation in different complex indoor environments of the corridor and office lab during work hours to ascertain real-life and time feasibility shows that the technique's accuracy is greatly improved in the office room and the corridor, achieving lower average prediction errors at low-cost than the comparison prediction algorithms. Compared with the conventional prediction techniques, for example, with Access Point 1 (AP1), the proposed Height Dependence Path-Loss (HEM) model at 0 dBm error attains a confidence probability of 10.98%, higher than the 2.65% for the distance dependence of Path-Loss New Empirical Model (NEM), 4.2% for the Multi-Wall dependence on Path-Loss (MWM) model, and 0% for the Conventional one-slope Path-Loss (OSM) model, respectively. Online localization, amongst the hearable APs, it is seen the proposed HEM fingerprint localization based on the proposed HEM prediction model attains a confidence probability of 31% at 3 m, 55% at 6 m, 78% at 9 m, outperforming the NEM with 26%, 43%, 62%, 62%, the MWM with 23%, 43%, 66%, respectively. The robustness of the HEM fingerprint using diverse predicted test samples by the NEM and MWM models indicates better localization of 13% than comparison fingerprints.

Chinese traditional culture is the treasure of our cultural field. In the new era, it is of great significance to give traditional culture a new life and vitality. The term "big data" is hotly debated all over the world, while the development of big data is gradually occupying all aspects of the society that people are compatible with society. It is an imperative initiative to build a cultural data system by making use of big data technology, and cultural big data can make Chinese traditional culture release more vitality. This paper analyzes the new characteristics of traditional culture development from big data in helping traditional culture inheritance and innovation and proposes new ideas and creates more possibilities for the development of traditional culture. Combining with big data technology, this paper proposes an improvement to the data sparsity problem and cold-start problem of collaborative filtering recommendation algorithm and also improves the recommendation algorithm based on association rules. The association rule technique is used to compensate for the cold-start and data sparsity problems of new users often encountered by collaborative filtering techniques; the aim is to obtain recommendation results with high user satisfaction. Experiments on traditional cultural resource datasets show that the method in this paper effectively solves the data sparsity and cold-start problems that exist in traditional collaborative filtering techniques, and the recommendation accuracy surpasses that of other methods., Competing Interests: The author declares that they have no conflicts of interest., (Copyright © 2022 Zhixian Li.)

Traditional science and technology literature search mainly provides users with reliable and detailed information materials and services through technical means, data resources, and service strategies. With the development of network technology, computer technology, and information technology, digital information resources are increasing day by day, which continuously impact the traditional knowledge service mode. Some traditional technical methods and service means can no longer meet the information needs of users under large data sets. This paper proposes a model of large-scale literature search service in the context of big data by studying the technical means and service modes used for scientific and technical literature search in universities in the era of big data. Specifically, this paper proposes a method for fast literature retrieval by combining R-tree indexing for the characteristics of diverse data types and large data volume of science and technology literature. The method uses an improved k-mean clustering algorithm to construct an R-tree clustering model and improve the retrieval efficiency of the system by retrieving scientific and technical literature data through R-tree indexing. Experiments on university science and technology literature datasets show that the method in this paper improves both efficiency and precision when searching literature., Competing Interests: The author declares that there are no conflicts of interest., (Copyright © 2022 Chen Zhang.)

SI is a relatively recent technology that was inspired by observations of natural social insects and artificial systems. This system comprises multiple individual agents who rely on collective behavior in decentralized and self-organized networks. One of the biggest difficulties for existing computer techniques is learning from such large datasets, which is addressed utilizing big data. Big data-based categorization refers to the challenge of determining which set of classifications a new discovery belongs to. This classification is based on a training set of data that comprises observations that have been assigned to a certain category. In this paper, CIN-big data value calculation based on particle swarm optimization (BD-PSO) algorithm is proposed by operating in local optima and to improve the operating efficiency. The convergence speed of the particle swarm optimization (PSO), which operates in the local optima, is improved by big data-based particle swarm optimization (BD-PSO). It improves computing efficiency by improving the method, resulting in a reduction in calculation time. The performance of the BD-PSO is tested on four benchmark dataset, which is taken from the UCI. The datasets used for evaluation are wine, iris, blood transfusion, and zoo. SVM and CG-CNB are the two existing methods used for the comparison of BD-PSO. It achieves 92% of accuracy, 92% of precision, 92% of recall, and 1.34 of F1 measure, and time taken for execution is 149 ms, which in turn outperforms the existing approaches. It achieves robust solutions and identifies appropriate intelligent technique related to the optimization problem., Competing Interests: The authors declare that there are no conflicts of interest with any financial organizations regarding the material reported in this manuscript., (Copyright © 2022 Wensheng Ma and Xilin Hou.)

With the advent of the Internet and the era of big data, education is increasingly dependent on data resources to support product and business innovation, and the lack of data resources has severely limited the areas involved. As a general information filtering method, personalized recommendation systems analyze the historical interaction data between users and items to build user interest models in an environment of "information overload", allowing users to discover and recommend information that interests them. However, the explosive growth of information in the network makes users wander in the sea of information, and it is increasingly difficult to find the information they really need, i.e., information overload. This has given rise to personalized recommendation systems, which currently have more mature applications in industries such as e-commerce, music services, and movie services. To this end, this paper studies and implements a customized educational resource recommendation system that can handle big data. The results show that the values of different similarity calculations all fluctuate with the gradual increase of the number of nearest neighbors, and the algorithm in this paper is maximum at the number of neighbors around 60; then, it is inferred that applying the calculation method to the recommendation algorithm will improve the recommendation accuracy. Therefore, education uses the concept of big data to process the huge amount of education data and find some correlations and laws in education, so as to realize "teaching according to the material, teaching according to the material"., Competing Interests: The authors declare that they have no conflicts of interest., (Copyright © 2022 Rong Fu et al.)

In the era of big data, text as an information reserve database is very important, in all walks of life. From humanities research to government decision-making, from precision medicine to quantitative finance, from customer management to marketing, massive text, as one of the most important information carriers, plays an important role everywhere. The text data generated in these practical problems of humanities research, financial industry, marketing, and other fields often has obvious domain characteristics, often containing the professional vocabulary and unique language patterns in these fields and often accompanied by a variety of "noise." Dealing with such texts is a great challenge for the current technical conditions, especially for Chinese texts. A clustering algorithm provides a better solution for text big data information processing. Clustering algorithm is the main body of cluster analysis, K-means algorithm with its implementation principle is simple, low time complexity is widely used in the field of cluster analysis, but its K value needs to be preset, initial clustering center random selection into local optimal solution, other clustering algorithm, such as mean drift clustering, K-means clustering in mining text big data. In view of the problems of the above algorithm, this paper first extracts and analyzes the text big data and then does experiments with the clustering algorithm. Experimental conclusion: by analyzing large-scale text data limited to large-scale and simple data set, the traditional K-means algorithm has low efficiency and reduced accuracy, and the K-means algorithm is susceptible to the influence of initial center and abnormal data. According to the above problems, the K-means cluster analysis algorithm for data sets with large data volumes is analyzed and improved to improve its execution efficiency and accuracy on data sets with large data volume set. Mean shift clustering can be regarded as making many random centers move towards the direction of maximum density gradually, that is, moving their mean centroid continuously according to the probability density of data and finally obtaining multiple maximum density centers. It can also be said that mean shift clustering is a kernel density estimation algorithm., Competing Interests: The author declares no conflicts of interest regarding this work., (Copyright © 2022 Zi Li Chen.)

A crucial step in improving data quality is to discover semantic relationships between data. Functional dependencies are rules that describe semantic relationships between data in relational databases and have been applied to improve data quality recently. However, traditional functional discovery algorithms applied to distributed data may lead to errors and the inability to scale to large-scale data. To solve the above problems, we propose a novel distributed functional dependency discovery algorithm based on Apache Spark, which can effectively discover functional dependencies in large-scale data. The basic idea is to use data redistribution to discover functional dependencies in parallel on multiple nodes. In this algorithm, we take a sampling approach to quickly remove invalid functional dependencies and propose a greedy-based task assignment strategy to balance the load. In addition, the prefix tree is used to store intermediate computation results during the validation process to avoid repeated computation of equivalence classes. Experimental results on real and synthetic datasets show that the proposed algorithm in this paper is more efficient than existing methods while ensuring accuracy.

Big streaming data environment concerns a complicated scenario where data to be processed continuously flow into a processing unit and certainly cause a memory overflow problem. This obstructs the adaptation of deploying all existing classic sorting algorithms because the data to be sorted must be entirely stored inside the fixed-size storage including the space in internal and external storage devices. Generally, it is always assumed that the size of each data chunk is not larger than the size of storage (M) but in fact the size of the entire stream (n) is usually much larger than M. In this paper, a new fast continuous streaming sorting is proposed to cope with the constraint of storage overflow. The algorithm was tested with various real data sets consisting of 10,000 to 17,000,000 numbers and different storage sizes ranging from 0.01n to 0.50n. It was found that the feasible lower bound of storage size is 0.35n with 100% sorting accuracy. The sorting time outperforms bubble sort, quick sort, insertion sort, and merge sort when data size is greater than 1,000,000 numbers. Remarkably, the sorting time of the proposed algorithm is 1,452 times less than the sorting time of external merge sort and 28.1767 times less than the sorting time of streaming data sort. The time complexity of proposed algorithm is O(n) while the space complexity is O(M)., Competing Interests: The authors have declared that no competing interests exist.

Representation learning with small labeled data have emerged in many problems, since the success of deep neural networks often relies on the availability of a huge amount of labeled data that is expensive to collect. To address it, many efforts have been made on training sophisticated models with few labeled data in an unsupervised and semi-supervised fashion. In this paper, we will review the recent progresses on these two major categories of methods. A wide spectrum of models will be categorized in a big picture, where we will show how they interplay with each other to motivate explorations of new ideas. We will review the principles of learning the transformation equivariant, disentangled, self-supervised and semi-supervised representations, all of which underpin the foundation of recent progresses. Many implementations of unsupervised and semi-supervised generative models have been developed on the basis of these criteria, greatly expanding the territory of existing autoencoders, generative adversarial nets (GANs) and other deep networks by exploring the distribution of unlabeled data for more powerful representations. We will discuss emerging topics by revealing the intrinsic connections between unsupervised and semi-supervised learning, and propose in future directions to bridge the algorithmic and theoretical gap between transformation equivariance for unsupervised learning and supervised invariance for supervised learning, and unify unsupervised pretraining and supervised finetuning. We will also provide a broader outlook of future directions to unify transformation and instance equivariances for representation learning, connect unsupervised and semi-supervised augmentations, and explore the role of the self-supervised regularization for many learning problems.

Medical data processing is exponentially increasing day by day due to the frequent demand for many applications. Healthcare data is one such field, which is dynamically growing day by day. In today's scenario, an enormous amount of sensing devices and data collection units have been employed to generate and collect medical data all over the world. These healthcare devices will result in big real-time data streams. Hence, healthcare-based big data analytics and monitoring have gained hawk-eye importance but needs improvisation. Recently, machine and deep learning algorithms have gained importance to analyze huge amounts of medical data, extract the information, and even predict the future insights of diseases and also cope with the huge volume of data. But applying the learning models to handle big/medical data streams remains to be a challenge among the researchers. This paper proposes the novel deep learning electronic record search engine algorithm (ERSEA) along with firefly optimized long short-term memory (LSTM) model for better data analytics and monitoring. The experimentations have been carried out using Apache Spark using the different medical respiratory data. Finally, the proposed framework results are contrasted with existing models. It shows the accuracy, sensitivity, and specificity like 94%, 93.5%, and 94% for less than 5 GB dataset, and also, more than 5 GB it provides 94%, 92%, and 93% to prove the extraordinary performance of the proposed framework., Competing Interests: The authors declare no conflicts of interest., (Copyright © 2022 M. Thilagaraj et al.)

Achieving community immunity against the coronavirus disease 2019 (COVID-19) depends on vaccinating the largest number of people within a specific period while taking all precautionary measures. To address this problem, this paper presents a smart parking system that will help the health crisis management committee to vaccinate the largest number of people with the minimum period of time while ensuring that all precautionary measures are followed, through a set of algorithms. These algorithms seek to ensure a uniform distribution of persons in parking. This paper proposes a novel complex system for smart parking and nine algorithms to address the NP-hard problem. The experimental results demonstrate the performance of the proposed algorithms in terms of gap and time. Applying these algorithms to smart cities to ensure precautionary measures against COVID-19 can help fight against this pandemic. [ABSTRACT FROM AUTHOR]

With the continuous development of social economy, education has received more and more attention. As an important part of higher education, it has been profoundly influenced by the era of data in recent years. In order to evaluate the impact of big data on higher education management, this paper introduced a time-varying lens algorithm (TLA) to analyze the business needs of teachers and education management by sorting out the business processes of education management, education thinking, and education practice. Through learning and mining the corresponding technology, improve the corresponding educational ability, and use big data to assist the management of higher education. The simulation results show that the time-varying clustering sampling algorithm is effective., Competing Interests: The authors declare that there are no conflicts of interest., (Copyright © 2021 Chen Liu and Boxuan Song.)

Traditional audit data analysis algorithms have many shortcomings, such as the lack of means to mine the hidden audit clues behind the data, the difficulty of finding increasingly hidden cheating techniques caused by the electronic and networked environment, and the inability to solve the quality defects of the audited data. Correlation analysis algorithm in data mining technology is an effective means to obtain knowledge from massive data, which can complete, muffle, clean, and reduce defective data and then can analyze massive data and obtain audit trails under the guidance of expert experience or analysts. Therefore, on the basis of summarizing and analyzing previous research works, this paper expounds the research status and significance of audit data analysis and application; elaborates the development background, current status, and future challenges of correlation analysis algorithm; introduces the methods and principles of data model and its conversion and audit model construction; conducts audit data collection and cleaning; implements audit data preprocessing and its algorithm description; performs audit data analysis based on correlation analysis algorithm; analyzes the hidden node activation value and audit rule extraction in correlation analysis algorithm; proposes the application of audit data based on correlation analysis algorithm; discusses the relationship between audit data quality and audit risk; and finally compares different data mining algorithms in audit data analysis. The findings demonstrate that by analyzing association rules, the correlation analysis algorithm can determine the significance of a huge quantity of audit data and characterise the degree to which linked events would occur concurrently or sequentially in a probabilistic manner. The correlation analysis algorithm first inputs the collected audit data through preprocessing module to filter out useless data and then organizes the obtained data into a format that can be recognized by data mining algorithm and executes the correlation analysis algorithm on the sorted data; finally, the obtained hidden data is divided into normal data and suspicious data by comparing it with the pattern in the rule base. The algorithm can conduct in-depth analysis and research on the company's accounting vouchers, account books, and a large number of financial accounting data and other data of various natures in the company's accounting vouchers; reveal its original characteristics and internal connections; and turn it into an audit. People need more direct and useful information. The study results of this paper provide a reference for further researches on audit data analysis and application based on correlation analysis algorithm., Competing Interests: The authors declare that they have no conflicts of interest., (Copyright © 2021 Jifan Chen and Muhammad Talha.)

Fault detection and diagnosis (FDD) has received considerable attention with the advent of big data. Many data-driven FDD procedures have been proposed, but most of them may not be accurate when data missing occurs. Therefore, this paper proposes an improved random forest (RF) based on decision paths, named DPRF, utilizing correction coefficients to compensate for the influence of incomplete data. In this DPRF model, intact training samples are firstly used to grow all the decision trees in the RF. Then, for each test sample that possibly contains missing values, the decision paths and the corresponding nodes importance scores are obtained, so that for each tree in the RF, the reliability score for the sample can be inferred. Thus, the prediction results of each decision tree for the sample will be assigned to certain reliability scores. The final prediction result is obtained according to the majority voting law, combining both the predicting results and the corresponding reliability scores. To prove the feasibility and effectiveness of the proposed method, the Tennessee Eastman (TE) process is tested. Compared with other FDD methods, the proposed DPRF model shows better performance on incomplete data.

As the amounts of data and use of distributed systems for data storage and processing have increased, reducing the number of replications has turned into a crucial requirement in these systems, which has been addressed by plenty of research. In this paper, an algorithm has been proposed to reduce the number of replications in big data transfer and, eventually to lower the traffic load over the grid by classifying data efficiently and optimally based on the sent data types and using VIKOR as a method of multivariate decision-making for ranking replication sites. Considering different variables, the VIKOR method makes it possible to take all the parameters effective in the assessment of site ranks into account. According to the results and evaluations, the proposed method has exhibited an improvement by about thirty percent in average over the LRU, LFU, BHR, and Without Rep. algorithms. Furthermore, it has improved the existing multivariate methods through different approaches to replication by thirty percent, as it considers effective parameters such as time, the number of replications, and replication site, causing replication to occur when it can make an improvement in terms of access., Competing Interests: The authors have declared that no competing interests exist.

The medical field has gradually become intelligent, and information and the research of intelligent medical diagnosis information have received extensive attention in the medical field. In response to this situation, this paper proposes a Hadoop-based medical big data processing system. The system first realized the ETL module based on Sqoop and the transmission function of unstructured data and then realized the distributed storage management function based on HDFS. Finally, a MapReduce algorithm with variable key values is proposed in the data statistical analysis module. Through simulation experiments on the system modules and each algorithm, the results show that because the traditional nondistributed big data acquisition module transmits the same scale of data, it consumes more than 3200 s and the transmission time exceeds 3000 s. The time consumption of smart medical care under the 6G protocol is 150 s, the transmission time is 146 s, and the time is reduced to 1/10 of the original. The research of intelligent medical diagnosis information based on big data has good rationality and feasibility., Competing Interests: The authors declare that they have no conflicts of interest., (Copyright © 2021 Zhihai Xu et al.)

In modern-day medicine, medical imaging has undergone immense advancements and can capture several biomedical images from patients. In the wake of this, to assist medical specialists, these images can be used and trained in an intelligent system in order to aid the determination of the different diseases that can be identified from analyzing these images. Classification plays an important role in this regard; it enhances the grouping of these images into categories of diseases and optimizes the next step of a computer-aided diagnosis system. The concept of classification in machine learning deals with the problem of identifying to which set of categories a new population belongs. When category membership is known, the classification is done on the basis of a training set of data containing observations. The goal of this paper is to perform a survey of classification algorithms for biomedical images. The paper then describes how these algorithms can be applied to a big data architecture by using the Spark framework. This paper further proposes the classification workflow based on the observed optimal algorithms, Support Vector Machine and Deep Learning as drawn from the literature. The algorithm for the feature extraction step during the classification process is presented and can be customized in all other steps of the proposed classification workflow., Competing Interests: The authors declare no conflicts of interest., (Copyright © 2021 Christian Tchito Tchapga et al.)

The accessing and processing of textual information (i.e. the storing and querying of a set of strings) is especially important for many current applications (e.g. information retrieval and social networks), especially when working in the fields of Big Data or IoT, which require the handling of very large string dictionaries. Typical data structures for textual indexing are Hash Tables and some variants of Tries such as the Double Trie (DT). In this paper, we propose an extension of the DT that we have called MergedTrie. It improves the DT compression by merging both Tries into a single and by segmenting the indexed term into two fixed length parts in order to balance the new Trie. Thus, a higher overlapping of both prefixes and suffixes is obtained. Moreover, we propose a new implementation of Tries that achieves better compression rates than the Double-Array representation usually chosen for implementing Tries. Our proposal also overcomes the limitation of static implementations that does not allow insertions and updates in their compact representations. Finally, our MergedTrie implementation experimentally improves the efficiency of the Hash Tables, the DTs, the Double-Array, the Crit-bit, the Directed Acyclic Word Graphs (DAWG), and the Acyclic Deterministic Finite Automata (ADFA) data structures, requiring less space than the original text to be indexed., Competing Interests: The authors have declared that no competing interests exist.

There is still no effective approach to overcome the problem of credit evaluation for Chinese students. In absence of a reliable credit evaluation system for students, the university students have to only apply through online peer-to-peer (P2P) loan platforms because Chinese financial institutions typically reject students' loan applications. Lack of students' financial records hinders financial institutes and banks to routinely evaluate the students' credit status and assign loans to them. Hence, this paper attempted to benefit from university students' diversified daily behavior data, and logistic regression (LR) and gradient boosting decision tree (GBDT) algorithms were also used to develop robust credit evaluation models for university students, in which the validation of the proposed models was assessed by a real-time P2P lending platform. In this study, the students' overdue behavior in returning books to university library was used as an index. With training 17838 samples, the proposed models performed well, while GBDT-based model outperformed in identification of "bad borrowers." Based on the proposed models, a self-sponsored peer-to-peer loan platform was established and developed in a Chinese university for ten months, and the achieved findings demonstrated that adopting such credit evaluation models can effectively reduce the default ratio.

Big data classification is very slow when using traditional machine learning classifiers, particularly when using a lazy and slow-by-nature classifier such as the k-nearest neighbors algorithm (KNN). This paper proposes a new approach which is based on sorting the feature vectors of training data in a binary search tree to accelerate big data classification using the KNN approach. This is done using two methods, both of which utilize two local points to sort the examples based on their similarity to these local points. The first method chooses the local points based on their similarity to the global extreme points, while the second method chooses the local points randomly. The results of various experiments conducted on different big datasets show reasonable accuracy rates compared to state-of-the-art methods and the KNN classifier itself. More importantly, they show the high classification speed of both methods. This strong trait can be used to further improve the accuracy of the proposed methods., Competing Interests: The author has declared that no competing interests exist.

Objective: Electronic health record (EHR)-based phenotyping infers whether a patient has a disease based on the information in his or her EHR. A human-annotated training set with gold-standard disease status labels is usually required to build an algorithm for phenotyping based on a set of predictive features. The time intensiveness of annotation and feature curation severely limits the ability to achieve high-throughput phenotyping. While previous studies have successfully automated feature curation, annotation remains a major bottleneck. In this paper, we present PheNorm, a phenotyping algorithm that does not require expert-labeled samples for training., Methods: The most predictive features, such as the number of International Classification of Diseases, Ninth Revision, Clinical Modification (ICD-9-CM) codes or mentions of the target phenotype, are normalized to resemble a normal mixture distribution with high area under the receiver operating curve (AUC) for prediction. The transformed features are then denoised and combined into a score for accurate disease classification., Results: We validated the accuracy of PheNorm with 4 phenotypes: coronary artery disease, rheumatoid arthritis, Crohn's disease, and ulcerative colitis. The AUCs of the PheNorm score reached 0.90, 0.94, 0.95, and 0.94 for the 4 phenotypes, respectively, which were comparable to the accuracy of supervised algorithms trained with sample sizes of 100-300, with no statistically significant difference., Conclusion: The accuracy of the PheNorm algorithms is on par with algorithms trained with annotated samples. PheNorm fully automates the generation of accurate phenotyping algorithms and demonstrates the capacity for EHR-driven annotations to scale to the next level - phenotypic big data., (© The Author 2017. Published by Oxford University Press on behalf of the American Medical Informatics Association. All rights reserved. For Permissions, please email: journals.permissions@oup.com)

This paper uses big data technology to extract the electromechanical fault characteristics of metro vehicles and analyze the current situation under different fault conditions to ensure the operation quality and safety of metro operations. It also establishes a simulation model to simulate the current waveform of metro vehicles under different fault conditions and analyze the fault phenomenon. The simulation test results show that: (1) The current waveform of a single transistor with the hard fault is compared with the simulated current waveform under a normal state. The upper part of the A phase current waveform is lost when T1 fails. When T2 fails, the current waveform in the lower half of the C phase current is lost. When T3 fails, the upper half of the B phase current waveform is lost. (2) The current waveform in the hard fault's upper and lower bridge arms will have phase loss. In the T25 fault, the C phase current is completely lost. In the T14 fault, the phase A current waveform is completely lost. In the T36 fault, the phase B current is completely lost. (3) The current waveform of a single transistor with a soft fault is complete, but the overall current amplitude is reduced. When a T1 fails, the A phase current tends to rise first and then fall. Compared to normal, the amplitude of the current decreases, and the peak decreases slightly. (4) The current values of phase B and phase C of the two transistors on the same bridge above and below the soft fault are mostly the same. The phase A current output value decreases in both the positive and negative half cycles. This paper aims to improve the monitoring ability of the monitoring system of electromechanical equipment of metro vehicles, which plays a specific role in maintaining the safety of subway operations and improving the quality of subway operations. [ABSTRACT FROM AUTHOR]

The quality of the data in core electronic registers has constantly decreased as a result of numerous errors that were made and inconsistencies in the data in these databases due to the growing number of databases created with the intention of providing electronic services for public administration and the lack of the data harmonization or interoperability between these databases. Evaluating and improving the quality of data by matching and linking records from multiple data sources becomes exceedingly difficult due to the incredibly large volume of data in these numerous data sources with different data architectures and no unique field to create interconnection among them. Different algorithms are developed to treat these issues and our focus will be on algorithms that handle large amounts of data, such as Levenshtein distance (LV) algorithm and Damerau-Levenshtein distance (DL) algorithm. In order to analyze and evaluate the effectiveness and quality of data using the mentioned algorithms and making improvements to these algorithms, through this paper we will conduct experiments on large data sets with more than one million records. [ABSTRACT FROM AUTHOR]

Collecting and analyzing data from all devices to improve the efficiency of business processes is an important task of Industrial Internet of Things (IIoT). In the age of data explosion, extensive text data generated by the IIoT have given birth to a variety of text representation methods. The task of text representation is to convert the natural language to a form that computer can understand with retaining the original semantics. However, these methods are difficult to effectively extract the semantic features among words and distinguish polysemy in natural language. Combining the advantages of convolutional neural network (CNN) and variational autoencoder (VAE), this paper proposes an intelligent CNN-VAE text representation algorithm as an advanced learning method for social big data within next-generation IIoT, which help users identify the information collected by sensors and perform further processing. This method employs the convolution layer to capture the local features of the context and uses the variational technique to reconstruct feature space to make it conform to the normal distribution. In addition, the improved word2vec model based on topical word embedding (TWE) is utilized to add topical information to word vectors to distinguish polysemy. This paper takes the social big data as an example to illustrate the way of the proposed algorithm applied in the next-generation IIoT and utilizes Cnews dataset to verify the performance of proposed method with four evaluating metrics (i.e., recall, accuracy, precision, and F1-score). Experimental results indicate that the proposed method outperforms word2vec-avg and CNN-AE in K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) classifiers and distinguishes polysemy effectively. [ABSTRACT FROM AUTHOR]

The paper addresses the challenge of transmitting a big number of files stored in a data center (DC), encrypting them by compilers, and sending them through a network at an acceptable time. Face to the big number of files, only one compiler may not be sufficient to encrypt data in an acceptable time. In this paper, we consider the problem of several compilers and the objective is to find an algorithm that can give an efficient schedule for the given files to be compiled by the compilers. The main objective of the work is to minimize the gap in the total size of assigned files between compilers. This minimization ensures the fair distribution of files to different compilers. This problem is considered to be a very hard problem. This paper presents two research axes. The first axis is related to architecture. We propose a novel pre-compiler architecture in this context. The second axis is algorithmic development. We develop six algorithms to solve the problem, in this context. These algorithms are based on the dispatching rules method, decomposition method, and an iterative approach. These algorithms give approximate solutions for the studied problem. An experimental result is implemented to show the performance of algorithms. Several indicators are used to measure the performance of the proposed algorithms. In addition, five classes are proposed to test the algorithms with a total of 2350 instances. A comparison between the proposed algorithms is presented in different tables discussed to show the performance of each algorithm. The result showed that the best algorithm is the Iterative-mixed Smallest-Longest-Heuristic (ISL) with a percentage equal to 97.7% and an average running time equal to 0.148 s. All other algorithms did not exceed 22% as a percentage. The best algorithm excluding ISL is Iterative-mixed Longest-Smallest Heuristic (ILS) with a percentage equal to 21,4% and an average running time equal to 0.150 s. [ABSTRACT FROM AUTHOR]

This paper analyses the phenomenology and epistemology of chatbots such as ChatGPT and Bard. The computational architecture underpinning these chatbots are large language models (LLMs), which are generative artificial intelligence (AI) systems trained on a massive dataset of text extracted from the Web. We conceptualise these LLMs as multifunctional computational cognitive artifacts, used for various cognitive tasks such as translating, summarizing, answering questions, information-seeking, and much more. Phenomenologically, LLMs can be experienced as a "quasi-other"; when that happens, users anthropomorphise them. For most users, current LLMs are black boxes, i.e., for the most part, they lack data transparency and algorithmic transparency. They can, however, be phenomenologically and informationally transparent, in which case there is an interactional flow. Anthropomorphising and interactional flow can, in some users, create an attitude of (unwarranted) trust towards the output LLMs generate. We conclude this paper by drawing on the epistemology of trust and testimony to examine the epistemic implications of these dimensions. Whilst LLMs generally generate accurate responses, we observe two epistemic pitfalls. Ideally, users should be able to match the level of trust that they place in LLMs to the degree that LLMs are trustworthy. However, both their data and algorithmic opacity and their phenomenological and informational transparency can make it difficult for users to calibrate their trust correctly. The effects of these limitations are twofold: users may adopt unwarranted attitudes of trust towards the outputs of LLMs (which is particularly problematic when LLMs hallucinate), and the trustworthiness of LLMs may be undermined. [ABSTRACT FROM AUTHOR]

Since demand forecasting is the first step in managing and operating a tourism business, its accuracy is very important to tourism businesses. In order to address NN's drawbacks, such as local optimization, slow convergence, and large sample sizes, this paper organically combines the PSO and NN models and builds a PSO-NN-based tourism demand forecasting model. The tourism demand forecasting indexes, the choice of NN forecasting models, the modelling process, and the implementation methods are first analysed and studied along with the fundamental theories and forecasting techniques of PSO and NN. In order to increase the precision of the prediction model, the PSO algorithm is also used to optimise the weights and thresholds of the NN. The final section of the paper compares the performance of the model developed in this paper with the most widely used model for forecasting tourism demand. According to the experimental findings, this model's prediction accuracy can reach 95.81 percent, or about 10.09 percent higher than the prediction accuracy of the conventional NN model. There are some practical implications to this research. Applying the optimization model to the forecast of tourism demand is doable and practical. [ABSTRACT FROM AUTHOR]

With the rapid development of AI and big data mining technologies, computerized medical decision-making has become increasingly prominent. The aim of high-utility pattern mining (HUPM) is to discover meaningful patterns in medical databases that contribute to maximizing the utility from the perspective of diagnosis. However, HUPM pays less attention to the interpretability and explainability of these patterns in medical decision-making scenarios. This paper proposes a novel algorithm called the Improved fuzzy high-utility pattern mining (IF-HUPM) to address this problem. First, the paper applies a fuzzy preprocessing method to divide the fuzzy intervals of a medical quantitative data set, which enhances the fuzziness and interpretability of the data. Next, in the process of IF-HUPM, both fuzzy tree and list structures are employed to calculate fuzzy high-utility values. By combining the characteristics of the one-stage and two-stage algorithms of HUPM, an adaptive-phase Fuzzy HUPM hybrid frame is proposed. The experimental results demonstrate that the proposed IF-HUPM algorithm enhances both accuracy and efficiency and the mining process requires less time and space on average. [ABSTRACT FROM AUTHOR]

In order to explore potential value of explosively growing data in thermal power unit, this paper proposes a big data mining method based on Hadoop-based Spark cluster-computing framework and algorithms. Firstly, positive and negative balance methods are used to accurately obtain actual net coal consumption, and maximum information coefficient method is used to select all parameters related to optimization objectives. Then, Spark-based Mini-Batch K-means algorithm and Elbow method are constructed to divide whole operating modes. After that, all data are discretized and mapped to corresponding intervals by using Spark-based Elbow method and Mini-Batch K-means algorithm. Finally, Spark-based parallel FP-growth algorithm is used to deeply mine the potential relationships and laws. To verify the proposed method, a 350-MW thermal power unit is taken as a study case. The important conclusions are as follows: (1) the proposed Spark-based Mini-Batch K-means algorithm reduces the calculation time by 57.11% compared with Mini-Batch K-means algorithm, and 85.61% calculation time compared with K-means algorithm. The proposed Spark-based FP-growth algorithm reduces computational time by 32.8% compared with FP-growth algorithm. (2) Strong association rules of whole operating modes are mined, and operating optimization guidance schemes for important parameters are obtained. Take operating mode 1 as an example: if the optimal result can be reasonably applied, it can save 2.942 g coal per kilowatt hour. (3) Besides, we have found out some other potential relationships among parameters, which have important reference value for on-site operators to analyze economy of the thermal power unit. [ABSTRACT FROM AUTHOR]

As science and technology progress and develop rapidly in this day and age, various industry applications have changed the data in a new way, and the explosive growth of data has made traditional data mining unable to perform the current data mining work. The aim of this paper is to study the aggregation digging of big data based around flocking automation algorithms under circumstances of cloud. There is a fuzzy-mean aggregation arrangement with mixed frog leaping in this paper. Through simulation analysis of different clustering algorithms, hybrid frog-hopping and as well as the merging arrangement introduced in this paper, it is concluded that the merging algorithm achieves an improvement of up to 90% accuracy on the iritual membrane dataset. It was demonstrated that the arrangement provides effective agglomerations. When the number of iterations is 500, the fitness value of the algorithm on Dataset 1 is 1.59 × 104, and its convergence speed is faster than the other algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD), and presents HPClust, an innovative set of hybrid parallel approaches for its effective solution. By utilizing modern high-performance computing techniques, HPClust enhances key clustering metrics: effectiveness, computational efficiency, and scalability. In contrast to vanilla data parallelism, which only accelerates processing time through the MapReduce framework, our approach unlocks superior performance by leveraging the multi-strategy competitive–cooperative parallelism and intricate properties of the objective function landscape. Unlike other available algorithms that struggle to scale, our algorithm is inherently parallel in nature, improving solution quality through increased scalability and parallelism and outperforming even advanced algorithms designed for small- and medium-sized datasets. Our evaluation of HPClust, featuring four parallel strategies, demonstrates its superiority over traditional and cutting-edge methods by offering better performance in the key metrics. These results also show that parallel processing not only enhances the clustering efficiency, but the accuracy as well. Additionally, we explore the balance between computational efficiency and clustering quality, providing insights into optimal parallel strategies based on dataset specifics and resource availability. This research advances our understanding of parallelism in clustering algorithms, demonstrating that a judicious hybridization of advanced parallel approaches yields optimal results for MSSC-ITD. Experiments on the synthetic data further confirm HPClust's exceptional scalability and robustness to noise. [ABSTRACT FROM AUTHOR]

The novelty of this paper is in determining and using hyperparameters to improve the Extended Isolation Forest (EIF) algorithm, a relatively new algorithm, to detect malicious activities in network traffic. The EIF algorithm is a variation of the Isolation Forest algorithm, known for its efficacy in detecting anomalies in high-dimensional data. Our research assesses the performance of the EIF model on a newly created dataset composed of Zeek Connection Logs, UWF-ZeekDataFall22. To handle the enormous volume of data involved in this research, the Hadoop Distributed File System (HDFS) is employed for efficient and fault-tolerant storage, and the Apache Spark framework, a powerful open-source Big Data analytics platform, is utilized for machine learning (ML) tasks. The best results for the EIF algorithm came from the 0-extension level. We received an accuracy of 82.3% for the Resource Development tactic, 82.21% for the Reconnaissance tactic, and 78.3% for the Discovery tactic. [ABSTRACT FROM AUTHOR]

Sensors are the main components in Cyber-Physical Systems (CPS), which transmit large amounts of physical values and big data to computing platforms for processing. On the other hand, the embedded processors (as edge devices in fog computing) spend most of their time reading the sensor signals as compared with computing time. The impact of sensors on the performance of fog computing is very great, thus, the enhancement of the reading time of sensors will positively affect the performance of fog computing, and solves the CPS challenges such as delay, timed precision, temporal behavior, energy, and cost. In this paper, we propose an algorithm based on the 1st derivative of the sensor signal to generate an adaptive sampling frequency. The proposed algorithm uses an adaptive frequency to capture the sudden and rapid change in sensor signal in the steady state. Finally, we realize and tested it using the Ptolemy II Modeling Environment. [ABSTRACT FROM AUTHOR]

Algorithm is the core category and basic methods of the digital age, and advanced technologies such as big data, artificial intelligence, and blockchain all need to rely on various algorithm designs or take the algorithm as the underlying principle. However, due to the characteristics of algorithm design, application, and technology itself, there are also hidden worries such as algorithm black-box, algorithm discrimination, and difficulty in accountability in the operation process to varying degrees. This paper summarizes these problems into three aspects: unexplainable, self-reinforcing and autonomous. Facing the opportunities and risks generated by the application of the algorithm in national governance, while actively promoting the development of algorithm technology to continuously promote the modernization process of national governance, it is also necessary to increase the governance of the algorithm. The practice has proved that enhancing the interpretability of algorithm, optimizing algorithm design, and adopting legal regulatory algorithm are the basic approaches to effective regulatory algorithm in the era of intelligent governance. [ABSTRACT FROM AUTHOR]

The pedestrian detection model has a high requirement on the quality of the dataset. Concerning this problem, this paper uses data cleaning technology to improve the quality of the dataset, so as to improve the performance of the pedestrian detection model. The dataset used in this paper is obtained from subway stations in Beijing and Nanjing. The data images' quality is subject to motion blur, uneven illumination, and other noisy factors. Therefore, data cleaning is very important for this paper. The data cleaning process in this paper is divided into two parts: detection and correction. First, the whole dataset goes through blur detection, and the severely blurred images are filtered as the difficult samples. Then, the image is sent to DeblurGAN for deblur processing. 2D gamma function adaptive illumination correction algorithm is used to correct the subway pedestrian image. Then, the processed data is sent to the pedestrian detection model. Under different data cleaning datasets, through the analysis of the detection results, it is proved that the data cleaning process significantly improves the detection model's performance. [ABSTRACT FROM AUTHOR]

The ItemCF algorithm is currently the most widely used recommendation algorithm in commercial applications. In the early days of recommender systems, most recommendation algorithms were run on a single machine rather than in parallel. This approach, coupled with the rapid growth of massive user behavior data in the current big data era, has led to a bottleneck in improving the execution efficiency of recommender systems. With the vigorous development of distributed technology, distributed ItemCF algorithms have become a research hotspot. Hadoop is a very popular distributed system infrastructure. MapReduce, which provides massive data computing, and Hive, a data warehousing tool, are the two core components of Hadoop, each with its own advantages and applicable scenarios. Scholars have already utilized MapReduce and Hive for the parallelization of the ItemCF algorithm. However, these pieces of literature make use of either MapReduce or Hive alone without fully leveraging the strengths of both. As a result, it has been difficult for parallel ItemCF recommendation algorithms to feature both simple and efficient implementation and high running efficiency. To address this issue, we proposed a distributed ItemCF recommendation algorithm based on the combination of MapReduce and Hive and named it HiMRItemCF. This algorithm divided ItemCF into six steps: deduplication, obtaining the preference matrixes of all users, obtaining the co-occurrence matrixes of all items, multiplying the two matrices to generate a three-dimensional matrix, aggregating the data of the three-dimensional matrix to obtain the recommendation scores of all users for all items, and sorting the scores in descending order, with Hive being used to carry out steps 1 and 6, and MapReduce for the other four steps involving more complex calculations and operations. The Hive jobs and MapReduce jobs are linked through Hive's external tables. After implementing the proposed algorithm using Java and running the program on three publicly available user shopping behavior datasets, we found that compared to algorithms that only use MapReduce jobs, the program implementing the proposed algorithm has fewer lines of source code, lower cyclomatic complexity and Halstead complexity, and can achieve a higher speedup ratio and parallel computing efficiency when processing all datasets. These experimental results indicate that the parallel and distributed ItemCF algorithm proposed in this paper, which combines MapReduce and Hive, has both the advantages of concise and easy-to-understand code as well as high time efficiency. [ABSTRACT FROM AUTHOR]

With the macroeconomy entering a new normal, many new problems are exposed in all walks of life, and the risk of default in the financial sector is also being exposed at an accelerated pace. In the context of big data, internet finance, as an important part of the financial market, also faces many risks in the process of its rapid development. Reasonable, scientific, and effective prediction and prevention of financial default risk have become a key link in the process of risk management practice in the financial industry. Based on the powerful prediction function of the neural network, this paper combined neural network and chaos theory to construct a chaotic RBF neural network. It was applied to financial default risk prediction, which made the prediction accuracy and efficiency higher. The chaotic neural network solves the shortcomings of unstable prediction in the basic neural network and can comprehensively and accurately predict the financial default risk, so as to take measures to prevent risks. The experimental results of this paper show that the accuracy rate of the chaotic RBF neural network reaches 95%, while the accuracy rates of the BP neural network and the RBF neural network are 67% and 78%, respectively. Although the prediction accuracy of these two methods is also high, it is still not as high as the chaotic RBF neural network. Therefore, it is very meaningful to choose the chaotic RBF neural network to predict financial default risk in this paper. [ABSTRACT FROM AUTHOR]

The location planning of relief distribution centres (DCs) is crucial in humanitarian logistics as it directly influences the disaster response and service to the affected victims. In light of the critical role of facility location in humanitarian logistics planning, the study proposes a two-stage relief distribution location problem. The first stage of the model determines the minimum number of relief DCs, and the second stage find the optimal location of these DCs to minimize the total cost. To address a more realistic situation, restrictions are imposed on the coverage area and capacity of each DCs. In addition, for optimally solving this complex NP-hard problem, a novel two-phase algorithm with exploration and exploitation phase is developed in the paper. The first phase of the algorithm i.e., exploration phase identifies a near-optimal solution while the second phase i.e. exploitation phase enhances the solution quality through a close circular proximity investigation. Furthermore, the comparative analysis of the proposed algorithm with other well-known algorithms such as genetic algorithm, pattern search, fmincon, multistart and hybrid heuristics is also reported and computationally tested from small to large data sets. The results reveal that the proposed two-phase algorithm is more efficient and effective when compared to the conventional metaheuristic methods. [ABSTRACT FROM AUTHOR]

Triangle enumeration is a foundation brick for solving harder graph problems related to social networks, the Internet and transportation, to name a few applications. This problem is well studied in the theory literature, but remains an open problem with big data. In this paper, we defend the idea of solving triangle enumeration with SQL queries evaluating the steps of a new adaptive algorithm with linear speedup. Such SQL approach provides scalability beyond RAM limits, automatic parallel processing and more importantly: linear speedup as more machines are added. We present theory results and experimental validation showing our solution works well with large graphs analyzed on a parallel cluster with many machines, producing a balanced workload even with highly skewed degree vertices. We consider two types of distributed systems: (1) a parallel DBMS that evaluates SQL queries, and (2) a parallel HPC cluster calling the MPI library (called via Python). Extensive benchmark experiments with large graphs show our SQL solution offers many advantages over MPI and competing graph analytic systems. [ABSTRACT FROM AUTHOR]

With the improvement of people's economic level, people pay more attention to financial investment. At present, the financial industry provides customers with a variety of investment services, but it has always been unable to provide targeted services for customers. Based on this, this paper studies the optimization of intelligent financial technology core technology based on collaborative filtering algorithm in the big data environment. On the basis of a simple analysis of the application of financial core technology and the research status of collaborative filtering algorithm, this paper constructs an application model of intelligent financial collaborative filtering algorithm. In view of the shortcomings of collaborative filtering algorithm, it uses user-based clustering algorithm to improve the collaborative filtering algorithm. According to the frequency of customers' access to financial products, the attention model is established and simulated. The results show that the collaborative filtering optimization algorithm used in this paper can reduce the absolute error of recommendation and improve the accuracy. [ABSTRACT FROM AUTHOR]

Accurate recommendation of tourist attractions is conducive to improving users' travel efficiency and tourism experience. However, the choice of tourism feature factors and the difference of recommendation algorithm will affect the accuracy of scenic spot recommendation. Aiming at the problems of sparse data, insufficient tourism factors, and low recommendation accuracy in the existing tourism recommendation research, this paper puts forward a scenic spot recommendation method based on microblog data and machine learning by using the characteristics of personalized expression and strong current situation of microblog data and the intelligent prediction function of machine learning, so as to realize accurate and personalized scenic spot recommendation. This paper extracts rich tourism characteristic factors. Typical tourism recommendation algorithms choose tourism characteristic factors from scenic spots, tourists, and other aspects, without considering the travel time, tourism season, and other contextual information of tourists' destination, which can help understand users' tourism preferences from different angles. Aiming at the problem of sparse data and cold start of collaborative filtering recommendation algorithm, this paper introduces deep learning algorithm and combines the proposed multifeature tourism factors to build dynamic scenic spot prediction models (random forest preferred attraction prediction (RFPAP) and neural networks preferred attraction prediction (NNPAP)). The experimental results show that RFPAP and NNPAP methods can overcome the problem of data sparsity and achieve 89.61% and 89.51% accuracy, respectively. RFPAP method is better than NNPAP method and has stronger generalization ability. [ABSTRACT FROM AUTHOR]

This paper presents a dynamic segmentation and weighted comprehensive matching algorithm based on neural networks for cross-media piano performance audio recognition and retrieval. The 3D convolutional neural network process is separated to compress the network parameters and improve the computational speed. Skip connection and layer-wise learning rate solve the problem that the separated network is challenging to train. The piano performance audio recognition is facilitated by shuffle operation. In pattern recognition, music retrieval algorithms are gaining more and more attention due to their ease of implementation and efficiency. However, the problems of imprecise dynamic note segmentation and inconsistent matching templates directly affect the accuracy of the MIR algorithm. We propose a dynamic threshold-based segmentation and weighted comprehensive matching algorithm to solve these problems. The amplitude difference step is dynamically set, and the notes are segmented according to the changing threshold to improve the accuracy of note segmentation. A standard score frequency is used to transform the pitch template to achieve input normalization to enhance the accuracy of matching. Direct matching and DTW matching are fused to improve the adaptability and robustness of the algorithm. Finally, the effectiveness of the method is experimentally demonstrated. This paper implements the data collection and processing, audio recognition, and retrieval algorithm for cross-media piano performance big data through three main modules: the collection, processing, and storage module of cross-media piano performance big data, the building module of audio recognition of cross-media piano performance big data, and the dynamic precision module of cross-media piano performance big data. [ABSTRACT FROM AUTHOR]

This study focuses on the load balancing of the transactions in the blockchain. The problem is how to assign these transactions to the blocks. The objective is to guarantee a load balancing of the workload in the time of blocks. The proposed problem is an NP-hard one. To face the hardness of the studied problem, the challenge is to develop algorithms that solve the problem approximately. Finding an approximate solution is a real challenge. In this paper, nine algorithms are proposed. These algorithms are based on the dispatching-rules method, randomization approach, clustering algorithms, and iterative method. The proposed algorithms return approximate solutions in a remarkable time. In addition, in this paper, a novel architecture composed of blocks is proposed. This architecture adds the component "Balancer". This component is responsible to call the best-proposed algorithm and solve the scheduling problem in a polynomial time. In addition, the proposed work helps users to solve the problem of big data concurrency. These algorithms are coded and compared. The performance of these algorithms is tested over three classes of instances. These classes are generated based on uniform distribution. The total number of instances tested is 1350. The average gap, execution time, and the percentage of the best-reached value are used as metrics to measure the performance of the proposed algorithms. Experimental results show the performance of these algorithms and a comparison between them is discussed. The experimental results show that the best algorithm is best-mi-transactions iterative multi-choice with 93.9% in an average running time of 0.003 s. [ABSTRACT FROM AUTHOR]