检索结果-内蒙古大学图书馆

Effi-CNN: real-time vision-based system for interpretation of sign language using CNN and transfer learning

Multimedia Tools and Applications 2025年第6期84卷 3137-3159页

作者： Pranav Katarya, Rahul Big Data Analytics and Web Intelligence Laboratory Computer Science & Engineering Department Delhi Technological University New Delhi India

The deaf and mute population has difficulty conveying their thoughts and ideas to others. Sign language is their most expressive mode of communication, but the general public is callow of sign language;therefore, the mute and deaf have difficulty communicating with others. A system that can correctly translate sign language motions to speech and vice versa in real time is required to overcome this communication barrier. Effi-CNN, a vision-based Sign Language Recognition (SLR) system employing transfer learning with EfficientNetB2, is proposed in this paper. We have also developed a system covering sign gestures to text in real time. Our approach was evaluated on eight publicly available datasets, including the Massey university gesture dataset, the ArSL2018 dataset, the MNIST-ASL dataset, and others. When comparing our results to state-of-the-art algorithms, the experimental findings showed that our proposed work is more successful than existing models. Our proposed model delivered an accuracy of 99.90 on MNIST dataset. The results show that our Effi-CNN surpasses most currently existing solutions and can categorize many gestures with a low error rate. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

T³Planner: Multi-Phase Planning Across Structure-Constrained Optical, IP, and Routing Topologies

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1823-1839页

作者： Hao, Yijun Yang, Shusen Li, Fang Zhang, Yifan Zhao, Cong Ren, Xuebin Zhao, Peng Xu, Chenren Wang, Shibo Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Xi’an710049 China Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an710049 China Peking University School of Computer Science Beijing100871 China The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong National Engineering Laboratory for Big Data Analytics Xi'an Jiaotong University Xi'an710049 China

Network topology planning is an essential multi-phase process to build and jointly optimize the multi-layer network topologies in wide-area networks (WANs). Most existing practices target single-phase/layer planning, and are incapable of satisfying all rigorous topological structure constraints (e.g., dual-homing rings) defined by network standards and operators, especially in large-scale networks. These significantly limit their usability and performance in production networks. We consider a general topology planning problem with typical structure constraints over three essential phases (greenfield, reconfiguration, and site expansion) and topological layers (optical, IP, and routing topologies). We present, T3Planner, a novel practical solver to this problem in production. Specifically, we develop a structure-driven encoder based on graph neural network (GNN) for concise structure encoding, and design a new learning framework with optical-centric layer compression/reconstruction and rule-aided reinforcement learning (RL) for fast convergence and high performance. Extensive experiments on nine real topologies demonstrate that T3Planner scales to large optical networks with hundreds of sites, saves 46.6% cost, and supports 3.12x more demand when compared to related existing approaches. © 1983-2012 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Semantic grounding of LLMs using knowledge graphs for query reformulation in medical information retrieval

Semantic grounding of LLMs using knowledge graphs for query ...

引用

2024 IEEE International Conference on big data, bigdata 2024

作者： Tommasel, Antonela Assent, Ira Isistan CONICET-UNCPBA Argentina Aarhus University Department of Computer Science Denmark Digit Aarhus University Centre for Digitalisation Big Data and Data Analytics Denmark

ISBN: (纸本)9798350362480

The widespread adoption of electronic health records has generated a vast amount of patient-related data, mostly presented in the form of unstructured text, which could be used for document retrieval. However, querying these texts in full could present challenges due to their unstructured and lengthy nature, as they may contain noise or irrelevant terms that can interfere with the retrieval process. Recently, large language models (LLMs) have revolutionized natural language processing tasks. However, despite their promising capabilities, their use in the medical domain has raised concerns due to their lack of understanding, hallucinations, and reliance on outdated knowledge. To address these concerns, we evaluate a Retrieval Augmented Generation (RAG) approach that integrates medical knowledge graphs with LLMs to support query refinement in medical document retrieval tasks. Our initial findings from experiments using two benchmark TREC datasets demonstrate that knowledge graphs can effectively ground LLMs in the medical domain. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

On the Convergence of Prey Predator Algorithm

引用

International Journal of Applied and Computational Mathematics 2024年第2期10卷 1-23页

作者： Tilahun, Surafel Luleseged Department of Mathematics HPC and Big Data Analytics Center of Excellence Addis Ababa Science and Technology University Addis Ababa 16417 Ethiopia

Unlike their success in solving complex and difficult problems, there is a lack of proper mathematical analysis and discussion of metaheuristic algorithms. Even though some researches are done on these aspects, the gap is still wide and different researchers outlined that more needs to be done to understand and analyse the search behaviour mathematically in order to move towards explainable AI. Convergence analysis is one of the issues researchers are trying to address. In this paper, a discussion on the convergence of prey predator algorithm will be presented. It is a swarm based algorithm which shows promising results. Furthermore, some initial researches show that it is a generalized algorithm where some well known algorithms fall as its special case. Hence, its analysis can be customized and used for other algorithms as well. Based on mathematical arguments, this paper discusses the convergence analysis of the algorithm to a near optimal solution with appropriate implementation, i.e. appropriate parameter setting. Prey predator algorithm is shown to be an ϵ-convergent algorithm that means there is a non infinity iteration number to get at least epsilon less quality from an optimal solution. © The Author(s), under exclusive licence to Springer Nature India Private Limited 2024.

关键词： Convergence Metaheuristic Prey predator algorithm Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Seeing Through the Lies: A Vision Transformer-Based Solution 3rd

Seeing Through the Lies: A Vision Transformer-Based Solution

引用

3rd International Conference on Artificial-Business analytics, Quantum and Machine Learning: Trends, Perspectives, and Prospects, Com-IT-Con 2023

作者： Rasool, Aale Katarya, Rahul Big Data Analytics and Web Intelligence Laboratory Department of Computer Science Delhi Technological University New Delhi India

ISBN: (纸本)9789819725076

Deepfake technology has become increasingly sophisticated and poses a growing threat to society, as it can be used to create convincing fake videos for malicious purposes. Therefore, detecting deepfakes has become crucial to ensure the authenticity of visual content. This paper proposes a novel deepfake detection approach that utilizes InceptionResNetV2 for feature extraction and Vision Transformer (ViT) with Nyström Attention mechanism for classification. Our model achieves high accuracy, AUC, precision, and recall on the CelebDFv2 dataset and outperforms state-of-the-art techniques like EfficientNet, XceptionNet, and ResNet. We also perform evaluations on the CelebDFv1 and DFDC datasets. Furthermore, we conduct a comprehensive literature survey to highlight the existing research in deepfake detection. We provide a roadmap for future work in this field, highlighting potential research directions that can further improve the effectiveness and applicability of deepfake detection models. The proposed model shows great potential for real-world applications, and the suggested future work can help to address some of the remaining challenges in this area. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Lifelong Graph Learning for Graph Summarization

Lifelong Graph Learning for Graph Summarization

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Jonatan Frank Marcel Hoffmann Nicolas Lell David Richerby Ansgar Scherp Data Science and Big Data Analytics Ulm University Germany University of Essex Colchester UK

ISBN: (数字)9798331504946

ISBN: (纸本)9798331504953

Summarizing web graphs is challenging due to the heterogeneity of the modeled information and its changes over time. We investigate the use of neural networks for lifelong graph summarization. After observing the web graph at a point in time, we train a network to summarize graph vertices. We apply this trained network to summarize the vertices of the changed graph at the next point in time. Subsequently, we continue training and evaluating the network to perform lifelong graph summarization. We use the GNNs Graph-MLP and GCN, as well as an MLP baseline, to summarize the temporal graphs. We compare 1-hop and 2-hop summaries. We investigate the impact of reusing parameters from a previous snapshot by measuring backward and forward transfer as well as forgetting rate. Our extensive experiments are on two series of ten weekly snapshots, from 2012 and 2022, of a web graph with over 100M edges. They show that all networks predominantly use 1-hop information to determine the summary, even when performing 2-hop summarization. Due to the heterogeneity of web graphs, in some snapshots, the 2-hop summary produces up to ten times as many vertex classes as the 1-hop summary. When using the network trained on the last snapshot from 2012 and applying it to the first snapshot of 2022, we observe a strong drop in accuracy. We attribute this drop over the ten-year time warp to the strongly increased heterogeneity of the web graph in 2022. The source code and additional resources are available at https://***/jofranky/Lifelong-Graph-Summarization-with-Neural-Networks.

关键词： Training Accuracy Current measurement Source coding Time measurement Resource description framework Graph neural networks Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

Multi-View Structural Graph Summaries

Multi-View Structural Graph Summaries

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Jonatan Frank Andor Diera David Richerby Ansgar Scherp Data Science and Big Data Analytics Ulm University Germany University of Essex Colchester UK

ISBN: (数字)9798331504946

ISBN: (纸本)9798331504953

A structural graph summary is a small graph representation that preserves structural information necessary for a given task. The summary is used instead of the original graph to complete the task faster. We introduce multi-view structural graph summaries and propose an algorithm for merging two summaries. We conduct a theoretical analysis of our algorithm. We run experiments on three datasets, contributing two new ones. The datasets are of different domains (web graph, source code, and news) and sizes. The interpretation of multi-view depends on the domain: pay-level domains on the web, control vs. data flow of the code, and the output of different news broadcasters. We experiment with three graph summary models: attribute collection, class collection, and their combination. We observe that merging two structural summaries has an upper bound of quadratic complexity; but under reasonable assumptions, it has linear-time worst-case complexity. The running time of merging has a strong linear correlation with the number of edges in the two summaries. Therefore, the experiments support the assumption that the upper bound of quadratic complexity is not tight and that linear complexity is possible. Furthermore, our experiments show that always merging the two smallest summaries by the number of edges is the most efficient strategy for merging multiple structural summaries. The source code and additional resources are available at https://***/jofranky/Multi-View-Structural-Graph-Summaries.

关键词： Upper bound Correlation Codes Source coding Merging Knowledge graphs Resource description framework Complexity theory Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

Multi-View Structural Graph Summaries

arXiv

引用

arXiv 2024年

作者： Frank, Jonatan Diera, Andor Richerby, David Scherp, Ansgar Data Science and Big Data Analytics Ulm University Germany University of Essex Colchester United Kingdom

A structural graph summary is a small graph representation that preserves structural information necessary for a given task. The summary is used instead of the original graph to complete the task faster. We introduce multi-view structural graph summaries and propose an algorithm for merging two summaries. We conduct a theoretical analysis of our algorithm. We run experiments on three datasets, contributing two new ones. The datasets are of different domains (web graph, source code, and news) and sizes. The interpretation of multi-view depends on the domain: pay-level domains on the web, control vs. data flow of the code, and the output of different news broadcasters. We experiment with three graph summary models: attribute collection, class collection, and their combination. We observe that merging two structural summaries has an upper bound of quadratic complexity;but under reasonable assumptions, it has linear-time worst-case complexity. The running time of merging has a strong linear correlation with the number of edges in the two summaries. Therefore, the experiments support the assumption that the upper bound of quadratic complexity is not tight and that linear complexity is possible. Furthermore, our experiments show that always merging the two smallest summaries by the number of edges is the most efficient strategy for merging multiple structural summaries. The source code and additional resources are available at https://***/jofranky/ Multi-View-Structural-Graph-Summaries. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Lifelong Graph Learning for Graph Summarization

arXiv

引用

arXiv 2024年

作者： Frank, Jonatan Hoffmann, Marcel Lell, Nicolas Richerby, David Scherp, Ansgar Data Science and Big Data Analytics Ulm University Germany University of Essex Colchester United Kingdom

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Recommendation fairness and where to find it: An empirical study on fairness of user recommender systems

Recommendation fairness and where to find it: An empirical s...

引用

2023 IEEE International Conference on big data, bigdata 2023

作者： Tommasel, Antonela Assent, Ira Aarhus University Department of Computer Science Digit Aarhus University Centre for Digitalisation Big Data and Data Analytics Denmark Isistan CONICET-UNCPBA Argentina

ISBN: (纸本)9798350324457

Recommender systems play a crucial role in how users consume information and establish new social relations. However, different factors (such as the data collection process, the designed recommendation model, or even the interpretation of findings) could make recommenders (unintendedly) prone to biases, favouring certain user groups or items, thus resulting in unfair outcomes. Recommenders also face fairness criticism for inducing filter bubbles, echo chambers, and, more generally, facilitating opinion manipulation. In this work, we study the impact of user recommender systems on fairness. To this end, we carry out a user recommendation task on a politically polarized Twitter data collection. Then, we evaluate how the different politically aligned user groups experience recommendation quality. Finally, we explore causal models to identify data and model-related features that could affect the fairness of recommender outcomes. Our study shows that political alignment is associated with the unfairness of recommenders affecting not only the relevance of recommendations, but also their diversity and the resulting interaction patterns. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：