A well-known drawback in the least squares support vector machine (LS-SVM) is that the sparseness is lost. In this study, an effective pruning algorithm is developed to deal with this problem. To avoid solving the pri...
详细信息
A well-known drawback in the least squares support vector machine (LS-SVM) is that the sparseness is lost. In this study, an effective pruning algorithm is developed to deal with this problem. To avoid solving the primal set of linear equations, the bottom to the top strategy is adopted in the proposed algorithm. During the training process of the algorithm, the chunking incremental and decremental learning procedures are used alternately. A small support vector set, which can cover most of the information in the training set, can be formed adaptively. Using the support vector set, one can construct the final classifier. In order to test the validation of the proposed algorithm, it has been applied to five benchmarking UCI datasets. In order to show the relationships among the chunking size, the number of support vector machine, the training time, and the testing accuracy, different chunking sizes are tested. The experimental results show that the proposed algorithm can adaptively obtain the sparse solutions without almost losing generalization performance when the chunking size is equal to 2, and also its training speed is much faster than that of the sequential minimal optimization (SMO) algorithm. The proposed algorithm can also be applied to the least squares support vector regression machine as well as LS-SVM classifier.
In this paper an intrusion detection method based on Dynamic Growing Neural Network (DGNN) for wireless networking is presented. DGNN is based on the Hebbian learning rule and adds new neurons under certain conditions...
详细信息
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with r...
详细信息
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with rigor advocates a DL method to map the specification of MAS into a DL TBox. Thus, we can use the existing DL reasoners and systems to verify and validate some system's properties.
Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection...
详细信息
ISBN:
(纸本)9781932415988
Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection of coordination mechanisms, new coordination models using swarm intelligence, new methods using varied techniques like case based reasoning, reinforcement learning, distributed logic programming, game theory, etc.. In this paper, we survey these achievement as a general study of coordination, including, the nature of coordination, coordination mechanisms, coordination approaches, relationship among coordination mechanisms and approaches, coordination methodologies, conversational aspects of coordination and software architectures. And along with this survey, we give our view of future research direction of coordination.
knowledge discovery in spatial databases represents a particular case of discovery, allowing the discovery of relationships that exist between spatial and non-spatial data. Spatial reasoning ought to play a very impor...
详细信息
In Containing Order Rough Set Methodology (CORS), ordered attribute 'criterion' is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significa...
详细信息
Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classificat...
详细信息
ISBN:
(纸本)9781932415988
Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classifications are based upon implementation details. However, interaction is the kernel aspect of coordination, and coordination is the outcome of interactions between agents, so here, we give another kind of taxonomy based on interaction types, which are coordination models based on direct interactions and indirect interactions. Using this taxonomy, all coordination models are classified into two classes with no intersection, in addition, coordination models with indirect interactions and emergent behaviors are the direction of future work.
Continuous queries are important in moving objects databases and spatio-temporal reasoning. The traditional synchronous updating algorithms of moving object pervasively focus on improving queries' execution effici...
详细信息
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user inter...
详细信息
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.
In this paper, we describe a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation problem. The who...
详细信息
暂无评论