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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

635 篇 会议
467 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

713 篇 工学
- 584 篇 计算机科学与技术...
- 481 篇 软件工程
- 165 篇 信息与通信工程
- 68 篇 控制科学与工程
- 67 篇 生物工程
- 55 篇 电气工程
- 39 篇 电子科学与技术（可...
- 37 篇 化学工程与技术
- 36 篇 机械工程
- 31 篇 生物医学工程（可授...
- 23 篇 仪器科学与技术
- 23 篇 动力工程及工程热...
- 19 篇 光学工程
- 19 篇 建筑学
- 17 篇 交通运输工程
- 17 篇 航空宇航科学与技...
302 篇 管理学
- 184 篇 图书情报与档案管...
- 146 篇 管理科学与工程(可...
- 49 篇 工商管理
292 篇 理学
- 176 篇 数学
- 67 篇 生物学
- 55 篇 统计学（可授理学、...
- 51 篇 物理学
- 41 篇 化学
- 22 篇 系统科学
39 篇 法学
- 33 篇 社会学
30 篇 医学
- 26 篇 临床医学
- 20 篇 基础医学(可授医学...
- 14 篇 药学(可授医学、理...
22 篇 经济学
- 22 篇 应用经济学
7 篇 教育学
6 篇 文学
5 篇 农学
1 篇 军事学
1 篇 艺术学

主题

61 篇 semantics
39 篇 knowledge engine...
37 篇 data mining
30 篇 training
24 篇 feature extracti...
23 篇 data engineering
20 篇 xml
20 篇 laboratories
20 篇 computational mo...
20 篇 information retr...
19 篇 conferences
19 篇 big data
18 篇 task analysis
18 篇 data models
17 篇 visualization
17 篇 databases
16 篇 knowledge manage...
15 篇 search engines
15 篇 algorithm design...
14 篇 query processing

机构

195 篇 school of inform...
105 篇 school of comput...
52 篇 key laboratory o...
49 篇 key laboratory o...
33 篇 school of inform...
32 篇 jiangxi key labo...
31 篇 key laboratory o...
29 篇 college of compu...
29 篇 key laboratory o...
28 篇 department of ma...
25 篇 key laboratory o...
25 篇 key laboratory o...
24 篇 school of econom...
23 篇 key laboratory o...
21 篇 school of inform...
20 篇 key laboratory o...
18 篇 key laboratory o...
18 篇 key lab of data ...
18 篇 key laboratory o...
18 篇 key laboratory o...

作者

71 篇 du xiaoyong
60 篇 chen hong
38 篇 li cuiping
38 篇 xiaoyong du
34 篇 wu xindong
33 篇 he jun
33 篇 wang meng
31 篇 liu hongyan
30 篇 li xirong
29 篇 hong chen
29 篇 wang shan
28 篇 zhang jing
26 篇 xindong wu
23 篇 sun geng
20 篇 niyato dusit
19 篇 huang qingming
19 篇 hong richang
18 篇 shan wang
18 篇 liu jun
18 篇 xu qianqian

语言

1,035 篇 英文
47 篇 其他
24 篇 中文

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

共 1106 条记录，以下是821-830 订阅

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

详细简洁

排序：

Integrated retrieval over structured and unstructured data

Integrated retrieval over structured and unstructured data

引用

2012 Cross Language Evaluation Forum Conference, CLEF 2012

作者： Wang, Qiuyue Kang, Jinglin School of Information Renmin University of China Beijing100872 China Key Lab of Data Engineering and Knowledge Engineering MOE Beijing100872 China

We report our experiment results on the INEX 2012 Linked data Track. We participated in the ad hoc and jeopardy tasks. As the new data collection on INEX 2012 Linked data Track features a combination of unstructured and structured data, our first attempt is to investigate different strategies of combining the retrievals over structured and unstructured data, and compare the combined approaches with the traditional unstructured ones. In this paper, we discussed three types of combination strategies and we experimented two of them on the track. The experiment results show that.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Location selection for utility maximization with capacity constraints 12

Location selection for utility maximization with capacity co...

引用

21st ACM International Conference on Information and knowledge Management, CIKM 2012

作者： Sun, Yu Huang, Jin Chen, Yueguo Zhang, Rui Du, Xiaoyong School of Information Renmin University of China Beijing China University of Melbourne Melbourne VIC Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9781450311564

Given a set of client locations, a set of facility locations where each facility has a service capacity, and the assumptions that: (i) a client seeks service from its nearest facility;(ii) a facility provides service to clients in the order of their proximity, we study the problem of selecting all possible locations such that setting up a new facility with a given capacity at these locations will maximize the number of served clients. This problem has wide applications in practice, such as setting up new distribution centers for online sales business and building additional base stations for mobile subscribers. We formulate the problem as location selection query for utility maximization. After applying three pruning rules to a baseline solution,we obtain an efficient algorithm to answer the query. Extensive experiments confirm the efficiency of our proposed algorithm. © 2012 ACM.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Bayesian network structure learning from attribute uncertain data

Bayesian network structure learning from attribute uncertain...

引用

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

作者： Song, Wenting Yu, Jeffrey Xu Cheng, Hong Liu, Hongyan He, Jun Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China Chinese University of Hong Kong Hong Kong Hong Kong Department of Manage. Sci. and Eng. Tsinghua University China

ISBN: (纸本)9783642322808

In recent years there has been a growing interest in Bayesian Network learning from uncertain data. While many researchers focus on Bayesian Network learning from data with tuple uncertainty, Bayesian Network structure learning from data with attribute uncertainty gets little attention. In this paper we make a clear definition of attribute uncertain data and Bayesian Network Learning problem from such data. We propose a structure learning method named DTAU based on information theory. The algorithm assumes that the structure of a Bayesian network is a tree. It avoids enumerating all possible worlds. The dependency tree is computed with polynomial time complexity. We conduct experiments to demonstrate the effectiveness and efficiency of our method. The experiments show the clustering results on uncertain dataset by our dependency tree are acceptable. © 2012 Springer-Verlag.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共111页 << < 79 80 81 82 83 84 85 86 87 88 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：