已为您找到该学者31条结果 成果回收站
【期刊论文】An Improved Group Search Optimizer for the Internet of Things
冯翔, 刘晓婷, 虞慧群
International Journal of Communication Systems,2014,29(3):535-552
2014年10月24日
The development of the Internet of Things brings new opportunities and challenges for sensor networks. The scale of sensor networks tends to be larger. And the fusion rules need to be intelligent. In this paper, we propose a new Internet of Things group search optimizer (ITGSO) to solve intelligent information fusion problems in the high-dimensional multi-sensor networks. ITGSO is inspired by the latest research achievement about leader decision in Nature and works about social coordination, which mainly consists of three parts: basic group search optimizer, binary group search optimizer, and social decision model. With ITGSO, we need less time to obtain minimum Bayes cost than particle swarm optimization. And information of uncertain social intelligent problems can be fused. In this paper, we give the theoretical basic of ITGSO and proved its validity via mathematical analysis and simulation results.
Internet of Things group search optimizer, sensor network, binary group search optimizer, leader decision
-
96浏览
-
0点赞
-
0收藏
-
1分享
-
20下载
-
0
-
引用
冯翔, 马美怡, 施尹, 虞慧群
计算机研究与发展,2013,50(12):2543-2553
2013年12月15日
机器人学是现在及未来科技发展的重点,路径规划是机器人学中的一个重要课题.生物界一些群居动物有严格的等级制度和职责分工,受社会群居动物行为启发,提出社会群体搜索算法(social group search algorithm, SGSO).社会群体搜索算法对群体的分类及信息反馈机制——领导-追随机制的制定,降低了早熟的概率,交叉变异和淘汰机制的引入增加了搜索范围,减少了陷入局部最优的可能.同时,对提出的社会群体搜索算法进行了分析,从理论上证明了算法的收敛性;将社会群体搜索算法应用于机器人路径规划进行仿真,从实验中验证了算法的有效性,并与遗传算法和粒子群算法比较,进一步证明了社会群体搜索算法在机器人路径规划问题中的有效性和高效性.
机器人路径规划, 社会群体搜索算法, 社会行为, 遗传算法, 粒子群优化
-
96浏览
-
0点赞
-
0收藏
-
1分享
-
1下载
-
0
-
引用
【期刊论文】A New Multi-Colony Fairness Algorithm for Feature Selection
冯翔, 杨昙, 虞慧群
Soft Computing,2016,21(23):7141-7157
2016年07月06日
As the world gradually transforms from an information world to a data-driven world, areas of pattern recognition and data mining are facing more and more challenges. The process of feature subset selection becomes a necessary part of big data pattern recognition due to the data with explosive growth. Inspired by the behavior of grabbing resources in animals, this paper adds personal grabbing-resource behavior into the model of resource allocation transformed from the model of feature selection. Multi-colony fairness algorithm (MCFA) is proposed to deal with grabbing-resource behaviors in order to obtain a better distribution scheme (i.e., to obtain a better feature subset). The algorithm effectively fuses strategies of the random search and the heuristic search. In addition, it combines methods of filter and wrapper so as to reduce the amount of calculation while improving classification accuracies. The convergence and the effectiveness of the proposed algorithm are verified both from mathematical and experimental aspects. MCFA is compared with other four classic feature selection algorithms such as sequential forward selection, sequential backward selection, sequential floating forward selection, and sequential floating backward selection and three mainstream feature selection algorithms such as relevance–redundancy feature selection, minimal redundancy–maximal relevance, and ReliefF. The comparison results show that the proposed algorithm can obtain better feature subsets both in the aspects of feature subset length which is defined as the number of features in a feature subset and the classification accuracy. The two aspects indicate the efficiency and the effectiveness of the proposed algorithm.
Feature selection, Multi-colony fairness algorithm (, MCFA), , Resource allocation, Grabbing-resource behavior
-
95浏览
-
0点赞
-
0收藏
-
0分享
-
0下载
-
0
-
引用
【期刊论文】A Novel Optimization Algorithm Inspired by the Creative Thinking Process
冯翔, 邹儒, 虞慧群
Soft Computing,2014,19(10):2955-2972
2014年09月19日
Creative thinking, which plays an essential role in the progress of human society, has an outstanding problem-solving ability. This paper presents a novel creativity-oriented optimization model (COOM) and algorithm (COOA) inspired by the creative thinking process. At first, COOM is constructed by simplifying the procedure of creative thinking while retaining its main characteristics. And then, COOA is presented for continuous optimization problems. It is a realization of COOM. As a new nature-inspired algorithm, COOA is different from other similar algorithms in terms of the basic principle, mathematical formalization and properties. Features of the COOM and the corresponding algorithm include a powerful processing ability for the complex problems, namely high-dimensional, highly nonlinear and random problems. The proposed approach also has the advantages in terms of the higher intelligence, effectiveness, parallelism and lower computation complexity. The properties of COOA, including convergence and parallelism, are discussed in detail. The numerous simulations on the CEC-2013 real-parameter optimization benchmark functions’ problems have shown the effectiveness and parallelism of the proposed approach.
Creativity-oriented optimization algorithm, Nature-inspired algorithm, Creative thinking, Numerical function optimization
-
94浏览
-
0点赞
-
0收藏
-
1分享
-
18下载
-
0
-
引用
【期刊论文】Parallel Physics-inspired Waterflow Particle Mechanics Algorithm for Load Rebalancing
冯翔, Francis C.M. Lau
Computer Networks,2010,54(11):1767-1777
2010年02月10日
The Load Rebalancing Problem (LRP) that reassigns tasks to processors so as to minimize the maximum load arises in the context of dynamic load balancing. Many applications such as on Web based environment, parallel computing on clusters can be stated as LRP. Solving LRP successfully would allow us to utilize resources better and achieve better performance. However LRP has been proven to be NP-hard, thus generating the exact solutions in tractable amount of time becomes infeasible when the problems become large. We present a new nature-inspired approximation algorithm based on the Waterflow Particle Mechanics (W-PM) model to compute in parallel approximate efficient solutions for LRPs. Just like other Nature-inspired Algorithms (NAs) drawing from observations of physical processes that occur in nature, the W-PM algorithm is inspired by kinematics and dynamics of waterflow. The W-PM algorithm maps the classical LRP to the flow of water flows in channels by corresponding mathematical model in which all water flows flow according to certain defined rules until reaching a stable state. By anti-mapping the stable state, the solution to LRP can be obtained.
Load rebalancing, Approximation algorithm, Nature-inspired algorithm, Waterflow particle mechanics model, Distributed and parallel algorithm
-
93浏览
-
0点赞
-
0收藏
-
1分享
-
25下载
-
0
-
引用