The theory of granule computing based on the quotient space is one of the three main granule computing theories. The emphasis is on the structure of the quotient space theory in this paper. Comparing with Rough Set th...
详细信息
In this paper, we investigate one-class and clustering problems by using statistical learning theory. To establish a universal framework, a unsupervised learning problem with predefined threshold η is formally descri...
详细信息
In this paper, a new image classification method is developed. This approach applies graph decomposition and probabilistic neural networks (PNN) to the task of supervised image classification. We use relational graphs...
详细信息
In this paper, a new image classification method is developed. This approach applies graph decomposition and probabilistic neural networks (PNN) to the task of supervised image classification. We use relational graphs to represent image. These graphs are constructed from the feature points of images. Spectra of these graphs are obtained as feature vectors for classification. PNN is adopted to classify image according to the feature vectors. Experimental results show that this method can achieve best result of images classification.
In this paper, we propose a dimension reduction method of locality preserving projections based on QR-decomposition of training data matrix, namely LPP/QR. It is efficient and effective in under-sampled recognition of...
详细信息
In this paper, we propose a dimension reduction method of locality preserving projections based on QR-decomposition of training data matrix, namely LPP/QR. It is efficient and effective in under-sampled recognition of image and text data, especially when the number of dimension of data is greater than the number of training samples. Its theoretical foundation is presented. The equivalence between LPP/QR and generalized LPP is induced although LPP/QR is faster than generalized LPP. Several experiments are conducted on Yale face database. High recognition rates show that the algorithm performs better in under-sampled situations.
The theory of granule computing based on the quotient space is one of the three main granule computing theories. The emphasis is on the structure of the quotient space theory in this paper. Comparing with rough set th...
详细信息
The theory of granule computing based on the quotient space is one of the three main granule computing theories. The emphasis is on the structure of the quotient space theory in this paper. Comparing with rough set theory, the authors point out the importance of the structure in granule computing theory. A new method of constructing quotient space according to the structure is also presented in this paper. The differences between the quotient structure and structure-based method are proved. Finally, some examples show the rationality and feasibility of our methods.
A online infomax algorithm is proposed in this paper. The performances and properties of this online algorithm is investigated in detail. To the problem of the artifacts removal in real life EEG signal, both the onlin...
详细信息
The quotient space theory obtains a fusion model about semi-order structure under the condition of consistency information, harnessing topology relation among elements of the universe space and hierarchical structure....
详细信息
The quotient space theory obtains a fusion model about semi-order structure under the condition of consistency information, harnessing topology relation among elements of the universe space and hierarchical structure. It has great significance to forming a unified theory structure about information fusion technology. This paper gets a new semi-order structure fusion model under the condition of inconsistency information and proves incompleteness of its semi-order lattice . An example is presented in the paper at last as well as a new method is indicated for Bayesian network structure learning.
Quotient space theory of problem solving, a formal model of granular computing, is generalized in the sense that topological structure is replaced by Cech's closure space. Some basic issues of granular computing, ...
详细信息
Quotient space theory of problem solving, a formal model of granular computing, is generalized in the sense that topological structure is replaced by Cech's closure space. Some basic issues of granular computing, such as the representation of real world at different levels of granularity, property preserving and the construction of granular world, are discussed in detail. It turns out that most of conclusions of the classical quotient space theory keep being valid, so intension and applicable fields are enriched and enlarged respectively.
Inspired by the quotient space theory and fuzzy concept, it is pointed out that the foundation of success of FCS (fuzzy control system) does not refer to the value-getting of MFs (membership functions) and the success...
详细信息
Inspired by the quotient space theory and fuzzy concept, it is pointed out that the foundation of success of FCS (fuzzy control system) does not refer to the value-getting of MFs (membership functions) and the success can be achieved by obtaining the mutual relationships between elements, namely the relationships of their order. The hierarchical structure, which is made up of order relation, is the essential characteristic of fuzzy control. It's the necessary condition of the success of FCS. At the end of this paper, the logical control system based on order relation is given. Its controlling rules are more accustomed to the mental habits of the mankind and it may achieve the ideal performance of steady state. MATLAB's simulation demonstrates the above-mentioned conclusions.
Let G be a graph and f: G→ G be a continuous map with at least one periodic point. Using the quote space method, the paper addresses that f is an equicontinuous map if and only if one of the following End(G)+2k+1 con...
详细信息
Let G be a graph and f: G→ G be a continuous map with at least one periodic point. Using the quote space method, the paper addresses that f is an equicontinuous map if and only if one of the following End(G)+2k+1 conditions holds: 1) {f jm(End(G)+2k)!}∞j=1 is uniformly convergent, in which m=1,2,…, End(G)+2k; and 2) There is a positive integer n esuring that {f jn}∞j=1 is uniformly convergent.
暂无评论