- 博客(12)
- 收藏
- 关注
原创 Multi-label learning for BP
# -*- coding: utf-8 -*-"""Created on 2017/4/5 9:52 2017@author: Randolph.Lee"""from __future__ import divisionfrom pybrain.structure import *from Evaluation_metrics import *from Threshold_fun
2017-04-06 10:06:11 521 2
原创 Threshold function with BP neural network
Threshold function is a common practice in multi-label learning to return as the learned model. In this case, in order to decide the proper label set for unseen instance, the real-valued ouput f(x, y)
2017-04-06 10:02:54 504
原创 KNN for Multi-label learning
ML-kNN is adjusted for the multi-label learning tasks by introducing the maximum post probability to the prediction of unseen instances' labels. It is a lazy learning algorithm, and belong to the algo
2017-04-05 09:40:36 673
原创 Basic Introduction of Multi-label Learning
Traditional supervised learning is one of the mostly-studied machine learning paradigms, where each object is represented by a single feature vector and associated with a single label. The fundamental
2017-04-05 09:31:42 482
原创 Ant Colony Optimization
ACO algorithm is originally inspired by social behavior of ant colonies, which is a branch of newly developed form of artificial intelligence called Swarm Intelligence (SI). Although ants have no si
2017-03-20 18:42:31 690
原创 Particle Swarm Optimization
Particle swarm optimization (PSO) (Kennedy & Eberhart, 1995) is an emerging population-based meta-heuristic that simulates social behavior such as birds flocking to a promising position to achieve pre
2017-03-20 18:40:13 817 1
原创 The Advance Crossover in Genetic Algorithm
Three different crossover for the sequence encoding
2017-03-20 18:29:53 388
原创 Simulated Annealing Optimization
Simulated Annealing is an optimization algorithm that simulates the annealing process in the thermodynamics energetics. The basic ideas is that any object will go through the state transition from the high temperature to the low one. And accordingly the in
2017-03-16 22:00:31 457
原创 Pruffer
Pruffer encoding scheme is a wonderful technique for solving the minimum spanning tree through the genetic algorithm. It can avoid the complex representation of tree in the algorithm. In general, for a m-node tree, just m-2 bits is required in the chromoso
2017-03-16 08:19:48 433
原创 Binary Ant Colony Optimization
Binary ACO is a modification of TACO. It is a good and efficient approach for feature selection because of simple search rules.
2017-03-15 21:20:44 495
原创 Group genetic algorithm
Group genetic algorithm was proposed based on the weaknesses of GA applied to the grouping problems. The crossover operation is the biggest difference. Here I give the basic example and the corresponding codes.
2017-03-15 10:10:04 589
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人