Search

Graph representation learning aims to effectively encode high-dimensional sparse graph-structured data into low-dimensional dense vectors, which is a fundamental task that has been widely studied in a range of fields, including machine learning and data mining. Classic graph embedding methods follow the basic idea that the embedding vectors of interconnected nodes in the graph can still maintain a relatively close distance, thereby preserving the structural information between the nodes in the graph. However, this is sub-optimal due to: (i) traditional methods have limited model capacity which limits the learning performance; (ii) existing techniques typically rely on unsupervised learning strategies and fail to couple with the latest learning paradigms; (iii) representation learning and downstream tasks are dependent on each other which should be jointly enhanced. With the remarkable success of deep learning, deep graph representation learning has shown great potential and advantages over shallow (traditional) methods, there exist a large number of deep graph representation learning techniques have been proposed in the past decade, especially graph neural networks. In this survey, we conduct a comprehensive survey on current deep graph representation learning algorithms by proposing a new taxonomy of existing state-of-the-art literature. Specifically, we systematically summarize the essential components of graph representation learning and categorize existing approaches by the ways of graph neural network architectures and the most recent advanced learning paradigms. Moreover, this survey also provides the practical and promising applications of deep graph representation learning. Last but not least, we state new perspectives and suggest challenging directions which deserve further investigations in the future., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

This paper introduces a model for the translation of natural language into ontology and vice versa in an autonomous navigation system of a sea-going vessel. The system comprehensively executes communication tasks at sea. The authors use machine learning methods in the field of text mining and basic and additional properties of ontologies. The newly developed ontology is applicable in shipping. The key elements of the prototype are the sequence of communication commands given from the ship's bridge, decomposition, extraction of the communication sequence and the rule base. The presented model has been implemented and verified in selected scenarios of collision situations at sea. The test results confirm that the assumptions, the designed system architecture and the algorithms in the prototype are correct., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Hatłas-Sowińska, Misztal. 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.)

Purpose: On the one hand, this paper is to further understand the residents' differentiated power consumption behaviors and tap the residential family characteristics labels from the perspective of electricity stability. On the other hand, this paper is to address the problem of lack of causal relationship in the existing research on the association analysis of residential electricity consumption behavior and basic information data. Design/methodology/approach: First, the density-based spatial clustering of applications with noise method is used to extract the typical daily load curve of residents. Second, the degree of electricity consumption stability is described from three perspectives: daily minimum load rate, daily load rate and daily load fluctuation rate, and is evaluated comprehensively using the entropy weight method. Finally, residential customer labels are constructed from sociological characteristics, residential characteristics and energy use attitudes, and the enhanced FP-growth algorithm is employed to investigate any potential links between each factor and the stability of electricity consumption. Findings: Compared with the original FP-growth algorithm, the improved algorithm can realize the excavation of rules containing specific attribute labels, which improves the excavation efficiency. In terms of factors influencing electricity stability, characteristics such as a large number of family members, being well employed, having children in the household and newer dwelling labels may all lead to poorer electricity stability, but residents' attitudes toward energy use and dwelling type are not significantly associated with electricity stability. Originality/value: This paper aims to uncover household socioeconomic traits that influence the stability of home electricity use and to shed light on the intricate connections between them. Firstly, in this article, from the perspective of electricity stability, the characteristics of the power consumption of residents' users are refined. And the authors use the entropy weight method to comprehensively evaluate the stability of electricity usage. Secondly, the labels of residential users' household characteristics are screened and organized. Finally, the improved FP-growth algorithm is used to mine the residential household characteristic labels that are strongly associated with electricity consumption stability. Highlights: The stability of electricity consumption is important to the stable operation of the grid. An improved FP-growth algorithm is employed to explore the influencing factors. The improved algorithm enables the mining of rules containing specific attribute labels. Residents' attitudes toward energy use are largely unrelated to the stability of electricity use. [ABSTRACT FROM AUTHOR]

In view of the problems in planning and recommending tour routes, this paper constructs a feature text mining (FTM) method and spatial accessibility model (SAM) as the key factors for scenic spot recommendation (SSR) and tour route recommendation (TRR). The scenic spot clustering algorithm (SSCA) based on FTM was constructed by tourists' text evaluation data mining. Considering the spatial attributes of scenic spots, the scenic spot topology tree algorithm (SSTTA) based on dynamic buffer spatial accessibility (DBSA) was constructed. The optimal scenic spots were recommended based on interest matching and spatial accessibility optimization. As to the recommended scenic spots, this paper proposes an optimal tour route recommendation algorithm (TRRA) based on SSTTA, which aims to determine the optimal adjacent section path structure tree (ASPST) with the lowest cost under travel constraints and transportation modes. The experiment verifies that the proposed algorithm can recommend scenic spots that match tourists' interests and have optimal spatial accessibility, and the optimal tour routes with the lowest costs under certain travel constraints. Compared with the searched sub-optimal tour routes, the optimal tour route recommended by the proposed algorithm produces the lowest travel costs, and all the scenic spots in the tour route meet the tourists' interests. Compared with the commonly used BDMA and GDMA methods, the proposed algorithm can determine the optimal routes with lower travel costs. [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 view of the existing traffic signal detection algorithms, which require a large amount of computation and model, are difficult to deploy at the embedded end, and are difficult to detect long-distance traffic signals with a high miss rate, this paper designs a lightweight traffic signal detection algorithm for the embedded end, which aims at lightweight and real-time requirements. GhostNet network Ghost module and Ghost bottleneck layer structure are adopted to reduce the number of model parameters and improve the detection speed. To solve the feature similarity problem, the weighted bidirectional feature pyramid network is used to make the algorithm more sensitive to the target. The dense void space pyramid pool is used to optimize the extraction of global context information. Aiming at the problem of small target recognition, the information extraction of small target is enhanced through the improvement of multi-scale detection. Finally, the learning ability of the model is improved through knowledge distillation, and the detection performance is improved. Experimental results show that the recognition accuracy and recall rate of traffic lights by this detection algorithm reach 97.0% and 99% respectively, 2.7 and 3 percentage points higher than that of YOLOv5s. The model size is reduced to 8.06 MB, 58% of that of YOLOv5s, and the recognition rate is increased from 51 frames per second to 56 frames per second. Through testing in the embedded terminal, the improved algorithm can recognize the traffic signal in real time and accurately. [ABSTRACT FROM AUTHOR]

The crack image on the rail surface has a small target, many background interference information and a high resolution, making its target detection effect not ideal. In this regard, the paper proposes an improved target detection algorithm of YOLOV5s to improve the detection effect of rail cracks. The VOV-GSCSP module is introduced in the neck network, and the ordinary convolution is replaced by the lighter convolution method GSconv to reduce the computational effort of the network while retaining more detailed information. The feature pyramid structure is improved and a multipath cross-layer fusion structure is proposed to incorporate the information of the backbone network across layers in the process of feature pyramid downsampling to retain more original feature information and improve the accuracy of target detection. Meanwhile, the CA attention module and Transformer structure are introduced to further enhance the information extraction of higher-order semantics. The experimental results show that the improved YOLOV5s algorithm achieves an average mean accuracy (mAP) of 62.4%, which is 6.2 percentage points better than the original YOLOV5s algorithm; the recall rate (Recall) is 92.2%, which is 4.4 percentage points better. [ABSTRACT FROM AUTHOR]

Clustering is an effective statistical data analysis technique; it has several applications, including data mining, pattern recognition, image analysis, bioinformatics, and machine learning. Clustering helps to partition data into groups of objects with distinct characteristics. Most of the methods for clustering use manually selected parameters to find the clusters from the dataset. Consequently, it can be very challenging and time-consuming to extract the optimal parameters for clustering a dataset. Moreover, some clustering methods are inadequate for locating clusters in high-dimensional data. To address these concerns systematically, this paper introduces a novel selection-free clustering technique named data point positioning analysis (DPPA). The proposed method is straightforward since it calculates 1-NN and Max-NN by analyzing the data point placements without the requirement of an initial manual parameter assignment. This method is validated using two well-known publicly available datasets used in several clustering algorithms. To compare the performance of the proposed method, this study also investigated four popular clustering algorithms (DBSCAN, affinity propagation, Mean Shift, and K-means), where the proposed method provides higher performance in finding the cluster without using any manually selected parameters. The experimental finding demonstrated that the proposed DPPA algorithm is less time-consuming compared to the existing traditional methods and achieves higher performance without using any manually selected parameters. [ABSTRACT FROM AUTHOR]

Introduction: Data mining in healthcare is a nascent arena of research in healthcare. Heterogeneity of Diabetes Mellitus in terms of clinical presentation calls for newer methods of research to study potential risk factors. Aim: The paper aims to use clustering techniques to identify the relationship between the four variables, namely the pre-prandial and postprandial sugar level, age and sex. Methods: The data was taken from a diagnostic laboratory in Wagholi, Pune. We conducted K-mean algorithm, EM algorithm, model-based clustering and t-mixture model. Results: It is evidenced that the data was best fitted to the t-mixture model. Our 50% samples were people with diabetes, 17% had prediabetes. Trivial correlation existed between age and sugar level. Males and females were equally at risk of having diabetes. Data presented concludes that age and sex have no effect on the risk of having diabetes. Data mining can be used to deduce meaningful clusters to drive plan-based interventions in the population. Conclusion: Methods of data mining can be used to deduce meaningful clusters in a heterogeneous dataset thus providing policymakers and healthcare researchers with novel information that will potentially contribute in formulating evidence-based policies. [ABSTRACT FROM AUTHOR]

The large amount of data generated every day makes necessary the re-implementation of new methods capable of handle with massive data efficiently. This is the case of Association Rules, an unsupervised data mining tool capable of extracting information in the form of IF-THEN patterns. Although several methods have been proposed for the extraction of frequent itemsets (previous phase before mining association rules) in very large databases, the high computational cost and lack of memory remains a major problem to be solved when processing large data. Therefore, the aim of this paper is three fold: (1) to review existent algorithms for frequent itemset and association rule mining, (2)to develop new efficient frequent itemset Big Data algorithms using distributive computation, as well as a new association rule mining algorithm in Spark, and (3) to compare the proposed algorithms with the existent proposals varying the number of transactions and the number of items. To this purpose, we have used the Spark platform which has been demonstrated to outperform existing distributive algorithmic implementations. [ABSTRACT FROM AUTHOR]

Identifying all frequent high utility occupancy itemsets (FHUOIs) in a quantitative transaction dataset is a new trend in data mining. By combining both factors of frequency and utility occupancy, these patterns are more suitable for several applications in the real world. These patterns not only reflect the interests of most users but also contribute a high proportion of the utility in supporting transactions. Nonetheless, the set of all discovered FHUOIs may be very large, especially for large and dense datasets or for low values of predefined minimum thresholds. For this reason, it is often quite challenging for users to analyze and use the obtained patterns. To address this issue, this paper proposes two novel algorithms named MaxCloFHUOIM and CloFHUOIM to extract compact representations of FHUOIs. The former is designed to simultaneously mine two concise representations of FHUOIs that consist of all closed FHUOIs and all maximal FHUOIs, whereas the latter only discovers the closed FHUOIs, which provide a lossless summary of all FHUOIs. The proposed algorithms rely on a novel weak upper bound on utility occupancy, to reduce the search space by quickly pruning itemsets with low utility occupancy. Especially, the algorithms integrate two new efficient strategies to prune non-closed FHUOI candidate branches early in the prefix search tree. Results from an in-depth experimental evaluation conducted on several benchmark real-life and synthetic quantitative datasets demonstrate that MaxCloFHUOIM and CloFHUOIM have excellent performance in terms of runtime, memory usage, and scalability. In particular, the proposed algorithms are up to two orders of magnitude faster than a baseline algorithm. [ABSTRACT FROM AUTHOR]

Clustering is an important technique for data mining and machine learning. In this paper, a novel clustering algorithm, scale division and region growing (SRG), is proposed, which is based on scale division and region growing. This method uses the division-and-merge strategy, which consists of two primary phases, namely the division phase and the merging phase. In the division phases, the data is mapped to a two-dimensional space, and the clustering problem is transformed to an image processing problem. Then the image is divided into different scales to adaptively find the appropriate scale. After finding the appropriate scale, the region growing is carried out under this scale and the multiple sub-clusters are created. In the merging phases, the sub-clusters are evaluated and merged to form the final clusters in the dataset. The proposed algorithm is tested on 15 benchmark datasets including both the synthetic datasets and the real datasets, and it is found that SRG can obtain better clustering results and has higher accuracy than other typical clustering algorithms. Moreover, the experimental results on noisy datasets show that the proposed algorithm has good robustness. [ABSTRACT FROM AUTHOR]

The theory of Formal Concept Analysis (FCA) finds diverse applications in fields like knowledge extraction, cognitive concept learning and data mining. The construction of a concept lattice significantly influences the effectiveness of formal concept analysis; hence, the development of high-performance algorithms for concept construction is crucial. In this paper, we introduce a novel algorithm called "Bit-Close" for formal concept construction. Bit-Close leverages bit representation and operations, fundamental to computer science, to enhance the In-Close algorithm. Furthermore, we explore the parallel method of Bit-Close. Our experimental results, obtained from multiple public and random datasets, demonstrate that Bit-Close outperforms In-Close by approximately 20% and is significantly better than other competing algorithms. [ABSTRACT FROM AUTHOR]

Under the influence of air humidity, dust, aerosols, etc., in real scenes, haze presents an uneven state. In this way, the image quality and contrast will decrease. In this case, It is difficult to detect the target in the image by the universal detection network. Thus, a dual subnet based on multi-task collaborative training (DSMCT) is proposed in this paper. Firstly, in the training phase, the Gated Context Aggregation Network (GCANet) is used as the supervisory network of YOLOX to promote the extraction of clean information in foggy scenes. In the test phase, only the YOLOX branch needs to be activated to ensure the detection speed of the model. Secondly, the deformable convolution module is used to improve GCANet to enhance the model's ability to capture details of non-homogeneous fog. Finally, the Coordinate Attention mechanism is introduced into the Vision Transformer and the backbone network of YOLOX is redesigned. In this way, the feature extraction ability of the network for deep-level information can be enhanced. The experimental results on artificial fog data set FOG_VOC and real fog data set RTTS show that the map value of DSMCT reached 86.56% and 62.39%, respectively, which was 2.27% and 4.41% higher than the current most advanced detectionmodel. The DSMCT network has high practicality and effectiveness for target detection in real foggy scenes. [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]

Our heart is one of the most fundamental or significant parts of our body. The heart is responsible for maintaining blood flow and forming it. There are thousands of cases on the planet connected to heart disease. A growing number of people are committing suicide because of coronary illness. Different side effects like chest pain, fast heartbeat, etc are referenced. The medical industry tracks down information. This paper discusses anticipating coronary illness using computer-aided calculations. Here, we will utilize different AI calculations like a help vector classifier, K-means, and D-tree algorithms. Calculations are used based on highlights and to anticipate coronary illness. By applying data mining techniques, it takes less time to predict disease. Based on the highlights, computations forecast cardiac illness. Using data mining techniques like D-tree and K-means algorithms speeds up and enhances disease prediction precision. [ABSTRACT FROM AUTHOR]

Feature selection is an important preprocessing step in many data science and machine learning applications. Although there exist several sophisticated feature selection algorithms, their benefits are sometimes overshadowed by their complexity and slow execution. Therefore, in many cases, a more simple algorithm may be better suited. In this paper, we demonstrate that a rudimentary forward selection algorithm can achieve optimal performance with a low time complexity. Our study is based on an extensive empirical evaluation of the forward feature selection algorithm in the context of linear regression. Concretely, we compare the forward selection algorithm against the gold standard exhaustive search algorithm based on several datasets. The results show that the forward selection algorithm achieves high performance with relatively fast execution. Given the simplicity, accuracy, and speed of the forward feature selection algorithm, we recommend it as a primary feature selection method for most regression applications. Our results are particularly pertinent in the case of big data and real-time analysis. [ABSTRACT FROM AUTHOR]

Association rule mining (ARM) is a widely used technique in data mining for pattern discovery. However, association rule mining in numerical data poses a considerable challenge. In recent years, researchers have turned to optimization-based approaches as a potential solution. One particular area of interest in numerical association rules mining (NARM) is controlling the length of itemset intervals. In this paper, we propose a novel evolutionary algorithm based on the multi-objective firefly algorithm for efficiently mining numerical association rules (MOFNAR). MOFNAR utilizes Balance, square of cosine (SOC) and comprehensibility as objectives of evolutionary algorithm to assess rules and achieve a rule set that is both simple and accurate. We introduce the Balance measure to effectively control the intervals of numerical itemsets and eliminate misleading rules. Furthermore, we suggest a penalty approach, and the crowding-distance method is employed to maintain high diversity. Experimental results on five well-known datasets show the effectiveness of our method in discovering a simple rule set with high confidence that covers a significant percentage of the data. [ABSTRACT FROM AUTHOR]

Literature screening is the process of identifying all relevant records from a pool of candidate paper records in systematic review, meta-analysis, and other research synthesis tasks. This process is time consuming, expensive, and prone to human error. Screening prioritization methods attempt to help reviewers identify most relevant records while only screening a proportion of candidate records with high priority. In previous studies, screening prioritization is often referred to as automatic literature screening or automatic literature identification. Numerous screening prioritization methods have been proposed in recent years. However, there is a lack of screening prioritization methods with reliable performance. Our objective is to develop a screening prioritization algorithm with reliable performance for practical use, for example, an algorithm that guarantees an 80% chance of identifying at least 80% of the relevant records. Based on a target-based method proposed in Cormack and Grossman, we propose a screening prioritization algorithm using sampling with replacement. The algorithm is a wrapper algorithm that can work with any current screening prioritization algorithm to guarantee the performance. We prove, with mathematics and probability theory, that the algorithm guarantees the performance. We also run numeric experiments to test the performance of our algorithm when applied in practice. The numeric experiment results show this algorithm achieve reliable performance under different circumstances. The proposed screening prioritization algorithm can be reliably used in real world research synthesis tasks. [ABSTRACT FROM AUTHOR]

Techniques for classifying data using data mining are now a day prevalent in agriculture. The method of classifying seeds involves grouping various seed varieties according to their morphological characteristics. To accomplish categorization of the typical Charotar region (generally comprising Anand and Kheda districts of the Gujarat State of India) Gujarat Wheat (GW) varieties (TRITICUM – AESTIVUM) viz. GW 273, GW 496, GW 322, LOK-1, and GDW 1255 (TRITICUM – DURUM), Weka Explorer was used. The features used are area, perimeter, solidity, aspect ratio, major and minor axis of seed kernel, Hue, Saturation, Value, and SF1 (empirical). Features reduction was done using Information Gain (IG) and its modified version Gain Ratio (GR). This paper compares performance of Tree based data mining algorithms in classifying wheat varieties. For classification we used purely tree-based machine learning algorithms viz. J48, Random Forest, Hoeffding Tree, Logistic Model Tree (LMT), and REPTree. LMT- logistics regression method gives higher accuracy 96.4% compared to other classifiers. Hoeffding Tree classifiers stood second with 96% accuracy. For validation 10-fold cross validation was used. By reducing the number of folds in cross validation performance of most algorithms decreased except J48. The percentage of correctly classified instance increased for all algorithms when features were selected by GR except for J48. [ABSTRACT FROM AUTHOR]

Data mining has reached a state that is difficult to break through, while the scale of data is growing rapidly, due to the lack of traditional computing power and limited data storage space. Efficient and accurate extraction of valuable information from massive data has become a challenge. Researchers have combined quantum computing with data mining to address this problem, hence the concept of quantum data mining has emerged. The fundamental tenets of quantum physics are adhered to for information transmission and computing operations in quantum data mining, which use the states of minuscule particles to represent and process information. Quantum data mining are based on the characteristics of quantum computing, such as superposition and entanglement, which make the ability of computational and information extraction effectively improved. The paper discusses and summarizes the relevant literature on quantum data mining in recent 3 years. After introducing relevant basic concepts of quantum computing, quantum data mining is presented in five aspects: quantum data classification, quantum data clustering, quantum dimensionality reduction, quantum association rules, quantum linear regression, and quantum causal analysis. These approaches, based on quantum computing, offer new perspectives and tools for handling complex data mining tasks. In conclusion, the development of quantum data mining is promising and crucial to overcome the difficulties associated with large-scale data mining. [ABSTRACT FROM AUTHOR]

Classification is a widely used supervised learning technique that enables models to discover the relationship between a set of features and a specified label using available data. Its applications span various fields such as engineering, telecommunication, astronomy, and medicine. In this paper, we propose a novel rule-based classifier called RUCIB (RUle-based Classifier Inspired by BRADO), which draws inspiration from the socio-inspired swarm intelligence algorithm known as BRADO. RUCIB introduces two key aspects: the ability to accommodate multiple values for features within a rule and the capability to explore all data features simultaneously. To evaluate the performance of RUCIB, we conducted experiments using ten databases sourced from the UCI machine learning database repository. In terms of classification accuracy, we compared RUCIB to ten well-known classifiers. Our results demonstrate that, on average, RUCIB outperforms Naive Bayes, SVM, PART, Hoeffding Tree, C4.5, ID3, Random Forest, CORER, CN2, and RACER by 9.32%, 8.97%, 7.58%, 7.4%, 7.34%, 7.34%, 7.22%, 5.06%, 5.01%, and 1.92%, respectively. [ABSTRACT FROM AUTHOR]

It is obvious that the problem of Frequent Itemset Mining (FIM) is very popular in data mining, which generates frequent itemsets from a transaction database. An extension of the frequent itemset mining is High Utility Itemset Mining (HUIM) which identifies itemsets with high utility from the transaction database. This gains popularity in data mining, because it identifies itemsets which have more value but the same was not identified as frequent by Frequent Itemset Mining. HUIM is generally referred to as Utility Mining. The utility of the items is measured based on parameters like cost, profit, quantity or any other measures preferred by the users. Compared to high utility itemsets (HUIs) mining, high average utility itemsets (HAUIs) mining is more precise by considering the number of items in the itemsets. In state-of-the-art algorithms that mines HUIS and HAUIs use a single fixed minimum utility threshold based on which HAUIs are identified. In this paper, the proposed algorithm mines HAUIs from transaction databases using Artificial Fish Swarm Algorithm (AFSA) with computed multiple minimum average utility thresholds. Computing the minimum average utility threshold for each item with the AFSA algorithm outperforms other state-of-the-art HAUI mining algorithms with multiple minimum utility thresholds and user-defined single minimum threshold in terms of number of HAUIs. It is observed that the proposed algorithm outperforms well in terms of execution time, number of candidates generated and memory consumption when compared to the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Heterogeneous information networks (HINs) contain a rich network structure and semantic information, which makes them commonly used in recommendation systems. However, most of the existing HIN-based recommendation systems rely on meta-paths for information extraction, lack meta-path information supplements, and rarely learn complex structure information in heterogeneous graphs. To address these issues, we develop a novel recommendation algorithm that integrates the attention mechanism, meta-paths, and neighbor node information (AMNRec). In the heterogeneous information network, the missing information of the meta-path is supplemented by extracting the information of users and items' neighbor nodes. The rich interactions between nodes are captured through convolution, and the embedded representation of nodes and meta-paths is obtained through the attention mechanism. TOP-N recommendation is completed by combining users, items, neighbor nodes, and meta-paths. Experiments on three public datasets show that AMNRec not only has the best recommendation performance but also has good interpretability of the recommendation results compared with the six recommendation benchmark algorithms. [ABSTRACT FROM AUTHOR]

• A feature selection method based on binary dandelion algorithm is proposed. • The algorithm applies a sine-cosine operator and a restart strategy. • Mutual information and quick bit mutation improve the performance of the algorithm. • The algorithm performs well on datasets with larger dimensions. Feature selection (FS) is an important data preprocessing technology for machine learning and data mining. Metaheuristic algorithm (MH) has been widely used in feature selection because of its powerful search function. This paper presents an improved Binary Dandelion Algorithm using Sine Cosine operator and Restart strategy (SCRBDA) for feature selection. First, the sine cosine operator is used in the radius formula of the core dandelions (CD), which significantly enhances the ability of algorithm development and exploration. Secondly, the algorithm uses a restart strategy to increase its ability to get rid of local optimum. Thirdly, mutual information is used to guide the generation of some dandelions, which pays more attention to the correlation between the selected features and categories. Finally, quick bit mutation is used as the mutation strategy to improve the diversity of the population. The SCRBDA proposed in this paper was tested on 18 datasets of different sizes from UCI machine learning database. The SCRBDA was compared with 8 other classical feature selection algorithms, and the performance of the proposed algorithm was evaluated through feature subset size, classification accuracy, fitness value, and F1-score. The experimental results show that SCRBDA achieves the best performance, which has stronger feature reduction ability and achieves better overall performance on most datasets. Especially on large-scale datasets, SCRBDA can obtain extremely smaller feature subsets while maintaining much higher classification accuracy, and satisfactory F1-score. [ABSTRACT FROM AUTHOR]

Cluster analysis is one of the most important research issues in data mining and machine learning. To date, numerous clustering algorithms have been proposed to tackle the fixed-length vector data. In many real applications, we need to detect clusters from a set of discrete sequences in which each sequence is an ordered list of items. Due to the sequential and discrete nature, the discrete sequence clustering problem is more challenging and most of existing vector data clustering algorithms cannot be directly employed. In this paper, we present a stochastic algorithm for clustering discrete sequences. Our method first quickly generates a set of random partitions over the sequential data set and then merges these random clustering results via weighted graph construction and partition. We perform extensive empirical comparisons on real data sets to show that our method is comparable to those state-of-the-art clustering algorithms with respect to both accuracy and efficiency. • A randomized algorithm is proposed to solve the discrete sequence clustering issue. • Our algorithm provides high success rate for sequence linkage in clusters. • Experimental results demonstrate the feasibility and effectiveness of our method. [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]

• We propose an priori information extraction method based on filter combination. • We construct a comprehensive sample library containing various priori information. • We propose a similarity measure based on prior information for adaptive filtering. • A robust infrared small target detection algorithm is proposed. • Our algorithm detects low signal to clutter ratio targets with good performance. Infrared small target detection in complex backgrounds remains a big challenge due to its small size and weak energy, which makes it easy to be submerged in complex backgrounds. Common filtering algorithms are difficult to apply to various complex scenes and generate many false alarms and poor robustness. Therefore, this paper proposes an infrared small target detection algorithm based on filter kernel combination optimization learning method. For the sample image block use typical filter kernels and weight coefficients to calculate the combination of filtering results, and construct the loss function of the results and the true value. The optimal weight coefficients are learned using an optimization method, which effectively achieves the fusion of multiple features, then we build a sample library containing comprehensive priori information. In the implementation, an online inference method based on similarity measure is proposed to match test images with sample library image blocks to obtain optimal combination weights. By utilizing the comprehensive priori information to enhance the adaptive ability of the algorithm for various complex backgrounds. Finally, get the position of the infrared small target. The experimental results show that our algorithm has excellent detection performance for infrared small targets with complex background and low signal to clutter ratio, and the AUC value is 0.9980, which is more robust than other comparative algorithms. [ABSTRACT FROM AUTHOR]

The concept of k -core, which indicates the largest induced subgraph where each node has k or more neighbors, plays a significant role in measuring the cohesiveness and engagement of a network, and it is exploited in diverse applications, e.g., network analysis, anomaly detection, community detection, etc. However, recent studies have demonstrated the vulnerability of k -core under malicious perturbations which focus on removing the minimal number of edges to make k -core structures collapse. Despite this, to the best of our knowledge, no existing research has yet concentrated on the minimal number of edges that must be removed to collapse a specific node in the k -core. To address this issue, in this paper, we make the first attempt to study the robustness of individual nodes in k -core and propose the Targeted k -node Collapse Problem (TNCP) with three novel contributions. Firstly, we offer a general definition of TNCP problem with a proof of its NP-hardness. Secondly, in order to cover the TNCP problem, we propose a heuristic algorithm named TNC and its improved version named ATNC for implementations on large-scale networks. Finally, experiments on 20 real-world networks across various domains verify the superiority of our proposed algorithms over 6 baseline methods with detailed comparisons and analyses. Resource related to our study is publicly available at https://github.com/Yocenly/TNCP. [ABSTRACT FROM AUTHOR]

Deriving insight from data is a challenging task for researchers and practitioners, especially when working on spatio-temporal domains. If pattern searching is involved, the complications introduced by temporal data dimensions create additional obstacles, as traditional data mining techniques are insufficient to address spatio-temporal databases (STDBs). We hereby present a new algorithm, which we refer to as F1/FP, and can be described as a probabilistic version of the Minus-F1 algorithm to look for periodic patterns. To the best of our knowledge, no previous work has compared the most cited algorithms in the literature to look for periodic patterns—namely, Apriori, MS-Apriori, FP-Growth, Max-Subpattern, and PPA. Thus, we have carried out such comparisons and then evaluated our algorithm empirically using two datasets, showcasing its ability to handle different types of periodicity and data distributions. By conducting such a comprehensive comparative analysis, we have demonstrated that our newly proposed algorithm has a smaller complexity than the existing alternatives and speeds up the performance regardless of the size of the dataset. We expect our work to contribute greatly to the mining of astronomical data and the permanently growing online streams derived from social media. [ABSTRACT FROM AUTHOR]

This study introduces a novel algorithm tailored for the precise detection of lower outliers (i.e., data points at the lower tail) in univariate datasets, which is particularly suited for scenarios with a single cluster and similar data distribution. The approach leverages a combination of transformative techniques and advanced filtration methods to efficiently segregate anomalies from normal values. Notably, the algorithm emphasizes high-precision outlier detection, ensuring minimal false positives, and requires only a few parameters for configuration. Its unsupervised nature enables robust outlier filtering without the need for extensive manual intervention. To validate its efficacy, the algorithm is rigorously tested using real-world data obtained from photovoltaic (PV) module strings with similar DC capacities, containing various outliers. The results demonstrate the algorithm's capability to accurately identify lower outliers while maintaining computational efficiency and reliability in practical applications. [ABSTRACT FROM AUTHOR]

Language models (LMs) such as BERT and GPT have revolutionized natural language processing (NLP). However, the medical field faces challenges in training LMs due to limited data access and privacy constraints imposed by regulations like the Health Insurance Portability and Accountability Act (HIPPA) and the General Data Protection Regulation (GDPR). Federated learning (FL) offers a decentralized solution that enables collaborative learning while ensuring data privacy. In this study, we evaluated FL on 2 biomedical NLP tasks encompassing 8 corpora using 6 LMs. Our results show that: (1) FL models consistently outperformed models trained on individual clients' data and sometimes performed comparably with models trained with polled data; (2) with the fixed number of total data, FL models training with more clients produced inferior performance but pre-trained transformer-based models exhibited great resilience. (3) FL models significantly outperformed pre-trained LLMs with few-shot prompting. [ABSTRACT FROM AUTHOR]

Box-constrained optimization problems in the real m × n matrix space have been widely applied in big data mining. However, efficient solution of them is still a challenge. In this paper, a new nonmonotone line search rule is first proposed by extending the well-known ones and inheriting their advantages. Then, by analyzing and exploiting properties of this rule, a new nonmonotone spectral projected gradient algorithm is developed to solve the box-constrained optimization problems in the matrix space. Global convergence of the developed algorithm is also established. Numerical tests are conducted on a series of randomly generated test problems and those in the set of benchmark test problems. Compared with other existing nonmonotone line search rules, our rule shows its advantages in terms of the significantly reduced number of function evaluations and significantly reduced number of iterations. To further validate applicability of this research, we apply the studied optimization problem and the developed algorithm to solve the problems of image clustering. Numerical results demonstrate that the proposed method can generate better clustering results and is more robust than the similar ones available in the literature. [ABSTRACT FROM AUTHOR]

The mining of frequent itemsets and association rules is a core problem in data mining and an essential task in data analysis. In this paper, we present SufRec, a new algorithm for finding frequent itemsets and association rules. We give two versions. In both versions, the mining of the frequent itemsets is decomposed as a sequence of tasks. The first version (the SufRecDep algorithm) proceeds the tasks successively, each one using the results of the previous ones. The second version (the SufRecInd algorithm) performs the tasks independently of each other. Both versions are recursive with respect to the items and have thus the advantage to be particularly efficient for updating the mining process when new items are added to the database or when others are excluded. Moreover, the task-independent processing of SufRecInd makes it very easy to build parallel versions of SufRec. We present two parallel SufRec algorithms. With the first one, P-FIFO-SufRec, the processors perform the tasks according to the order in which the items appear in the database, preserving the recursive nature of SufRec. For second one, P-PAST-SufRec, the set of items is fixed and the tasks are pre-assigned to each processor. In order to evaluate the performance of SufRec, we carry out a consequent experimental study. In particular, we compare its running times with those of well-known parallel and non-parallel frequent itemsets mining algorithms. • Construction of SufRec, a new algorithm for frequent itemsets mining (FIM). • Construction of parallel versions of SufRec algorithm. • Experimental study comparing SufRec with well-known FIM algorithms. • Applications to the case where the list of items changes over time. [ABSTRACT FROM AUTHOR]

In the field of traffic management and control systems, we are witnessing a symbiotic evolution, where intelligent infrastructure is progressively collaborating with smart vehicles to produce benefits for traffic monitoring and security, by rapidly identifying hazardous behaviours. This exponential growth is due to the rapid development of deep learning in recent years, as well as the improvements in computer vision models. These technologies allow for monitoring tasks without the need to install numerous sensors or stop the traffic, using the extensive camera network of surveillance cameras already present in worldwide roads. This study proposes a computer vision-based solution that allows for real-time processing of video streams through edge computing devices, eliminating the need for Internet connectivity or dedicated sensors. The proposed system employs deep learning algorithms and vision techniques that perform vehicle detection, classification, tracking, speed estimation, and vehicle geolocation., Author(s): Jaime Villa (corresponding author) [1]; Franz García [1]; Rubén Jover [2]; Ventura Martínez [2]; José M. Armingol [1] 1. Introduction In the 21st century, where mobility is at the [...]

The application of network formulaology and network pharmacology has significantly advanced the scientific understanding of traditional Chinese medicine (TCM) treatment mechanisms in disease. The field of herbal biology is experiencing a surge in data generation. However, researchers are encountering challenges due to the fragmented nature of the data and the reliance on programming tools for data analysis. We have developed TCMNPAS, a comprehensive analysis platform that integrates network formularology and network pharmacology. This platform is designed to investigate in-depth the compatibility characteristics of TCM formulas and their potential molecular mechanisms. TCMNPAS incorporates multiple resources and offers a range of functions designed for automated analysis implementation, including prescription mining, molecular docking, network pharmacology analysis, and visualization. These functions enable researchers to analyze and obtain core herbs and core formulas from herbal prescription data through prescription mining. Additionally, TCMNPAS facilitates virtual screening of active compounds in TCM and its formulas through batch molecular docking, allowing for the rapid construction and analysis of networks associated with "herb-compound-target-pathway" and disease targets. Built upon the integrated analysis concept of network formulaology and network pharmacology, TCMNPAS enables quick point-and-click completion of network-based association analysis, spanning from core formula mining from clinical data to the exploration of therapeutic targets for disease treatment. TCMNPAS serves as a powerful platform for uncovering the combinatorial rules and mechanism of TCM formulas holistically. We distribute TCMNPAS within an open-source R package at GitHub (https://github.com/yangpluszhu/tcmnpas), and the project is freely available at http://54.223.75.62:3838/. [ABSTRACT FROM AUTHOR]

Clinical narratives commonly use acronyms without explicitly defining their long forms. This makes it difficult to automatically interpret their sense as acronyms tend to be highly ambiguous. Supervised learning approaches to their disambiguation in the clinical domain are hindered by issues associated with patient privacy and manual annotation, which limit the size and diversity of training data. In this study, we demonstrate how scientific abstracts can be utilised to overcome these issues by creating a large automatically annotated dataset of artificially simulated global acronyms. A neural network trained on such a dataset achieved the F1-score of 95% on disambiguation of acronym mentions in scientific abstracts. This network was integrated with multiword term recognition to extract a sense inventory of acronyms from a corpus of clinical narratives on the fly. Acronym sense extraction achieved the F1-score of 74% on a corpus of radiology reports. In clinical practice, the suggested approach can be used to facilitate development of institution-specific inventories. [ABSTRACT FROM AUTHOR]

Single-image super-resolution (SISR) techniques have found wide applications in semiconductor defect inspection. Enhancing image resolution to improve inspection sensitivity and accuracy holds great significance. A novel SISR algorithm, called cross-convolutional residual network (CCRN), is proposed in this study. CCRN comprises a cross-convolutional module (CCM), which incorporates a cross-sharing mechanism that facilitates the fusion of features from different stages, enabling the extraction of more information from the image. Moreover, a global residual aggregation structure (GRA) is introduced. GRA captures and transfers different levels of residual features acquired from learning each CCM to the reconstruction layer. Experimental results demonstrate that the proposed SR algorithm outperforms existing state-of-the-art SR algorithms in terms of both visual and quantitative metrics when applied to optical, SEM, and TEM images of microfluidic chips, CMOS image sensors, and quantum dots, respectively. Additionally, CCRN significantly improves the accuracy of defect classification and inspection of unpatterned wafers, as evaluated using the WM-811K dataset. Notably, an increase in local defection testing accuracy from 79.00% to 89.00% and an improvement in classification accuracy from 93.69% to 96.06% are achieved. These findings underscore the potential applications of the proposed algorithm in improving semiconductor defect inspection and classification accuracies. [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]

Deep-learning algorithms hold promise in processing physiological signal data, including electrocardiograms (ECGs) and electroencephalograms (EEGs). However, healthcare often requires long-term monitoring, posing a challenge to traditional deep-learning models. These models are generally trained once and then deployed, which limits their ability to adapt to the dynamic and evolving nature of healthcare scenarios. Continual learning—known for its adaptive learning capabilities over time—offers a promising solution to these challenges. However, there remains an absence of consolidated literature, which reviews the techniques, applications, and challenges of continual learning specific to physiological signal analysis, as well as its future directions. Bridging this gap, our review seeks to provide an overview of the prevailing techniques and their implications for smart healthcare. We delineate the evolution from traditional approaches to the paradigms of continual learning. We aim to offer insights into the challenges faced and outline potential paths forward. Our discussion emphasizes the need for benchmarks, adaptability, computational efficiency, and user-centric design in the development of future healthcare systems. [ABSTRACT FROM AUTHOR]

The rapid technological evolution of the last years has motivated students to develop capabilities that will prepare them for an unknown future in the 21st century. In this context, many teachers intend to optimise the learning process, making it more dynamic and exciting through the introduction of gamification. Thus, this article focuses on a data-driven assessment of geometry competencies, which are essential for developing problem-solving and higher-order thinking skills. Our main goal is to adapt, evaluate and compare Bayesian Knowledge Tracing (BKT), Performance Factor Analysis (PFA), Elo, and Deep Knowledge Tracing (DKT) algorithms applied to the data of a geometry game named Shadowspect, in order to predict students' performance by means of several classifier metrics. We analysed two algorithmic configurations, with and without prioritisation of Knowledge Components (KCs) - the skills needed to complete a puzzle successfully, and we found Elo to be the algorithm with the best prediction power with the ability to model the real knowledge of students. However, the best results are achieved without KCs because it is a challenging task to differentiate between KCs effectively in game environments. Our results prove that the above-mentioned algorithms can be applied in formal education to improve teaching, learning, and organisational efficiency. [ABSTRACT FROM AUTHOR]

Byline: L. Dahloum, Q. Benameur and A. Yakubu Keywords: egg weight, Mallard duck, artificial neural network, automatic linear modelling, classification and regression tree, multivariate linear regression. INTRODUCTION Eggs have acquired [...]