We have studied the AC-4 algorithm and then present ordering heuristic forming the new solving algorithm based on the data structure used in the AC-4 algorithm. These algorithms take full advantage of the state inform...
详细信息
Escape time algorithm is a universal algorithm when to create fractal image. A class of algorithms based on escape time algorithm is wasting-calculation. In this essay, when combined with the feature of eventually per...
详细信息
The loss assessment is an important operation of claim process in insurance industry. On the growing tide of making the insurance information system the in-depth support to optimizing operation and serving insurant, a...
详细信息
Visual voice lip-reading, so the computer can understand what the speakers want to express direction by looking at their lips. Lip reading is the easiest way to compare the early characters and templates from the froz...
详细信息
Collective classification in networked data has become an important and active research topic, it has a wide variety of real world applications, such as hyperlinked document classification, protein interaction and gen...
详细信息
This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process ...
详细信息
Particle Swarm Optimization （PSO） is a popular and bionic algorithm based on the social behavior associated with bird flocking for optimization problems. To maintain the diversity of swarms, a few studies of multi-s...
详细信息
Particle Swarm Optimization （PSO） is a popular and bionic algorithm based on the social behavior associated with bird flocking for optimization problems. To maintain the diversity of swarms, a few studies of multi-swarm strategy have been reported. However, the competition among swarms, reservation or destruction of a swarm, has not been considered further. In this paper, we formulate four rules by introducing the mechanism for survival of the fittest, which simulates the competition among the swarms. Based on the mechanism, we design a modified Multi-Swarm PSO （MSPSO） to solve discrete problems, which consists of a number of sub-swarms and a multi-swarm scheduler that can monitor and control each sub-swarm using the rules. To further settle the feature selection problems, we propose an Improved Feature Selection （1FS） method by integrating MSPSO, Support Vector Machines （SVM） with F-score method. The IFS method aims to achieve higher generalization capa- bility through performing kernel parameter optimization and feature selection simultaneously. The performance of the proposed method is compared with that of the standard PSO based, Genetic Algorithm （GA） based and the grid search based mcthods on 10 benchmark datasets, taken from UCI machine learning and StatLog databases. The numerical results and statistical analysis show that the proposed IFS method performs significantly better than the other three methods in terms of prediction accuracy with smaller subset of features.
A novel self-adaptive differential evolution (SADE) algorithm is proposed in this paper. SADE adjusts the mutation rate F and the crossover rate CR adaptively, taking account of the different distribution of populatio...
详细信息
In this paper, we introduce a new tractable subclass of cardinal direction relations we called strong saturated-convex rectangle cardinal direction relations. We prove that reasoning in this subclass is a polynomial t...
详细信息
In this paper, we introduce a new tractable subclass of cardinal direction relations we called strong saturated-convex rectangle cardinal direction relations. We prove that reasoning in this subclass is a polynomial time problem and show that the path-consistency method is sufficient for deciding consistency.
Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions ...
详细信息
暂无评论