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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

57 篇 会议
5 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 46 篇 计算机科学与技术...
- 24 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 农业工程
- 1 篇 食品科学与工程（可...
9 篇 理学
- 9 篇 数学
- 4 篇 统计学（可授理学、...
8 篇 管理学
- 7 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
1 篇 农学
- 1 篇 作物学

主题

16 篇 logic programmin...
7 篇 learning systems
6 篇 inductive logic ...
6 篇 inductive logic ...
5 篇 artificial intel...
4 篇 formal logic
4 篇 mathematical log...
3 篇 computer circuit...
3 篇 software enginee...
3 篇 programming tech...
2 篇 computer science
2 篇 natural language...
2 篇 biochemistry
2 篇 machine learning
2 篇 testing
2 篇 algorithm analys...
2 篇 knowledge repres...
1 篇 datalog
1 篇 fuzzy sets
1 篇 fuzzy logic

机构

2 篇 natl inst inform...
1 篇 department of bi...
1 篇 school of comput...
1 篇 the pennsylvania...
1 篇 hiroshima city u...
1 篇 stockholm univ d...
1 篇 national institu...
1 篇 department of co...
1 篇 cnr ustu i-56100...
1 篇 stanford univ ct...
1 篇 cesimo fac ingn ...
1 篇 wright state uni...
1 篇 ntt commun sci l...
1 篇 dipartimento di ...
1 篇 simon fraser uni...
1 篇 department of bi...
1 篇 univ ca foscari ...
1 篇 charles universi...
1 篇 tu wien austria
1 篇 the university o...

作者

3 篇 inoue k
3 篇 ohwada hayato
3 篇 shavlik jude
2 篇 suzuki yusuke
2 篇 costa vitor sant...
2 篇 fonseca nuno a.
2 篇 stefan kramer
2 篇 bernhard pfahrin...
2 篇 matsumoto satosh...
2 篇 de raedt l
2 篇 shoudai takayosh...
2 篇 goadrich mark
2 篇 inoue katsumi
2 篇 oliphant louis
1 篇 muggleton stephe...
1 篇 m.j.o. galindo
1 篇 shen yi-dong
1 篇 bartenstein oska...
1 篇 lisi francesca a...
1 篇 borrajo daniel

语言

62 篇 英文
1 篇 中文

检索条件"任意字段=15th International Conference on Inductive Logic Programming, ILP 2005"

共 63 条记录，以下是11-20 订阅

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

详细简洁

排序：

Survivable Lightpath Provisioning in Multi-Domain Optical Networks 15

Survivable Lightpath Provisioning in Multi-Domain Optical Ne...

引用

15th IEEE international conference on High Performance Switching and Routing (HPSR)

作者： Pavarangkoon, Praphan Oki, Eiji Univ Electrocommun Dept Commun Engn & Informat Tokyo Japan

ISBN: (纸本)9781479916337

this paper proposes a survivable lightpath provisioning scheme that allows traffic splitting in multi-domain optical networks to minimize the cumulative cost of a set of paths. the proposed scheme, called two-phase lightpath provisioning, employs an integer linear programming (ilp) formulation based on hierarchical path computation with full-mesh topology abstraction. there are two phases in the scheme. the first phase solves the ilp problem on an inter-domain topology and then feeds the results as intra-domain requests. the second phase solves the ilp problem in each related domain. Finally, we concatenate all the intra-domain solutions along routing sequences. three different protection strategies are considered with varying degrees of primary and backup route separation. Furthermore, to support various types of traffic demands, we investigate two cases in terms of the number of requested wavelengths. First, the number of requested wavelengths is less than link wavelength capacity. Second, the number of requested wavelengths is greater than link wavelength capacity. For the latter case, the proposed scheme allows traffic splitting among feasible primary and backup routes. the proposed scheme well supports the implementation of heuristic algorithms for lightpath provisioning since it can provide reference values, including upper and lower bounds, that are useful as benchmarks.

关键词： Abstracts Network topology Optical fiber networks Routing Routing protocols Scalability Topology Fiber optic networks Routing protocols Network routing Network topology topology optical paths Scalability Traffic wavelengths inductive logic programming provisioning multiple domain networks

来源：评论

学校读者我要写书评

暂无评论

Decomposition, merging, and refinement approach to boost inductive logic programming algorithms

Decomposition, merging, and refinement approach to boost ind...

引用

15th international conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 2012

作者： Chovanec, Andrej Barták, Roman Charles University in Prague Faculty of Mathematics and Physics Malostranské nám. 25 118 00 Praha 1 Czech Republic

ISBN: (纸本)9783642331848

inductive logic programming (ilp) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples. It uses first-order logic as a uniform representation for examples and hypothesis. In this paper we propose a method to boost any ilp learning algorithm by first decomposing the set of examples to subsets and applying the learning algorithm to each subset separately, second, merging the hypotheses obtained for the subsets to get a single hypothesis for the complete set of examples, and finally refining this single hypothesis to make it shorter. the proposed technique significantly outperforms existing approaches. © 2012 Springer-Verlag.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence: Methodology, Systems, and Applications - 15th international conference, AIMSA 2012, Proceedings

Artificial Intelligence: Methodology, Systems, and Applicati...

引用

15th international conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 2012

ISBN: (纸本)9783642331848

the proceedings contain 36 papers. the topics discussed include: ontology-based information and event extraction for business intelligence;modelling highly symmetrical molecules: linking ontologies and graphs;personalizing and improving tag-based search in folksonomies;views and synthesis of cognitive maps;identification of the compound subjective rule interestingness measure for rule-based functional description of genes;automatic generation and learning of finite-state controllers;FactForge: data service or the diversity of inferred knowledge over LOD;from path-consistency to global consistency in temporal qualitative constraint networks;rule quality measure-based induction of unordered sets of regression rules;a study on the utility of parametric uniform crossover for adaptation of crossover operator;and decomposition, merging, and refinement approach to boost inductive logic programming algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resolving inductive Definitions with Binders in Higher-Order Typed Functional programming

Resolving Inductive Definitions with Binders in Higher-Order...

引用

15th international conference on Tools and Algorithms for the Construction and Analysis of Systems held at Joint European conferences on theory and Practice of Software

作者： Lakin, Matthew R. Pitts, Andrew M. Univ Cambridge Comp Lab Cambridge CB3 0FD England

ISBN: (纸本)9783642005893

this paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operational semantics, but;is excluded by the common representation of binding as meta-level lambda-abstraction. Drawing upon ideas from functional logic programming, we represent. such definitions with aliasing as recursively defined functions in a higher-order typed functional programming language that extends core ML with types for name-binding, a type of "semi-decidable propositions" and existential quantification for types with decidable equality. We show that the representation is sound and complete with respect, to the language's operational semantics, which combines the use of evaluation contexts with constraint programming. We, also give a new and simple proof that the associated constraint problem is NP-complete.

关键词： Binders

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming: 15th international conference, ilp 2005. Proceedings

Inductive Logic Programming: 15th International Conference, ...

引用

15th international conference on inductive logic programming, ilp 2005

the proceedings contain 26 papers from the conference on inductive logic programming 15th international conference, ilp 2005. the topics discussed include: guiding inference through relational reinforcement learning;converting semantic meta-knowledge into inductive bias;distance based generaliztion;automatic induction of abduction and abstraction theories from observations;strategies to parallelize ilp systems;inducing casual laws by regular inferece;spatial clustering of structured objects;predicate selection for structural decision trees;inductive equivalence of logic programs;and a study of applying dimensionality reduction to restrict the size of a hypothesis space.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Combining macro-operators with control knowledge

Combining macro-operators with control knowledge

引用

16th international conference on inductive logic programming

作者： Garcia-Duran, Rocio Fernandez, Fernando Borrajo, Daniel Univ Carlos III Madrid Avda Univ 30 Madrid 28911 Spain

ISBN: (纸本)9783540738466

inductive logic programming (ilp) methods have proven to succesfully acquire knowledge with very different learning paradigms, such as supervised and unsupervised learning or relational reinforcement learning. However, very little has been done on applying it to General Problem Solving (GPS). One of the ilp-based approaches applied to GPS is HAMLET. this method learns control rules (heuristics) for a non linear planner, PRODIGY4.0, which is integrated into the IPSS system;control rules are used as an effective guide when building the planning search tree. Other learning approaches applied to planning generate macro-operators, building high-level blocks of actions, but increasing the branching factor of the search tree. In this paper, we focus on integrating the two different learning approaches (HAMLET and macro-operators learning), to improve a planning process. the goal is to learn control rules that decide when to use the macro-operators. this process is successfully applied in several classical planning domains.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Efficient and scalable induction of logic programs using a deductive database system

Efficient and scalable induction of logic programs using a d...

引用

16th international conference on inductive logic programming

作者： Ferreira, Michel Fonseca, Nuno A. Rocha, Ricardo Scares, Tiago Univ Porto DCC FC & LIACC Oporto Portugal

ISBN: (纸本)9783540738466

A consequence of ilp systems being implemented in Prolog or using Prolog libraries is that, usually, these systems use a Prolog internal database to store and manipulate data. However, in real-world problems, the original data is rarely in Prolog format. In fact, the data is often kept in Relational Database Management Systems (RDBMS) and then converted to a format acceptable by the ilp system. therefore, a more interesting approach is to link the ilp system to the RDBMS and manipulate the data without converting it. this scheme has the advantage of being more scalable since the whole data does not need to be loaded into memory by the ilp system. In this paper we study several approaches of coupling ilp systems with RDBMS systems and evaluate their impact on performance. We propose to use a Deductive Database (DDB) system to transparently translate the hypotheses to relational algebra expressions. the empirical evaluation performed shows that the execution time of ilp algorithms can be effectively reduced using a DDB and that the size of the problems can be increased due to a non-memory storage of the data.

关键词： Implementation Performance Deductive Databases

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming by instance patterns 07

引用

Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

作者： Chongbing Liu Enrico Pontelli Dept. Computer Science New Mexico State University

ISBN: (纸本)9783540696087

Effectiveness and efficiency are two most important properties of ilp approaches. For both top-down and bottom-up search-based approaches, greater efficiency is usually gained at the expense of effectiveness. In this paper, we propose a bottom-up approach, called ilp by instance patterns, for the problem of concept learning in ilp. this approach is based on the observation that each example has its own pieces of description in the background knowledge, and the example together with these descriptions constitute a instance of the concept subject to learn. Our approach first captures the instance structures by patterns, then constructs the final theory purely from the patterns. On the effectiveness aspect, this approach does not assume determinacy of the learned concept. On the efficiency aspect, this approach is more efficient than existing ones due to its constructive nature, the fact that after the patterns are obtained, both the background and examples are not needed anymore, and the fact that it does not perform coverage test and needs no theorem prover.

关键词： patterns concept instance inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming: Yet another application of logic 16th

引用

16th international conference on Applications of Declarative programming and Knowledge Management (INAP 2005)

作者： Yamamoto, Akihiro Kyoto Univ Grad Sch Informat Sakyo Ku Kyoto 6068501 Japan

ISBN: (纸本)9783540692331

this paper presents a brief introduction of the relation between logic programming and machine learning. the area researching the relation is usually called inductive logic programming (ilp, for short). In this paper we will give the details of neither ilp systems nor ilp theories. We explain how to substitute concepts used in logic programming to items needed in formulating learning theories. We also show some theoretical applications to which the substitution are contributing.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves

Gleaner: Creating ensembles of first-order clauses to improv...

引用

13th international conference on inductive logic programming

作者： Goadrich, Mark Oliphant, Louis Shavlik, Jude Univ Wisconsin Dept Biostat & Med Informat Dept Comp Sci Madison WI 53706 USA

Many domains in the field of inductive logic programming (ilp) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall instead of simply using accuracy. the goal of our research is to find new approaches within ilp particularly suited for large, highly-skewed domains. We propose Gleaner, a randomized search method that collects good clauses from a broad spectrum of points along the recall dimension in recall-precision curves and employs an "at least L of these K clauses" thresholding method to combine sets of selected clauses. Our research focuses on Multi-Slot Information Extraction (IE), a task that typically involves many more negative examples than positive examples. We formulate this problem into a relational domain, using two large testbeds involving the extraction of important relations from the abstracts of biomedical journal articles. We compare Gleaner to ensembles of standard theories learned by Aleph, finding that Gleaner produces comparable testset results in a fraction of the training time.

关键词： inductive logic programming ensembles recall-precision curves biomedical information extraction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：