At present, qualitative spatial reasoning has become the hot issues in many research fields. The most popular models of spatial topological relations are Region Connection Calculus (RCC) and 9-intersection model. Howe...
详细信息
According to the complex control process of grinding, an expert system for grinding control based on fuzzy control and artificial neural network process was designed. The system integrates compute intelligence, expert...
详细信息
According to the complex control process of grinding, an expert system for grinding control based on fuzzy control and artificial neural network process was designed. The system integrates compute intelligence, expert system and automatic control technology, relying on powerful development environment. NET, using the advanced object-oriented language C++ and expert system tool CLIPS to develop the system. Under the guidance of expert experience and knowledge, the system has high accuracy control and run flexible stability. In the mean time it has strong adaptability and self-learning capability.
We augment Naive Bayes models by using divide and conquer strategy to address shortcomings of the standard Naive Bayes text classifier. The result is a generalized Bayes classifier which allows for local dependence am...
详细信息
We augment Naive Bayes models by using divide and conquer strategy to address shortcomings of the standard Naive Bayes text classifier. The result is a generalized Bayes classifier which allows for local dependence among feature subset;a model we refer to as the Augmented Naive Bayes (ANB) classifier. ANB relaxes the independence assumptions of Naive Bayes while still permitting efficient inference and learning. Experimental studies on a set of natural domains show that ANB has clear advantages with respect to the generalization ability.
Ontologies are widely used for capturing and organizing knowledge of a particular domain of interest, and they play a key role in the Semantic Web version, which adds a machine tractable, repurposeable layer to comple...
详细信息
Fuzzy neural network combines the learning capacity of artificial neural networks with the interpretability of the fuzzy systems. A novel structure learning algorithm for fuzzy neural networks (SLNN) is presented in t...
详细信息
Fuzzy neural network combines the learning capacity of artificial neural networks with the interpretability of the fuzzy systems. A novel structure learning algorithm for fuzzy neural networks (SLNN) is presented in this paper. The neurons of SLNN are created and adapted as online learning proceeds. The learning rule of SLNN is based on Hebb as well as soft competitive learning. The soft competitive learning cannot only let SLNN be able to learn from new data but also prevent it from losing the knowledge that has been learned earlier. To obtain a concise fuzzy rule, a pruning algorithm is adopted in SLNN, which does not disobey the basic design philosophy of fuzzy system. Simulations are performed on the primary benchmarks: circle-in-the-square, two spirals apart, UCI machine learning archive's synthetic control chart time series, and KDDCUP'99 data set. Compared with fuzzy ARTMAP, BP and hierarchical neuro-fuzzy quadtree (HNFQ), the fuzzy neural network achieves higher performance.
Most of real-life scheduling problems are semi online. Recently, how to solve such dynamic problems is a hot topic in the research of artificial intelligence. The semi on-line scheduling is introduced and the constrai...
详细信息
Most of real-life scheduling problems are semi online. Recently, how to solve such dynamic problems is a hot topic in the research of artificial intelligence. The semi on-line scheduling is introduced and the constraint models are analyzed and categorized. By defining the relevant concept of monotony about constraints that appear in general dynamic constraint models, a kind of constraint extending is formalized. Based on this dynamic constraint modeling, a sound dynamic constraint solving algorithm is designed to deal with the scheduling problems. Finally, an application example of semi on-line discrete resource scheduling problems is given. Experiments show that the algorithm is valid.
Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical c...
详细信息
Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical cubes according to a predefined threshold value, the tangent planes and normal vectors at each voxel are calculated and the normal vectors are orientated to the outside of surface based on wide first searching (WFS), and the 3D surface model is then obtained using marching cubes. Transfer function is used to specify the optical properties for volume rendering technology. We employ a 2D function. The end-user interacts with a set of direct manipulation widgets (triangles and rectangles). Each widget precisely corresponds to a different material and widgets are blended automatically to compute an overall transfer function. Compared to traditional techniques, the overall specification process takes a fraction of the time.
In an open multi-agent of dynamic network environment, different mobile agents hope to carry on the communication for the problem of a certain domain. There is a need to avoid appearance of logical exception phenomeno...
详细信息
In an open multi-agent of dynamic network environment, different mobile agents hope to carry on the communication for the problem of a certain domain. There is a need to avoid appearance of logical exception phenomenon, and the term in this domain must be made to obtain consistency. A layer ontology services communication model named LOSCM is proposed in this paper. LOSCM has two primary advantages. First, it fully takes into account the factors that affect the communication, and using ontology can be represented in agent's knowledge base. Second, provided ontology does not belong to the public data source or have public ontologies, according to the concept loss degree and the concept related degree, LOSCM establishes a layering algorithm, which is able to avoid logical exception handling policies, ensure the right understanding of communication entity concept, and resolve the consistency problem of concept translation. It is shown by experiments that LOSCM is superior to other methods, and can effectively improve the communication consistency of a mobile agent system under certain conditions.
For the larger search space when learning clause in Inductive Logic Programming, we defined the clause template. Firstly, we learn the clause templates by Genetic Algorithm, and then convert it to the requisite clause...
详细信息
For the larger search space when learning clause in Inductive Logic Programming, we defined the clause template. Firstly, we learn the clause templates by Genetic Algorithm, and then convert it to the requisite clauses by combining tag matrix and information gain sampling. We designed the corresponding fitness function and genetic operators. Theoretical analysis and experiment comparison show that this algorithm can reduce the search space, improve the search efficiency and can learn recursion clause. It is an effective clause learning algorithm.
Constraint satisfaction problems (CSPs) is an important research branch in artificial intelligence. Recently, dynamic CSP is proposed as a powerful tool for solving many real-world problems on dynamic environments. As...
详细信息
Constraint satisfaction problems (CSPs) is an important research branch in artificial intelligence. Recently, dynamic CSP is proposed as a powerful tool for solving many real-world problems on dynamic environments. As a result, several algorithms to solve dynamic CSPs are presented. Among those algorithms, local change (LC) algorithm based on solution reuse strategy is a method for solving many kinds of dynamic CSPs and efficient for flexible planning. On the basis of LC algorithm which is widely used, the tabu search strategy is integrated and a mini-conflict repair based algorithm is proposed, which is called Tabu_LC. The improved algorithm considers all the conflict variables as a whole, and then solves the sub-problems with branch and bound algorithm to find the best neighbor assignment, which improves the efficiency markedly. Furthermore, the Tabu_LC algorithm is implemented in the framework of constraint solving system Ming-yue 1.0, and compared with the LC algorithm using large amount of random CSPs. The experiment indicates that the improved algorithm has overwhelmed the LC algorithm on both the efficiency and quality of solutions.
暂无评论