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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

607 篇 会议
516 篇 期刊文献
17 册 图书

馆藏范围

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

日期分布

学科分类号

749 篇 工学
- 615 篇 计算机科学与技术...
- 507 篇 软件工程
- 157 篇 信息与通信工程
- 104 篇 生物工程
- 84 篇 控制科学与工程
- 78 篇 电气工程
- 53 篇 生物医学工程（可授...
- 48 篇 建筑学
- 45 篇 光学工程
- 44 篇 电子科学与技术（可...
- 43 篇 土木工程
- 36 篇 化学工程与技术
- 29 篇 机械工程
- 19 篇 航空宇航科学与技...
- 18 篇 动力工程及工程热...
- 15 篇 交通运输工程
403 篇 理学
- 240 篇 数学
- 111 篇 生物学
- 96 篇 统计学（可授理学、...
- 90 篇 物理学
- 39 篇 化学
- 39 篇 系统科学
- 16 篇 大气科学
264 篇 管理学
- 169 篇 图书情报与档案管...
- 108 篇 管理科学与工程(可...
- 40 篇 工商管理
65 篇 医学
- 58 篇 临床医学
- 45 篇 基础医学(可授医学...
- 33 篇 药学(可授医学、理...
35 篇 法学
- 33 篇 社会学
11 篇 经济学
9 篇 农学
8 篇 教育学
3 篇 文学
1 篇 哲学
1 篇 历史学
1 篇 军事学

主题

51 篇 semantics
39 篇 training
36 篇 data mining
24 篇 feature extracti...
23 篇 knowledge engine...
23 篇 machine learning
22 篇 computer science
22 篇 artificial intel...
21 篇 task analysis
21 篇 computational mo...
20 篇 visualization
17 篇 data engineering
17 篇 knowledge graph
16 篇 ontologies
15 篇 deep learning
15 篇 knowledge manage...
14 篇 conferences
14 篇 convolution
13 篇 ontology
12 篇 optimization

机构

105 篇 school of comput...
56 篇 department of da...
56 篇 department of da...
42 篇 key laboratory o...
34 篇 school of inform...
34 篇 college of compu...
29 篇 key laboratory o...
27 篇 department of ma...
25 篇 key laboratory o...
22 篇 knowledge and da...
21 篇 school of econom...
21 篇 key laboratory o...
17 篇 key laboratory o...
17 篇 key laboratory o...
16 篇 college of compu...
16 篇 data and knowled...
15 篇 institute of dat...
15 篇 school of cyber ...
15 篇 faculty of compu...
14 篇 school of comput...

作者

50 篇 nürnberger andre...
31 篇 wang meng
30 篇 wu xindong
27 篇 chatterjee soumi...
26 篇 he jun
25 篇 liu hongyan
24 篇 sun geng
23 篇 du xiaoyong
22 篇 xindong wu
22 篇 speck oliver
21 篇 niyato dusit
21 篇 spanakis gerasim...
21 篇 liu jun
19 篇 hong richang
19 篇 mehrkanoon siama...
18 篇 browne cameron
18 篇 o'sullivan decla...
18 篇 wang jiacheng
18 篇 wade vincent
17 篇 soemers dennis j...

语言

1,056 篇 英文
72 篇 其他
12 篇 中文

检索条件"机构=Data Science and Knowledge Engineering"

共 1140 条记录，以下是981-990 订阅

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

详细简洁

排序：

A fast two-stage algorithm for computing SimRank and its extensions

A fast two-stage algorithm for computing SimRank and its ext...

引用

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

作者： Jia, Xu Liu, Hongyan Zou, Li He, Jun Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China

ISBN: (纸本)3642167195

Similarity estimation can be used in many applications such as recommender system, cluster analysis, information retrieval and link prediction. SimRank is a famous algorithm to measure objects' similarities based on link structure. We observe that if one node has no in-link, similarity score between this node and any of the others is always zero. Based on this observation, we propose a new algorithm, fast two-stage SimRank (F2S-SimRank), which can avoid storing unnecessary zeros and can accelerate the computation without accuracy loss. Under the circumstance of no accuracy loss, this algorithm uses less computation time and occupies less main memory. Experiments conducted on real and synthetic datasets demonstrate the effectiveness and efficiency of our F2S-SimRank. © 2010 Springer-Verlag.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Detecting Hot Events from Web Search Logs

Detecting Hot Events from Web Search Logs

引用

11th International Conference on Web-Age Information Management (WAIM 2010)

作者： Gu, Yingqin Cui, Jianwei Liu, Hongyan Jiang, Xuan He, Jun Du, Xiaoyong Li, Zhixu Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing 100872 China Department of Management Science and Engineering Tsinghua University Beijing 100084 China

ISBN: (纸本)9783642142451

Detecting events from web resources is a challenging task, attracting many attentions in recent years. Web search log is an important data source for event detection because the information it contains reflects users' activities and interestingness to various real world events. There are three major issues for event detection from web search logs: effectiveness, efficiency and the organization of detected events. In this paper, we develop a novel Topic and Event Detection method, TED, to address these issues. We first divide the whole data into topics for efficiency consideration, and then incorporate link information, temporal information and query content to ensure the quality of detected events. Finally, events detected are organized through the proposed interestingness measure as well as topics they belong to. Experiments are conducted on a commercial search engine log. The results demonstrate that our method can effectively and efficiently detect hot events and give a meaningful organization of them.

关键词： Event detection click-through data efficient algorithm

来源：评论

学校读者我要写书评

暂无评论

VAN: Vehicle-assisted shortest-time path navigation

VAN: Vehicle-assisted shortest-time path navigation

引用

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

作者： Chen, Wenping Zhu, Sencun Li, Deying School of Information Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Department of Computer Science and Engineering Pennsylvania State University University Park PA United States

ISBN: (纸本)9781424474882

Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a dynamic navigation protocol called VAN for individual vehicles to find the shortest-time paths toward their given destinations. Specifically, a vehicle initiates a number of queries, which are routed by VANETs along different paths toward its destination. During query forwarding, the real-time road traffic information in each road segment is aggregated from multiple participating vehicles and returned to the source after the query reaches the destination. This information enables the source to calculate the shortest-time path. We also propose two forwarding optimization methods to reduce communication costs and an error handling mechanism to deal with abnormal circumstances. To evaluate its performance, we use the real traffic data of Beijing, including 2,308 road segments at two different times. Our simulation results demonstrate that our protocol, on average, could save around 30% driving time, compared to traveling along the shortest distance paths. ©2010 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Decision-maker-aware design of descriptive data mining

Decision-maker-aware design of descriptive data mining

引用

IWK 2010 Workshops: International Workshop on DERIS 2010 and the 1st International Workshop on Evolution Support for Model-Based Development and Testing, EMDT 2010 - Part of the Umbrella Conference 55th International Scientific Colloquium, IWK 2010

作者： Kaempgen, Benedikt Lemmerich, Florian Atzmueller, Martin Karlsruhe Germany University of Würzburg Department of Computer Science VI Würzburg Germany University of Kassel Knowledge and Data Engineering Group Kassel Germany

This paper presents two real-world case studies focussing on descriptive data mining for decision-makers. For that, we first propose a process-oriented design of descriptive data mining that helps in describing and performing such projects. Finally, we discuss important lessons learned during the implementation of the respective projects.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Augmenting bag-of-words - Category specific features and concept reasoning

Augmenting bag-of-words - Category specific features and con...

引用

2010 Cross Language Evaluation Forum Conference, CLEF 2010

作者： Mbanya, Eugene Hentschel, Christian Gerke, Sebastian Liu, Mohan Nurnberger, Andreas Ndjiki-Nya, Patrick Fraunhofer Institute for Telecommunications Heinrich Hertz Institute Germany Data and Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke-University Magdeburg Germany

In this paper we present our approach to the 2010 ImageClef PhotoAnnotation task. Based on the well-known bag-of-words approach we suggest two extensions. First, we analyzed the impact of category specific features and classifiers. In order to classify quality-related image categories we implemented a sharpness measure and use this as additional feature in the classification process. Second, we propose a post- classification step, which is based on the observation that many of the categories should be considered as being related to each other: Some categories exclude or allow for inference to others. We incorporate inference and exclusion rules by refining the classification results. The results we obtain show that both extensions can provide a classification performance increase when compared the the standard BoW approach.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Parallel SimRank computation on large graphs with iterative aggregation

Parallel SimRank computation on large graphs with iterative ...

引用

16th ACM SIGKDD International Conference on knowledge Discovery and data Mining, KDD-2010

作者： He, Guoming Feng, Haijun Li, Cuiping Chen, Hong Key Lab. of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science Renmin University of China China No. 59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781450300551

Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in practice;and 2) they can only be applied on static graphs. In this paper, we exploit the inherent parallelism and high memory bandwidth of graphics processing units (GPU) to accelerate the computation of SimRank on large graphs. Furthermore, based on the observation that SimRank is essentially a first-order Markov Chain, we propose to utilize the iterative aggregation techniques for uncoupling Markov chains to compute SimRank scores in parallel for large graphs. The iterative aggregation method can be applied on dynamic graphs. Moreover, it can handle not only the link-updating problem but also the node-updating problem. Extensive experiments on synthetic and real data sets verify that the proposed methods are efficient and effective. © 2010 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Local methods for estimating SimRank score

Local methods for estimating SimRank score

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Jia, Xu Liu, Hongyan Zou, Li He, Jun Du, Xiaoyong Cai, Yuanzhe Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China Department of Computer Science University of Texas Arlington TX 76019 United States

ISBN: (纸本)9780769540122

SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm "Local-SimRank". The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically. © 2010 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Interference and power constrained broadcast and multicast r...

引用

作者： Li, Zheng Li, Deying Liu, Ming School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

In this paper, we address the interference and power constrained broadcast/multicast routing problem (D-IPCB/M) in wireless ad hoc networks using directional antenna as a starting point, which jointly considers low-interference and energy-efficiency issues. Then we study the delay-bounded interference and power constrained broadcast/multicast routing problem (DB-D-IPCB/M). An approximation algorithm and a heuristic algorithm with low time complexity are proposed for the D-IPCB/M and DB-D-IPCB/M problem, respectively. Finally, we explore and investigate the multi-constrained subgraph optimization (MCSO) problem. We prove its NP-hard and propose an approximation scheme with theoretical performance guarantee for this class of optimization problems. This is a general result originated from the study of D-IPCB/M and DB-D-IPCB/M problems, which can be applicable to solve different optimization problems such as the multi-constrained broadcast/multicast routing problems. Broadcast/multicast message by using the routing trees found by our algorithms tends to not only have less channel collisions but also save energy to extend network lifetime. The theoretical results are evaluated by simulation studies. © 2010 Elsevier B.V. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance study on logging to another main memory database

Performance study on logging to another main memory database

引用

作者： Qin, Xiongpai Xiaoyun, Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Xuzhou Jiangsu 221008 China

ISBN: (纸本)9788988678183

In update intensive main memory database applications, huge volume of log records is generated, to maintain the ACID properties of the database system, the log records should be persistent efficiently. Delegating logging of one main memory database to another main memory database is proposed. The scheme is elaborated in detail in terms of architecture, logging & safeness levels, checkpointing, and recovery. Strict durability and relax durability are provided. When some form of non-volatile memory is used to temporarily holding log records, not only logging efficiency is improved, but also the scheme could guarantee full ACID of the system. We also propose using parallel logging to speedup log persistence by writing logs to multiple disks in parallel. Since interconnection network techniques progress by leaps and bounds, the scheme eliminates the concern about whether the system's overall performance may be slowed down by bandwidth and latency limitations. Experiment results demonstrate the feasibility of the proposal.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

The scaffolding of a formal context

The scaffolding of a formal context

引用

7th International Conference on Concept Lattices and Their Applications, CLA 2010

作者： Doerfel, Stephan Knowledge and Data Engineering Group Department of Mathematics and Computer Science University of Kassel Wilhelmshöher Allee 73 34121 Kassel Germany Department of Mathematics Institute of Algebra Technical University of Dresden 01062 Dresden Germany

The scaffolding of a complete lattice L of finite length was introduced by Rudolf Wille in 1976 as a relative subsemilattice of L that can be constructed using subdirect decomposition. The lattice is uniquely defined by its scaffolding and can be reconstructed from it. Using bonds, we demonstrate how the scaffolding can be constructed from a given formal context and thereby extend the notion of the scaffolding to doubly founded lattices. Further, we explain the creation of a suitable graphical representation of the scaffolding from the context.

关键词： Scaffolds

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共114页 << < 95 96 97 98 99 100 101 102 103 104 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：