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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

653 篇 会议
481 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

735 篇 工学
- 598 篇 计算机科学与技术...
- 485 篇 软件工程
- 171 篇 信息与通信工程
- 75 篇 控制科学与工程
- 66 篇 生物工程
- 59 篇 电气工程
- 42 篇 电子科学与技术（可...
- 38 篇 化学工程与技术
- 36 篇 机械工程
- 29 篇 生物医学工程（可授...
- 24 篇 仪器科学与技术
- 23 篇 动力工程及工程热...
- 18 篇 建筑学
- 17 篇 光学工程
- 17 篇 交通运输工程
- 17 篇 航空宇航科学与技...
- 14 篇 土木工程
302 篇 理学
- 182 篇 数学
- 66 篇 生物学
- 57 篇 统计学（可授理学、...
- 52 篇 物理学
- 40 篇 化学
- 24 篇 系统科学
298 篇 管理学
- 181 篇 图书情报与档案管...
- 144 篇 管理科学与工程(可...
- 47 篇 工商管理
39 篇 法学
- 33 篇 社会学
29 篇 医学
- 26 篇 临床医学
- 19 篇 基础医学(可授医学...
20 篇 经济学
- 20 篇 应用经济学
7 篇 教育学
6 篇 文学
5 篇 农学
1 篇 军事学
1 篇 艺术学

主题

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

机构

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

作者

70 篇 du xiaoyong
63 篇 chen hong
41 篇 li cuiping
38 篇 xiaoyong du
33 篇 wang meng
32 篇 he jun
32 篇 wu xindong
31 篇 liu hongyan
30 篇 li xirong
29 篇 hong chen
29 篇 wang shan
29 篇 zhang jing
28 篇 xindong wu
23 篇 sun geng
21 篇 niyato dusit
21 篇 liu jun
19 篇 huang qingming
19 篇 hong richang
18 篇 shan wang
18 篇 xu qianqian

语言

1,005 篇 英文
110 篇 其他
23 篇 中文

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

共 1138 条记录，以下是851-860 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

RUC @ INEX 2011 data-centric track

RUC @ INEX 2011 data-centric track

引用

Lecture Notes in Computer Science

作者： Wang, Qiuyue Gan, Yantao Sun, Yu School of Information Renmin University of China China Key Lab. of Data Engineering and Knowledge Engineering MOE Beijing 100872 China

ISBN: (纸本)9783642357336

We report our experiment results on the INEX 2011 data-Centric Track. We participated in both the ad hoc and faceted search tasks. On the ad hoc search task, we employ language modeling approaches to do structured object retrieval, trying to capture both the structure in data and structure in query and unify the structured and unstructured information retrieval in a general framework. However, our initial experimental results using INEX test bed show that the unstructured retrieval model performs better than structured retrieval models. On the faceted search task, we propose a simple user-simulation model to evaluate the effectiveness of a faceted search system's recommending facet-values. We implemented the evaluation system and conducted the evaluations for the track. We also tested basic redundancy and relevance based approaches for recommending facet-values. The results show that our basic approaches of recommending facet-values perform quite well. © Springer-Verlag 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Co-spatial searcher: Efficient tag-based collaborative spatial search on geo-social network

Co-spatial searcher: Efficient tag-based collaborative spati...

引用

17th International Conference on database Systems for Advanced Applications, DASFAA 2012

作者： Zhang, Jinzeng Meng, Xiaofeng Zhou, Xuan Liu, Dongqi School of Information Renmin University of China Beijing China Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China

ISBN: (纸本)9783642290374

The proliferation of geo-social network, such as Foursquare and Facebook Places, enables users to generate location information and its corresponding descriptive tags. Using geo-social networks, users with similar interests can plan for social activities collaboratively. This paper proposes a novel type of query, called Tag-based top-k Collaborative Spatial (TkCoS) query, for users to make outdoor plans collaboratively. This type of queries aim to retrieve groups of geographic objects that can satisfy a group of users' requirements expressed in tags, while ensuring that the objects be within the minimum spatial distance from the users. To answer TkCoS queries efficiently, we introduce a hybrid index structure called Spatial-Tag R-tree (STR-tree), which is an extension of the R-tree. Based on STR-tree, we propose a query processing algorithm that utilizes both spatial and tag similarity constraints to prune search space and identify desired objects quickly. Moreover, a differential impact factor is adopted to fine-tune the returned results in order to maximize the users' overall satisfaction. Extensive experiments on synthetic and real datatsets validate the efficiency and the scalability of the proposed algorithm. © 2012 Springer-Verlag.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Combining spatial cloaking and dummy generation for location privacy preserving

Combining spatial cloaking and dummy generation for location...

引用

8th International Conference on Advanced data Mining and Applications, ADMA 2012

作者： Xu, Nana Zhu, Dan Liu, Hongyan He, Jun Du, Xiaoyong Liu, Tao Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783642355264

Location privacy preserving is attracting more and more attentions with the wide use of accurate positioning devices. Two kinds of methods based on k-anonymity have been proposed for location privacy preserving. One is spatial cloaking and the other is dummy generation. However, simple cloaking may result in large cloaking region, especially when user distribution is sparse. Large cloaking region means low efficiency and high time cost. Dummy generation will also arouse great extra system cost. In this paper, we propose an approach that combines the two techniques to achieve an ideal complement. On one hand, cloaking algorithm is used to blur precise location into a region so that location privacy can be well protected. On the other hand, to those users whose cloaking region is large, generating limited number of dummies can help decrease the size of region. The effectiveness of our methods has been demonstrated by comprehensive experiments. © Springer-Verlag 2012.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共114页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：