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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

80 篇 会议
11 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

59 篇 工学
- 51 篇 计算机科学与技术...
- 49 篇 软件工程
- 30 篇 控制科学与工程
- 9 篇 信息与通信工程
- 3 篇 机械工程
- 2 篇 化学工程与技术
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
37 篇 管理学
- 29 篇 管理科学与工程(可...
- 13 篇 图书情报与档案管...
- 1 篇 工商管理
35 篇 理学
- 30 篇 数学
- 9 篇 系统科学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 1 篇 物理学
1 篇 文学
- 1 篇 新闻传播学
1 篇 农学
- 1 篇 作物学

主题

10 篇 support vector m...
4 篇 data mining
4 篇 rough set
4 篇 fuzzy measure
4 篇 decision trees
4 篇 training
3 篇 support vector m...
3 篇 random variables
3 篇 dominance relati...
3 篇 fuzzy integral
3 篇 classification a...
3 篇 classification (...
2 篇 information syst...
2 篇 learning systems
2 篇 core vector mach...
2 篇 rough sets
2 篇 approximation al...
2 篇 core set
2 篇 noise measuremen...
2 篇 decision tree

机构

23 篇 key lab. of mach...
9 篇 key lab.of machi...
6 篇 college of mathe...
6 篇 key lab.of machi...
5 篇 key lab.in machi...
4 篇 key lab of machi...
4 篇 key lab. of mach...
4 篇 key lab. of mach...
3 篇 key lab. in mach...
3 篇 college of scien...
3 篇 center for machi...
3 篇 department of in...
3 篇 key lab. in mach...
2 篇 beijing key lab ...
2 篇 key laboratory o...
2 篇 college of mathe...
2 篇 key lab. in mach...
2 篇 key lab of high ...
2 篇 beijing academy ...
2 篇 graduate univers...

作者

9 篇 yan li
9 篇 li yan
8 篇 xi-zhao wang
5 篇 yuan fang
4 篇 yan zhan
4 篇 jun-hai zhai
4 篇 su-fang zhang
4 篇 jun-fen chen
3 篇 li zhao
3 篇 zhan yan
3 篇 guo-fang zhang
3 篇 wang xizhao
3 篇 zhai jun-hai
3 篇 lu shuxia
3 篇 qun-feng zhang
3 篇 chen hao
3 篇 shuxia lu
3 篇 ai-xia chen
3 篇 zhai junhai
3 篇 ning li

语言

90 篇 英文
1 篇 其他

检索条件"机构=Key Lab. for Machine Learning and Computational Intelligence"

共 91 条记录，以下是21-30 订阅

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

详细简洁

排序：

Chinese functional chunk identification based on part of speech

Chinese functional chunk identification based on part of spe...

引用

International Conference on Communication Systems and Network Technologies, CSNT 2012

作者： Wang, Cheng-Yan Li, Xin-Fu Tian, Xue-Dong College of Mathematics and Computer Science Hebei University Baoding China Key Lab. in Machine Learning and Computational Intelligence of Hebei Province China

ISBN: (纸本)9780769546926

Chinese functional chunk describes the basic skeleton of the Chinese sentences. It is the important bridge for joining syntax and semantic description, and the Chinese functional chunk identification plays a key role in the field of natural language processing. Identifying the functional chunk is mostly based on methods of rules which come from the syntactic analysis. In this paper, the functional chunk is mainly identified according to the effect of the part of speech in the syntactic analysis. The experimental results show the proposed method works well on the functional chunk identification. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Incremental approach for updating approximations of variable precision rough set based on dominance relations 3

Incremental approach for updating approximations of variable...

引用

3rd International Conference on Information Technology and Management Innovation, ICITMI 2014

作者： Li, Yan Hou, Jia Jia Liu, Xiao Qing Key Lab of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (纸本)9783038352396

Variable precision rough set (VPRS) based on dominance relation is an extension of traditional rough set by which can handle preference-ordered information flexibly. This paper focuses on the maintenance of approximations in dominance based VPRS when the objects in an information system vary over time. The incremental updating principles are given as inserting or deleting an object, and some experimental evaluations validates the effectiveness of the proposed method. © 2014 Trans Tech Publications, Switzerland.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Maintaining dynamic information systems using incremental dominance-based rough set approach 3

Maintaining dynamic information systems using incremental do...

引用

3rd International Conference on Information Technology and Management Innovation, ICITMI 2014

作者： Li, Yan Liu, Xiao Qing Hou, Jia Jia Key Lab of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (纸本)9783038352396

Dominance-based rough sets approach (DRSA) is an effective tool to deal with information with preference-ordered attribute domain. In practice, many information systems may evolve when attribute values are changed. Updating set approximations for these dynamic information systems is a necessary step for further knowledge reduction and decision making in DRSA. The purpose of this paper is to present an incremental approach when the information system alters dynamically with the change of condition attribute values. The updating rules are given with proofs, and the experimental evaluations on UCI data show that the incremental approach outperforms the original non-incremental one. © 2014 Trans Tech Publications, Switzerland.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

An improved research method about the similarity calculation of ontology

An improved research method about the similarity calculation...

引用

2009 International Conference on Information Engineering and Computer Science, ICIECS 2009

作者： Li, Xin-Fu Yin, Peng Zheng, Mei Key Lab. in Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China Institute of International Education Yanshan University Qinhuangdao China

ISBN: (纸本)9781424449941

Ontology mapping has been widely used in ontology application, but the similarity calculation becomes a thorny issue in the process of ontology mapping. In this paper, the different elements of ontology are considered. Semantic similarity and concept similarity are integrated to get the ontology similarity. During the similarity calculation of the concept attributes, filter strategy is used to reduce the number of concept attributes, and a method of attributes similarity calculation is proposed. In addition, comprehensive similarity calculation method is given including the semantic and the concept of ontology. The experiment results show that this approach can improve the precision effectively. ©2009 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Markov property of Markov chains and its test

Markov property of Markov chains and its test

引用

International Conference on machine learning and Cybernetics

作者： Zhang, Yu-Fen Zhang, Qun-Feng Yu, Rui-Hua Key Lab. for Machine Learning and Computational Intelligence College of Mathematics and Computer Hebei University Baoding 071002 China Department of Information Technology Baoding University Baoding 071000 China

ISBN: (纸本)9781424465262

Markov chains, with Markov property as its essence, are widely used in the fields such as information theory, automatic control, communication techniques, genetics, computer sciences, economic administration, education administration, and market forecasts. While using Markov chains to predict the future events, we must test the Markov property of random variable sequences of the past statistic data. Only when the random variable sequences satisfy the Markov property, can the prediction could be precise. This paper discusses the concept of Markov property and its features, studies its test method, and by example demonstrates the effectiveness of this prediction method. © 2010 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Feature extended short text categorization based on theme ontology

Feature extended short text categorization based on theme on...

引用

2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012

作者： Zhan, Yan Chen, Hao Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (纸本)9781467300223

Short text classification problem as text classification a branch, in addition to the same with traditional text classification to a certain degree, still need to face some special problems to be solved, because of short text length, features sparse, measuring the words difficultly. Due to the nature of ontology emphasize related field concept, which has the defect of few characteristics in short text, it is necessary to emphasize the relationship between semantic. This paper uses the feature extended method based on theme Ontology. As considering the semantic relations, it can get better classification performance compared to the conventional method. Meanwhile, using Case-Base Maintenance learning via the GC (Generalization Capability) algorithm, which can reduce the case number into K-NN algorithm, can improve efficiency when indexing near neighbor in K-Nearest Neighbor algorithm. The numerical experiments prove the validity of this learning algorithm. © 2012 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Chinese text categorization study based on CBM learning

Chinese text categorization study based on CBM learning

引用

2010 7th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2010

ISBN: (纸本)9781424459346

Text Categorization (TC) is an important component in many information organization and information management tasks. In many TC applications, the case-base grows at a fast rate and this causes inefficiency in the case retrieval process. Using Case-Base Maintenance learning via the GC (Generalization Capability) altorithm, which can reduce the case number into KNN algorithm, can improve efficiency when indexing near neighbor in K-Nearest Neighbor algorithm. The numerical experiments prove the validity of this learning algorithm. Since K-NN algorithm is used extensively to a variety of areas, we can improve classification performance further in TC. ©2010 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

A survey of the initialization of centers and widths in radial basis function network for classification

A survey of the initialization of centers and widths in radi...

引用

2011 International Conference on machine learning and Cybernetics, ICMLC 2011

作者： Dong, Chun-Ru Chan, Patrick P.K. Ng, Wing W.Y. Yeung, Daniel S. Machine Learning and Cybernetics Research Center School of Computer Science and Engineering South China University of Technology Guangzhou 510006 China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 China

ISBN: (纸本)9781457703065

The radial basis function network (RBFN) has been widely used in various fields such as function regression, pattern recognition, and error detection, etc. However, the structural parameters of RBFN including the number of hidden units, centers vectors, and widths (variances) are one of the most importent issues when training a RBFN, which greatly affect the performance of RBFN. So, the objective of this paper is to construct an elementary survey about this problem. Firstly, the fundamental knowledge and notations of RBFN is introduced. Secondly, we summarize most existing network structure initialization methods for RBFN and categorize them into four goups. Then some typical appraoches for each category are introduced and discussed. The disadvantages and virtues for parts of methods are also introduced. Finally, the paper is concluded with a discussion of current difficulties and possible future directions about RBFN architecture selection. © 2011 IEEE.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

A comparative study of four Fuzzy Integrals for classifier fusion

A comparative study of four Fuzzy Integrals for classifier f...

引用

International Conference on machine learning and Cybernetics

作者： Feng, Hui-Min Li, Xue-Fei Chen, Jun-Fen Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 China College of Science Agricultural University of Hebei Baoding 071001 China

ISBN: (纸本)9781424465262

Fuzzy Integral is widely accepted and applied in multi-classifier fusion to express the importance of individual classifiers and the interaction among classifiers. In this fusion model, there are two keys to determine. One is determining the fuzzy measure. Many researchers have done much work and proposed many types of fuzzy measure and methods to determine fuzzy measures. Another is selecting from four types of fuzzy integral: Sugeno integral, Choquet integral, upper integral and lower integral. Usually, the type of fuzzy integral is specified in advance. Choquet integral is often the choice. This paper is to compare comprehensively four fuzzy integrals in multiple-classifier fusion and hope to give the foundation for selecting Choquet integral. According the theoretical and experimental analysis, it gives the conclusion that Choquet integral is the best suitable for classifier fusion. © 2010 IEEE.

关键词： Integral equations

来源：评论

学校读者我要写书评

暂无评论

Discretization of continuous-valued attributes in decision tree generation

Discretization of continuous-valued attributes in decision t...

引用

International Conference on machine learning and Cybernetics

作者： Li, Wen-Liagn Yu, Rui-Hua Wang, Xi-Zhao Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 China Department of Information Technology Baoding University Baoding 071000 China

ISBN: (纸本)9781424465262

Decision tree is one of the most popular and widely used classification models in machine learning. The discretization of continuous-valued attributes plays an important role in decision tree generation. In this paper, we improve Fayyad's discretization method which uses the average class entropy of candidate partitions to select boundaries for discretization. Our method can reduce the number of candidate boundaries further. Here we also propose a generalized splitting criterion for cut point selection and prove that the cut points are always on boundaries when using this criterion. Along with the formal proof, we present empirical results that the decision trees generated by using such criteria are similar on several datasets from the UCI machine learning Repository. © 2010 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：