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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

54 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

47 篇 工学
- 47 篇 计算机科学与技术...
- 22 篇 软件工程
- 5 篇 控制科学与工程
- 4 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
10 篇 理学
- 8 篇 数学
- 1 篇 物理学
- 1 篇 生物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

15 篇 inductive logic ...
9 篇 logic programmin...
6 篇 inductive logic ...
4 篇 computer circuit...
2 篇 mathematical log...
2 篇 programming tech...
2 篇 artificial intel...
2 篇 statistical rela...
1 篇 relational learn...
1 篇 runtime
1 篇 circuit simulati...
1 篇 corpus-based acq...
1 篇 clustering
1 篇 software enginee...
1 篇 subsumption unde...
1 篇 probabilistic lo...
1 篇 hybrid systems
1 篇 gpgpu
1 篇 program analysis
1 篇 architecture

机构

2 篇 katholieke univ ...
2 篇 univ york dept c...
1 篇 kuleuven leuven
1 篇 sri int menlo pk...
1 篇 inria nancy - gr...
1 篇 univ porto cracs...
1 篇 the pennsylvania...
1 篇 stockholm univ d...
1 篇 univ wisconsin d...
1 篇 nancy-université...
1 篇 microsoft corp r...
1 篇 univ porto fac e...
1 篇 univ york york y...
1 篇 univ porto cracs...
1 篇 northeastern uni...
1 篇 sofia univ st kl...
1 篇 univ london impe...
1 篇 ntt commun sci l...
1 篇 simon fraser uni...
1 篇 univ oxford comp...

作者

3 篇 cussens james
3 篇 kazakov dimitar
2 篇 muggleton stephe...
2 篇 srinivasan a
2 篇 costa vitor sant...
2 篇 fonseca nuno a.
2 篇 camacho r
2 篇 russo alessandra
2 篇 algahtani eyad
2 篇 camacho rui
1 篇 yang yuan
1 篇 sakama chiaki
1 篇 janssens g
1 篇 sasaki y
1 篇 luís moniz perei...
1 篇 rocha r
1 篇 lamiroy bart
1 篇 vieira jorge
1 篇 kung-kiu lau
1 篇 de raedt luc

语言

58 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

At the interface of inductive logic programming and statistics

引用

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

作者： Cussens, J Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

ISBN: (纸本)3540229418

inductive logic programming can be viewed as a style of statistical inference where the model that is inferred to explain the observed data happens to be a logic program. In general, logic programs have important differences to other models (such as linear models, tree-based models, etc) found in the statistical literature. this why we have ilp conferences!

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Autonomous Discovery of Abstract Concepts by a Robot

Autonomous Discovery of Abstract Concepts by a Robot

引用

10th international conference on Adaptive and Natural Computing Algorithms

作者： Bratko, Ivan Univ Ljubljana Fac Comp & Informat Sc Ljubljana 1000 Slovenia

ISBN: (纸本)9783642202810

In this paper we look at the discovery of abstract concepts by a robot autonomously exploring its environment and learning the laws of the environment. By abstract concepts we mean concepts that are not explicitly observable in the measured data, such as the notions of obstacle, stability or a, tool. We consider mechanisms of machine learning that enable the discovery of abstract concepts. Such mechanisms are provided by the logic based approach to machine learning called inductive logic programming (ilp). the feature of predicate invention in ilp is particularly relevant. Examples of actually discovered abstract concepts in experiments are described.

关键词： autonomous discovery robot learning discovery of abstract concepts inductive logic programming predicate invention

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CONNER: A Concurrent ilp Learner in Description logic 1

引用

29th international conference on inductive logic programming

作者： Algahtani, Eyad Kazakov, Dimitar Univ York York YO10 5GH N Yorkshire England

ISBN: (数字)9783030492106

ISBN: (纸本)9783030492090;9783030492106

Machine Learning (ML) approaches can achieve impressive results, but many lack transparency or have difficulties handling data of high structural complexity. the class of ML known as inductive logic programming (ilp) draws on the expressivity and rigour of subsets of First Order logic to represent both data and models. When Description logics (DL) are used, the approach can be applied directly to knowledge represented as ontologies. ilp output is a prime candidate for explainable artificial intelligence;the expense being computational complexity. We have recently demonstrated how a critical component of ilp learners in DL, namely, cover set testing, can be speeded up through the use of concurrent processing. Here we describe the first prototype of an ilp learner in DL that benefits from this use of concurrency. the result is a fast, scalable tool that can be applied directly to large ontologies.

关键词： inductive logic programming Description logics Ontologies Parallel computing GPGPU

来源：评论

学校读者我要写书评

暂无评论

From promising to profitable applications of ilp: A case study in drug discovery

引用

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

作者： Dehaspe, L Katholieke Univ Leuven PharmaDM Louvain Belgium Katholieke Univ Leuven Dept Comp Sci Louvain Belgium

ISBN: (纸本)3540229418

PharmaDM was founded end 2000 as a spin-off from three European universities (Oxford, Aberystwyth, and Leuven) that participated in two subsequent EC projects on inductive logic programming (ilp I-II, 1992-1998). Amongst the projects highlights was a series of publications that demonstrated the added-value of ilp in applications related to the drug discovery process. the mission of PharmaDM is to build on those promising results, including software modules developed at the founding universities (i.e., Aleph, Tilde, Warmr, ilprolog), and develop a profitable ilp based data mining product customised to the needs of drug discovery researchers. Technology development at PharmaDM is mostly based on demand pull, i.e., driven by user requirements. In this presentation I will look at the way ilp technology at PharmaDM has evolved over the past four years and the user feedback that has stimulated this evolution.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Least generalization under relative implication 9th

Least generalization under relative implication

引用

9th international conference on Artificial Intelligence - Methodology, Systems, and Applications (AIMSA 2000)

作者： Boytcheva, S Sofia Univ St Kliment Ohridski Fac Math & Informat Dept Informat Technol BU-1126 Sofia Bulgaria

ISBN: (纸本)3540410449

the main operators in inductive logic programming (ilp) axe specialization and generalization. In ilp, the three most important generality orders are subsumption, implication and implication relative to background knowledge. the present paper discusses the existence of least generalization under implication relative to background knowledge. It has been shown that the least generalization under relative implication does not exists in the general case, but, as argued in this paper, it exists if the sets to be generalized and the background knowledge satisfy some special conditions.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

Anytime inductive logic programming 15

Anytime Inductive Logic Programming

引用

15th international conference on Computers and their Applications

作者： Lindgren, T Stockholm Univ Dept Comp & Syst Sci S-16440 Kista Sweden

ISBN: (纸本)1880843323

Anytime algorithms refers to algorithms that "always can produce a result. Often the result of the algorithm depends on the time at hand, the longer the time, the better the answer. In this paper we present an easy way of turning regular inductive logic programming (ilp) algorithms such as Divide-And-Conquer (DAC.) and Separate-And-Conquer (SAC) into anytime algorithms. We conduct experiments with these anytime algorithms and introduce a simple heuristic called squared quota, that we compare with an established one, information gain. It seems that squared quota is better suited for a small window size of example data, and hence better to use in anytime systems. A comparison between SAC and DAC reveals that they excel in different combinations of examples/background knowledge.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

Partitional Clustering of Protein Sequences - An inductive logic programming Approach

引用

10th international Work-conference on Artificial Neural Networks (IWANN 2009)

作者： Fonseca, Nuno A. Costa, Vitor S. Camacho, Rui Vieira, Cristina Vieira, Jorge Univ Porto IBMC Rua Campo Alegre 823 P-4150180 Oporto Portugal Univ Porto INESC Porto LA CRACS Porto Portugal Univ Porto LIAAD INSEC Porto LA & FEUP Porto Portugal

ISBN: (纸本)9783642024801

We present a novel approach to cluster sets of protein sequences, based on inductive logic programming (ilp). Preliminary results show that;the method proposed Produces understand able descriptions/explanations of the clusters. Furthermore, it can be used as a knowledge elicitation tool to explain clusters proposed by other clustering approaches, such as standard phylogenetic programs.

关键词： Clustering inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

Learning an approximation to inductive logic programming clause evaluation

引用

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

作者： DiMaio, F Shavlik, J Univ Wisconsin Comp Sci Dept Madison WI 53706 USA

ISBN: (纸本)3540229418

One challenge faced by many inductive logic programming (ilp) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as stochastic clause selection (SCS) and rapid random restarts (RRR) have proven somewhat successful at addressing this weakness. However, on datasets where hypothesis evaluation is computationally expensive, even these algorithms may take unreasonably long to discover a good solution. We attempt to improve the performance of these algorithms on datasets by learning an approximation to ilp hypothesis evaluation. We generate a small set of hypotheses, uniformly sampled from the space of candidate hypotheses, and evaluate this set on actual data. these hypotheses and their corresponding evaluation scores serve as training data for learning an approximate hypothesis evaluator. We outline three techniques that make use of the trained evaluation-function approximator in order to reduce the computation required during an ilp hypothesis search. We test our approximate clause evaluation algorithm using the popular ilp system Aleph. Empirical results are provided on several benchmark datasets. We show that the clause evaluation function can be accurately approximated.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Learning semantic lexicons from a part-of-speech and semantically tagged corpus using inductive logic programming

Learning semantic lexicons from a part-of-speech and semanti...

引用

10th international conference on inductive logic programming (ilp2000)

作者： Claveau, V Sébillot, P Fabre, U Bouillon, P Inst Rech Informat & Syst Aleatoires F-35042 Rennes France Univ Toulouse 2 ERSS F-31058 Toulouse France Univ Geneva TIM ISSCO ETI CH-1205 Geneva Switzerland

this paper describes an inductive logic programming learning method designed to acquire from a corpus specific Noun-Verb (N-V) pairs-relevant in information retrieval applications to perform index expansion-in order to build up semantic lexicons based on Pustejovsky's generative lexicon (GL) principles (Pustejovsky, 1995). In one of the components of this lexical model, called the qualia structure, words are described in terms of semantic roles. For example, the telic role indicates the purpose or function of an item (cut for knife), the agentive role its creation mode (build for house), etc. the qualia structure of a noun is mainly made up of verbal associations, encoding relational information. the learning method enables us to automatically extract, from a morpho-syntactically and semantically tagged corpus, N-V pairs whose elements are linked by one of the semantic relations defined in the qualia structure in GL. It also infers rules explaining what in the surrounding context distinguishes such pairs from others also found in sentences of the corpus but which are not relevant. Stress is put here on the learning efficiency that is required to be able to deal with all the available contextual information, and to produce linguistically meaningful rules.

关键词： corpus-based acquisition lexicon learning generative lexicon inductive logic programming subsumption under object identity private properties

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：