Search

Keyphrase Extraction is an automatic task that involves identifying the key words or phrases that capture the main content of an article. It is useful for various downstream tasks, including text search, text clustering, and text classification. Embedding-based methods for keyphrase extraction have shown promising results by utilizing pre-trained language models to represent candidate phrases and documents separately. These methods then rank the candidate phrases based on the cosine similarity between the document and the candidate phrases embeddings. However, there are mainly two shortcomings in such methods: I) Redundancy errors, when there are partial repetitions of candidate keyphrases, the methods tend to use redundant long phrases as keyphrases; II) Low keyphrase coverage, such as some keyphrases used to describe locally important information are ignored. In this paper, we propose an unsupervised keyphrase extraction method called "MICRank", which evaluates the importance of candidate keyphrases from three perspectives: global information, local information, and attribute information, and solved the aforementioned issues. The experimental results on six benchmarks demonstrate that the proposed MICRank method outperforms the state-of-the-art unsupervised keyphrase extraction methods. In addition, this paper improves the judgment criterion of correct keyphrase extraction and introduces a new evaluation metric called S1@M (M ∈ {5,10,15}) to address the issue of synonyms being considered incorrect predictions. [ABSTRACT FROM AUTHOR]

In allusion to the privacy and security problems, a secure multi-channel information protection scheme based on an integrated optical device is proposed in this paper. The information to be encrypted and shared is converted into a QR code. For supporting the multi-channel encryption, a 1- n w encryption algorithm is employed, which possesses the capability to map the original image information into n w seemingly random cipher images. In terms of hardware, an ultra-compact optical encryption device is designed, which consists of two rows of ring resonators coupled to the waveguide. This novel encryption device can output ten cipher images, each transmitted on a separate channel. Meanwhile, the vertical-cavity surface-emitting laser subject to optical injection and optical feedback is researched to generate optical chaos sequences, which are introduced for key generation and QR code encryption. Ultimately, combining the 1- n w encryption algorithm and optical chaos, information protection is implemented based on integrated optics. The simulation results demonstrate the practical feasibility and remarkable effectiveness of the proposed scheme. Furthermore, various security and robustness analyses are performed, and the results reveal that the proposed information protection scheme has a high level of security and robustness. This work is of great significance for the development of optical encryption chips and provides potential applications for secure data sharing. [ABSTRACT FROM AUTHOR]

DNA sequence motif discovery is an important issue in gene research, which helps identify transcription factor binding sites in DNA sequences to reveal the mechanisms that regulate gene expression. However, the growing awareness of privacy protection and increasingly stringent regulations pose challenges to data collection and usage. This paper proposes DP-FLMD, a privacy-preserving federated framework for discovering DNA sequence motifs. We employ federated learning, allowing participants to store their raw data locally and upload only selected parameters to protect data privacy. Nevertheless, privacy concerns still persist, as these participant parameters may potentially compromise their privacy to some extent. To enhance privacy protection, we incorporate a differential privacy algorithm to add noise to these parameters. Additionally, we verify that the method satisfies ϵ -differential privacy through theoretical analysis. Extensive experiments are performed on six datasets, demonstrating that DP-FLMD achieves a good trade-off between privacy and utility. Besides, we investigate the effect of parameters on DP-FLMD. In the future, our research will focus on exploring enhanced privacy protection mechanisms, expanding the scope of framework applications, and further optimizing the trade-off between privacy and utility. • Federated learning for DNA sequence motifs discovery. • A strategy for reducing communication costs. • Alleviating privacy concerns in distributed DNA sequence motif discovery. • The new algorithm achieves a better trade-off between privacy and utility. [ABSTRACT FROM AUTHOR]

The standard NMF algorithm is not suitable for sampling data from low-dimensional manifolds embedded in high-dimensional environmental spaces, as the geometric information hidden in feature manifolds and sample manifolds is rarely learned. In order to obtain better clustering performance based on NMF, manifold and orthogonal constraint, a new type of model named Orthogonal Graph regularized Non-negative Matrix Factorization model under Sparse Constraints (OGNMFSC) is proposed. Firstly, this type of model constructs a nearest neighbor graph to encode the geometric information of the data space, in order to obtain more discriminative ability by preserving the structure of the graph. Secondly, this type of model adds orthogonal constraints to achieve better local representation and significantly reduce the inconsistency between the original matrix and the basis vectors. Thirdly, by adding sparse constraints to obtain a sparser representation matrix, the clustering performance of the model can be improved. The main conclusion of this paper is that two effective algorithms have been generated to solve the model, which not only provides theoretical convergence proof for these two algorithms, but also demonstrates significant clustering performance in experiments compared to classical models such as K-means, PCA, NMF, Semi-NMF, NMFSC, ONMF, GNMF, NeNMF. • Effectively combining graph regularization, orthogonality and sparsity. • The convergence proof of the new model's algorithm has been obtained. • Compared with NMF, ONMF and etc, this model has shown good results in experiments. • Explain the effective combination of orthogonality, graph, sparsity via experiments. [ABSTRACT FROM AUTHOR]

This research introduces Automated Cost-Duration Variance Prediction (CDVP) system to empower project managers to proactively predict project budget, duration, cost variance and duration variance. The research involved the development and comparison of a total of 48 machine learning (ML) algorithms, with 12 algorithms dedicated to each predictive model. To conduct the study, a dataset comprising 1277 historical cases of Field Canals Improvement Projects (FCIPs) was utilized. Factor analysis and stepwise regression analysis were employed for feature selection where five key drivers were identified from the initial 25 parameters. The paper optimized the performance of each algorithm based on Bayesian optimization. The proposed system produces four outputs: project cost, project cost variance, project duration, and duration variance. The developed ML models were able to predict all of the system's outputs with an adjusted determination coefficient R2 score greater than 0.93 and Mean Absolute Percentage Error (MAPE) less than 8.97. Environmentally, this research recommends to assess CO 2 emissions as a performance criterion to select the low environmental impact algorithms. As a result, Light Gradient Boosting Machine (LightGBM) and AdaBoost Regressor were green sustainable algorithms that emitted on average 58 and 69 CO 2e grams per computational hours. To enhance interpretability, the study employed the SHapley Additive exPlanations (SHAP) technique to provide explanations for the key drivers. [ABSTRACT FROM AUTHOR]

In artificial intelligence applications, advanced computational models, such as deep learning, are employed to achieve high accuracy, often requiring the execution of numerous operations. Conversely, lightweight computational models are typically more resource-efficient, making them suitable for various devices, including smartphones, tablets, and wearable technology. This paper presents an ultra-low-computation solution for interpreting sign languages to assist deaf and hard-of-hearing individuals without needing specialized hardware or significant computational resources. The proposed approach initially performs data abstraction on the input data. During this process, the image is systematically scanned from various perspectives, and the collected information is then encoded into a one-dimensional vector. Subsequently, the abstracted information undergoes processing through a Fully Connected Neural Network (FCN), resulting in highly accurate output. We also introduced two abstraction methods, namely Opaque and Glass, inspired by the interaction of light with different types of objects. The proposed abstractions facilitate the comprehension of the hand gesture's outer boundary as well as its row-wise and column-wise density of pixels. Our experiments on three datasets confirm the efficiency of the proposed method, achieving an accuracy of 99.4% in recognizing American Sign Language, 99.96% accuracy in recognizing Indian Sign Language, and 99.95% accuracy in recognizing Bangla Sign Language. Notably, the model size and the number of MAC operations are significantly smaller than state-of-the-art computational models trained on the same datasets. • We introduced an ultra-low-computation method for interpreting sign languages. • We developed a new encoding for the abstraction of hand gesture images. • Our approach significantly reduces both model size and MAC operations. • We achieved high accuracy in understanding American, Indian, and Bangla SLs. [ABSTRACT FROM AUTHOR]

Common subspace learning methods only utilize local or global structure in feature extraction, and cannot obtain the global optimal discriminative projection matrix. For this reason, this paper proposes a discriminative sparse subspace learning method based on the manifold regularization framework (DSSL-MR), which introduces the graph Laplacian matrix that reflects the intrinsic geometric structure of the sample as a penalty term. DSSL-MR simultaneously uses both sub-manifold and multi-manifold information of samples for obtaining optimal projection to enhance the discriminability of different classes in subspace. DSSL-MR uses the sparse property of the L 2 , 1 -norm to constrain the projection matrix, which can eliminate redundant features and select features that are significant for classification. It is a linear supervised method, which belongs to the Fisher discriminant analysis framework. Experimental results on multiple real-world datasets show that the algorithm is very effective in classification and has high recognition rates. • Subspace learning and spectral graphs are combined into a unified learning framework. • The learned projection maps samples to the subspace with optimal class separation. • The manifold regularization framework fusing decision boundary and subspace learning. • The sample structure is analyzed by fusing multimanifold and submanifold information. [ABSTRACT FROM AUTHOR]

Emergency Medical Services are essential for health systems as their effective management can improve patient prognosis. Nevertheless, designing an optimized distribution of resources is a difficult task due to the complex nature of these systems. Moreover, locating the resources is particularly challenging in heterogeneous density territories where, in addition to their efficient management, the equity principle in the medical access of inhabitants of rural areas is also desirable. This paper approaches the ambulance (re)location–allocation problem in the geographical area of the Basque Country. The area has three major cities, which account for a third of the emergencies, while there are few emergencies in rural areas, with a sparse population. To that end, a two-stage stochastic 0-1 integer linear programming model that balances the response time between densely populated and isolated areas is proposed. Specifically, the model incorporates two relevant principles: (1) optimizing emergency attendance through the option of allocating ambulances via a multi-interval response time and (2) equitably responding to emergencies so remote areas are not neglected. Conducted experiments have been validated and indicate that the proposed model can improve the success rate in rural areas by 23 percentage points, while reducing the overall success rate by less than 9 percentage points. • We develop two data-driven ambulance (re)location–allocation stochastic models. • Two objectives: Concern for regional equity while maintaining efficiency. • Multi-interval response times are optimized in the Basque Emergency Medical Service. • Robust and global validated results show an improvement in success rates. [ABSTRACT FROM AUTHOR]

The recent multi-objective optimization problems are very complex which require an effective and robust evolutionary method for obtaining a global Pareto-optimal solutions. Most of these multi-objective evolutionary techniques are population-based methods which usually work on random search approaches and often trapped into local minima during their execution. A new fuzzy tuned mayfly algorithm (FTMA) is presented in this paper, to obtain the Pareto-optimal solutions for any complex multi-objective power system problem. It has a self-adapting global exploration capability to get the best Pareto-optimal solutions by varying two crucial parameters i.e., crossover (P c) and mutation P m probabilities. Moreover, a model of Pareto-dominance is employed to rank non-dominating solutions to maintain the diversity within the populations. The proposed evolutionary approach is examined on a standard ZDT benchmark test suite and its algorithmic performance is statistically compared with a few of the recent optimization techniques such as NSGA-II, NSGA-III, MMODE, MOAVOA and MMA algorithm. It is further applied to minimize two distinct objective functions (i.e., total transmission loss and voltage stability index) for IEEE-118 bus system and IEEE-24 bus RTS. A comprehensive statistical analysis is presented for the obtained numerical results, which proves that proposed FTMA has better convergence with better solution diversity in comparison to the other competing algorithms. A comprehensive analysis based on statistical results reveal that the proposed FTMA is superior for obtaining better non-dominating pareto-fronts as compared to other competing methods. [ABSTRACT FROM AUTHOR]

In traditional machine learning, there is often a discrepancy in data distribution between the source and target domains. Domain adaptation (DA) was proposed to learn the robust classifier for target domain by using knowledge from different source domains. Most DA methods focus on only the geometric structure of the data or statistical properties to reduce the differences between domains. The complementarity of these two aspects is ignored, which causes the problem of domain underadaptation to some degree. In this paper, we propose latent space search (LSS) approach for domain adaptation that consider both geometric and statistical properties. LSS consists of two parts: latent subspace learning and space search subspace learning. In the latent subspace, the geometric and statistical properties of the data are preserved by a low-rank coupled projection as well as joint distribution of the data. For the solution, an iterative feedback approach is used to obtain a robust subspace. Furthermore, to improve the discriminability of the subspace, the space search optimization algorithm is used to reconstruct the latent subspace, so that the source domain and the target domain can interleave well in the subspace. A comparative study illustrates that the proposed LSS has better performance than other state-of-art models reported in the literature. • Differences in data distribution exist in traditional machine learning. • Geometric and statistical properties are preserved in the latent subspace. • The discriminability of the subspace is raised in space search subspace. [ABSTRACT FROM AUTHOR]