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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

218 篇 会议
137 篇 期刊文献
3 册 图书

馆藏范围

358 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

226 篇 工学
- 190 篇 计算机科学与技术...
- 159 篇 软件工程
- 52 篇 信息与通信工程
- 22 篇 生物工程
- 14 篇 控制科学与工程
- 13 篇 生物医学工程（可授...
- 10 篇 化学工程与技术
- 9 篇 光学工程
- 9 篇 电子科学与技术（可...
- 7 篇 机械工程
- 7 篇 仪器科学与技术
- 6 篇 动力工程及工程热...
- 6 篇 电气工程
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 3 篇 建筑学
104 篇 理学
- 57 篇 数学
- 26 篇 生物学
- 21 篇 物理学
- 18 篇 统计学（可授理学、...
- 10 篇 化学
- 7 篇 系统科学
78 篇 管理学
- 54 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 6 篇 工商管理
12 篇 医学
- 11 篇 临床医学
- 8 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
10 篇 法学
- 9 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 经济学
2 篇 文学
2 篇 农学

主题

17 篇 semantics
11 篇 data engineering
10 篇 laboratories
10 篇 data mining
8 篇 knowledge engine...
8 篇 wireless sensor ...
8 篇 machine learning
8 篇 training
7 篇 query processing
7 篇 information retr...
7 篇 forecasting
6 篇 object detection
6 篇 knowledge manage...
6 篇 search engines
6 篇 costs
6 篇 feature extracti...
5 篇 xml
5 篇 contrastive lear...
5 篇 embeddings
4 篇 helium

机构

85 篇 school of inform...
49 篇 key laboratory o...
18 篇 key lab of data ...
18 篇 key laboratory o...
11 篇 key laboratory o...
10 篇 gaoling school o...
10 篇 beijing key labo...
9 篇 engineering rese...
9 篇 department of ma...
8 篇 peng cheng labor...
8 篇 key laboratory o...
7 篇 key lab. of inte...
7 篇 school of comput...
7 篇 renmin universit...
7 篇 key laboratory o...
7 篇 university of ch...
7 篇 school of comput...
7 篇 school of cyber ...
7 篇 key lab of big d...
7 篇 shenzhen researc...

作者

35 篇 du xiaoyong
30 篇 chen hong
30 篇 li xirong
20 篇 li cuiping
20 篇 xiaoyong du
15 篇 hong chen
13 篇 he jun
11 篇 liu hongyan
11 篇 yang gang
11 篇 wang shan
10 篇 liu jun
9 篇 wang shuai
9 篇 dou zhicheng
8 篇 wen ji-rong
8 篇 shan wang
8 篇 huang qingming
8 篇 xu qianqian
8 篇 cuiping li
7 篇 liu tao
7 篇 cao xiaochun

语言

341 篇 英文
12 篇 其他
5 篇 中文

检索条件"机构=MoE Key Lab of Data Engineering and Knowledge Engineering"

共 358 条记录，以下是101-110 订阅

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

详细简洁

排序：

RPR-Net: A Point Cloud-Based Rotation-Aware Large Scale Place Recognition Network 17th

RPR-Net: A Point Cloud-Based Rotation-Aware Large Scale Plac...

引用

17th European Conference on Computer Vision, ECCV 2022

作者： Fan, Zhaoxin Song, Zhenbo Zhang, Wenping Liu, Hongyan He, Jun Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China Department of Management Science and Engineering Tsinghua University Beijing100084 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

ISBN: (纸本)9783031250552

Point cloud-based large scale place recognition is an important but challenging task for many applications such as Simultaneous Localization and Mapping (SLAM). Taking the task as a point cloud retrieval problem, previous methods have made delightful achievements. However, how to deal with catastrophic collapse caused by rotation problems is still under-explored. In this paper, to tackle the issue, we propose a novel Point Cloud-based Rotation-aware Large Scale Place Recognition Network (RPR-Net). In particular, to solve the problem, we propose to learn rotation-invariant features in three steps. First, we design three kinds of novel Rotation-Invariant Features (RIFs), which are low-level features that can hold the rotation-invariant property. Second, using these RIFs, we design an attentive module to learn rotation-invariant kernels. Third, we apply these kernels to previous point cloud features to generate new features, which is the well-known SO(3) mapping process. By doing so, high-level scene-specific rotation-invariant features can be learned. We call the above process an Attentive Rotation-Invariant Convolution (ARIConv). To achieve the place recognition goal, we build RPR-Net, which takes ARIConv as a basic unit to construct a dense network architecture. Then, powerful global descriptors used for retrieval-based place recognition can be sufficiently extracted from RPR-Net. Experimental results on prevalent datasets show that our method achieves comparable results to existing state-of-the-art place recognition models and significantly outperforms other rotation-invariant baseline models when solving rotation problems. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Learning via Weight-aware Distillation under Class Distribution Mismatch

Semi-Supervised Learning via Weight-aware Distillation under...

引用

International Conference on Computer Vision (ICCV)

作者： Pan Du Suyun Zhao Zisen Sheng Cuiping Li Hong Chen Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Renmin University of China Beijing China

Semi-Supervised Learning (SSL) under class distribution mismatch aims to tackle a challenging problem wherein unlabeled data contain lots of unknown categories unseen in the labeled ones. In such mismatch scenarios, traditional SSL suffers severe performance damage due to the harmful invasion of the instances with unknown categories into the target classifier. In this study, by strict mathematical reasoning, we reveal that the SSL error under class distribution mismatch is composed of pseudo-labeling error and invasion error, both of which jointly bound the SSL population risk. To alleviate the SSL error, we propose a robust SSL framework called Weight-Aware Distillation (WAD) that, by weights, selectively transfers knowledge beneficial to the target task from unsupervised contrastive representation to the target classifier. Specifically, WAD captures adaptive weights and high-quality pseudo-labels to target instances by exploring point mutual information (PMI) in representation space to maximize the role of unlabeled data and filter unknown categories. Theoretically, we prove that WAD has a tight upper bound of population risk under class distribution mismatch. Experimentally, extensive results demonstrate that WAD outperforms five state-of-the-art SSL approaches and one standard baseline on two benchmark datasets, CIFAR10 and CIFAR100, and an artificial cross-dataset. The code is available at https://***/RUC-DWBI-ML/research/tree/main/WAD-master.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Managing a Large Shared Bank of Unstructured data by Using Free-Table

Managing a Large Shared Bank of Unstructured Data by Using F...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xiao Zhang Xiaoyong Du Jinchuan Chen Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for end-users and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not column-oriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable.

关键词： data models Conference management knowledge management engineering management data engineering Proposals Maintenance engineering knowledge engineering data mining Relational databases

来源：评论

学校读者我要写书评

暂无评论

MapReduce-Based SimRank Computation and Its Application in Social Recommender System

MapReduce-Based SimRank Computation and Its Application in S...

引用

IEEE International Conference on Services Economics (SE)

作者： Lina Li Cuiping Li Hong Chen Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

Recently there has been a lot of interest in graph-based analysis, with examples including social network analysis, recommendation systems, document classification and clustering, and so on. A graph is an abstraction that naturally captures data objects as well as relationships among those objects. Objects are represented as nodes and relationships are represented as edges in the graph. There are many cases in which similarities among nodes are required to compute. SimRank is one of the simple and intuitive algorithms for this purpose. It is rigidly based on the random walk theorem. Existing methods on SimRank computation suffer from one limitation: the computing cost can be very high in practice. In order to optimize the computation of SimRank, a few techniques have been proposed. However, the performance of these methods are still limited by the processing ability of the single computer. Ideally, we would like to develop new parallel solutions that can offer improved processing power to compute SimRank on large data set. In this paper, we propose parallel algorithms for SimRank computation on Map-Reduce framework, and more specifically its open source implementation, Hadoop. Two different parallel methods are proposed and their performances are evaluated and compared. Furthermore, we employ the proposed methods to do the similarity computation in order to recommend appropriate products to users in social recommender systems.

关键词： Computers Iterative methods Recommender systems Computational modeling Parallel processing Equations Sorting

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations

Inductive Relation Prediction with Logical Reasoning Using C...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Pan, Yudai Liu, Jun Zhang, Lingling Zhao, Tianzhe Lin, Qika Hu, Xin Wang, Qianying School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Lenovo Research Beijing China

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant embedding paradigm has a restriction on handling unseen entities during testing. In the real-world scenario, the inductive setting is more common because entities in the training process are finite. Previous methods capture an inductive ability by implicit logic in KGs. However, it would be challenging to preciously acquire entity-independent relational semantics of compositional logic rules and to deal with the deficient supervision of logic caused by the scarcity of relational semantics. To this end, we propose a novel graph convolutional network (GCN)-based model LogCo with logical reasoning by contrastive representations. LogCo firstly extracts enclosing subgraphs and relational paths between two entities to supply the entity-independence. Then a contrastive strategy for relational path instances and the subgraph is proposed for the issue of deficient supervision. The contrastive representations are learned for a joint training regime. Finally, prediction results and logic rules for reasoning are attained. Comprehensive experiments on twelve inductive datasets show that LogCo achieves outstanding performance comparing with SOTA inductive baselines. © 2022 Association for Computational Linguistics.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An MRC Framework for Semantic Role labeling 29

An MRC Framework for Semantic Role Labeling

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Wang, Nan Li, Jiwei Meng, Yuxian Sun, Xiaofei Qiu, Han Wang, Ziyao Wang, Guoyin He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China China Shannon.AI Zhejiang University China Tsinghua University China University of Leeds United Kingdom Amazon Alexa AI

Semantic Role labeling (SRL) aims at recognizing the predicate-argument structure of a sentence and can be decomposed into two sub-tasks: predicate disambiguation and argument labeling. Prior work deals with these two tasks independently, which ignores the semantic connection between the two tasks. In this paper, we propose to use the machine reading comprehension (MRC) framework to bridge this gap. We formalize predicate disambiguation as multiple-choice machine reading comprehension, where the descriptions of candidate senses of a given predicate are used as options to select the correct sense. The chosen predicate sense is then used to determine the semantic roles for that predicate, and these semantic roles are used to construct the query for another MRC model for argument labeling. In this way, we are able to leverage both the predicate semantics and the semantic role semantics for argument labeling. We also propose to select a subset of all the possible semantic roles for computational efficiency. Experiments show that the proposed framework achieves state-of-the-art or comparable results to previous work. Code is available at https://***/ShannonAI/MRC-SRL. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

On-Line System of Garbage Image-Orientated Intelligent Classification, Submission and Examination 20

On-Line System of Garbage Image-Orientated Intelligent Class...

引用

20th IEEE International Conference on e-Business engineering, ICEBE 2024

作者： Tian, Jiayin Wang, Yaozhi Liu, Jiaxin Chen, Yan School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China Xi'an Jiaotong University Shaanxi Key Lab of Big Data Knowledge Engineering Shaanxi Xi'an China School of Computer Science and Technology Xi'an Jiaotong University Xi'an Jiaotong University Shaanxi Key Lab of Big Data Knowledge Engineering Shaanxi Xi'an China

ISBN: (纸本)9798350365856

In a world brimming with new products continually, novel waste types are ubiquitous. This makes current image-based garbage classification systems difficult to perform well due to the long-tailed effects of distribution of garbage types, and necessitates an urgent and efficient garbage classification with abilities of detecting new and rare wastes and class-incremental learning for environmental sustainability. Therefore, we propose a framework of Online System of Garbage Image-Oriented Intelligent Classification, Submission, and Examination, facilitating the incremental garbage classification efforts. In which, to identify novel garbage effectively, we also introduced few-shot object detection method with two key algorithms: Two-Stage Object Detection Learning Algorithm and Dynamic Query-based Incremental Few-shot Learning Algorithm. Our experiment results show that Both outperform the current existing ones in dataset, MS COCO. Then, a strategy of Class-Incremental learning based Residual Network is proposed to meet the need of new waste class-incremental learning. The experimental results support our strategy. Finally, a prototype system employed the above algorithms and the strategy is described. © 2024 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Evolving Sequential Patterns Mining Model over Click Stream with Levenshtein-Automata

Evolving Sequential Patterns Mining Model over Click Stream ...

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Haifeng Li Hong Chen School of Information Key Laboratory of Data Engineering and Knowledge Engineering MOEMOE Renmin University of China Beijing China

Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximate mining algorithms are proposed which spend too many system resources and can only obtain the partial feature of stream. In this paper, a multi-level evolving sequential pattern mining model ESPMM is presented to address this problem thus the mostly entire stream feature is obtained. Furthermore, because of the smaller support of sequential patterns in each level, a mining method BMLA based on Levenshtein-Automata is proposed which builds state conversion model to compute sequences' similarity in linear time. The experiment results show this model is effective and efficient.

关键词： Distance measurement data mining Runtime Automata Computational modeling Evolution (biology) data models

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Interference and power constrained broadcast and multicast r...

引用

作者： Li, Zheng Li, Deying Liu, Ming School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

In this paper, we address the interference and power constrained broadcast/multicast routing problem (D-IPCB/M) in wireless ad hoc networks using directional antenna as a starting point, which jointly considers low-interference and energy-efficiency issues. Then we study the delay-bounded interference and power constrained broadcast/multicast routing problem (DB-D-IPCB/M). An approximation algorithm and a heuristic algorithm with low time complexity are proposed for the D-IPCB/M and DB-D-IPCB/M problem, respectively. Finally, we explore and investigate the multi-constrained subgraph optimization (MCSO) problem. We prove its NP-hard and propose an approximation scheme with theoretical performance guarantee for this class of optimization problems. This is a general result originated from the study of D-IPCB/M and DB-D-IPCB/M problems, which can be applicable to solve different optimization problems such as the multi-constrained broadcast/multicast routing problems. Broadcast/multicast message by using the routing trees found by our algorithms tends to not only have less channel collisions but also save energy to extend network lifetime. The theoretical results are evaluated by simulation studies. © 2010 Elsevier B.V. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Article reranking by memory-enhanced key sentence matching for detecting previously fact-checked claims 59

Article reranking by memory-enhanced key sentence matching f...

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：