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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是41-50 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Renmin University of China at ImageCLEF 2013 scalable concept image annotation

Renmin University of China at ImageCLEF 2013 scalable concep...

引用

2013 Cross Language Evaluation Forum Conference, CLEF 2013

作者： Li, Xirong Liao, Shuai Liu, Binbin Yang, Gang Jin, Qin Xu, Jieping Du, Xiaoyong Key Lab of Data Engineering and Knowledge Engineering MOE Japan Multimedia Computing Lab School of Information Renmin University of China Zhongguancun Street 59 Beijing100872 China

In this paper we describe our image annotation system par ticipated in the ImageCLEF 2013 scalable concept image annotation task. The system leverages multiple base classifiers, including single feature and multi-feature kNN classifiers and histogram intersection ker nel SVMs, all of which are learned from the provided 250K web images and provided features with no extra manual verification. These base clas sifiers are combined into a stacked model, with the combination weights optimized to maximize the geometric mean of F-samples, F-concepts, and AP-samples metrics on the provided development set. By varying the configuration of the system, we submitted five runs. Evaluation re sults show that for all of our runs, model stacking with optimized weights performs best. Our system can annotate diverse Internet images purely based on the visual content, at the following accuracy level: F-samples of 0.290, F-concepts of 0.304, and AP-samples of 0.380. What is more, a system-to-system comparison reveals that our system and the best sub mission this year are complementary with respect to the best annotated concepts, suggesting the potential for future improvement.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Top-k neighborhood dominating query

Top-k neighborhood dominating query

引用

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

作者： Xie, Xike Lu, Hua Chen, Jinchuan Shang, Shuo Department of Computer Science Aalborg University Denmark Key Labs of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9783642374869

In many real-life applications, spatial objects are associated with multiple non-spatial attributes. For example, a hotel may have price and rating in addition to its geographic location. In traditional spatial databases, spatial objects are often ranked solely based on their distance to a given query location, e.g., in a nearest neighbor search. In another line of research, domination based skyline queries are used to return best objects according to multi-criteria on non-spatial attributes. In this paper, we study how to rank spatial objects with respect to their non-spatial attributes within their spatial neighborhoods. To enable a general ranking, we design a ranking function that inherits the advantages of dominance relationship and integrates them with spatial proximity. Further, we propose an effective index structure, and a branch and bound solution that executes the ranking efficiently via the index. We conduct extensive empirical studies on real and synthetic datasets. The results demonstrate the high efficiency of our proposal compared to straightforward alternatives. © Springer-Verlag 2013.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Efficient SPARQL query evaluation via automatic data partitioning

Efficient SPARQL query evaluation via automatic data partiti...

引用

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

作者： Yang, Tao Chen, Jinchuan Wang, Xiaoyan Chen, Yueguo Du, Xiaoyong School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9783642374494

The volume of RDF data increases very fast within the last five years, e.g. the Linked Open data cloud grows from 2 billions to 50 billions of RDF triples. With its wonderful scalability, cloud computing platform like Hadoop is a good choice for processing queries over large data sets. Previous works on evaluating SPARQL queries with Hadoop mainly focus on reducing the number of joins through careful split of HDFS files and algorithms for generating Map/Reduce jobs. However, the way of partitioning RDF data could also affect the performance. Specifically, a good partitioning will greatly reduce or even totally avoid cross-node joins and significantly reduce the cost of query evaluation. Based on HadoopDB, this work processes SPARQL queries in a hybrid architecture where Map/Reduce takes charge of the computing tasks and an RDF query engine, RDF-3X, stores the data and evaluates join operations over local data. Based on analysis of query work-loads, we propose a novel algorithm for automatically partitioning RDF data. We also present an approximate solution to physically place the partitions in order to reduce data redundancy. All the proposed approaches are evaluated by extensive experiments over large RDF data sets. © Springer-Verlag 2013.

关键词： Resource Description Framework (RDF)

来源：评论

学校读者我要写书评

暂无评论

Cross-codebook image classification

Cross-codebook image classification

引用

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Liao, Shuai Li, Xirong Du, Xiaoyong Key Lab of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China Beijing 100872 China State Key Lab of Software Development Environment Beijing 100191 China

ISBN: (纸本)9783319037301

Representing images by bag of visual codes (BoVC) features has been the cornerstone of state-of-the-art image classification system. Since the BoVC features depend on a precomputed codebook in use, when the codebook applied to test images differs from the codebook of an existing image classification system, the system becomes inapplicable. To resolve the codebook incompatibility problem, we propose in this paper cross-codebook image classification. This is achieved by transforming BoVC features derived from one codebook to make them compatible with another codebook. Two BoVC transform methods, i.e., code-reassignment and least squares, are studied. Experiments on a popular image classification benchmark set show that both methods are better than random guess when crossing the codebooks. In particular, when the BoVC features are transformed from a higher dimension to a relatively small dimension, cross-codebook image classification has a similar performance compared to within-codebook image classification, with a relative performance loss of 1.3% only. The results justify the feasibility of the proposed cross-codebook image classification. © Springer International Publishing Switzerland 2013.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Assessing the Influence Probability between Objects: A Random Walker Approach

Assessing the Influence Probability between Objects: A Rando...

引用

IEEE Symposium on Computational Intelligence and data Mining

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

ISBN: (纸本)9781424427659

Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influence based on the random walker model on graphs. Two approaches, linear systems method and Basic InfRank algorithm, are shown and return equal results, but Basic InfRank is more efficient by iterative computation. Two variants on bipartite graphs and star graphs are discussed. Experiments show InfRank algorithms have good accuracy, fast convergent rate and high performance.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Building bilingual ontology from WordNet and Chinese classified thesaurus

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： He, Hu Xiaoyong, Du School of Information Renmin University of China 100872 Beijing China Key Lab. of Data and Knowledge Engineering MOE 100872 Beijing China

ISBN: (纸本)9783540767183

Both WordNet and Chinese Classified Thesaurus(CCT) are widely used in information retrieval and management systems. In this paper we propose a novel approach for building bilingual ontologies based on these existing knowledge bases, WordNet and CCT. The bilingual ontology has the merit that contains both domain related and general purpose semantic information coverage from these two complementary knowledge sources. A lattice based similarity measure and assessment algorithm is used for aligning and merging these two knowledge bases. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Ontology hierarchies matching by lattices alignment

Ontology hierarchies matching by lattices alignment

引用

2nd International Workshop on Ontology Matching, OM-2007 - Collocated with the 6th International Semantic Web Conference, ISWC-2007 and the 2nd Asian Semantic Web Conference, ASWC-2007

作者： He, Hu Du, Xiaoyong School of Information Renmin University of China 100872 Beijing China Key Lab. of Data and Knowledge Engineering MOE 100872 Beijing China

Ontology matching determines the correspondences between concepts and relations of related ontologies. In this paper, we put forward an ontology hierarchies matching approach based on lattices alignment. The proposed lattice-based matching algorithm can be utilized not only in matching processes between two ontologies, but also in annotation processes between an ontology and its corresponding resources. Experiments on spatiotemporal ontology annotation have been carried out which shown the applicability of the approach.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

XRCJ: Supporting keyword search in XML and relation co-occurrence

XRCJ: Supporting keyword search in XML and relation co-occur...

引用

1st International Workshop on Graph database, IWGD 2010, 1st International Workshop on Advanced Techniques on XML data Management, XMLDM 2010, 2nd International Workshop on WCMT 2010, Held in Conj. with WAIM 2010

作者： Zhang, Song Du, Xiaoyong Key Lab. of Data Engineering and Knowledge Engineering School of Information Renmin University of China China

ISBN: (纸本)3642167195

keyword search is a proven, user-friendly way to query html documents in the World Wide Web. With the trend of integrating IR technologies into DB community, state-of-the-art studies have introduced keyword search into XML and relation. In this paper we introduce keyword search into a new circumstance called XRC (XML and relation co-occurrence) where XML and relational data exist at the same storage. By exploring semantic relationships between data from relation and XML, we enable users who intend to visit data from XML and relation to access information in an easier manner. To achieve this target, we propose a novel operation called XRCJ which connects data from XML and relation together when answering search query. We also improve traditional inverted index and design a mixed inverted index. Through conducting extensive experiments on synthetic data from real data set DBLP, we find that our method can achieve a good performance in XML and relation co-occurrence circumstance. © 2010 Springer-Verlag.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

TYG: A tag-as-you-go online annotation tool for web browsing and navigation

TYG: A tag-as-you-go online annotation tool for web browsing...

引用

6th International Conference on knowledge Science, engineering and Management, KSEM 2013

作者： Hu, He Du, Xiaoyong School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing 100872 China

ISBN: (纸本)9783642397868

We present TYG (Tag-as-You-Go) in this paper, a chrome browser extension for personal knowledge annotation on standard web pages. We investigate an approach to combine a K-Medoid-style clustering algorithm with the user input to achieve semi-automatic web page annotation. The annotation process supports user-defined tagging schema and comprises an automatic mechanism that is built upon clustering techniques, which can group similar html nodes into clusters corresponding to the user specification. TYG is a prototype system illustrating the proposed approach. Experiments with TYG show that our approach can achieve both efficiency and effectiveness in real world annotation scenarios. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：