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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

48 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

43 篇 工学
- 43 篇 计算机科学与技术...
- 17 篇 软件工程
- 5 篇 控制科学与工程
- 2 篇 电气工程
- 1 篇 机械工程
- 1 篇 信息与通信工程
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
7 篇 理学
- 5 篇 数学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
4 篇 管理学
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学

主题

13 篇 logic programmin...
7 篇 inductive logic ...
6 篇 inductive logic ...
3 篇 learning systems
2 篇 efficiency
2 篇 learning algorit...
2 篇 data reduction
2 篇 ilp
2 篇 robustness
1 篇 fuzzy sets
1 篇 fuzzy logic
1 篇 fake news
1 篇 performance
1 篇 computer circuit...
1 篇 corpus-based acq...
1 篇 meta-reasoning
1 篇 cancer
1 篇 subsumption unde...
1 篇 protein-carbohyd...
1 篇 bottlenose dolph...

机构

2 篇 univ wisconsin d...
2 篇 department of co...
2 篇 univ wisconsin d...
1 篇 katholieke univ ...
1 篇 univ porto fac e...
1 篇 eurise universit...
1 篇 mahsa univ sauja...
1 篇 imu univ saveeth...
1 篇 wright state uni...
1 篇 northeastern uni...
1 篇 ntt commun sci l...
1 篇 inra ur1077 mig ...
1 篇 univ oxford comp...
1 篇 univ bari dipart...
1 篇 inria rennes cam...
1 篇 univ ferrara dip...
1 篇 liacc p-4150 opo...
1 篇 univ manchester ...
1 篇 katholieke univ ...
1 篇 univ wisconsin d...

作者

3 篇 camacho rui
3 篇 rocha ricardo
2 篇 basile teresa m....
2 篇 srinivasan a
2 篇 costa vitor sant...
2 篇 fonseca nuno a.
2 篇 ferilli stefano
2 篇 shavlik j
2 篇 davis jesse
2 篇 camacho r
2 篇 page david
2 篇 srinivasan ashwi...
2 篇 esposito florian...
1 篇 spallek rainer g...
1 篇 inoue k
1 篇 riguzzi f
1 篇 theofrastos mant...
1 篇 nicolini c.
1 篇 janssens g
1 篇 sasaki y

语言

50 篇 英文

检索条件"任意字段=14th International Conference ILP 2004: Inductive Logic Programming"

共 50 条记录，以下是31-40 订阅

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

详细简洁

排序：

A simulated annealing framework for ilp

引用

14th international conference on inductive logic programming (ilp 2004)

作者： Serrurier, M Prade, H Richard, G Univ Toulouse 3 IRIT F-31062 Toulouse France

ISBN: (纸本)3540229418

In inductive logic programming (ilp), algorithms which are purely of the bottom-up or top-down type encounter several problems in practice. Since a majority of them axe greedy ones, these algorithms find clauses in local optima, according to the "quality" measure used for evaluating the results. Moreover, when learning clauses one by one, induced clauses become less interesting to cover few remaining examples. In this paper, we propose a simulated annealing framework to overcome these problems. Using a refinement operator, we define neighborhood relations on clauses and on hypotheses (i.e. sets of clauses). With these relations and appropriate quality measures, we show how to induce clauses (in a coverage approach), or to induce hypotheses directly by using simulated annealing algorithms. We discuss the necessary conditions on the refinement operators and the evaluation measures in order to increase the algorithm's effectivity. Implementations are described and experimentation results are presented.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Learning logic programs with annotated disjunctions

引用

14th international conference on inductive logic programming (ilp 2004)

作者： Riguzzi, F Univ Ferrara Dipartimento Ingn I-44100 Ferrara Italy

ISBN: (纸本)3540229418

logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we propose an algorithm for learning LPADs. the learning problem we consider consists in starting from a sets of interpretations annotated with their probability and finding one (or more) LPAD that assign to each interpretation the associated probability. the learning algorithm first finds all the disjunctive clauses that are true in all interpretations, then it assigns to each disjunct in the head a probability and finally decides how to combine the clauses to form an LPAD by solving a constraint satisfaction problem. We show that the learning algorithm is correct and complete.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Modelling inhibition in metabolic pathways through abduction and induction

引用

14th international conference on inductive logic programming (ilp 2004)

作者： Tamaddoni-Nezhad, A Kakas, A Muggleton, S Pazos, F Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England Univ Cyprus Dept Comp Sci Nicosia Cyprus Univ London Imperial Coll Sci Technol & Med Dept Biol Sci London SW7 2BZ England

ISBN: (纸本)3540229418

In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unknown enzymes or inhibitors. We show how we can model, within Abductive logic programming (ALP), inhibition in metabolic pathways and use abduction to generate facts about inhibition of enzymes by a particular toxin (e.g. Hydrazine) given the underlying metabolic pathway and observations about the concentration of metabolites. these ground facts, together with biochemical background information, can then be generalised by ilp to generate rules about the inhibition by Hydrazine thus enriching further our model. In particular, using Progol 5.0 where the processes of abduction and inductive generalization are integrated enables us to learn such general rules. Experimental results on modelling in this way the effect of Hydrazine in a real metabolic pathway are presented.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Circumscription policies for induction

引用

14th international conference on inductive logic programming (ilp 2004)

作者： Inoue, K Saito, H Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan NEC Corp Ltd Internet Syst Res Labs Nara 6300101 Japan

ISBN: (纸本)3540229418

there are two types of formalization for induction in logic. In descriptive induction, induced hypotheses describe rules with respect to observations with all predicates minimized. In explanatory induction, on the other hand, hypotheses abductively account for observations without any minimization principle. Both inductive methods have strength and weakness, which are complementary to each other. In this work, we unify these two logical approaches. In the proposed framework, not all predicates are minimized but minimality conditions can be flexibly determined as a circumscription policy. Constructing appropriate policies, we can intentionally minimize models of an augmented axiom set. As a result, induced hypotheses can have both conservativeness and explainability, which have been considered incompatible with each other in the literature. We also give two procedures to compute inductive hypotheses in the proposed framework.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

On avoiding redundancy in inductive logic programming

引用

14th international conference ilp 2004: inductive logic programming

作者： Fonseca, Nuno Costa, Vitor S. Silva, Fernando Camacho, Rui DCC-FC and LIACC Universidade do Porto R. do Campo Alegre 823 4150-180 Porto Portugal COPPE/Sistemas UFRJ Centro de Tecnologia BIoco H-319 Rio de Janeiro Brazil Faculdade de Engenharia And: LIACC Universidade do Porto Rua Dr. Roberto Frias s/n 4200-465 Porto Portugal

ISBN: (纸本)9783540229414

ilp systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. the generation of redundant hypotheses may prevent the systems from finding good models and increases the time to induce them. In this paper we propose a classification of hypotheses redundancy and show how expert knowledge can be provided to an ilp system to avoid it. Experimental results show that the number of hypotheses generated and execution time are reduced when expert knowledge is used to avoid redundancy. © Springer-Verlag Berlin Heidelberg 2004.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

ilp: A short look back and a longer look forward

ILP: A short look back and a longer look forward

引用

10th international conference on inductive logic programming (ilp2000)

作者： Page, D Srinivasan, A Univ Wisconsin Dept Biostat & Med Informat Madison WI 53706 USA Univ Wisconsin Dept Comp Sci Madison WI 53706 USA Univ Oxford Comp Lab Oxford OX1 3QD England

inductive logic programming (ilp) is built on a foundation laid by research in machine learning and computational logic. Armed with this strong foundation, ilp has been applied to important and interesting problems in the life sciences, engineering and the arts. this paper begins by briefly reviewing some example applications, in order to illustrate the benefits of ilp. In turn, the applications have brought into focus the need for more research into specific topics. We enumerate and elaborate five of these: (1) novel search methods;(2) incorporation of explicit probabilities;(3) incorporation of special-purpose reasoners;(4) parallel execution using commodity components;and (5) enhanced human interaction. It is our hypothesis that progress in each of these areas can greatly improve the contributions that can be made with ilp;and that, with assistance from research workers in other areas, significant progress in each of these areas is possible.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Macro-operators revisited in inductive logic programming

引用

14th international conference on inductive logic programming (ilp 2004)

作者： Alphonse, É INRA UR1077 MIG F-78352 Jouy En Josas France

ISBN: (纸本)3540229418

For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. these techniques change the representation of relational problems to attribute-value problems in order to use well-known learning algorithms to solve them. Propositionalization approaches have been successively applied to various problems but are still considered as ad hoc techniques. In this paper, we study these techniques in the larger context of macro-operators as techniques to improve the heuristic search. the macro-operator paradigm enables us to propose a unified view of propositionalization and to discuss its current limitations. We show that a whole new class of approaches can be developed in relational learning which extends the idea of changes of representation to more suited learning languages. As a first step, we propose different languages that provide a better compromise than current propositionalization techniques between the cost of building macro-operators and the cost of learning. It is known that ilp problems can be reformulated either into attribute-value or multi-instance problems. With the macro-operator approach, we see that we can target a new representation language we name multi-table. this new language is more expressive than attribute-value but is simpler than multi-instance. Moreover, it is PAC-learnable under weak constraints. Finally, we suggest that relational learning can benefit from both the problem solving and the attribute-value learning community by focusing on the design of effective macro-operator approaches.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Automatic induction of first-order logic descriptors type domains from observations

Automatic induction of first-order logic descriptors type do...

引用

14th international conference ilp 2004: inductive logic programming

作者： Ferilli, Stefano Esposito, Floriana Basile, Teresa M. A. Mauro, Nicola Di Department of Computer Science University of Bari Italy

the types of learning systems used in the description language and its related domains are investigated. these learning systems are able to exploit meta-information to improve their performance. An algorithm, which automatically identifies types from types is proposed. the performance of the algorithm in domains with different characteristics, and its robustness with respect to incomplete observations are studied.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Discovery of functional relationships in multi-relational data using inductive logic programming

Discovery of functional relationships in multi-relational da...

引用

4th IEEE international conference on Data Mining

作者： Alves, A Camacho, R Oliveira, E LIACC P-4150 Oporto Portugal

ISBN: (纸本)0769521428

ilp systems have been largely applied to datamining classification tasks with a considerable success. the use of ilp systems in regression tasks has been far less successful. Current systems have very limited numerical reasoning capabilities, which limits the application of ilp to discovery of functional relationships of numeric nature. this paper proposes improvements in numerical reasoning capabilities of ilp systems for dealing with regression tasks. It proposes the use of statistical-based techniques like Model Validation and Model Selection to improve noise handling and it introduces a new search stopping criterium based on the PAC method to evaluate learning performance. We have found these extensions essential to improve on results over machine learning and statistical-based algorithms used in the empirical evaluation study.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Query transformations for improving the efficiency of ilp systems

Query transformations for improving the efficiency of ILP sy...

引用

10th international conference on inductive logic programming (ilp2000)

作者： Costa, VS Srinivasan, A Camacho, R Blockeel, H Demoen, B Janssens, G Struyf, J Vandecasteele, H Van Laer, W UFRJ COPPE Sistemas Rio De Janeiro Brazil Univ Porto LIACC Oporto Portugal Univ Oxford Comp Lab Oxford England Univ Porto FEUP Oporto Portugal Katholieke Univ Leuven Dept Comp Sci B-3001 Louvain Belgium PharmaDM B-3001 Heverlee Belgium Katholieke Univ Leuven Dept Comp Sci B-3001 Louvain Belgium

Relatively simple transformations can speed up the execution of queries for data mining considerably. While some ilp systems use such transformations, relatively little is known about them or how they relate to each other. this paper describes a number of such transformations. Not all of them are novel, but there have been no studies comparing their efficacy. the main contributions of the paper are: (a) it clarifies the relationship between the transformations;(b) it contains an empirical study of what can be gained by applying the transformations;and (c) it provides some guidance on the kinds of problems that are likely to benefit from the transformations.

关键词： inductive logic programming program analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：