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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

198 篇 期刊文献
122 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

297 篇 工学
- 224 篇 计算机科学与技术...
- 62 篇 电气工程
- 29 篇 软件工程
- 20 篇 控制科学与工程
- 13 篇 机械工程
- 13 篇 信息与通信工程
- 11 篇 动力工程及工程热...
- 11 篇 石油与天然气工程
- 9 篇 水利工程
- 7 篇 环境科学与工程（可...
- 5 篇 力学（可授工学、理...
- 5 篇 航空宇航科学与技...
- 4 篇 生物医学工程（可授...
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 交通运输工程
- 2 篇 船舶与海洋工程
63 篇 理学
- 34 篇 数学
- 17 篇 生物学
- 4 篇 物理学
- 3 篇 地球物理学
- 3 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 系统科学
62 篇 管理学
- 60 篇 管理科学与工程(可...
4 篇 农学
- 2 篇 作物学
3 篇 医学
2 篇 经济学
- 2 篇 应用经济学

主题

321 篇 multi-objective ...
26 篇 multi-objective ...
15 篇 genetic algorith...
11 篇 evolutionary alg...
11 篇 nsga-ii
10 篇 many-objective o...
8 篇 optimization
8 篇 evolutionary com...
7 篇 fuzzy rule-based...
7 篇 search-based sof...
7 篇 pareto front
7 篇 differential evo...
6 篇 combinatorial op...
6 篇 scheduling
5 篇 neural architect...
5 篇 data mining
5 篇 parallel and dis...
5 篇 moea/d
5 篇 feature selectio...
5 篇 artificial neura...

机构

5 篇 hosei univ fac c...
4 篇 univ pisa dipart...
4 篇 tokai univ sch i...
3 篇 hosei univ grad ...
3 篇 univ zaragoza de...
3 篇 univ cordoba dep...
3 篇 univ granada dep...
2 篇 amirkabir univ t...
2 篇 ort braude coll ...
2 篇 univ south austr...
2 篇 hunan univ sch c...
2 篇 univ jaen dept c...
2 篇 cyber dyne srl v...
2 篇 xidian univ sch ...
2 篇 royal univ bhuta...
2 篇 delft univ techn...
2 篇 basque res & tec...
2 篇 univ basque coun...
2 篇 nanjing univ sta...
2 篇 east china univ ...

作者

10 篇 marcelloni franc...
8 篇 lazzerini beatri...
6 篇 jimenez fernando
6 篇 sato yuji
6 篇 sanchez gracia
5 篇 qian chao
5 篇 ducange pietro
5 篇 coello coello ca...
5 篇 dufo-lopez rodol...
4 篇 yao xin
4 篇 liu dan-xuan
4 篇 gastelum chavira...
4 篇 guo jianmei
4 篇 zapotecas-martin...
4 篇 antonelli michel...
4 篇 leyva lopez juan...
4 篇 marquez-vega lui...
4 篇 palma jose
4 篇 miyakawa minami
4 篇 shi kai

语言

305 篇 英文
16 篇 其他

检索条件"主题词=multi-objective evolutionary algorithms"

共 321 条记录，以下是151-160 订阅

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

详细简洁

排序：

Many-objective Optimization Using Taxi-Cab Surface evolutionary Algorithm

Many-Objective Optimization Using Taxi-Cab Surface Evolution...

引用

7th International Conference on evolutionary multi-Criterion Optimization (EMO)

作者： Moen, Hans J. F. Hansen, Nikolai B. Hovland, Harald Torresen, Jim Norwegian Def Res Estab Informat Management Div Oslo Norway Univ Oslo Dept Informat N-0316 Oslo Norway Univ Oslo Dept Math N-0316 Oslo Norway

ISBN: (纸本)9783642371400

Optimization of problems spanning more than three objectives, called many-objective optimization, is often hard to achieve using modern algorithm design and currently available computational resources. In this paper a multi-objective evolutionary algorithm, called the Surface evolutionary Algorithm, is extended into many-objective optimization by utilizing, for the first time, the taxi-cab metric in the optimizer. The Surface evolutionary Algorithm offers an alternative to multi-objective optimizers that rely on the principles of domination, hypervolume and so forth. The taxi-cab metric, or Manhattan distance, is introduced as the selection criterion and the basis for calculating attraction points in the Surface evolutionary Algorithm. This allows for fast and efficient many-objective optimization previously not attainable using this method. The Taxi-Cab Surface evolutionary Algorithm is evaluated on a set of well-known many-objective benchmark test problems. In problems of up to 20 dimensions, this new algorithm of low complexity is tested against several modern multi-objective evolutionary algorithms. The results reveal the Taxi-Cab Surface evolutionary Algorithm as a conceptually simple, yet highly efficient many-objective optimizer.

关键词： multi-objective optimization multi-objective evolutionary algorithms many-objective optimization

来源：评论

学校读者我要写书评

暂无评论

A New evolutionary Algorithm for Extracting a Reduced Set of Interesting Association Rules 1

引用

22nd International Conference on Neural Information Processing (ICONIP)

作者： Kabir, Mir Md. Jahangir Xu, Shuxiang Kang, Byeong Ho Zhao, Zongyuan Univ Tasmania Sch Engn Hobart Tas Australia Univ Tasmania ICT Hobart Tas Australia

ISBN: (数字)9783319265353

ISBN: (纸本)9783319265353;9783319265346

Data mining techniques involve extracting useful, novel and interesting patterns from large data sets. Traditional association rule mining algorithms generate a huge number of unnecessary rules because of using support and confidence values as a constraint for measuring the quality of generated rules. Recently, several studies defined the process of extracting association rules as a multi-objective problem allowing researchers to optimize different measures that can present in different degrees depending on the data sets used. Applying evolutionary algorithms to noisy data of a large data set, is especially useful for automatic data processing and discovering meaningful and significant association rules. From the beginning of the last decade, multi-objective evolutionary algorithms are gradually becoming more and more useful in data mining research areas. In this paper, we propose a new multi-objective evolutionary algorithm, MBAREA, for mining useful Boolean association rules with low computational cost. To accomplish this our proposed method extends a recent multi-objective evolutionary algorithm based on a decomposition technique to perform evolutionary learning of a fitness value of each rule, while introducing a best population and a class based mutation method to store all the best rules obtained at some point of intermediate generation of a population and improving the diversity of the obtained rules. Moreover, this approach maximizes two objectives such as performance and interestingness for getting rules which are useful, easy to understand and interesting. This proposed algorithm is applied to different real world data sets to demonstrate the effectiveness of the proposed approach and the result is compared with existing evolutionary algorithm based approaches.

关键词： Data mining Association rules multi-objective evolutionary algorithms Conditional probability Interestingness

来源：评论

学校读者我要写书评

暂无评论

Clustering Based Parallel Many-objective evolutionary algorithms Using the Shape of the objective Vectors 8

Clustering Based Parallel Many-Objective Evolutionary Algori...

引用

8th International Conference on evolutionary multi-Criterion Optimization (EMO)

作者： von Luecken, Christian Brizuela, Carlos Baran, Benjamin Univ Nacl Asuncion Fac Politecn San Lorenzo Paraguay CICESE Res Ctr Ensenada Baja California Mexico

ISBN: (纸本)9783319158921;9783319158914

multi-objective evolutionary algorithms (MOEA) are used to solve complex multi-objective problems. As the number of objectives increases, Pareto-based MOEAs are unable to maintain the same effectiveness showed for two or three objectives. Therefore, as a way to ameliorate this performance degradation several authors proposed preference-based methods as an alternative to Pareto based approaches. On the other hand, parallelization has shown to be useful in evolutionary optimizations. A central aspect for the parallelization of evolutionary algorithms is the population partitioning approach. Thus, this paper presents a new parallelization approach based on clustering by the shape of objective vectors to deal with many-objective problems. The proposed method was compared with random and k-means clustering approaches using a multi-threading framework in parallelization of the NSGA-II and six variants using preference-based relations for fitness assignment. Executions were carried-out for the DTLZ problem suite, and the obtained solutions were compared using the generational distance metric. Experimental results show that the proposed shape-based partition achieves competitive results when comparing to the sequential and to other partitioning approaches.

关键词： multi-objective evolutionary algorithms Many-objective optimization Parallel evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Bi-MOCK: A multi-objective evolutionary Algorithm for Bi-clustering with Automatic Determination of the Number of Bi-clusters 24th

Bi-MOCK: A Multi-objective Evolutionary Algorithm for Bi-clu...

引用

24th International Conference on Neural Information Processing (ICONIP)

作者： Bousselmi, Meriem Bechikh, Slim Hung, Chih-Cheng Ben Said, Lamjed Univ Tunis Comp Sci Dept SMART Lab Tunis Tunisia Kennesaw State Univ Marietta GA USA Anyang Normal Univ Anyang Peoples R China

ISBN: (纸本)9783319700939;9783319700922

Bi-clustering is one of the main tasks in data mining with many possible applications in bioinformatics, pattern recognition, text mining, just to cite a few. It refers to simultaneously partitioning a data matrix based on both rows and columns. One of the main issues in bi-clustering is the difficulty to find the number of bi-clusters, which is usually pre-specified by the human user. During the last decade, a new algorithm, called MOCK, has appeared and shown its performance in data clustering where the number of clusters is determined automatically. Motivated by the interesting results of MOCK, we propose in this paper a new algorithm, called Bi-MOCK, which could be seen as an extension of MOCK for bi-clustering. Like MOCK, Bi-MOCK uses the concept of multi-objective optimization and is able to find automatically the number of bi-clusters thanks to a newly proposed variable string length encoding scheme. The performance of our proposed algorithm is assessed on a set of real gene expression datasets. The comparative experiments show the merits and the outperformance of Bi-MOCK with respect to some existing recent works.

关键词： Bi-clustering Number of bi-clusters multi-objective evolutionary algorithms Variable-size encoding

来源：评论

学校读者我要写书评

暂无评论

multi-objective evolutionary Neural Network to Predict Graduation Success at the United States Military Academy

Multi-objective Evolutionary Neural Network to Predict Gradu...

引用

Complex Adaptive Systems Conference (CAS) - Cyber Physical Systems and Deep Learning

作者： Lesinski, Gene Corns, Steven US Mil Acad West Point NY 10996 USA Missouri Univ Sci & Technol Rolla MO 65409 USA

This paper presents an evolutionary neural network approach to classify student graduation status based upon selected academic, demographic, and other indicators. A pareto-based, multi-objective evolutionary algorithm utilizing the Strength Pareto evolutionary Algorithm (SPEA2) fitness evaluation scheme simultaneously evolves connection weights and identifies the neural network topology using network complexity and classification accuracy as objective functions. A combined vector-matrix representation scheme and differential evolution recombination operators are employed. The model is trained, tested, and validated using 5100 student samples with data compiled from admissions records and institutional research databases. The inputs to the evolutionary neural network model are used to classify students as: graduates, late graduates, or non-graduates. Results of the hybrid method show higher mean classification rates (88%) than the current methodology (80%) with a potential savings of $130M. Additionally, the proposed method is more efficient in that a less complex neural network topology is identified by the algorithm. (C) 2018 The Authors. Published by Elsevier B.V.

关键词： evolutionary algorithms Neural network multi-objective evolutionary algorithms enrollment management student retention

来源：评论

学校读者我要写书评

暂无评论

Methodologies for Solving Complex multi-objective Combinatorial Problems in Engineering: An evolutionary Approach

Methodologies for Solving Complex Multi-Objective Combinator...

引用

IEEE International Conference on Automatica (ICA-ACCA)

作者： Donoso, Yezid Univ Los Andes Syst & Comp Engn Dept Master Program Informat Secur Bogota Colombia

ISBN: (纸本)9781509011476

In real problems in Engineering, solving a problem is not enough;the solution of the problem must be the best solution possible. In other words, it is necessary to find the optimal solution. The solution is the best possible solution because in the real world this problem may have certain constraints by which the solutions found may be feasible, that is, they can be implemented in practice and, unfeasible or that they cannot be implemented. Some of these problems in engineering can be MOP (multi-objective Optimization Problem). A general MOP includes a set of n parameters ( decision variables), a set of k objective functions and a set of m restrictions. The objective and restriction functions are functions of the decision variables where is possible to obtain a set of optimal values. Then the MOP can be expressed as: Optimize y = f(x) = (fl( x), f2(x),..., fk(x)) Subject to e(x) = (el(x), e2(x),..., em(x)) 0 Where x = (x1, x2,..., xn) X y = (y1, y2,..., yk) Y The method evolutionary algorithm (EA) refers to searching and optimization techniques based on the evolution model proposed by Charles Darwin. Genetic algorithms are used in several areas especially for searching and optimizations. In the real case the algorithm is implemented by choosing a coding for the possible solutions to the problem. The coding is done through chains of bits, numbers or characters that represent the chromosomes. The crossing and mutation operations are applied in a very simple way through functions of vector value manipulation. The EAs are interesting given the fact that at first glance they seem especially apt to deal with the difficulties presented by MOPs. The reason for this is that they can return an entire set of solutions after a simple run and they do not have any other of the limitations of traditional techniques. In addition, some researchers have suggested that the EAs would behave better than other blind searching techniques.

关键词： Complex Problems evolutionary algorithms multi-objective Optimization Problems multi-objective evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring the Pareto frontier using multi-sexual evolutionary algorithms: an application to a flexible manufacturing problem

Exploring the Pareto frontier using multi-sexual evolutionar...

引用

Conference on Applications and Science of Neural Networks, Fuzzy Systems, and evolutionary Computation V

作者： Bonissone, S Subbu, R GE Co Global Res Ctr Schenectady NY 12309 USA

ISBN: (纸本)0819445541

In multi-objective optimization (MOO) problems we need to optimize or at least satisfy many possibly conflicting objectives. For instance, in manufacturing planning we might want to minimize the cost and production time while maximizing the product's quality. We propose the use of evolutionary algorithms (EAs) to solve these problems. EAs are computer programs that generate solutions by simulating a Darwinian evolution. Solutions are represented as individuals in a population and are assigned scores according to a fitness function that determines their relative quality. Strong solutions are selected for reproduction, and pass their genetic material to the next generation. Weak solutions are removed from the population. The fitness function evaluates each solution and returns a related score.. In MOO problems, this fitness function is vector-valued, i.e. it returns a value for each objective. Therefore, instead of a global optimum, we try to find the Pareto-optimal or non-dominated frontier. We use multi-sexual EAs with as many genders as optimization criteria. We have created new crossover and gender assignment functions, and experimented with various parameters to determine the best setting (yielding the highest number of non-dominated solutions.) These experiments are conducted using a variety of fitness functions, and the algorithms are later evaluated on a flexible manufacturing problem with total cost and time minimization objectives.

关键词： multi-objective evolutionary algorithms multi-sexual evolutionary algorithms Pareto frontier flexible manufacturing

来源：评论

学校读者我要写书评

暂无评论

multi-objective evolutionary fuzzy modeling for the docking maneuver of an automated guided vehicle

Multi-objective evolutionary fuzzy modeling for the docking ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lucas, JM Martínez-Barberá, H Jiménez, F Univ Murcia Dept Informat & Commun Engn Murcia Spain

ISBN: (纸本)0780392981

In many real-world applications, mobile robots require interacting with objects in their environments by means of performing docking tasks in a precise manner. In the application domain of this work, an Automated Guided Vehicle (AGV), specifically, a fork-lift truck must often perform docking maneuvers to load pallets in conveyor belts. The main purpose is to improve some features of docking task as its duration, accuracy and stability. We propose a soft computing technique based on a multiobjective evolutionary algorithm in order to find multiples fuzzy logic controllers which optimize specific objectives and satisfy imposed constraints for docking task in charge of following up an online generated trajectory.

关键词： multi-objective evolutionary algorithms path following path tracking mobile robots constraint optimization fuzzy control

来源：评论

学校读者我要写书评

暂无评论

A Classification Surrogate Model based evolutionary Algorithm for Neural Network Structure Learning

A Classification Surrogate Model based Evolutionary Algorith...

引用

International Joint Conference on Neural Networks (IJCNN) held as part of the IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Hu, Wenyue Zhou, Aimin Zhang, Guixu East China Normal Univ Sch Comp Sci & Technol Shanghai Key Lab Multidimens Informat Proc Shanghai Peoples R China

ISBN: (纸本)9781728169262

Designing neural networks often requires a large number of artificial intelligence experts. However, such manual processes are time-consuming and require numerous resources. In this paper, we try to search neural network structures automatically for the image classification task. Moreover, considering the huge computational cost of neural architecture search (NAS), we attempt to apply a classification surrogate model based multi-objective evolutionary algorithm to search neural network architectures (CSMEA-Net). The algorithm combines two objectives, i.e., minimizing the validation error and the computational complexity measured by the number of floating-point operations (FLOPs) to achieve Pareto Optimality. In addition, we improve the components of the cell-based search space. The performance of network architectures discovered by our method is evaluated on CIFAR-10 and CIFAR-100 datasets. The experimental results show that the proposed approach can find a higher-performance neural network architecture compared with both hand-crafted as well as automatically-designed networks.

关键词： convolutional neural network neural architecture search multi-objective evolutionary algorithms image classification

来源：评论

学校读者我要写书评

暂无评论

Parallel Dynamic multi-objective Optimization evolutionary Algorithm 22

Parallel Dynamic Multi-Objective Optimization Evolutionary A...

引用

22nd International Arab Conference on Information Technology (ACIT)

作者： Grid, Maroua Belaiche, Leila Kahloul, Laid Benharzallah, Saber Biskra Univ Comp Sci Dept LINFI Lab Biskra Algeria Batna 2 Univ Batna Algeria

ISBN: (纸本)9781665419956

multi-objective optimization evolutionary algorithms (MOEAs) are considered as the most suitable heuristic methods for solving multi-objective optimization problems (MOPs). These MOEAs aim to search for a uniformly distributed, near-optimal and near-complete Pareto front for a given MOP. However, MOEAs fail to achieve their aim completely because of their fixed population size. To overcome this limit, an evolutionary approach of multi-objective optimization was proposed;the dynamic multi-objective evolutionary algorithms (DMOEAs). This paper deals with improving the user requirements (i.e., getting a set of optimal solutions in minimum computational time). Although, DMOEA has the distinction of dynamic population size, being an evolutionary algorithm means that it will certainly be characterized by long execution time. One of the main reasons for adapting parallel evolutionary algorithms (PEAs) is to obtain efficient results with an execution time much lower than the one of their sequential counterparts in order to tackle more complex problems. Thus, we propose a parallel version of DMOEA (i.e., PDMOEA). As experimental results, the proposed PDMOEA enhances DMOEA in terms of three criteria: improving the objective space, minimization of computational time and converging to the desired population size.

关键词： multi-objective problems Pareto front multi-objective evolutionary algorithms Dynamic MOEA Parallel DMOEA

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：