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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
139 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

228 篇 工学
- 190 篇 计算机科学与技术...
- 159 篇 软件工程
- 52 篇 信息与通信工程
- 22 篇 生物工程
- 14 篇 控制科学与工程
- 13 篇 生物医学工程（可授...
- 10 篇 化学工程与技术
- 9 篇 光学工程
- 9 篇 电子科学与技术（可...
- 8 篇 电气工程
- 7 篇 机械工程
- 7 篇 仪器科学与技术
- 6 篇 动力工程及工程热...
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 3 篇 建筑学
105 篇 理学
- 57 篇 数学
- 26 篇 生物学
- 22 篇 物理学
- 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
9 篇 training
8 篇 knowledge engine...
8 篇 wireless sensor ...
8 篇 machine learning
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
5 篇 data models

机构

86 篇 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...
8 篇 shenzhen researc...
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...

作者

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

语言

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

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

共 360 条记录，以下是71-80 订阅

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

详细简洁

排序：

Using ontology to enhance collaborative recommendation based on community

Using ontology to enhance collaborative recommendation based...

引用

9th International Conference on Web-Age Information Management, WAIM 2008

作者： Yu, Li 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

ISBN: (纸本)9780769531854

Collaborative filtering is an important personalized recommendation technique applied widely in E-commerce. It is not adapted to multi-interest or title recommendation for the 'general neighbourhood' problem which is analyzed in this paper. Based on it, collaborative filtering recommendation based on community is presented by introducing the concept 'community neighbourhood' in the paper. Unfortunately, it results into severer sparsity problem which makes heavy effect on its performance. In order to overcome it, an ontological A-priori score is used to infer user preference and to pre-fill null rating first. After pre-filling using the ontology method, then collaborative filtering based on community is executed based on a dense rating matrix. The experiment shows that collaborative filtering based on community makes generally better performance than traditional method when data is not very sparse, and ontology method can truly enhance collaborative filtering based on community since the sparsity is overcame. © 2008 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Improve top-K recommendation by extending review analysis

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Zhu, Qing Xing, Zhe Liang, Jingfan School of Information Renmin University of China Beijing 100872 China Key Laboratory for Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing 100872 China

ISBN: (纸本)9783642292521

The Web has become the popular place for people to purchase product and acquire services, so collaborative filtering is one of the most important algorithms applied in e-commerce recommendation systems. Unfortunately, it is widely recognized that the traditional recommendation methods are inefficient when the user rating data is extremely sparse. In order to overcome the limitations, good recommendation tools are needed to help Web customers determine the products and satisfaction services. In this paper, we propose a multi-dimensional adaptive recommendation algorithm by extending opinion analysis to improve top-k recommendation. In the first step, the novel algorithm that uses extened opinion analysis, creatively combines three dimensional recommendation models: user-based, item-based and opinion-based collaborative filtering. It successfully integrates opinion mining technology with collaborative filtering algorithm. In the second step, we configured the dynamic measurement would help us determine the weight of three dimensions: user-based, item-based and opinion-based analysis, and hence get the final prediction result. The experimental results show that multi-dimensional recommendation can effectively alleviate the dataset sparsity problem and achieve better prediction accuracy compared to other traditional collaborative recommendation algorithms. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Detecting stealthy malware with inter-structure and imported signatures 11

Detecting stealthy malware with inter-structure and imported...

引用

6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011

作者： Liang, Bin You, Wei Shi, Wenchang Liang, Zhaohui Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9781450305648

Recent years have witnessed an increasing threat from kernel rootkits. A common feature of such attack is hiding malicious objects to conceal their presence, including processes, sockets, and kernel modules. Scanning memory with object signatures to detect the stealthy rootkit has been proven to be a powerful approach only when it is hard for adversaries to evade. However, it is difficult, if not impossible, to select fields from a single data structure as robust signatures with traditional techniques. In this paper, we propose the concepts of inter-structure signature and imported signature, and present techniques to detect stealthy malware based on these concepts. The key idea is to use cross-reference relationships of multiple data structures as signatures to detect stealthy malware, and to import some extra information into regions attached to target data structures as signatures. We have inferred four invariants as signatures to detect hidden processes, sockets, and kernel modules in Linux respectively and implemented a prototype detection system called DeepScanner. Meanwhile, we have also developed a hypervisor-based monitor to protect imported signatures. Our experimental result shows that our DeepScanner can effectively and efficiently detect stealthy objects hidden by seven real-world rootkits without any false positives and false negatives, and an adversary can hardly evade DeepScanner if he/she does not break the normal functions of target objects and the system. Copyright 2011 ACM.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Rucmm at MediaEval 2015 Affective impact of movies task: Fusion of audio and visual cues

Rucmm at MediaEval 2015 Affective impact of movies task: Fus...

引用

Multimedia Benchmark Workshop, MediaEval 2015

作者： Jin, Qin Li, Xirong Cao, Haibing Huo, Yujia Liao, Shuai Yang, Gang Xu, Jieping Multimedia Computing Lab School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

This paper summarizes our efforts for the first time participation in the Violent Scene Detection subtask of the MediaEval 2015 Affective Impact of Movies Task. We build violent scene detectors using both audio and visual cues. In particular, the audio cue is represented by bag-of-audio-words with fisher vector encoding. The visual cue is exploited by extracting CNN features from video frames. The detectors are implemented using two-class linear SVM classifiers. Evaluation shows that the audio detectors and the visual detectors are comparable and complementary to each other. Among our submissions, multi-modal late fusion leads to the best performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

COCA: More accurate multi-dimensional histograms out of more accurate correlations detection

COCA: More accurate multi-dimensional histograms out of more...

引用

9th International Conference on Web-Age Information Management, WAIM 2008

作者： Wei, Cao Xiongpai, Qin Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769531854

Detecting and exploiting correlations among columns in relational databases are of great value for query optimizers to generate better query execution plans (QEPs). We propose a more robust and informative metric, namely, entropy correlation coefficients, other than chi-square test to detect correlations among columns in large datasets. We introduce a novel yet simple kind of multi-dimensional synopses named COCA-Hist to cope with different correlations in databases. With the aid of the precise metric of entropy correlation coefficients, correlations of various degrees can be detected effectively;when correlation coefficients testify to mutual independence among columns, the AVI (attribute value independence) assumption can be adopted undoubtedly. COCA can also serve as a data-mining tool with superior qualities as CORDS does. We demonstrate the effectiveness and accuracy of our approach by several experiments. © 2008 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

MrCAR: A Multi-relational Classification Algorithm based on Association Rules

MrCAR: A Multi-relational Classification Algorithm based on ...

引用

International Conference on Web Information Systems and Mining

作者： Gu, Yingqin Liu, Hongyan He, Jun Hu, Bo Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering MOE China Information School Renmin University of China Beijing 100872 China School of Economics and Management Tsinghua University Beijing 100084 China

ISBN: (纸本)9780769538174

Classification is an important subject in data mining and machine learning, which has been studied extensively and has a wide range of applications. Classification based on association rules is one of the most effective classification method, whose accuracy is higher and discovered rules are easier to understand comparing with classical classification methods. However, current algorithms for classification based on association rules is single table oriented, which means they can only apply to the data stored in a single relational table. Directly applying these algorithms in multi-relational data environment will result in many problems. This paper proposes a novel algorithm MrCAR for classification based on association rules in multi-relational data environment. MrCAR mines relevant features in each table to predict the class label. Close itemsets technique and Tuple ID Propagation method are used to improve the performance of the algorithm. Experimental results show that MrCAR has higher accuracy and better understandability comparing with a typical existing multirelational classification algorithm.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Zask: A case study on online collaborative learning

Zask: A case study on online collaborative learning

引用

10th IASTED International Conference on Web-Based Education, WBE 2013

作者： Wang, Xiaoyan Chen, Jinchuan Du, Xiaoyong School of Information Renmin University of China Beijing China School of Information and Electrical Engineering Ludong University Shandong China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

ISBN: (纸本)9780889869431

Modern educational theories, such as collaborative learning, constructivism and inquiry learning, have achieved many successes in real-world applications. Especially, with the development of information technologies, there have been several online collaborative learning platforms in practice. Unfortunately, as these platforms are either too complicated or too expensive, none of them are suitable for us in the practice of STEM+. Moreover, most of these platforms are in English, while we are using Chinese as our teaching language. Using an online collaborative learning platform (OCLP) named Zask, this paper reported our practice in online collaborative learning on course Introduction to database System. According to the data collected from the first round of our practice, it shows that users' active participations in Zask could benefit for both teaching and learning, and then provide positive effects in education.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Random analysis of statistical rough set

Random analysis of statistical rough set

引用

2016 International Conference on Machine Learning and Cybernetics, ICMLC 2016

作者： Tsang, Eric C.C. Zhao, Su-Yun Faculty of Information Technology Macau University of Science and Technology C-Macau China Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

ISBN: (纸本)9781509003891

Attribute reduction is an inevitable problem in machine learning and statistical learning. To improve the traditional rough set reduction, statistical rough sets is then proposed by introducing random sampling into the rough approximation. Random sampling is the main contribution of statistical rough sets. As a result, it is necessary to analyze the randomness of statistical rough sets. In this paper, we analyze and demonstrate the influence of the randomness in the process of attribute reduction by a large number of experiments to test the effectiveness and stability of the random sampling. © 2016 IEEE.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

ALOR: Adaptive layout optimization of raft groups for heterogeneous distributed key-value stores 1

引用

15th IFIP International Conference on Network and Parallel Computing, NPC 2018

作者： Wang, Yangyang Chai, Yunpeng Wang, Xin Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing China College of Intelligence and Computing Tianjin University Tianjin China

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Many distributed key-value storage systems employ the simple and effective Raft protocol to ensure data consistency. They usually assume a homogeneous node hardware configuration for the underlying cluster and thus adopt even data distribution schemes. However, today’s distributed systems tend to be heterogeneous in nodes’ I/O devices due to the regular worn I/O device replacement and the emergence of expensive new storage media (e.g., non-volatile memory). In this paper, we propose a new data layout scheme called Adaptive Layout Optimization of Raft groups (ALOR), considering the hardware heterogeneity of the cluster. ALOR aims to optimize the data layout of Raft groups to achieve a better practical load balance, which leads to higher performance. ALOR consists of two components: leader migration in Raft groups and skewed data layout based on cold data migration. We conducted experiments on a practical heterogeneous cluster, and the results indicate that, on average, ALOR improves throughput by 36.89%, reduces latency and 99th percentile tail latency by 24.54% and 21.32%, respectively. © IFIP International Federation for Information Processing 2018.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Efficient querying of correlated uncertain data with cached results

Efficient querying of correlated uncertain data with cached ...

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 2013

作者： Chen, Jinchuan Zhang, Min Xie, Xike Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China School of Information Renmin University of China China Department of Computer Science Aalborg University Denmark

ISBN: (纸本)9783642374869

Although there have been many efforts for management of uncertain data, evaluating probabilistic inference queries, a known NP-hard problem, is still a big challenge, especially for querying data with highly correlations. The state-of-art exact algorithms for accelerating the evaluation of inference queries are based on special indices. Besides, with the observation of the existence of many frequent queries, some researchers try to improve efficiency by reusing previously queried results. Indexing depends on the static properties like data distributions, whereas caching is in favor of the dynamic features like query workload. In this paper we propose a new approach for speeding up the evaluation of inference queries by caching frequent results in a junction tree-based hierarchical index. To the best of our knowledge, this is the first effort on utilizing both the static (data) and dynamic (query workload) properties to efficiently evaluate probabilistic inference queries. Moreover, according to our experience, different caching strategies may significantly affect the query performance. Basically a good caching strategy needs to have high cache hit ratio with limited space *** on these considerations, we propose a novel caching approach, called FVEC, and present corresponding algorithms for efficiently querying correlated uncertain data. We further conduct a series of extensive experiments on large uncertain datasets in order to illustrate the effectiveness and efficiency of our proposed approaches. As illustrated by the results, compared with previous solutions, our method could greatly improve the query performance. © Springer-Verlag 2013.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：