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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是41-50 订阅

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

详细简洁

排序：

Unsupervised learning of rules for morphological disambiguation

引用

7th international conference on Text, Speech and Dialogue, TSD 2004

作者： Šmerk, Pavel Masaryk University Botanická 68a BrnoCZ-602 00 Czech Republic

ISBN: (纸本)3540230491

State-of-the-art rule-based tools for morphological disambiguation use either manually crafted rules or rules learnt from manually annotated data. this paper presents a new method of learning rules for morphological disambiguation using only unannotated data. the inductive logic programming and active learning are employed. the induced rules display very promising acurracy. Also the probable limitations of the proposed method are discussed. © Springer-Verlag Berlin Heidelberg 2004.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A monte carlo study of randomised restarted search in ilp

引用

14th international conference on inductive logic programming, ilp 2004

作者： Železný, Filip Srinivasan, Ashwin Page, David in Prague Karlovo Nám. 13 Prague121 35 Czech Republic IBM India Research Laboratory Indian Institute of Technology Block 1 New Delhi110 016 India Dept. Of Biostatistics and Medical Informatics Dept. Of Computer Science University of Wisconsin 1300 University Ave. MadisonWI53706 United States

ISBN: (纸本)9783540229414

Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that if the search cost distribution (SCD) of the non-restarted randomised search exhibits a slower-than-exponential decay (that is, a "heavy tail"), restarts can reduce the search cost expectation. Recently, this heavy tail phenomenon was observed in the SCD’s of benchmark ilp problems. Following on this work, we report on an empirical study of randomised restarted search in ilp. Our experiments, conducted over a cluster of a few hundred computers, provide an extensive statistical performance sample of five search algorithms operating on two principally different ilp problems (artificially generated graph data and the wellknown "mutagenesis" problem). the sample allows us to (1) estimate the conditional expected value of the search cost (measured by the total number of clauses explored) given the minimum clause score required and a "cutoff" value (the number of clauses examined before the search is restarted);and (2) compare the performance of randomised restarted search strategies to a deterministic non-restarted search. Our findings indicate that the cutoff value is significantly more important than the choice of (a) the specific refinement strategy;(b) the starting element of the search;and (c) the specific data domain. We find that the optimal value for the cutoff parameter remains roughly stable across variations of these three factors and that the mean search cost using this value in a randomised restarted search is up to three orders of magnitude (i.e. 1000 times) lower than that obtained with a deterministic non-restarted search. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

引用

14th international conference on inductive logic programming, ilp 2004

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

ISBN: (纸本)9783540229414

Successful application of Machine Learning to certain realworld situations sometimes requires to take into account relations among objects. inductive logic programming, being based on First-Order logic as a representation language, provides a suitable learning framework to be adopted in these cases. However, the intrinsic complexity of this framework, added to the complexity of the specific application context, often requires pure induction to be supported by various kinds of metainformation on the domain itself and/or on its representation in order to prune the search space of all possible definitions. Indeed, avoiding the exploration of paths that do not lead to any correct solution can greatly reduce computational times, and hence becomes a critical issue for the performance of the whole learning process. In the current practice, providing such information is often in charge of the human expert. It is also a difficult and error-prone activity, in which mistakes are highly probable because of a number of factors. this makes it desirable to develop procedures that can automatically generate such information starting from the same observations that are input to the learning process. this paper focuses on a specific kind of meta-information: the types used in the description language and their related domains. Indeed, many learning systems known in the literature are able to exploit (and sometimes require) such a kind of knowledge to improve their performance. An algorithm is proposed to automatically identify types from observations, and detailed examples of its behaviour are given. An evaluation of its performance in domains with different characteristics is reported, and its robustness with respect to incomplete observations is studied. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Increasing ilp of RISC microprocessors through control-flow based reconfiguration 14th

Increasing ILP of RISC microprocessors through control-flow ...

引用

14th international conference on Field Programmable logic and Applications, FPL 2004

作者： Köhler, Steffen Braunes, Jens Preußer, thomas Zabel, Martin Spallek, Rainer G. Institute of Computer Engineering Department of Computer Science Dresden University of Technology DresdenD-01062 Germany

ISBN: (纸本)3540229892

this work introduces a new concept of enhancing a RISC microprocessor with a tightly coupled reconfigurable ALU array, a vector load/store unit and a control flow manipulation unit. these units implement coarse-grain reconfigurable structures by means of switchable contexts. Context activation is performed event-driven according to the instruction pointer of the RISC microprocessor. the synchronous operation of the context controlled functional units enables instruction level parallelism (ilp) comparable to complex VLIW processors, without introducing instruction overhead. the reconfigurable units can be adapted to the application demands exploiting parallelism more coarse-grain than common instruction-level functional units. To evaluate the concept, a standard ARM RISC microprocessor was chosen to be tightly coupled to these reconfigurable units. Architecture description and simulation were performed using RECAST, a reconfiguration-enabled architecture description language and simulation tool-set. the software environment also includes a retargetable, parallelizing C compiler based on the SUIF compiler kit. First experiments executing DSP algorithms have indicated, that the proposed architecture can exploit more of the potential application parallelism than conventional VLIW processors. © Springer-Verlag Berlin Heidelberg 2004.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

A novel approach to machine discovery: Genetic programming and Stochastic Grammars 12

A novel approach to machine discovery: Genetic Programming a...

引用

12th international conference on inductive logic programming

作者： Ratle, A Sebag, M Inst Super Automobile & Transports LRMA F-58027 Nevers France Univ Paris 11 LRI CNRS UMR 8623 F-91405 Orsay France

ISBN: (纸本)3540005676

the application of Genetic programming (GP) to the discovery of empirical laws most often suffers from two limitations. the first one is the size of the search space;the second one is the growth of non-coding segments, the introns, which exhausts the memory resources as GP evolution proceeds. these limitations are addressed by combining Genetic programming and Stochastic Grammars. On one hand, grammars are used to represent prior knowledge;for instance, context-free grammars can be used to enforce the discovery of dimensionally consistent laws, thereby significantly restricting GP search space. On the other hand, in the spirit of distribution estimation algorithms, the grammar is enriched with derivation probabilities. By exploiting such probabilities, GP avoids the intron phenomenon. the approach is illustrated on a real-world like problem, the identification of behavioral laws in Mechanics.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

Determination of general concept in learning default rules

Determination of general concept in learning default rules

引用

6th Pacific Rim international conference on Artificial Intelligence, PRICAI 2000

作者： Ohara, Kouzou Taka, Hideyuki Babaguchi, Noboru Kitahashi, Tadahiro I.S.I.R. Osaka University 8-1 Mihogaoka Ibaraki Osaka 567-0047 Japan

ISBN: (纸本)3540679251

In this paper, we discuss a method to determine which concept, the target concept or its opposite, is more general in given examples when learning rules with exceptions, or default rules in the inductive logic programming (ilp) framework. the ilp system learning default rules has to learn both the concepts in a three valued setting which clearly distinguishes what is true, what is false, and what is unknown. In order to learn hypotheses which holds as generally as possible in the domain, we should give a higher priority to the concept which is more general, or covers more examples than does the other. For this purpose, our method dynamically determines the general concept according to the ratio of positive examples covered by the hypothesis which is correct and most general in the hypothesis space. © Springer-Verlag Berlin Heidelberg 2000.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

A note on two simple transformations for improving the efficiency of an ilp system 10th

A note on two simple transformations for improving the effic...

引用

10th international conference on inductive logic programming, ilp 2000

作者： Costa, Vítor Santos Srinivasan, Ashwin Camacho, Rui COPPE/Sistemas UFRJ Brazil LIACC Universidade do Porto Portugal Oxford University Comp. Lab Wolfson Bldg. Parks Rd Oxford United Kingdom LIACC and FEUP Universidade do Porto Portugal

ISBN: (纸本)354067795X

inductive logic programming (ilp) systems have had noteworthy successes in extracting comprehensible and accurate models for data drawn from a number of scientific and engineering domains. these results suggest that ilp methods could enhance the model-construction capabilities of software tools being developed for the emerging discipline of"k nowledge discovery from databases." One significant concern in the use of ilp for this purpose is that of efficiency. the performance of modern ilp systems is principally affected by two issues: (1) they often have to search through very large numbers of possible rules (usually in the form of definite clauses);(2) they have to score each rule on the data (usually in the form of ground facts) to estimate "goodness". Stochastic and greedy approaches have been proposed to alleviate the complexity arising from each of these issues. While these techniques can result in order-of-magnitude improvements in the worst-case search complexity of an ilp system, they do so at the expense of exactness. As this may be unacceptable in some situations, we examine two methods that result in admissible transformations of clauses examined in a search. While the methods do not alter the size of the search space (that is, the number of clauses examined), they can alleviate the theorem-proving effort required to estimate goodness. the first transformation simply involves eliminating literals using a weak test for redundancy. the second involves partitioning the set of literals within a clause into groups that can be executed independently of each other. the efficacy of the se transformations are evaluated empirically on a number of well-known ilp datasets. the results suggest that for problems that require the use of highly nondeterminate predicates, the transformations can provide significant gains as the complexity of clauses sought increases. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Learning What is Important to Learn, Some Experiments with inductive logic programming 14

Learning What is Important to Learn, Some Experiments with I...

引用

14th international conference on Computers and their Applications, CATA 1999

作者： Jacquenet, F. Bernard, M. Nicolini, C. LIRSIA Université de Bourgogne Dijon Cedex21011 France EURISE Université de Saint-Etienne Saint-Etienne Cedex 2 42023 France CEA Valduc Is/Tille 21120 France

ISBN: (纸本)9781618395450

Most Intelligent Tutoring Systems (ITS) nowadays integrate some Artificial Intelligence techniques to improve the quality of the Computer Aided Tutor. Knowledge bases, reasoning techniques, can be widely used. Nevertheless, the problem is "What is important to learn for a student". this question is an important bottleneck for the design of a good and efficient ITS. From the way we answer to it will depend the success of the ITS being designed. In this paper, we propose to integrate some Machine Learning techniques in ITS to allow them to automatically improve their knowledge bases and reasoning facilities. Copyright© (1999) by the international Society for Computers and their Applications. All rights reserved.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

Induction of logic programs based on ψ-terms 10th

引用

10th international conference on Algorithmic Learning theory (ALT 99)

作者： Sasaki, Y NTT Commun Sci Labs Seika Kyoto 6190237 Japan

ISBN: (纸本)3540667482

this paper extends the traditional inductive logic programming (ilp) framework to a psi-term capable ilp framework. Ait-Kaci's psi-terms have interesting and significant properties for markedly widening applicable areas of ilp. For example, psi-terms allow partial descriptions of information, generalization and specialization of sorts (or types) placed instead of function symbols, and abstract descriptions of data using sorts;they have comparable representation power to feature structures used in natural language processing. We have developed an algorithm that learns logic programs based on psi-terms, made possible by a bottom-up approach employing the least general generalization (lgg) extended for psi-terms. As an area of application, we have selected information extraction (IE) tasks in which sort information is crucial in deciding the generality of IE rules. Experiments were conducted on a set of test examples and background knowledge consisting of case frames of newspaper articles. the results showed high precision and recall rates for learned rules for the IE tasks.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：