In real world problems, the collected data vary from time to time, and therefore, the approximations of a concept by a variable precision rough set model(VPRS) should be correspondingly updated. This paper focuses on ...
详细信息
In real world problems, the collected data vary from time to time, and therefore, the approximations of a concept by a variable precision rough set model(VPRS) should be correspondingly updated. This paper focuses on developing incremental method to update set approximations of VPRS based on dominance relations. Under dynamic environments where an object is inserted or deleted, we present the updating principles and then develop the incremental method for updating approximation sets. The related theoretical results are presented with proofs, and illustrative examples are also given to support the effectiveness of the proposed method.
Classification for large datasets is a classical problem in machinelearning. In this paper, we focus on effevtive classification algorithm for large datasets and imbalanced datasets. First, to deal with imbalanced da...
详细信息
Classification for large datasets is a classical problem in machinelearning. In this paper, we focus on effevtive classification algorithm for large datasets and imbalanced datasets. First, to deal with imbalanced dataset, we define the weight according to the size of positive and negative dataset. Then, a fast learning algorithm on large datasets called a core set weighted support vector machines(CSWSVM) is proposed. In the proposed approach, the corresponding core set(CS) can be solved by employing the core vector machine(CVM) or generalized CVM(GCVM), and then the weighted support vector machines(WSVM) can be used to implement classification for imbalanced datasets. Experimental results on UCI and USPS datasets demonstrate that the proposed method is effective.
Pathfinding is a typical task in many computer games, and its performance will affect the quality of game AI. In order to enhance the efficiency of multi-task pathfinding, case-based reasoning has been introduced in t...
详细信息
Pathfinding is a typical task in many computer games, and its performance will affect the quality of game AI. In order to enhance the efficiency of multi-task pathfinding, case-based reasoning has been introduced in traditional A* algorithm, called the CBMT method. The method needs to select representative paths which can cover the whole map to build a compact case base, which is difficult in large maps. Besides, repeatedly searching for similar cases for each pathfinding task would be a time consuming process. To address these problems, we provide a kd-tree case storage structure and case retrieval mechanical in the CBMT method. The pre-stored cases(previously found paths) are generated randomly and incrementally. The original flat storage structure of the cases is changed into the kd-tree structure. Since the searching space can be reduced by branch pruning in case retrieval, the pathfinding efficiency has been improved obviously, and the number of searched nodes is also reduced.
Dominance relation rough set approach(DRSA) is a useful mathematical tool to deal with preference-ordered data. The main idea is using dominance relations to replace equivalent relations in classical rough set theory....
详细信息
Dominance relation rough set approach(DRSA) is a useful mathematical tool to deal with preference-ordered data. The main idea is using dominance relations to replace equivalent relations in classical rough set theory. However, the definition of conventional dominance relation is very strict which may limit its application to information systems with relative large number of attributes. In this paper, we relax the conditions in the definition of dominance relation and introduce the concept of extended dominance relation. The proprieties of this new concept are also discussed and it is found that all the properties of classical dominance relation are still satisfied.
Pathfinding is an important task in computer games, where the algorithm efficiency is the key issue. In this paper, we introduce case-based reasoning method in the process of A* algorithm in multi-task pathfinding. Fi...
详细信息
This paper presents a PSO-based method for learning similarity measure of nominal features for case based reasoning classifiers (i.e. CBR classifiers). The symbolic features considered here takes completely unordered ...
详细信息
Chinese functional chunk describes the basic skeleton of the Chinese sentences. It is the important bridge for joining syntax and semantic description, and the Chinese functional chunk identification plays a key role ...
详细信息
By incorporating domination principle in inconsistent decision systems based on dominance relations, we define the concept of distribution function for a decision system to directly reflect the inconsistent degree of ...
详细信息
Ontology mapping has been widely used in ontology application, but the similarity calculation becomes a thorny issue in the process of ontology mapping. In this paper, the different elements of ontology are considered...
详细信息
The radial basis function network (RBFN) has been widely used in various fields such as function regression, pattern recognition, and error detection, etc. However, the structural parameters of RBFN including the numb...
详细信息
暂无评论