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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

352 篇 期刊文献
315 篇 会议

馆藏范围

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

日期分布

学科分类号

449 篇 工学
- 347 篇 计算机科学与技术...
- 300 篇 软件工程
- 96 篇 信息与通信工程
- 50 篇 电气工程
- 45 篇 控制科学与工程
- 44 篇 生物工程
- 39 篇 化学工程与技术
- 29 篇 生物医学工程（可授...
- 26 篇 电子科学与技术（可...
- 24 篇 机械工程
- 17 篇 光学工程
- 16 篇 航空宇航科学与技...
- 15 篇 建筑学
- 13 篇 交通运输工程
- 12 篇 仪器科学与技术
- 12 篇 土木工程
- 11 篇 动力工程及工程热...
199 篇 理学
- 116 篇 数学
- 50 篇 生物学
- 43 篇 统计学（可授理学、...
- 34 篇 物理学
- 25 篇 化学
- 14 篇 系统科学
144 篇 管理学
- 88 篇 管理科学与工程(可...
- 68 篇 图书情报与档案管...
- 29 篇 工商管理
30 篇 医学
- 24 篇 临床医学
- 19 篇 基础医学(可授医学...
- 12 篇 药学(可授医学、理...
15 篇 法学
- 13 篇 社会学
10 篇 农学
9 篇 经济学
3 篇 教育学
3 篇 文学
2 篇 艺术学

主题

35 篇 semantics
21 篇 knowledge engine...
21 篇 training
20 篇 conferences
20 篇 data mining
18 篇 feature extracti...
15 篇 task analysis
14 篇 deep learning
12 篇 data models
11 篇 big data
11 篇 machine learning
10 篇 computational mo...
10 篇 visualization
9 篇 object detection
9 篇 knowledge graph
8 篇 computer science
8 篇 knowledge manage...
8 篇 convolution
8 篇 contrastive lear...
8 篇 predictive model...

机构

89 篇 school of inform...
86 篇 school of comput...
32 篇 college of compu...
31 篇 key laboratory o...
24 篇 key laboratory o...
24 篇 key laboratory o...
22 篇 key laboratory o...
20 篇 key laboratory o...
18 篇 key laboratory o...
14 篇 key labs of data...
14 篇 key laboratory o...
14 篇 key laboratory o...
13 篇 college of compu...
13 篇 pazhou lab
13 篇 department of ma...
12 篇 key laboratory o...
12 篇 key laboratory o...
12 篇 key laboratory o...
11 篇 school of softwa...
10 篇 mininglamp acade...

作者

32 篇 wu xindong
29 篇 du xiaoyong
28 篇 chen hong
23 篇 sun geng
22 篇 xindong wu
21 篇 li cuiping
20 篇 niyato dusit
17 篇 wang meng
17 篇 zhang jing
17 篇 xiaoyong du
15 篇 liu hongyan
15 篇 xuegang hu
15 篇 wang yang
15 篇 li jiahui
15 篇 wang jiacheng
14 篇 he jun
14 篇 chenyang bu
13 篇 meng wang
13 篇 hong chen
13 篇 zhao zhang

语言

611 篇 英文
43 篇 其他
13 篇 中文

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

共 667 条记录，以下是571-580 订阅

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

详细简洁

排序：

Extracting domain-relevant term using wikipedia based on random walk model

Extracting domain-relevant term using wikipedia based on ran...

引用

7th ChinaGrid Annual Conference, ChinaGrid 2012

作者： Wu, Wenjuan Liu, Tao Hu, He Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China

ISBN: (纸本)9780769548166

In this paper we present a new approach for the automatic identification of domain-relevant concepts and entities of a given domain using the category and page structures of the Wikipedia in a language independent way. By applying Markov random walk algorithm on the weighted Wikipedia link graph, our approach can identify large quantities of domain-relevant concepts and entities with very little human effort. Experimental results show that our method achieves high accuracy and acceptable efficiency in domainrelevant term extraction. © 2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Radical features for Chinese text classification

Radical features for Chinese text classification

引用

2012 9th International Conference on Fuzzy Systems and knowledge Discovery, FSKD 2012

作者： Hu, He Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Infonnation Renmin University of China Beijing China

ISBN: (纸本)9781467300223

Chinese radicals play important roles in forming Chinese character's semantic meaning. The semantic properties of radicals make them a promising source of information to be analyzed in text mining and content extraction. However, until recently there is little research work concentrating on using the radical set in text mining related tasks. We investigate the roles of radicals in Chinese text classification tasks. In the task, texts are transformed into vectors of radicals, characters and words. Radicals are further pruned by their semantic strengths and network traits. We carry out experiments with real data from Open Directory Project. The experiments results justify Chinese radicals as important features for semantic processing in Chinese text mining tasks. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Predicting retweet behavior in Weibo social network

Predicting retweet behavior in Weibo social network

引用

13th International Conference on Web Information Systems engineering, WISE 2012

作者： Zhang, Hongbo Zhao, Qun Liu, Hongyan Xiao, Ke He, Jun Du, Xiaoyong Chen, Hong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China School of Economics and Management Tsinghua University China

ISBN: (纸本)9783642350627

Retweeting ensures the information diffusion in micro-blog services. By this simple way, it is convenient for a user to share and spread interesting information in the whole network. In this paper, we consider many features to compute the probability that a user retweets a tweet. With the probability, we build a retweet model to predict the number of possible-views of a tweet. The model is based on the theory of random walks. Experiments conducted on real dataset show that the proposed method has a good performance than the traditional prediction methods. © 2012 Springer-Verlag.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Information propagation in online social networks based on user behavior

Information propagation in online social networks based on u...

引用

3rd International Conference on Information Computing and Applications, ICICA 2012

作者： Li, Niu Han, Xiaoting Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China School of Economics and Management Beihang University Beijing China

ISBN: (纸本)9783642340611

Along with the development of Internet and Web2.0, online social networks (OSNs) are becoming an important information propagation platform. Therefore, it is of great significance to study the information propagation rules in OSNs. An information propagation model named IP-OSN is proposed in this paper, and some simulation experiments are carried out to investigate the mechanism of information propagation. From the experimental results, we can see that along with the information propagation, the number of known nodes increases and reaches its maximum, then keep an unchanging status. Moreover, from the user behavior aspect, we find that different user behavior in OSNs causes different information propagation results, the more users who are willing to diffuse information, the more scope the information can propagate and the faster the information diffuses. Findings in this paper are meaningful for theory of information propagation and complex networks. © 2012 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共67页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：