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

MSEs Credit Risk Assessment Model Based on Federated Learning and Feature Selection

computers, Materials & Continua 2023年第6期75卷 5573-5595页

作者： Zhanyang Xu Jianchun Cheng Luofei Cheng Xiaolong Xu Muhammad Bilal School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China State Key Laboratory Novel Software Technology Nanjing UniversityNanjing210023China Department of Computer and Electronics Systems Engineering Hankuk University of Foreign StudiesYongin-siGyeonggi-do17035Korea

Federated learning has been used extensively in business inno-vation scenarios in various *** research adopts the federated learning approach for the first time to address the issue of bank-enterprise information asymmetry in the credit assessment ***,this research designs a credit risk assessment model based on federated learning and feature selection for micro and small enterprises(MSEs)using multi-dimensional enterprise data and multi-perspective enterprise *** proposed model includes four main processes:namely encrypted entity alignment,hybrid feature selection,secure multi-party computation,and global model ***,a two-step feature selection algorithm based on wrapper and filter is designed to construct the optimal feature set in multi-source heterogeneous data,which can provide excellent accuracy and *** addition,a local update screening strategy is proposed to select trustworthy model parameters for aggregation each time to ensure the quality of the global *** results of the study show that the model error rate is reduced by 6.22%and the recall rate is improved by 11.03%compared to the algorithms commonly used in credit risk research,significantly improving the ability to identify ***,the business operations of commercial banks are used to confirm the potential of the proposed model for real-world implementation.

关键词： Federated learning feature selection credit risk assessment MSEs

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

How far are we to GPT-4V?Closing the gap to commercial multimodal models with open-source suites

引用

science China(Information sciences) 2024年第12期67卷 5-22页

作者： Zhe CHEN Weiyun WANG Hao TIAN Shenglong YE Zhangwei GAO Erfei CUI Wenwen TONG Kongzhi HU Jiapeng LUO Zheng MA Ji MA Jiaqi WANG Xiaoyi DONG Hang YAN Hewei GUO Conghui HE Botian SHI Zhenjiang JIN Chao XU Bin WANG Xingjian WEI Wei LI Wenjian ZHANG Bo ZHANG Pinlong CAI Licheng WEN Xiangchao YAN Min DOU Lewei LU Xizhou ZHU Tong LU Dahua LIN Yu QIAO Jifeng DAI Wenhai WANG State Key Laboratory for Novel Software Technology Nanjing University Shanghai AI Laboratory School of Computer Science Fudan University SenseTime Research Department of Information Engineering The Chinese University of Hong Kong Department of Electronic Engineering Tsinghua University

In this paper, we introduce InternVL 1.5, an open-source multimodal large language model(MLLM) to bridge the capability gap between open-source and proprietary commercial models in multimodal understanding. We introduce three simple improvements.(1) Strong vision encoder: we explored a continuous learning strategy for the large-scale vision foundation model — InternViT-6B, boosting its visual understanding capabilities, and making it can be transferred and reused in different LLMs.(2) Dynamic high-resolution: we divide images into tiles ranging from 1 to 40 of 448×448 pixels according to the aspect ratio and resolution of the input images, which supports up to 4K resolution input.(3) High-quality bilingual dataset: we carefully collected a high-quality bilingual dataset that covers common scenes, document images,and annotated them with English and Chinese question-answer pairs, significantly enhancing performance in optical character recognition(OCR) and Chinese-related tasks. We evaluate InternVL 1.5 through a series of benchmarks and comparative studies. Compared to both open-source and proprietary commercial models, InternVL 1.5 shows competitive performance, achieving state-of-the-art results in 8 of 18 multimodal benchmarks. Code and models are available at https://***/OpenGVLab/InternVL.

关键词： multimodal model open-source vision encoder dynamic resolution bilingual dataset

来源：评论

学校读者我要写书评

暂无评论

Effective and Efficient Community Search with Graph Embeddings 26

Effective and Efficient Community Search with Graph Embeddin...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Gou, Xiaoxuan Xu, Xiaoliang Wu, Xiangying Chen, Runhuai Wang, Yuxiang Wu, Tianxing Ke, Xiangyu Hangzhou Dianzi University School of Computer Science China Southeast University School of Computer Science and Engineering China Zhejiang University School of Software Technology China

ISBN: (纸本)9781643684369

Given a graph G and a query node q, community search (CS) seeks a cohesive subgraph from G that contains q. CS has gained much research interests recently. In the database research community, researchers aim to find the most cohesive subgraph satisfying a specific community model (e.g., k-core or k-truss) via graph traversal. These works obtain good precision, however suffering from the low efficiency issue. In the AI research community, a new thought of using the deep learning model to support CS without relying on graph traversal emerges. Supervised end-to-end models using GCN are presented, which perform efficiently, but leave a large room for precision improvement. None of them can achieve a good balance between the efficiency and effectiveness. This motivates our solution: First, we present an offline community-injected graph embedding method to preserve the community's cohesiveness features into the learned node representations. Second, we resort to a proximity graph (PG) built from node representations, to quickly return the community online. Moreover, we develop a self-augmented method based on KL divergence to further optimize node representations. Extensive experiments on seven real-world graphs show our solution's superiority on effectiveness (at least 39.3% improvement) and efficiency (one to two orders of magnitude faster). © 2023 The Authors.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

GliomaCNN: An Effective Lightweight CNN Model in Assessment of Classifying Brain Tumor from Magnetic Resonance Images Using Explainable AI

引用

computer Modeling in Engineering & sciences 2024年第9期140卷 2425-2448页

作者： Md.Atiqur Rahman Mustavi Ibne Masum Khan Md Hasib M.F.Mridha Sultan Alfarhood Mejdl Safran Dunren Che Department of Computer Science and Engineering Ahsanullah University of Science and TechnologyDhaka1208Bangladesh Department of Computer Science and Software Engineering The University of Western AustraliaPerthWA 6009Australia Department of Computer Science American International University-BangladeshDhaka1229Bangladesh Department of Computer Science College of Computer and Information SciencesKing Saud UniversityP.O.Box 51178Riyadh11543Saudi Arabia School of Computing Southern Illinois UniversityCarbondale62901USA

Brain tumors pose a significant threat to human lives and have gained increasing attention as the tenth leading cause of global *** study addresses the pressing issue of brain tumor classification using Magnetic resonance imaging(MRI).It focuses on distinguishing between Low-Grade Gliomas(LGG)and High-Grade Gliomas(HGG).LGGs are benign and typically manageable with surgical resection,while HGGs are malignant and more *** research introduces an innovative custom convolutional neural network(CNN)model,*** stands out as a lightweight CNN model compared to its *** research utilized the BraTS 2020 dataset for its *** with the gradient-boosting algorithm,GliomaCNN has achieved an impressive accuracy of 99.1569%.The model’s interpretability is ensured through SHapley Additive exPlanations(SHAP)and Gradient-weighted Class Activation Mapping(Grad-CAM++).They provide insights into critical decision-making regions for classification *** challenges in identifying tumors in images without visible signs,the model demonstrates remarkable performance in this critical medical application,offering a promising tool for accurate brain tumor diagnosis which paves the way for enhanced early detection and treatment of brain tumors.

关键词： Deep learning magnetic resonance imaging convolutional neural networks explainable AI boosting algorithm ablation

来源：评论

学校读者我要写书评

暂无评论

ITERATE: Image-Text Enhancement, Retrieval, and Alignment for Transmodal Evolution with LLMs 31

ITERATE: Image-Text Enhancement, Retrieval, and Alignment fo...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Fu, Chenhan Wang, Guoming Li, Juncheng Zhang, Wenqiao Lu, Rongxing Tang, Siliang School of Software Technology Zhejiang University China Ningbo Research Institute Zhejiang University China College of Computer Science and Technology Zhejiang University China Faculty of Computer Science University of New Brunswick Canada

ISBN: (纸本)9798891761964

Inspired by human cognitive behavior, we introduce visual modality to enhance the performance of pure text-based question-answering tasks with the development of multimodal models. However, obtaining corresponding images through manual annotation often entails high costs. Faced with this challenge, an intuitive strategy is to use search engines or use web scraping techniques to automatically obtain relevant image information. However, the images obtained by this strategy may be of low quality and may not match the context of the original task, which could fail to improve or even decrease performance on downstream tasks. In this paper, we propose a novel framework named "ITERATE", aimed at retrieving and optimizing the quality of images to improve the alignment between text and images. Inspired by evolutionary algorithms in reinforcement learning and driven by the synergy of large language models (LLMs) and multimodal models, ITERATE employs a series of strategic actions such as filtering, optimizing, and retrieving to acquire higher quality images, and repeats this process over multiple generations to enhance the quality of the entire image cluster. Our experimental results on the scienceQA, ARC-Easy, and OpenDataEval datasets also verify the effectiveness of our method, showing improvements of 3.5%, 5%, and 7%, respectively. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

OptEx: Expediting First-Order Optimization with Approximately Parallelized Iterations 38

OptEx: Expediting First-Order Optimization with Approximatel...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Shu, Yao Fang, Jiongfeng He, Ying Tiffany Yu, Fei Richard China College of Computer Science and Software Engineering Shenzhen University China School of Information Technology Carleton University Canada

First-order optimization (FOO) algorithms are pivotal in numerous computational domains, such as reinforcement learning and deep learning. However, their application to complex tasks often entails significant optimization inefficiency due to their need of many sequential iterations for convergence. In response, we introduce first-order optimization expedited with approximately parallelized iterations (OptEx), the first general framework that enhances the optimization efficiency of FOO by leveraging parallel computing to directly mitigate its requirement of many sequential iterations for convergence. To achieve this, OptEx utilizes a kernelized gradient estimation that is based on the history of evaluated gradients to predict the gradients required by the next few sequential iterations in FOO, which helps to break the inherent iterative dependency and hence enables the approximate parallelization of iterations in FOO. We further establish theoretical guarantees for the estimation error of our kernelized gradient estimation and the iteration complexity of SGD-based OptEx, confirming that the estimation error diminishes to zero as the history of gradients accumulates and that our SGD-based OptEx enjoys an effective acceleration rate of Θ(√N) over standard SGD given parallelism of N, in terms of the sequential iterations required for convergence. Finally, we provide extensive empirical studies, including synthetic functions, reinforcement learning tasks, and neural network training on various datasets, to underscore the substantial efficiency improvements achieved by OptEx in practice. Our implementation is available at https://***/youyve/OptEx. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mathematical Methods for Reducing the Search Space for Solutions in 'Big Data' Analysis and Management 14

Mathematical Methods for Reducing the Search Space for Solut...

引用

14th International Conference on Advanced computer Information Technologies, ACIT 2024

作者： Syrotkina, Olena Kobti, Ziad Aleksieiev, Mykhailo Moroz, Dmytro Udovyk, Iryna Martynenko, Andrii University of Windsor School of Computer Science Windsor Canada Dnipro University of Technology Department of Software Engineering Dnipro Ukraine

ISBN: (纸本)9798350350036

This paper addresses mathematical methods to reduce or segment the search space for big data solutions into distinct subspaces with partial solutions. It is achieved by using a data organization structure of 'm-tuples based on ordered sets of arbitrary cardinality.' We provide a mathematical description of this structure and review contemporary methodologies to address similar problems. The study highlights how these properties can significantly reduce the analyzed state space and includes graphs that demonstrate changes in data volume within these subspaces. Additionally, we analyze how variations in four specific arguments affect data volume changes and provide an overview of the efficiency gains in resource use from applying the mathematical methods discussed. © 2024 IEEE.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

FreAML: A Frequency-Domain Adaptive Meta-Learning Framework for EEG-Based Emotion Recognition

FreAML: A Frequency-Domain Adaptive Meta-Learning Framework ...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Wang, Lei Zhu, Jianping Du, Le Jin, Bo Wei, Xiaopeng DaLian University of Technology School of Software Technology DaLian China DaLian University of Technology School of Computer Science and Technology DaLian China Dongbei University of Finance and Economics School of Finance DaLian China

ISBN: (纸本)9798350386226

Emotion recognition technology, especially methods based on electroencephalogram (EEG) signals, plays a critical role in revealing deep human emotions and enhancing human-computer interaction experiences. However, the high-frequency characteristics of EEG signals lead to significant individual differences, causing domain distribution shift issues. To address this, we propose a frequency-domain adaptive meta-learning probabilistic inference framework, named FreAML, leveraging the advantages of frequency-domain signals in preserving comprehensive views and learning global dependencies. Specifically, we first introduce an adaptive meta-task construction strategy based on a clustering-matching pattern. Then, through a dual-stream amortization network, we learn task-specific frequency-domain real and imaginary parameters from the support set. Finally, using these task-specific parameters, we achieve rapid generalization learning of the query set through a frequency-domain linear mapping. Extensive experiments on two public datasets validate the effectiveness and superiority of the proposed method. © 2024 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Design of a Secured and Trusted E-Voting System Using Blockchain technology

Design of a Secured and Trusted E-Voting System Using Blockc...

引用

2024 IEEE SmartBlock4Africa, SmartBlock4Africa 2024

作者： Elegba Jeremiah, O. Agbelusi, O. Olutayo Victor, A. Akintola Kolawole, G. School of Computing The Federal University of Technology Department of Software Engineering Akure Nigeria School of Computing The Federal University of Technology Department of Computer Science Akure Nigeria

ISBN: (纸本)9798350376838

The state of election in Nigeria is worrisome. Electoral malpractices have been a major challenge to the Nigerian government in recent times. Government has made frantic efforts to tackle these electoral challenges but the recent event in year 2023 presidential election is worrisome suggests that the solution is not near. Recently, the percentage of eligible voters who vote on election days is declining. Voters turnout went up from 52.3% in 1999 - the first general election since 1993 - to 69% in 2003. But, it has been on the decline nearly ever since - 57.5% in 2007, 53.7% in 2011, 43.7% in 2015 and 34.8% in 2019. In 2023, it is 28.63%. With the way things are going, if urgent action is not taken, this could signal the end of democracy in Nigeria. This research presents the design and implementation of a trusted and secured e-voting based on blockchain technology that will increase voters confidence and trust. The system utilizes *** for the frontend and Solidity on the Polygon blockchain for the backend, ensuring transparency, tamper-resistance, and heightened security. This innovative approach addresses trust and reliability concerns in traditional voting systems, offering a modernized and trustworthy electoral process. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：