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.)

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]

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]

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]

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 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]

In the era of big data, unsupervised learning algorithms such as clustering are particularly prominent. In recent years, there have been significant advancements in clustering algorithm research. The Clustering by Density Peaks algorithm is known as Clustering by Fast Search and Find of Density Peaks (density peak clustering). This clustering algorithm, proposed in Science in 2014, automatically finds cluster centers. It is simple, efficient, does not require iterative computation, and is suitable for large-scale and high-dimensional data. However, DPC and most of its refinements have several drawbacks. The method primarily considers the overall structure of the data, often resulting in the oversight of many clusters. The choice of truncation distance affects the calculation of local density values, and varying dataset sizes may necessitate different computational methods, impacting the quality of clustering results. In addition, the initial assignment of labels can cause a 'chain reaction', i.e., if one data point is incorrectly labeled, it may lead to more subsequent data points being incorrectly labeled. In this paper, we propose an improved density peak clustering method, DPC-MS, which uses the mean-shift algorithm to find local density extremes, making the accuracy of the algorithm independent of the parameter dc. After finding the local density extreme points, the allocation strategy of the DPC algorithm is employed to assign the remaining points to appropriate local density extreme points, forming the final clusters. The robustness of this method in handling uncertain dataset sizes adds some application value, and several experiments were conducted on synthetic and real datasets to evaluate the performance of the proposed method. The results show that the proposed method outperforms some of the more recent methods in most cases. [ABSTRACT FROM AUTHOR]

In this paper, we propose and experimentally assess an innovative framework for scaling posterior distributions over different-curation datasets, based on Bayesian-Neural-Networks (BNN). Another innovation of our proposed study consists in enhancing the accuracy of the Bayesian classifier via intelligent sampling algorithms. The proposed methodology is relevant in emerging applicative settings, such as provenance detection and analysis and cybercrime. Our contributions are complemented by a comprehensive experimental evaluation and analysis over both static and dynamic image datasets. Derived results confirm the successful application of our proposed methodology to emerging big data analytics settings. [ABSTRACT FROM AUTHOR]

Clustering algorithms are part of algorithms of unsupervised-learning that are commonly used in different fields. Two major impacts on the data clustering algorithm have been the rapid developments and creation of electronic data. This includes the view of how the big data is stored as well as how it is processed. A cluster has a high level of resemblance to the same cluster and a low level of resemblance to other clusters. Clustering algorithms are commonly used in all fields, such as retail, banking, development, etc.. Even though different methodologies are proposed with different scenarios, but none of the existing methodologies are proven to be a better approaches. Here, in our work we have adopted an improved Map- Reduce programming model to combine the Canopy clustering and K-means clustering algorithms to process the Microarray data with the available commodity hardware with an aim to achieve better performance. The results obtained from different scenarios shown that the proposed method was capable of improving computational speed significantly by increasing the nodes as required. In this research, this paper explored the efficiency by evaluating and implementing the proposed Improved k-means with Improved Map Reduce algorithm which runs on Hadoop Frame work using Microarray dataset along with different datasets. [ABSTRACT FROM AUTHOR]

Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big data systems require recursive computations beyond the Boolean space. In this article, we study the convergence of datalog when it is interpreted over an arbitrary semiring. We consider an ordered semiring, define the semantics of a datalog program as a least fixpoint in this semiring, and study the number of steps required to reach that fixpoint, if ever. We identify algebraic properties of the semiring that correspond to certain convergence properties of datalog programs. Finally, we describe a class of ordered semirings on which one can use the semi-naïve evaluation algorithm on any datalog program. [ABSTRACT FROM AUTHOR]

The mode is a fundamental descriptive statistic in data analysis, signifying the most frequent element within a dataset. The range mode query (RMQ) problem expands upon this concept by preprocessing an array A containing n natural numbers. This allows for the swift determination of the mode within any subarray A[a..b], thus optimizing the computation of the mode for a multitude of range queries. The efficacy of this process bears considerable importance in data analytics and retrieval across diverse platforms, including but not limited to online shopping experiences and financial auditing systems. This study is dedicated to exploring and benchmarking different algorithms and data structures designed to tackle the RMQ problem. The goal is to not only address the theoretical aspects of RMQ but also to provide practical solutions that can be applied in real-world scenarios, such as the optimization of an online shopping platform's understanding of customer preferences, enhancing the efficiency and effectiveness of data retrieval in large datasets. [ABSTRACT FROM AUTHOR]

Instance selection is an important preprocessing technology in data mining and machine learning. In this paper, we proposed a novel evolutionary based instance selection algorithm for big data. First, we defined a coarse granularity chromosome structure to reduce the size of search space and costs of chromosome operations(recombination and mutation, etc.). Then a stratified evolution strategy was proposed to remove the hyper parameter in classic fitness function and achieve precise control over the reduction ratio of instances. Finally, a sampling-based fitness function was proposed to reduce the time complexity. Experimental results shown that our new algorithm is efficient to complete the instance selection task on data set with millions of instances in minutes-level. The 10-fold cross-validation also proved that the selection results on many datasets have high nearest neighbor classification accuracy. • We proposed a distributed coarse granularity chromosome structure to reduce search space and ensure load balance. • We proposed a stratified evolution strategy to transform multi-objective to multiple single-objective tasks. • We proposed a sampling-based fitness function with less time complexity [ABSTRACT FROM AUTHOR]

Efficient attribute reduction algorithm capable of handling high dimensional big data is one of the hot topics of rough set theory, and some related researchers have achieved with |C| jobs. In this paper, we present the definition of a marked reduction set and propose a more efficient attribute reduction algorithm (RA-MRS). The RA-MRS includes a batch processing phase and a vibration optimization phase, which reduce the number of jobs from |C| to log 2 |C|. Additionally, we provide an effective judgment strategy based on MapReduce, which supports the exception processing mechanism of Java to interrupt and advance the current job. Finally, the proposed algorithm is implemented in parallel based on Spark computing framework. The experimental results show that the proposed RA-MRS algorithm is over 99% faster than the classical PAAR_PR algorithm and 70% faster than the algorithm in the literature (Yin et al., 2021). [ABSTRACT FROM AUTHOR]

In knowledge discovery and data mining, removing redundant and irrelevant data attributes is crucial. Traditional algorithms, however, struggle with efficiency in high-dimensional big data contexts. To solve this problem, this paper proposes a novel global search attribute reduction method namely RHC-IGWO (Rough Hypercuboid Structure via Improved Grey Wolf Optimizer) by integrating the rough hypercuboid method and Improved Grey Wolf Optimizer (IGWO) with the pheromone mechanism. The algorithm is embedded into the Apache Spark parallel computing framework (Parallel computing Rough Hypercuboid Structure via Improved Grey Wolf Optimizer, PcRHC-IGWO) to accelerate and simplify the attribute reduction process. The algorithm divides the decision table into several independent blocks, introduces the pheromone mechanism to simulate the wolf pack behavior, and uses the IGWO for global search, which is conducive to efficient local search and global information sharing between individuals. The position of the individual is initialized by calculating the relevance between the attributes, and the pheromone value is dynamically updated according to the reduction quality. This allows automatically giving more search focus to more promising attribute regions. Experiments with public and real datasets demonstrate the RHC-IGWO algorithm's significant speedup and its efficacy in maintaining or enhancing classification accuracy. Particularly noteworthy is its performance on schizophrenia datasets, where the proposed method achieves outstanding classification accuracies of 86.2%, 88.89%, and 92.86% across various classifiers. These results not only demonstrate its effectiveness but also underline its potential in advanced data analysis scenarios. Additionally, on some large-scale datasets, the time required for processing has been reduced by 85.71%, showcasing the algorithm's efficiency in handling complex and voluminous data. • This study presents the unbalanced evaluation indicators of attribute subsets by parallel computing. • The pheromone and mutation mechanisms in BGWA are combined with rough hypercuboid approach. • This study presents a distributed meta-heuristic attribute reduction via Apache Spark. [ABSTRACT FROM AUTHOR]

Digital data processing has revolutionized medical documentation and enabled the aggregation of patient data across hospitals. Initiatives such as those from the AO Foundation about fracture treatment (AO Sammelstudie, 1986), the Major Trauma Outcome Study (MTOS) about survival, and the Trauma Audit and Research Network (TARN) pioneered multi-hospital data collection. Large trauma registries, like the German Trauma Registry (TR-DGU) helped improve evidence levels but were still constrained by predefined data sets and limited physiological parameters. The improvement in the understanding of pathophysiological reactions substantiated that decision making about fracture care led to development of patient's tailored dynamic approaches like the Safe Definitive Surgery algorithm. In the future, artificial intelligence (AI) may provide further steps by potentially transforming fracture recognition and/or outcome prediction. The evolution towards flexible decision making and AI-driven innovations may be of further help. The current manuscript summarizes the development of big data from local databases and subsequent trauma registries to AI-based algorithms, such as Parkland Trauma Mortality Index and the IBM Watson Pathway Explorer. [ABSTRACT FROM AUTHOR]

With the rapid development of social media, people can access a large amount of data in a short period of time, and big data technology has emerged. With the vigorous development of cloud computing and big data, the method of mining audience interests through a large amount of data to guide film and television creation has attracted more and more attention from experts and scholars. In order to understand the current situation of film and television drama creation in China and provide suggestions for the shortcomings in the industry, this article mainly analyzes the application of intelligent algorithms for traffic prediction models and big data analysis in film and television creation. This intelligent algorithm can predict the potential audience of movies or TV dramas, helping producers and investors make decisions. This system utilizes artificial intelligence technology to select suitable actors for characters based on their matching degree and past work performance. This article applies intelligent algorithms to big data processing to improve the accuracy of data processing. This article explores the application of intelligent algorithms and big data analysis in film and television creation. Using machine learning algorithms to predict the potential audience of a movie or TV series based on historical data, providing decision-making basis for investors and producers. This system utilizes AI technology to select suitable actors for characters based on their matching degree with characters and past work performance, improving the scientific and accurate selection of roles. The application of these technologies helps to improve production efficiency and quality, reduce costs and risks, and inject new impetus into the sustainable development of the film and television industry. [ABSTRACT FROM AUTHOR]

MapReduce is a popular paradigm in distributed computing, but it is not efficient when executing iterative algorithms over a distributed big dataset due to its heavy data communication overhead. Non-MapReduce computing is an alternative for improving computing efficiency and data scalability when using iterative algorithms to process big distributed datasets on clusters. In this paper, we investigate Non-MapReduce approach in distributed computing and use Spark implementations of machine learning algorithms to discuss the problems of MapReduce in executing iterative algorithms over a big distributed dataset and the advantages of Non-MapReduce for the same tasks. We present a method to build a new machine learning library made of sequential algorithms for distributed computing. We use experiment results to show comparisons of computing efficiency and data scalability of MapReduce and Non-MapReduce in executing six machine learning algorithms over big datasets. [ABSTRACT FROM AUTHOR]

Fault-finding diagnostics is a model-driven approach that identifies a system's malfunctioning portion. It uses residual generators to identify faults, and various methods like isolation techniques and structural analysis are used. However, diagnostic equipment doesn't measure the remaining signal-to-noise ratio. Residual selection identifies fault-detecting generators. Fault detective diagnostic (FDD) approaches have been investigated and implemented for various industrial processes. However, industrial operations make it difficult to implement FDD techniques. To bridge the gap between theoretical methodologies and implementations, hybrid approaches and intelligent procedures are needed. Future research should focus on improving fault prognosis, allowing for accurate prediction of process failures and avoiding safety hazards. Real-time and comprehensive FDD strategies should be implemented in the age of big data. [ABSTRACT FROM AUTHOR]

With the rapid advancement of internet technology, various industries have accumulated vast amounts of data, including on user behavior and personal preferences. Traditional museums can leverage this user data to uncover individual preferences and offer personalized services to their visitors. However, the exponential growth of information has also led to the problem of information overload, making it challenging for users to find relevant information within the vast data landscape. Consequently, the utilization rate of available information decreases. By harnessing the power of cloud computing, big data analytics, and recommendation systems, museums can enhance visitors' touring experiences by helping them discover collections aligned with their interests and connecting with like-minded individuals. To address this objective, the research focuses on optimizing the initial clustering centers of the fuzzy clustering algorithm and parallelizing the optimized algorithm using MapReduce, resulting in the development of a novel MapReduce-based k-prototype fuzzy c-means (MRKPFCM) algorithm. Subsequently, the MRKPFCM algorithm is combined with the classical collaborative filtering algorithm to create a hybrid and parallelized collaborative filtering recommendation algorithm, incorporating elements such as MRKPFCM, audience, and collection. This hybrid algorithm is further supplemented by a content-based recommendation approach to generate comprehensive and refined recommendation results. Experimental findings demonstrate that the predictive scoring errors, as measured by RMSE and MAE, exhibited a downward trend when the number of nearest neighbors for target users fell within the range of 10–20. For instance, the studied algorithm's MAE value decreased from 0.7512 to 0.7179, surpassing the corresponding figures for the two comparison algorithms. Moreover, with an increase in the number of nearest neighbors within the same range, all three algorithms experienced improved accuracy in prediction results. In particular, the accuracy rate rose from 17.84% to 18.82%, outperforming the two comparison algorithms. In summary, the enhanced hybrid recommendation algorithm achieved through this study displays superior recommendation accuracy and holds significant practical value. [ABSTRACT FROM AUTHOR]

In the context of the Internet of Things (IoT), Tiny Machine Learning (TinyML) and Big Data, enhanced by Edge Artificial Intelligence, are essential for effectively managing the extensive data produced by numerous connected devices. Our study introduces a set of TinyML algorithms designed and developed to improve Big Data management in large-scale IoT systems. These algorithms, named TinyCleanEDF, EdgeClusterML, CompressEdgeML, CacheEdgeML, and TinyHybridSenseQ, operate together to enhance data processing, storage, and quality control in IoT networks, utilizing the capabilities of Edge AI. In particular, TinyCleanEDF applies federated learning for Edge-based data cleaning and anomaly detection. EdgeClusterML combines reinforcement learning with self-organizing maps for effective data clustering. CompressEdgeML uses neural networks for adaptive data compression. CacheEdgeML employs predictive analytics for smart data caching, and TinyHybridSenseQ concentrates on data quality evaluation and hybrid storage strategies. Our experimental evaluation of the proposed techniques includes executing all the algorithms in various numbers of Raspberry Pi devices ranging from one to ten. The experimental results are promising as we outperform similar methods across various evaluation metrics. Ultimately, we anticipate that the proposed algorithms offer a comprehensive and efficient approach to managing the complexities of IoT, Big Data, and Edge AI. [ABSTRACT FROM AUTHOR]

We analyzed the symptoms composition of Interstitial Cystitis (IC), the regularity of the evolution of symptoms before and after treatment, and the visualization of the community network, to provide a reference for clinical diagnosis and treatment of Interstitial Cystitis. Based on the outpatient electronic case data of 552 patients with Interstitial Cystitis, we used a complex network community discovery algorithm, directed weighted complex network, and Sankey map to mine the data of the symptoms composition of Interstitial Cystitis, the evolution of symptoms before and after treatment and the visualization of the community network, to analyze the epidemiological characteristics of interstitial cystitis symptoms in the real world. By the community division of the complex network of interstitial cystitis symptoms, We finally obtained three core symptom communities. Among them, symptom community A (bladder‐related symptoms) is the symptom community with the highest proportion of nodes (60.00%) in the complex network of Interstitial Cystitis, symptom community B (non‐bladder‐related symptoms 1) ranks second (32.00%) in a complex network of Interstitial Cystitis, and symptom community C (non‐bladder‐related symptoms 2) has the lowest proportion (8.00%). There is a complex evolutionary relationship between the symptoms of Interstitial Cystitis before and after treatment. Among the single symptoms before and after treatment, the decreased rate of Day frequency is 93.22%, and the reduced urgency rate is 93.07%. The decline rate of Nocturia was 82.33%. From the perspective of different communities, the overall symptoms of symptom community A decreased by 34.39% after treatment, the general symptoms of symptom community B decreased by 35.37%, and the prevalent symptoms of symptom community C decreased by 71.43%. In the case of using diet regulation treatment to treat bladder pain, the cure rate of bladder pain can reach 22.67%. The cure rate of burning in bladders can get 15.38% with Percutaneous Sacral neuromodulation, 96.95% with diet regulation treatment, and 100% with Percutaneous Sacral neuromodulation. When using behavioral physiotherapy to treat bladder pain, 3.57% of the patient's symptoms change to bladder discomfort; 4% of the patient's symptoms change to bladder discomfort when using oral medicine to treat bladder pain.Symptom research methods based on community findings can effectively explore the rule of symptom outcome of Interstitial Cystitis before and after treatment, and the results are highly interpretable by professionals. The cover image is based on the Original Article Research on symptoms composition, time series evolution, and network visualisation of interstitial cystitis based on complex network community discovery algorithm by Lei Pang et al., https://doi.org/10.1049/syb2.12083 [ABSTRACT FROM AUTHOR]

Data sharing and publication have been popular in recent years due to the abundance of options. Evaluating and extracting data from sizable valuable databases i.e., data mining has various challenges which include issues with security, privacy, and data integrity. Anonymized data is used in the majority of privacy preserving data publication approaches, depending on a few utilitarian measures. However, applications that have particular needs for the data they utilize might not be able to use the anonymized data. Practical data anonymization must work to accomplish two opposing objectives: to maintain the data's usefulness and to satisfy a specific privacy need. The utility loss when data is anonymized is frequently measured using generic utility metrics, such as the specific values generalized in a specific ontology. As a need for an application, we suggest equivalent specification, a technique that enables a data user to characterize some properties of the anonymized data. We also introduce the "split-and-mould" algorithm, a heuristic anonymization algorithm that applies a generalization method to the user-provided parameters. Our preliminary results indicate that the specification format and procedure can improve significantly the utility of the anonymized data for data mining that develop predictive models, like decision trees (DTs) and Naïve Bayes. [ABSTRACT FROM AUTHOR]

The paper contributes to the further development of platform studies by looking at the early stages of development. It draws on insights from an exemplary research and innovation project that aimed to develop a "diversity-aware online social platform". The article takes a co-productive stance. It is thus characterised by both critical analysis and active engagement. From this insider perspective, it discusses how emerging tensions were navigated in the attempt to develop a new diversity-oriented platform and how this affected the enactment of the idealistic motive to promote diversity that formed the initial objective for the project. The empirical observations are then engaged in conversation with insights from the fields of critical innovation and platform studies. These perspectives are mobilised to fathom how Silicon Valley agendas influence innovation imperatives that focus on rapid scalability through automation, privileging a narrow problem-solving mentality. It is argued that these imperatives limit the adoption of alternative platform models from the early stages of planning, design, and development in ways that trap innovators in the same logics that created the problems they are trying to respond to in the first place.

In the process of Canny edge detection, a large number of high complexity calculations such as Gaussian filtering, gradient calculation, non-maximum suppression, and double threshold judgment need to be performed on the image, which takes up a lot of operation time, which is a great challenge to the real-time requirements of the algorithm. The traditional Canny edge detection technology mainly uses customized equipment such as DSP and FPGA, but it has some problems, such as long development cycle, difficult debugging, resource consumption, and so on. At the same time, the adopted CUDA platform has the problem of poor cross-platform. In order to solve this problem, a fine-grained parallel Canny edge detection method is proposed, which is optimized from three aspects: task partition, vector memory access, and NDRange optimization, and CPU-GPU collaborative parallelism is realized. At the same time, the parallel Canny edge detection methods based on multi-core CPU and CUDA architecture are designed. The experimental results show that OpenCL accelerated Canny edge detection algorithm (OCL_Canny) achieves 20.68 times acceleration ratio compared with CPU serial algorithm at 7452 × 8024 image resolution. At the image resolution of 3500 × 3500, the OCL_Canny algorithm achieves 3.96 times the acceleration ratio compared with the CPU multi-threaded Canny parallel algorithm. At 1024 × 1024 image resolution, the OCL_Canny algorithm achieves 1.21 times the acceleration ratio compared with the CUDA-based Canny parallel algorithm. The effectiveness and performance portability of the proposed Canny edge detection parallel algorithm are verified, and it provides a reference for the research of fast calculation of image big data. [ABSTRACT FROM AUTHOR]

Big data provide massive samples and resources for exploring the operating rules of public transportation. This article proposes a method that combines multiple data sources to identify potential bus passenger flows, aiming to address the issue of insufficient identification accuracy with a single data source. First, the spatially weighted K-means algorithm and improved DBSCAN algorithm are designed to partition traffic zones and residents' travel flow OD is extracted based on mobile phone signaling data. Second, using bus IC card data and vehicle trajectory data, a method for identifying bus passenger boarding and alighting stops based on spatiotemporal clustering is proposed and the bus passenger flow OD for each traffic zone is calculated. By comparing the resident travel flow OD with the bus passenger flow OD, we set a threshold for the potential bus passenger demand proportion. Finally, the analysis is conducted using actual data from a city in central China. The city is divided into 43 traffic zones, with the maximum bus passenger flow proportion between zones being 14.9%, the minimum being 5.0%, and the average being 7.2%. The initial threshold for the potential bus passenger demand proportion is thus set to 7.2%, and a sensitivity analysis is conducted by gradually decreasing the threshold in increments of 0.5% to 6.7%, 6.2%, 5.7%, and 5.2%. The corresponding potential bus passenger demand OD pairs between traffic zones are identified as 419, 358, 245, 151, and 51. Urban managers should focus on the 51 pairs with relatively large potential flows to gradually optimize and balance the development of the bus network based on actual conditions. The method proposed provides important theoretical and practical support for effectively optimizing urban bus networks. However, there are limited indicators for identifying potential passenger flows; in the future, more multidimensional indicators will be taken into consideration., Author(s): Lianghua Li [1,2]; Shouqiang Xue [3,4]; Yun Xiao (corresponding author) [3,4] 1. Introduction With the continuous advancement of urbanization in China, the transportation demand of urban residents is continually [...]