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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

617 篇 会议
548 篇 期刊文献
3 册 图书

馆藏范围

1,168 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

736 篇 工学
- 582 篇 计算机科学与技术...
- 475 篇 软件工程
- 150 篇 信息与通信工程
- 75 篇 控制科学与工程
- 74 篇 生物工程
- 55 篇 电气工程
- 42 篇 化学工程与技术
- 41 篇 电子科学与技术（可...
- 39 篇 机械工程
- 35 篇 生物医学工程（可授...
- 25 篇 仪器科学与技术
- 24 篇 动力工程及工程热...
- 23 篇 材料科学与工程（可...
- 21 篇 光学工程
- 19 篇 建筑学
- 17 篇 航空宇航科学与技...
- 15 篇 交通运输工程
330 篇 理学
- 183 篇 数学
- 80 篇 生物学
- 70 篇 物理学
- 55 篇 统计学（可授理学、...
- 39 篇 化学
- 22 篇 系统科学
290 篇 管理学
- 173 篇 图书情报与档案管...
- 144 篇 管理科学与工程(可...
- 46 篇 工商管理
39 篇 法学
- 34 篇 社会学
36 篇 医学
- 31 篇 临床医学
- 22 篇 基础医学(可授医学...
18 篇 经济学
- 18 篇 应用经济学
10 篇 教育学
7 篇 文学
6 篇 农学
1 篇 军事学
1 篇 艺术学

主题

58 篇 semantics
35 篇 knowledge engine...
35 篇 data mining
33 篇 training
25 篇 feature extracti...
22 篇 data models
20 篇 data engineering
20 篇 laboratories
20 篇 computational mo...
19 篇 conferences
19 篇 xml
19 篇 big data
18 篇 machine learning
18 篇 information retr...
17 篇 visualization
16 篇 deep learning
16 篇 task analysis
16 篇 databases
15 篇 knowledge manage...
15 篇 knowledge graph

机构

168 篇 school of inform...
104 篇 school of comput...
51 篇 key laboratory o...
49 篇 key laboratory o...
48 篇 college of compu...
32 篇 jiangxi key labo...
32 篇 school of inform...
31 篇 key laboratory o...
29 篇 key laboratory o...
28 篇 key laboratory o...
25 篇 key laboratory o...
23 篇 key laboratory o...
19 篇 school of econom...
19 篇 school of inform...
18 篇 key laboratory o...
18 篇 key laboratory o...
18 篇 key laboratory o...
18 篇 key laboratory o...
16 篇 college of compu...
16 篇 school of cyber ...

作者

57 篇 chen hong
43 篇 du xiaoyong
38 篇 li cuiping
32 篇 wu xindong
32 篇 wang meng
30 篇 hong chen
30 篇 xiaoyong du
29 篇 wang shan
29 篇 zhang jing
28 篇 xindong wu
23 篇 sun geng
22 篇 liu jun
20 篇 niyato dusit
18 篇 meng wang
18 篇 huang qingming
18 篇 hong richang
17 篇 shan wang
17 篇 wang yang
17 篇 xu qianqian
17 篇 wan changxuan

语言

1,017 篇 英文
123 篇 其他
28 篇 中文

检索条件"机构=Key Laboratory of Data Engineering and Knowledge Engineering of MOE"

共 1168 条记录，以下是921-930 订阅

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

详细简洁

排序：

Effectively grouping named entities from clickthrough data into clusters of generated keywords 16

Effectively grouping named entities from clickthrough data i...

引用

16th Pacific Asia Conference on Information Systems, PACIS 2012

作者： Jiang, Xuan Liu, Hongyan He, Jun Zhu, Rui Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

Many studies show that named entities are closely related to users' search behaviors, which brings increasing interest in studying named entities in search logs recently. This paper addresses the problem of forming fine grained semantic clusters of named entities within a broad domain such as "company", and generating keywords for each cluster, which help users to interpret the embedded semantic information in the cluster. By exploring contexts, URLs and session IDs as features of named entities, a three-phase approach proposed in this paper first disambiguates named entities according to the features. Then it properly weights the features with a novel measurement, calculates the semantic similarity between named entities with the weighted feature space, and clusters named entities accordingly. After that, keywords for the clusters are generated using a text-oriented graph ranking algorithm. Each phase of the proposed approach solves problems that are not addressed in existing works, and experimental results obtained from a real click through data demonstrate the effectiveness of the proposed approach.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Comparative Analysis of knowledge Management Methods in the Three knowledge Management Standards

A Comparative Analysis of Knowledge Management Methods in th...

引用

2012年管理与服务科学国际会议(MASS 2012)

作者： Shaotong Xu Xiaomi An Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) MOE

This paper aims to identify knowledge management (KM) methods that have been used in three KM Standards, i.e. KM Standards of Britain, European Union(EU) and Australia, with comparative analysis of three KM issues covering: basic definitions, KM work processes, essential factors and management frameworks;with a chronological analysis of their characteristics and evolution. The studies find that along with the practical development of KM practices, concepts of KM are getting understood more and more broadly, ranges of KM activities are extending, but management factors are getting highly integrated, and the management frameworks are going towards ecosystem. The paper provides valuable insight on theoretical and practical development of knowledge management methods and standards.

关键词： knowledge management knowledge management method knowledge management standard

来源：评论

学校读者我要写书评

暂无评论

An approach for personalized tag recommendation based on interest transfer model

An approach for personalized tag recommendation based on int...

引用

9th Web Information Systems and Applications Conference, WISA 2012

作者： Liu, Yue Yang, Nan Yang, Gang School of Information Renmin University of China Bejing China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Bejing China

ISBN: (纸本)9781467330541

Recently, social tagging systems become more and more popular in many Web 2.0 applications. In such systems, Users are allowed to annotate a particular resource with a freely chosen a set of tags. These user-generated tags can represent users' interests more concise and closer to human understanding. Interests will change over time. Thus, how to describe users' interests and interests transfer path become a big challenge for personalized recommendation systems. In this approach, we propose a variable-length time interval division algorithm and user interest model based on time interval. Then, in order to draw users' interests transfer path over a specific time period, we suggest interest transfer model. After that, we apply a classical community partition algorithm in our approach to separate users into communities. Finally, we raise a novel method to measure users' similarities based on interest transfer model and provide personalized tag recommendation according to similar users' interests in their next time intervals. Experimental results demonstrate the higher precision and recall with our approach than classical user-based collaborative filtering methods. © 2012 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Fusing concept detection and geo context for visual search 12

Fusing concept detection and geo context for visual search

引用

2nd ACM International Conference on Multimedia Retrieval, ICMR 2012

作者： Li, Xirong Snoek, Cees G.M. Worring, Marcel Smeulders, Arnold W.M. MOE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China Intelligent Systems Lab Amsterdam University of Amsterdam Netherlands Centrum Wiskunde and Informatica Netherlands

ISBN: (纸本)9781450313292

Given the proliferation of geo-tagged images, the question of how to exploit geo tags and the underlying geo context for visual search is emerging. Based on the observation that the importance of geo context varies over concepts, we propose a concept-based image search engine which fuses visual concept detection and geo context in a concept-dependent manner. Compared to individual content-based and geo-based concept detectors and their uniform combination, concept-dependent fusion shows improvements. Moreover, since the proposed search engine is trained on social-tagged images alone without the need of human interaction, it is flexible to cope with many concepts. Search experiments on 101 popular visual concepts justify the viability of the proposed solution. In particular, for 79 out of the 101 concepts, the learned weights yield improvements over the uniform weights, with a relative gain of at least 5% in terms of average precision. Copyright © 2012 ACM.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

JUFE at INEX 2011 Snippet Retrieval Track

JUFE at INEX 2011 Snippet Retrieval Track

引用

Lecture Notes in Computer Science

作者： Liu, Dexi Wan, Changxuan Liao, Guoqiong Zhong, Minjuan Liu, Xiping School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9783642357336

Jiangxi University of Finance and Economics (JUFE) submitted 8 runs to the Snippet Retrieval Track at INEX *** report describes an XML snippet retrieval method based on Average Topic Generalization (ATG) model used by JUFE. The basic idea of the ATG is that different element in an XML document plays different role and hence should has distinguishing importance. The ATG model sets a weight automatically to each element according to its tag or path in the XML document. Then, the BM25EW model based on the ATG is proposed to retrieve and rank the relevant elements in an XML document collection. All windows in the most relevant elements are scored and those windows with higher scores are extracted as snippets. By comparing with the runs under different strategies, the performance are discussed and analyzed in detail. © Springer-Verlag Berlin Heidelberg 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Topology-based data compression in wireless sensor networks

Topology-based data compression in wireless sensor networks

引用

13th International Conference on Web-Age Information Management, WAIM 2012

作者： Mo, Shangfeng Chen, Hong Li, Yinglong Key Laboratory of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Hunan University of Science and Technology Xiangtan 411201 China

ISBN: (纸本)9783642322808

In this paper, we address the problem of data Compression which is critical in wireless sensor networks. We proposed a novel Topology-based data Compression (TDC) algorithm for wireless sensor networks. We utilize the topological structure of routing tree to reduce the transmission of message packets. We analyzed the differences and relations between our algorithm and other compression algorithms. Extensive experiments are conducted to evaluate the performance of the proposed TDC approach by using two kinds of data sets: real data set and synthetic data set. The results show that the TDC algorithm substantially outperforms Non-compression algorithm in terms of packets transmitted. © 2012 Springer-Verlag.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

FindCredPg: A novel method to find credible pages based on trust web graph

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Wang, Teng Zhu, Qing Wang, Shan Liang, Jingfan Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783642292521

Finding credible pages is a challenging problem on the Web. Our key observation in this paper is that credible pages usually link to credible content-related pages, which is different from a normal page usually links to normal pages in spam page detection. We propose a novel method to find credible pages based on the trust web graph we define. This method first measures the content correlation between pages connected by hyperlinks, then it combines web link structure with content correlation value of pages to build a trust web graph. At last, credible pages are found successfully by using trust relation of vertices on the trust web graph. We construct a real-world data set by crawling millions of pages on the web and run a set of experiments on this data set. Experiment results show that the accuracy of this method is near 80% and the efficiency is higher. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Hypertext systems

来源：评论

学校读者我要写书评

暂无评论

Summarizing large-scale database schema using community detection

Summarizing large-scale database schema using community dete...

引用

作者： Wang, Xue Zhou, Xuan Wang, Shan School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China

Schema summarization on large-scale databases is a challenge. In a typical large database schema, a great proportion of the tables are closely connected through a few high degree tables. It is thus dificult to separate these tables into clusters that represent different topics. Moreover, as a schema can be very big, the schema summary needs to be structured into multiple levels, to further improve the usability. In this paper, we introduce a new schema summarization approach utilizing the techniques of community detection in social networks. Our approach contains three steps. First, we use a community detection algorithm to divide a database schema into subject groups, each representing a specific subject. Second, we cluster the subject groups into abstract domains to form a multi-level navigation structure. Third, we discover representative tables in each cluster to label the schema summary. We evaluate our approach on Freebase, a real world large-scale database. The results show that our approach can identify subject groups precisely. The generated abstract schema layers are very helpful for users to explore database. © 2012 Springer Science+Business Media, LLC & Science Press, China.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Efficient SPARQL query processing in mapreduce through data partitioning and indexing

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Nie, Zhi Du, Fang Chen, Yueguo Du, Xiaoyong Xu, Linhao Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China IBM Research China Beijing China

ISBN: (纸本)9783642292521

Processing SPARQL queries on single node is obviously not scalable, considering the rapid growth of RDF knowledge bases. This calls for scalable solutions of SPARQL query processing over Web-scale RDF data. There have been attempts for applying SPARQL query processing techniques in MapReduce environments. However, no study has been conducted on finding optimal partitioning and indexing schemes for distributing RDF data in MapReduce. In this paper, we investigate RDF data partitioning technique that provides effective indexing schemes to support efficient SPARQL query processing in MapReduce. Our extensive experiments over a huge real-life RDF dataset show the performance of the proposed partitioning and indexing schemes for efficient SPARQL query processing. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

H-tree: A hybrid structure for confidence computation in probabilistic databases

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Zhang, Qian Qin, Biao Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9783642292521

Probabilistic database has become a popular tool for uncertain data management. Most work in the area is focused on efficient query processing and has two main directions, accurate or approximate evaluation. In recent work for conjunctive query without self-joins on a tuple-independent probabilistic database, query evaluation is equivalent to computing marginal probabilities of boolean formulas associated with query results. If formulas can be factorized into a read-once form where every variable appears at most once, confidence computation is reduced to a tractable problem that can be evaluated in linear time. Otherwise, it is regarded as a NP-hard problem and need to be evaluated approximately. In this paper, we propose a framework that evaluates both tractable and NP-hard conjunctive queries efficiently. First, we develop a novel structure H-tree, where boolean formulas are decomposed to small partitions which are either read-once or NP-hard. Then we propose algorithms for building H-tree and parallelizing (approximate) confidence computation. We also propose fundamental theorems to ensure the correctness of our approaches. Performance experiments demonstrate the benefits of H-tree, especially for approximate confidence evaluation on NP-hard queries. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 89 90 91 92 93 94 95 96 97 98 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：