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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

454 篇 会议
375 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

521 篇 工学
- 425 篇 计算机科学与技术...
- 356 篇 软件工程
- 118 篇 信息与通信工程
- 54 篇 生物工程
- 53 篇 控制科学与工程
- 44 篇 电气工程
- 30 篇 机械工程
- 29 篇 化学工程与技术
- 27 篇 电子科学与技术（可...
- 24 篇 生物医学工程（可授...
- 19 篇 动力工程及工程热...
- 18 篇 仪器科学与技术
- 15 篇 建筑学
- 13 篇 交通运输工程
- 12 篇 光学工程
- 11 篇 材料科学与工程（可...
231 篇 管理学
- 140 篇 图书情报与档案管...
- 116 篇 管理科学与工程(可...
- 36 篇 工商管理
214 篇 理学
- 126 篇 数学
- 53 篇 生物学
- 36 篇 物理学
- 34 篇 统计学（可授理学、...
- 32 篇 化学
- 15 篇 系统科学
34 篇 法学
- 29 篇 社会学
23 篇 医学
- 21 篇 临床医学
- 16 篇 基础医学(可授医学...
- 12 篇 药学(可授医学、理...
15 篇 经济学
- 15 篇 应用经济学
6 篇 教育学
5 篇 文学
4 篇 农学
1 篇 艺术学

主题

41 篇 semantics
28 篇 data mining
28 篇 training
22 篇 knowledge engine...
17 篇 feature extracti...
15 篇 conferences
15 篇 big data
15 篇 laboratories
15 篇 computational mo...
14 篇 information retr...
14 篇 data models
13 篇 task analysis
13 篇 xml
13 篇 databases
12 篇 knowledge graph
12 篇 wireless sensor ...
12 篇 predictive model...
12 篇 visualization
11 篇 query processing
11 篇 deep learning

机构

154 篇 school of inform...
103 篇 school of comput...
44 篇 key laboratory o...
40 篇 key laboratory o...
32 篇 school of inform...
29 篇 jiangxi key labo...
29 篇 key laboratory o...
28 篇 key laboratory o...
23 篇 key laboratory o...
19 篇 school of inform...
19 篇 key laboratory o...
19 篇 college of compu...
18 篇 school of econom...
18 篇 key laboratory o...
18 篇 key laboratory o...
16 篇 key laboratory o...
16 篇 school of cyber ...
16 篇 key laboratory o...
15 篇 key laboratory o...
14 篇 school of inform...

作者

44 篇 chen hong
33 篇 du xiaoyong
28 篇 zhang jing
27 篇 li cuiping
26 篇 xindong wu
26 篇 wang meng
25 篇 xiaoyong du
24 篇 wu xindong
24 篇 wang shan
18 篇 liu jun
18 篇 hong chen
18 篇 huang qingming
17 篇 xu qianqian
17 篇 wan changxuan
16 篇 hong richang
15 篇 meng wang
15 篇 wang yang
15 篇 chenyang bu
13 篇 xuegang hu
13 篇 zhao zhang

语言

776 篇 英文
34 篇 其他
20 篇 中文

检索条件"机构=In formation School and Key Laboratory of Data Engineering and Knowledge Engineering"

共 830 条记录，以下是321-330 订阅

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

详细简洁

排序：

Page Query Language Generation for Structural Extraction

Page Query Language Generation for Structural Extraction

引用

The 2014 10th International Conference on Natural Computation (ICNC 2014) and the 2014 11th International Conference on Fuzzy Systems and knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)

作者： He Hu Xiaoyong Du School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge EngineeringMOE BeijingChina

ISBN: (纸本)9781479951499

The information on the Web is usually fabricated to be understandable by human users rather than ***'s not easy to automatically catalogue and extract the Web information solely with a software *** on these observations,we present an approach that uses human guided operations to automatically generate a PQL query,a SQL like query language focusing on Web pages,to extract the interested information fragments on Web *** PQL query uses XPath expressions to locating the target HTML *** develop a K-Medoid clustering algorithm to process PQL queries to generate the structural *** extracted information is structured as a relational table(in CSV format)which can be manipulated smoothly with spreadsheet software or a relational DBMS system.

关键词： PQL Structural Extraction Browser Extension

来源：评论

学校读者我要写书评

暂无评论

Mining Approximate Closed Frequent Itemsets over Stream

Mining Approximate Closed Frequent Itemsets over Stream

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Haifeng Li Zongjian Lu Hong Chen School of Information Key Laboratory of Data Engineering and Knowledge EngineeringMOEg Renmin University of China Beijing China

ISBN: (纸本)9780769532636

Frequent itemset mining is a very important problem in data mining. Closed frequent itemsets is the condensed representation of frequent itemsets thus spend less memory, so it is much suitable for stream mining. But on the other hand, when the minimum support is much lower, the size of closed frequent itemsets turns larger, which makes the performance reduced a lot. In this paper, we introduce a threshold to approximately mine closed frequent itemsets with a limited error tolerance. A new algorithm named ACFIM is proposed based on the introduction of the distance conception to mine the sliding window of stream, in which more data are pruned and more computation time are saved, so it much raise the performance in running time and memory comparing to the state-of-art closed frequent itemsets mining methods. Our experimental results over real-life datasets show that ACFIM is effective and efficient.

关键词： Itemsets data mining Distance measurement Pediatrics Approximation algorithms Approximation methods databases

来源：评论

学校读者我要写书评

暂无评论

Modeling User_s Cognitive Structure in Contextual Information Retrieval

Modeling User_s Cognitive Structure in Contextual Informatio...

引用

International Conference on Fuzzy Systems and knowledge Discovery (FSKD)

作者： Xuan Tian Xiaoyong Du He Hu Haihua Li School of Information Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

In contextual information retrieval, the retrieval of information depends on the time and place of submitting query, history of interaction, task in hand, and many other factors that are not given explicitly but implicitly lie in the interaction and surroundings of searching, namely the context. User's cognition is one of important contextual factors for understanding his or her personal needs. We propose a model called DOSAM to get user's individual cognitive structure on domain knowledge. DOSAM is developed from the spreading-activation model of psychology and is established on the domain ontology. The cost analysis of algorithm shows that it is feasible to get cognitive structure by DOSAM. Personalized search experimental results on digital library indicate that DOSAM can help improve the search effectiveness and user's satisfaction.

关键词： Context modeling Information retrieval Ontologies Cognition History Psychology Helium Laboratories data engineering knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Geometric Routing Precluding Loops and Dead Ends in 3-D Wireless Sensor Networks

Geometric Routing Precluding Loops and Dead Ends in 3-D Wire...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Jun Duan Deying Li Wenping Chen Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing China

Numerous algorithms on geometric networks has been studied, and most of them were based on 2-dimensional networks. But 2-dimensional geometric routing algorithms cannot be directly adapted to the 3-dimensional networks. In this paper, we propose routing algorithms based on the iteration of specific angles on the networks of Delaunay Triangulation in 3D space, and prove the certainty of data transmission of our routing algorithms. In the algorithms, the messages only need to carry information of O(1) nodes and each node just keeps 1-hop neighbors' information.

关键词： Routing Peer to peer computing Three dimensional displays Algorithm design and analysis Compass Wireless sensor networks Relays

来源：评论

学校读者我要写书评

暂无评论

Unsupervised vehicle re-identification with progressive adaptation 29

Unsupervised vehicle re-identification with progressive adap...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Peng, Jinjia Wang, Yang Wang, Huibing Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University Liaoning Dalian China Pengcheng Laboratory Shenzhen Guangdong China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

ISBN: (纸本)9780999241165

Vehicle re-identification (reID) aims at identifying vehicles across different non-overlapping cameras views. The existing methods heavily relied on well-labeled datasets for ideal performance, which inevitably causes fateful drop due to the severe domain bias between the training domain and the real-world scenes;worse still, these approaches required full annotations, which is labor-consuming. To tackle these challenges, we propose a novel progressive adaptation learning method for vehicle reID, named PAL, which infers from the abundant data without annotations. For PAL, a data adaptation module is employed for source domain, which generates the images with similar data distribution to unlabeled target domain as "pseudo target samples". These pseudo samples are combined with the unlabeled samples that are selected by a dynamic sampling strategy to make training faster. We further proposed a weighted label smoothing (WLS) loss, which considers the similarity between samples with different clusters to balance the confidence of pseudo labels. Comprehensive experimental results validate the advantages of PAL on both VehicleID and VeRi-776 dataset. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Optimizing Random Access to Hierarchically-Compressed data on GPU

Optimizing Random Access to Hierarchically-Compressed Data o...

引用

Supercomputing Conference

作者： Feng Zhang Yihua Hu Haipeng Ding Zhiming Yao Zhewei Wei Xiao Zhang Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering (MOE) School of Information Renmin University of China Beijing China

ISBN: (纸本)9781665454452

GPU's powerful computational capacity holds great potentials for processing hierarchically-compressed data without decompression in data science domain. Unfortunately, existing GPU approaches offer only traversal-based data analytics; random access is extremely inefficient, substantially limiting their utility. To solve this problem, we develop a novel and broadly applicable optimization that enables efficient random access to hierarchically-compressed data without decompression in GPU memory. We address three major challenges for enabling efficient random access to compressed data on GPUs. The first challenge is designing GPU data structures that support random access. The second challenge is efficiently generating data structures on GPU. Generating data structures for random access is costly on the CPU, and the inefficiency increases dramatically when PCIe data transmission is incorporated. The third challenge is query processing on compressed data in GPU memory. Random accesses, including data updates, result in significant conflicts between massive threads. To solve the first challenge, we propose and modify a number of compressed data structures, including indexing within the complicated GPU memory hierarchy. To address the second challenge, we develop a two-phase process for generating these data structures on the GPU. To handle the third challenge, we propose a double-parsing design to avoid data conflicts. We evaluate our solution on two GPU platforms using five real-world datasets. Experiments show that the random access operations on GPU can achieve 65.04x average speedup compared to the state-of-the-art method.

关键词： Limiting Query processing Instruction sets High performance computing Memory management Graphics processing units data science

来源：评论

学校读者我要写书评

暂无评论

Cutting Learned Index into Pieces: An In-depth Inquiry into Updatable Learned Indexes

Cutting Learned Index into Pieces: An In-depth Inquiry into ...

引用

International Conference on data engineering

作者： Jiake Ge Boyu Shi Yanfeng Chai Yuanhui Luo Yunda Guo Yinxuan He Yunpeng Chai Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China

Numerous high-performance updatable learned indexes have recently been designed to support the writing requirements in practical systems. Researchers have proposed various strategies to improve the availability of updatable learned indexes. However, it is unclear which strategy is more profitable. Therefore, we deconstruct the design of learned indexes into multiple dimensions and in-depth evaluate their impacts on the overall performance, respectively. Through the in-depth exploration of learned indexes, we reckon that the approximation algorithm is the most crucial design dimension for improving the performance of the learned indexes rather than the popular works that focus on the learned index structure. Moreover, this paper makes a comprehensive end-to-end evaluation based on a high-performance key-value store to answer people’s concerns about which learned index is better and whether learned indexes can outperform traditional ones. Finally, according to end-to-end and in-depth evaluation results, we give some constructive suggestions on designing a better learned index in these dimensions, especially how to design an excellent approximate algorithm to improve the lookup and insertion performance of learned indexes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sentiment classification via L2-norm deep belief network 11

Sentiment classification via L2-norm deep belief network

引用

20th ACM Conference on Information and knowledge Management, CIKM'11

作者： Liu, Tao Li, Minghui Zhou, Shusen Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering MOE 100872 Beijing China School of Information Renmin University of China 100872 Beijing China Microsoft Asian Research and Development Group 100080 Beijing China Shenzhen Graduate School Harbin Institute of Technology 518055 Shenzhen China

ISBN: (纸本)9781450307178

Automatic analysis of sentiments expressed in large scale online reviews is very important for intelligent business applications. Sentiment classification is the most popular task of sentiment analysis, which is more challenging than traditional topic-based text classification. Basic features, such as vocabulary words, are not enough to classify sentiments well. Deep Belief Network (DBN) is introduced to discover more abstract features of sentiments. To capture full information of the features, large-size network can be constructed, but at the same time, large-size network tends to over fit the training data and even noise, which will reduce the generalization ability of the network. In this paper, L2-norm Deep Belief Network (L2DBN) is proposed, which uses L2-norm regularization to optimize the network parameters of DBN. L2DBN is first initialized by an unsupervised layer-wise training algorithm, and then fine-tuned by a supervised procedure. Network parameters are optimized using both classification loss and network complexity. Experimental results show that the proposed L2DBN outperforms the state-of-the-art method and the basic DBN on golden, noisy and heterogeneous datasets. © 2011 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Research on Web Services Selection Model Based on AHP

Research on Web Services Selection Model Based on AHP

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Bei Wu Meiyun Zuo Shijuan Wang Information School and Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China BeijingChina

This paper focuses on the problem that how to select the optimal service among many Web services which all meet the functional needs,establishes an index system for Web services products selection from four aspects,namely the supply side,the user,product and *** on this,we collect the views of 30 experts by Analytic Hierarchy Process (AHP) method and calculate the weight of each index at all levels based on the data collected from questionnaire *** the overall sample data analysis,we put two types of sample data namely business operation experts and academics for comparative *** Web services selection model proposed in this article can provide the reference to Web services managers when they selecting Web services,and also contributes to in-depth research on the adoption of Web services based information system.

关键词： web services selection model analytic hierarchy process information system

来源：评论

学校读者我要写书评

暂无评论

Improve Frequent Closed Itemsets Mining over data Stream with Bitmap

Improve Frequent Closed Itemsets Mining over Data Stream wit...

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Haifeng Li Hong Chen Key Laboratory of Data Engineering and Knowledge Engineering MOESchool of Information Renmin University of China Beijing China

ISBN: (纸本)9780769532639

Frequent itemsets mining is an important problem in data mining. Frequent closed itemsets mining provides complete and condensed information for frequent pattern analysis thus reduces the memory cost without accuracy loss. More research focus on stream mining with the more application of stream. Stream is fast and unlimited thus data had to be stored in limited memory, how to save running time and memory usage is the most important target. In this paper, we propose an improved frequent closed itemsets mining method based on traditional stream mining algorithm CFI-stream with bitmap coding named CLIMB (closed itemset mining with bitmap) over stream's sliding window. The distinct items are maintained in memory in lexicographic order and each itemset is coded to bit-sequence with the order of items, moreover, the bit-sequence is split into sections to be recoded to reduce the memory cost. The experimental results on real-life show that CLIMB algorithm is effective and efficient.

关键词： Itemsets data mining Encoding Decoding data structures Runtime Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共83页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：