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

A Curvature based Isometric Feature Mapping 26

A Curvature based Isometric Feature Mapping

26th international Conference on Pattern Recognition / 8th international workshop on Image Mining - Theory and applications (IMTA)

作者： Levada, Alexandre L. M. Univ Fed Sao Carlos Dept Comp Sao Carlos SP Brazil

ISBN: (数字)9781665490627

ISBN: (纸本)9781665490627

Unsupervised metric learning consists in building adaptive distance functions without knowledge of the class labels to improve pattern classification. Usually, this process can be accomplished by manifold learning algorithms, through nonlinear dimensionality reduction. In this paper, we propose a curvature based Isometric Feature Mapping, a method that uses differential geometric concepts to build an intrinsic distance function that measures the variations of the local tangent spaces along shortest paths in the KNN graph, motivated by the Frenet-Serret equations and the notion of curvature. Experimental results with several real world datasets show that the proposed method is capable of producing classification performance comparable to other state-of-the-art dimensionality reduction based metric learning techniques, such as t-SNE and UMAP.

关键词： Clustering algorithms Pattern classification optimization methods Euclidean distance Feature extraction Size measurement Manifold learning

来源：评论

学校读者我要写书评

暂无评论

A novel differential evolution with cooperative co-evolution for global optimization

A novel differential evolution with cooperative co-evolution...

引用

2nd international workshop on Intelligent Systems and applications, ISA2010

作者： Lee, Wei-Ping Chien, Wan-Jou Information Management Department Chung Yuan Christian University Chun li Taiwan

ISBN: (纸本)9781424458745

Differential evolution, termed DE, is a novel and rapidly developed evolution computation in recent year. There are some advantages of DE, including simple structure, easy use and rapid convergence speed. Besides, DE can be also applied on complex optimization problem. However, there are some problems, such as premature convergence and stagnation, remaining in DE algorithm. To overcome those disadvantages, a different method was proposed, named CO-DE, by combining with a simple co-evolutionary model and reset mechanism. Thus, CO-DE can maintain appropriate swarm diversity and reduce the premature convergence. On the other hand, a reset mechanism was set to avoid the particle stagnates, which can further improve the performance of differential evolution. The proposed model can be now successfully applied with some well-known benchmark functions. ©2010 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Study on water pollution diffusion by artificial immunity optimization algorithm

Study on water pollution diffusion by artificial immunity op...

引用

2nd international workshop on Intelligent Systems and applications, ISA2010

作者： Yu, Li Wang, Jia-Quan School of Management Hefei University of Technology Hefei China Department of Computer Science and Technology Anhui University of Science and Technology Huainan China

ISBN: (纸本)9781424458745

Artificial immune algorithm is a new bionic algorithms, it becomes a hot spot. Artificial immune algorithm has self-adjustment ability and adaptive capacity of the environment and can deal with complex optimization problems in parallel. Immune algorithm takes concentration and affinity as standards. Thus low concentration, high-fit individuals have more breeding opportunities. As attention to the diversity of individuals of solution group, convergence of the algorithm is avoided. Select the test function to simulate diffusion experiment, the results showed that the immune algorithm is easy to achieve stable and good solution, it can accurately reflect the mix of major pollutants, the proliferation of laws. The algorithm provided a analysis tools for environmental capacity of water pollutants for the river basin to identify and volume control, and sustainable utilization of water resources. ©2010 IEEE.

关键词： Pareto principle

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 3rd IEEE international workshop on System-on-Chip for Real-Time applications, IWSOC 2003

Proceedings - 3rd IEEE International Workshop on System-on-C...

引用

3rd IEEE international workshop on System-on-Chip for Real-Time applications, IWSOC 2003

ISBN: (纸本)076951944X

The proceedings contain 76 papers. The topics discussed include: template generation and selection algorithms;optimized datapath design by evolutionary computation;a performance evaluation method for optimizing embedded applications;a robust handshake for asynchronous system;detailed placement with net length constraints;Steiner tree construction based on congestion for the global routing problem;incorporating pattern prediction technique for energy efficient filter cache design;a survey of dynamic power optimization techniques;digital realization of analogue computing elements using bit streams;a mixed-mode delay-locked loop for wide-range operation and multiphase clock generation;dynamic hardware-software partitioning on reconfigurable system-on-chip;and catalog of hardware acceleration techniques for real-time reconfigurable system on chip.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Avoiding error-prone reordering optimization during legal systems migration

引用

16th international workshop on Database and Expert Systems applications

作者： Fang, YL Wang, H Yang, DQ Beijing Univ Technol Coll Comp Sci Beijing 100022 Peoples R China Tsinghua Univ Sch Econ & Management Beijing 100084 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China

ISBN: (纸本)3540285660

During Legal information systems migrations, one major problem is to handle attribute value cleaning. In the paper, we first show many data cleaning steps process on the values of the same data attributes and their derivations, and users may ignore or be puzzled by the data transforms that are defined to clean and transform the data sets, and such process can also be prone to error during process optimization. In this paper, we first define two major such problems as assignment conflict and range conflict,and giving problem definitions for such conflicts. Then we present two separate algorithms respectively to discover and solve the conflicts.

关键词： optimization

来源：评论

学校读者我要写书评

暂无评论

3rd workshop on Engineering applications, WEA 2016

3rd Workshop on Engineering Applications, WEA 2016

引用

3rd workshop on Engineering applications, WEA 2016

ISBN: (纸本)9783319508795

The proceedings contain 35 papers. The special focus in this conference is on Engineering applications. The topics include: A model for knowledge management in software industry;a metaprocesses-oriented methodology based on RAS;user experiences in virtual reality environments navigation based on simple knowledge organization systems;induction of rules based on similarity relations for imbalance datasets;price direction prediction on high frequency data using deep belief networks;search techniques for automated proposal of data mining schemes;comparison between neuronal networks and ANFIS for wind speed-energy forecasting;improving the performance of leaves identification by features selection with genetic algorithms;impact of weight initialization on multilayer perceptron using fuzzy similarity quality measure;a genetic optimized cascade multilevel converter for power analysis;proposal for a hybrid expert system and an optimization model for the routing problem in the courier services;use of simulation in a service desk of an oilfield services company;effects of using multimodal transport over the logistics performance of the food chain of uchuva;a simulation model to improve customer service in an information security company;multi-agent approach for solving the dynamic home health care routing problem;a dynamic model of logistic management for obtaining activated carbon;a knowledge-based expert system for scheduling in services systems;simulation of the coffee berry borer expansion in Colombian crops using a model of multiple swarms and a note about sensitivity analysis for the soft constraints model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows

引用

COMPUTERS & OPERATIONS RESEARCH 2011年第1期38卷 287-300页

作者： Garcia-Najera, Abel Bullinaria, John A. Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England

The vehicle routing problem with time windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective is to find the lowest distance set of routes to deliver goods, using a fleet of identical vehicles with restricted capacity, to customers with service time windows. However, there are other objectives, and having a range of solutions representing the trade-offs between objectives is crucial for many applications. Although previous research has used evolutionary methods for solving this problem, it has rarely concentrated on the optimization of more than one objective, and hardly ever explicitly considered the diversity of solutions. This paper proposes and analyzes a novel multi-objective evolutionary algorithm, which incorporates methods for measuring the similarity of solutions, to solve the multi-objective problem. The algorithm is applied to a standard benchmark problem set, showing that when the similarity measure is used appropriately, the diversity and quality of solutions is higher than when it is not used, and the algorithm achieves highly competitive results compared with previously published studies and those from a popular evolutionary multi-objective optimizer. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Vehicle routing problem Combinatorial optimization Multi-objective optimization Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Method of Selecting and Determining the Free Parameters of Swarm Intelligent algorithms for Optimizing Solutions in GIS 11

Method of Selecting and Determining the Free Parameters of S...

引用

11th IEEE international Conference on Intelligent Data Acquisition and Advanced Computing Systems - Technology and applications (IDAACS)

作者： Uhryn, Dmytro Lytvyn, Vasyl Lendiuk, Taras Natl Tech Univ Kharkiv Polytech Inst Chernivtsi Fac Dept Informat Syst Holovna Str 203A UA-58000 Chernovtsy Ukraine Lviv Polytech Natl Univ Dept Informat Syst & Networks Bandery Str 12 UA-79013 Lvov Ukraine West Ukrainian Natl Univ Dept Informat Comp Syst & Control 3 Peremoga Sq UA-46020 Ternopol Ukraine

ISBN: (纸本)9781665426053

The article proposes information technology for solving the discrete optimization problems in Geographic Information Systems (GIS). The information model of geographic data (geodata) was further developed, which consists of a formalized combination of their spatial and attributive components. It takes into account relational, semantic and frame models for representing the knowledge of the attributive component in order to unify the branch geodata. The conceptual model of decision support in sectoral GIS has been further developed, which takes into account the information model of geodata and the dynamics of their change, the hierarchy of tasks of sectoral GIS, the input operational data, the function of preferences and the criterion of decision-making. A new method of decision support for GIS construction was developed on the base of the proposed conceptual model. The method of selection and determination of free parameters of swarm intelligence algorithms is developed to increase the effectiveness of GIS. It is suggested to determine the free parameters for individual swarm algorithms based on machine learning with reinforcement, namely the Q-Learning method. Based on this method Markov chains for the swarm algorithms were constructed. Reinforcement consisted in the expert analysis of the results obtained by a certain swarm algorithm. On the example of territorial administration, optimal values of the parameters for individual swarm algorithms were found.

关键词： swarm intelligence free parameters optimization problems Geographic Information Systems geodata decision making

来源：评论

学校读者我要写书评

暂无评论

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Approaches and mathematical models for robust solutions to o...

引用

23rd international workshop on Combinatorial algorithms, IWOCA 2012

作者： Dayama, Niraj Ramesh Kulkarni, Ketki Indian Institute of Technology Bombay Powai-400 076 India

ISBN: (纸本)9783642359255

Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data. © 2012 Springer-Verlag.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A Short Survey of Evolutionary algorithms for Solving Many Objective optimization Problems 1

引用

13th international workshop of Advanced Manufacturing and Automation, IWAMA 2023

作者： Xu, Yigang Wang, Chen Department of Mechanical Engineering Hubei Institute of Automotive Technology Shiyan10525 China

ISBN: (数字)9789819706655

ISBN: (纸本)9789819706648

Multi-objective evolutionary algorithms have been shown to solve multi-objective optimization problems well and have been very widely used, but there are still drawbacks such as failure to develop sufficient environmental selection pressure to guide the population search toward the Pareto front, long computation time of the algorithms, and difficulty in visualization in the face of MaOPs, which have led to an increasing interest in the research of solving MaOPs. In addition, there are many expensive MaOPs in many practical applications of MaOPs. This paper has the following three parts of work: introducing common mainstream methods for solving MaOPs;introducing common surrogate-assisted methods for solving expensive MaOPs;applying MaOEAs and surrogate-assisted evolutionary algorithms to solve different MaOPs based on platEMO. The results show that there are differences in the effectiveness of different methods in solving different problems. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：