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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

3,529 篇 会议
32 篇 期刊文献
27 册 图书

馆藏范围

3,588 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,735 篇 工学
- 2,429 篇 计算机科学与技术...
- 1,089 篇 软件工程
- 535 篇 控制科学与工程
- 362 篇 电气工程
- 305 篇 信息与通信工程
- 276 篇 生物工程
- 184 篇 交通运输工程
- 176 篇 生物医学工程（可授...
- 126 篇 机械工程
- 122 篇 仪器科学与技术
- 109 篇 光学工程
- 67 篇 安全科学与工程
- 63 篇 化学工程与技术
- 50 篇 电子科学与技术（可...
- 48 篇 建筑学
913 篇 理学
- 557 篇 数学
- 299 篇 生物学
- 178 篇 统计学（可授理学、...
- 133 篇 物理学
- 84 篇 系统科学
- 59 篇 化学
435 篇 管理学
- 240 篇 图书情报与档案管...
- 235 篇 管理科学与工程(可...
- 128 篇 工商管理
207 篇 医学
- 179 篇 临床医学
- 126 篇 基础医学(可授医学...
- 78 篇 药学(可授医学、理...
119 篇 教育学
- 117 篇 教育学
67 篇 法学
- 61 篇 社会学
45 篇 农学
44 篇 经济学
- 44 篇 应用经济学
7 篇 文学
2 篇 军事学

主题

297 篇 deep learning
293 篇 machine learning
198 篇 training
143 篇 data models
136 篇 data mining
136 篇 feature extracti...
103 篇 accuracy
100 篇 computational mo...
96 篇 predictive model...
92 篇 reinforcement le...
87 篇 neural networks
78 篇 convolutional ne...
73 篇 task analysis
72 篇 support vector m...
62 篇 pattern recognit...
62 篇 visualization
61 篇 transfer learnin...
61 篇 artificial intel...
60 篇 training data
55 篇 real-time system...

机构

17 篇 university of bu...
17 篇 department of el...
14 篇 chitkara univers...
12 篇 graduate school ...
10 篇 university of ch...
10 篇 graduate school ...
10 篇 department of da...
9 篇 zarqa university...
8 篇 yonsei univ dept...
8 篇 zarqa university...
8 篇 department of co...
7 篇 institute of inf...
7 篇 univ calgary dep...
6 篇 graduate school ...
6 篇 department of co...
5 篇 asus intelligent...
5 篇 department of co...
5 篇 school of inform...
5 篇 department of co...
5 篇 department of co...

作者

17 篇 yin hujun
14 篇 ali elrashidi
14 篇 elrashidi ali
13 篇 alazaidah raed
12 篇 raed alazaidah
11 篇 hujun yin
11 篇 cho sung-bae
10 篇 corchado emilio
9 篇 ghassan samara
9 篇 samara ghassan
9 篇 jitpattanakul an...
8 篇 alhajj reda
8 篇 mekruksavanich s...
7 篇 silva catarina
7 篇 esraa abu elsoud
7 篇 wang wei
7 篇 elsoud esraa abu
7 篇 naranjo valery
7 篇 zheng yu
7 篇 ribeiro bernarde...

语言

3,509 篇 英文
69 篇 其他
25 篇 中文
2 篇 西班牙文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"任意字段=25th International Conference on Intelligent Data Engineering and Automated Learning"

共 3588 条记录，以下是131-140 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

SARA: A Sparsity-Aware Efficient Oblivious Aggregation Service for Federated Matrix Factorization 25th

SARA: A Sparsity-Aware Efficient Oblivious Aggregation Servi...

引用

25th international conference on Web Information Systems engineering, WISE 2024

作者： Zheng, Yifeng Xiong, Tianchen Ouyang, Huajie Wang, Songlei Hua, Zhongyun Gao, Yansong School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Data61 CSIRO Sydney Australia

ISBN: (纸本)9789819605668

Federated matrix factorization (FedMF) has recently emerged as a privacy-friendly paradigm which runs matrix factorization (MF) in a federated learning (FL) setting and enables users to keep their individual rating data local in the training process. In FedMF, users only need to share out item gradients for aggregation. However, prior work has shown that the item gradients, if directly exposed, can still leak users’ rating data. Meanwhile, the rating data are typically sparse and simply uploading the gradients of rated items will leak which and how many items a user rates. In light of the above, in this paper, we present SARA, a new sparsity-aware efficient oblivious aggregation service for FedMF. SARA protects the confidentiality of item gradients as well as hides which and how many items a user rates, through a custom sparsity-aware design that delicately builds on differential privacy and lightweight cryptography. Extensive experiments over real-world datasets demonstrate that SARA is utility-preserving and can bring the users significant savings (up to 98.28%) in the number of transmitted item gradients, compared to the baseline of fully transmitting gradients for all possible items. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TERM: Tree Ensemble Models for Interpretable Rule Mining 25th

TERM: Tree Ensemble Models for Interpretable Rule Mining

引用

25th international conference on Web Information Systems engineering, WISE 2024

作者： Zhu, Mengyu Li, Zhao Zhao, Jun Liu, Xiaopeng Liu, Yongning School of Information Engineering Ningxia University Yinchuan China College of Intelligence and Computing Tianjin University Tianjin China School of Economics and Management Ningxia University Yinchuan China Financial Big Data Laboratory Bank of Shizuishan Yinchuan China

ISBN: (纸本)9789819605781

Ensemble learning, particularly tree-based ensemble techniques, is acknowledged as the advanced approach to solving a wide range of challenging issues because of its exceptional performance in multiple machine learning applications. Nonetheless, even with its capacity for prediction, ensemble learning’s interpretability continues to be a problem, which restricts its use in situations where decision transparency is necessary. We suggest a novel model named TERM (Tree Ensemble Models for Interpretable Rule Mining) in order to get over this restriction and enhance the interpretability of Ensemble Tree Models. this method converts the complex binary classification decision-making process inside tree ensemble models into a series of rule lists that are globally equivalent to the decision-making process of the original model. this transformation aids in a more precise understanding and interpretation of the model’s predictive outcomes, enhancing its interpretability. Compared with existing rule extraction methods, TERM can simultaneously be applied to bagging methods and boosting methods. During the rule extraction phase, an adaptive set cover algorithm ADAPT-TA, is proposed to select rule subsets from the original rule set while avoiding local optima. Additionally, this method reduces the generalization error in the set of rules and runs faster on ensemble models involving multiple decision trees. through comparisons with six other models, we evaluated the performance and applicability of TERM, demonstrating its outstanding accuracy and interpretability. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Model Extraction Attacks on Privacy-Preserving Deep learning Based Medical Services 25th

Model Extraction Attacks on Privacy-Preserving Deep Learnin...

引用

25th international conference on Web Information Systems engineering, WISE 2024

作者： Wang, Xinqian Liu, Xiaoning Yi, Xun Yang, Xuechao Gondal, Iqbal RMIT University Melbourne Australia Victoria University Melbourne Australia

ISBN: (纸本)9789819605668

Advancements in deep learning have enabled high-quality medical diagnostic services. Typically, high-tech corporations train deep learning models to provide these services to their clients. To access services, clients simply upload their medical data and receive predictions. However, due to the sensitivity of medical data, such services usually face privacy concerns from their clients. Additionally, service providers cannot directly deploy their models on clients’ devices, as the trained models are considered valuable intellectual property. To address this issue, secure multi-party computation (MPC) has been proposed as a solution, allowing service providers and clients to jointly perform deep learning computations without disclosing their respective inputs. For efficiency reasons, most MPC-based secure inference protocols assume that all parties will remain semi-honest throughout the execution of the protocols. However, this assumption may not always hold for clients. A recent study has shown that if a client is compromised by a malicious adversary, the adversary can steal the model’s parameters. However, such attack can be performed across limited neural network structures that only combines linear layers and ReLU layers. In this paper, we extend the attack to be applicable to most neural network structures commonly used in practice, e.g., VGG-Net and ResNet. Specifically, we design malicious steps for the adversary to circumvent max-pool and softmax layers. Our experimental results demonstrate that the extracted model parameters differ from the true values by at most 0.01. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

VizardFL: Enabling Private Participation in Federated learning Systems 25th

VizardFL: Enabling Private Participation in Federated Learn...

引用

25th international conference on Web Information Systems engineering, WISE 2024

作者： Zang, Yichen Cai, Chengjun Dong, Wentao Wang, Cong City University of Hong Kong Kowloon Hong Kong Guangdong Dongguan China

ISBN: (纸本)9789819605668

We introduce the problem of private participation in federated learning (FL) systems. In this problem, different data owners can participate in different FL training tasks without revealing exactly which task they are involved in. It is extremely important in some metadata-sensitive scenarios (e.g., a patient does not want to disclose the fact that he/she is diseased but wants to contribute to the disease study). Despite the inherent privacy assurance of conventional FL techniques and recent advances in secure aggregations, such private participation remains an open issue. this work introduces VizardFL, an FL framework that efficiently enables private participation. At a high level, VizardFL is built out of distributed trust across two servers that keep client participation private as long as there is no collusion. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

MDAP: A Multi-view Disentangled and Adaptive Preference learning Framework for Cross-Domain Recommendation 25th

MDAP: A Multi-view Disentangled and Adaptive Preference Lea...

引用

25th international conference on Web Information Systems engineering, WISE 2024

作者： Tong, Junxiong Yin, Mingjia Wang, Hao Pan, Qiushi Lian, Defu chen, Enhong University of Science and Technology of China Jinzhai Road Anhui Hefei China State Key Laboratory of Cognitive Intelligence Anhui Hefei China

ISBN: (纸本)9789819605699

Traditional recommendation systems, relying on single-domain data, often struggle with sparse data or new user scenarios. Cross-domain Recommendation (CDR) systems leverage multi-domain user interactions to improve performance, especially in sparse data or new user scenarios. However, CDR faces challenges such as effectively capturing user preferences and avoiding negative transfer. To address these issues, we propose the Multi-viewDisentangled andAdaptivePreference learning (MDAP) framework. Our MDAP framework uses a multi-view encoder to capture diverse user preferences. the framework includes a gated decoder that adaptively combines embeddings from different views to generate a comprehensive user representation. By disentangling representations and allowing adaptive feature selection, our model enhances recommendations’ adaptability and effectiveness. Extensive experiments on benchmark datasets demonstrate that our method significantly outperforms state-of-the-art CDR and single-domain models, providing more accurate recommendations and deeper insights into user behavior across different domains. Our code is available at https://***/the-garden-of-sinner/MDAP. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

R-CONV: An Analytical Approach for Efficient data Reconstruction via Convolutional Gradients 25th

R-CONV: An Analytical Approach for Efficient Data Reconstru...

引用

25th international conference on Web Information Systems engineering, WISE 2024

作者： Eltaras, Tamer Ahmed Malluhi, Qutaibah Savino, Alessandro Carlo, Stefano Di Qayyum, Adnan Politecnico Di Torino Control and Computer Engineering Department Turin10129 Italy Qatar University Doha Qatar Information Technology University of the Punjab Lahore Pakistan

ISBN: (纸本)9789819605750

In the effort to learn from extensive collections of distributed data, federated learning has emerged as a promising approach for preserving privacy by using a gradient-sharing mechanism instead of exchanging raw data. However, recent studies show that private training data can be leaked through many gradient attacks. While previous analytical-based attacks have successfully reconstructed input data from fully connected layers, their effectiveness diminishes when applied to convolutional layers. this paper introduces an advanced data leakage method to efficiently exploit convolutional layers’ gradients. We present a surprising finding: even with non-fully invertible activation functions, such as ReLU, we can analytically reconstruct training samples from the gradients. To the best of our knowledge, this is the first analytical approach that successfully reconstructs convolutional layer inputs directly from the gradients, bypassing the need to reconstruct layers’ outputs. Prior research has mainly concentrated on the weight constraints of convolution layers, overlooking the significance of gradient constraints. Our findings demonstrate that existing analytical methods used to estimate the risk of gradient attacks lack accuracy. In some layers, attacks can be launched with less than 5 % of the reported constraints. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Semantic Communication of Images Using Image Generation and Image Captioning Models

Semantic Communication of Images Using Image Generation and ...

引用

PhD Symposium, Posters, Demos, and A Web for more inclusive, sustainable and prosperous societies, WEB-for-GOOD 2024 and 1st international Workshop on AI and Web data Analytics, AIWDA 2024 form the 25th international conference on Web Information Systems engineering, WISE 2024

作者： Mahgoub, Asma Yaacoub, Elias Department of Computer Science and Engineering Qatar University Doha Qatar

ISBN: (纸本)9789819614820

With the emergence of 6G networks and the new networking requirements, the existing networks are approaching the Shannon capacity limit. Hence, a new paradigm called ‘semantic communication’ is proposed in the literature. Semantic communication is the transmission of the meaning of a message between two intelligent agents. In this work, the problem of image semantic communication is considered. Most of the existing works in literature focus on the exact reconstruction of the transmitted image. Yet, to achieve full semantic communication, it is possible to focus on transmitting a similar image with the same meaning as the original image. this can be achieved by transmitting a text description of the image. An image captioning model, namely, the one-for-all (OFA) model is used to transform an image into its caption. the caption is transmitted through the network and at the receiver an image-to-text diffusion model, stability diffusion XL, is used to reconstruct a semantically similar image. the similarity between the transmitted and the received images is assessed using the textual similarity between the corresponding captions. the captions of the original and the generated images had a similarity above 0.7 using five text similarity measures, namely, ANLS, METEOR, ROUGE, BLEU and BERT similarity. this approach is shown to achieve a 99% reduction in the message size. the results emphasize the effect of using AI models to extract a general representation of a message and in turn consume less communication resources. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Chatbots

来源：评论

学校读者我要写书评

暂无评论

Fed-MoE: Efficient Federated learning for Mixture-of-Experts Models via Empirical Pruning 25th

Fed-MoE: Efficient Federated Learning for Mixture-of-Expert...

引用

25th international conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2024

作者： Zou, Yifei Qi, Senmao Yuan, Yuan Wang, Dawei Shen, Shikun Wu, Libing Guo, Shaoyong Yu, Dongxiao School of Computer Science and Technology Shandong University Qingdao China School of Cyber Science and Engineering Wuhan University Wuhan China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9789819642069

In recent years, the combination of Federated learning (FL) framework and Mixture of Experts (MoE) architecture has shown promise for large-scale model pre-training while preserving data privacy. However, the significant computational and communication requirement of MoE-based models presents substantial challenges for FL systems. To address this, we propose Fed-MoE, an efficient federated learning framework designed for MoE models through empirical pruning. Fed-MoE reduces computational overhead by pruning multiple experts at the client side while retaining general components, thus converting the model into dense sub-models. these sub-models are locally trained and later aggregated by the parameter server into a sparse MoE model. Our method optimizes the use of sparse activation in MoE models and reduces resource consumption without compromising performance. Extensive experimental results demonstrate that Fed-MoE significantly improves the efficiency of FL without compromising model performance, offering an effective solution for deploying large-scale MoE models in federated learning environments. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Incentive Mechanism for Collaborative Anomaly Detection in Internet of things 25th

An Efficient Incentive Mechanism for Collaborative Anomaly ...

引用

25th international conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2024

作者： He, Wenhai Li, Jinzhao Qiao, Cheng Zhao, Bowen School of Information Technology and Engineering Guangzhou College of Commerce Guangzhou China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou China Guangzhou Institute of Technology Xidian University Guangzhou China

ISBN: (纸本)9789819642069

the Internet of things (IoT) is transforming industries by connecting a myriad of devices to collect and exchange data. However, this connectivity increases vulnerability to cyber threats, making anomaly detection a critical and challenging research topic. Collaborative abnormal detection leverages multiple IoT devices to identify irregularities, but its success hinges on active participation from these devices. this paper explores the development of an efficient incentive mechanism to encourage device participation in collaborative abnormal detection, ensuring robust security in IoT networks. We consider two different knowledge levels of agents and integrate the success detection rate into the utility function of the incentive mechanisms. In particular, we proposed a lightweight method to compute the contribution of agents. Our evaluations reinforce the effectiveness of the proposed methods in enhancing critical performance metrics (by as much as 14% on average), albeit at the cost of longer convergence times (increased by around 11% on average). © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A data-Driven Integrated Framework for Virtual Testing of Autonomous Vehicles in Mixed Traffic Scenarios 8th

A Data-Driven Integrated Framework for Virtual Testing of Au...

引用

8th international conference on intelligent Transport Systems, INTSYS 2024

作者： Caroleo, Brunella Sadeghi, Javad Botta, Cristiana Nikneshan, Shadi Arnone, Maurizio Fondazione LINKS Via P.C. Boggio 61 Turin10138 Italy

ISBN: (纸本)9783031863691

the increasing presence of autonomous vehicles (AVs) in urban environments introduces both opportunities and challenges, particularly regarding their interactions with traditional vehicles and other road users. this paper presents a comprehensive framework designed to assess the integration of AVs in mixed traffic scenarios. the framework is built upon real-world data collected from AV trials conducted in Turin, Italy. By leveraging traffic microsimulation along with machine learning techniques, the study proposes a framework aimed at assessing ex-ante the impacts on traffic of AVs introduction, thus constituting a relevant tool of virtual testing of CCAM (Cooperative, Connected, and automated Mobility) trials before the physical introduction of autonomous vehicles on public roads. the integration of High-Performance Computing (HPC) ensures the efficiency of these simulations, enabling real-time analysis and testing. the proposed framework not only provides decision-makers with a tool for virtual testing of AV deployment, but also offers actionable insights into traffic management strategies. the study’s findings contribute to a deeper understanding of the role AVs can play in future urban mobility systems, particularly as cities prepare for the broader adoption of CCAM technologies. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2025.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共359页 << < 10 11 12 13 14 15 16 17 18 19 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：