Based on fuzzy association degree, a new pattern recognition algorithm is set up. First, some new concepts of fuzzy association coefficient (FAC), fuzzy association degree (FAD) and fuzzy relative weight (FRW) have be...
详细信息
Based on fuzzy association degree, a new pattern recognition algorithm is set up. First, some new concepts of fuzzy association coefficient (FAC), fuzzy association degree (FAD) and fuzzy relative weight (FRW) have been proposed for surveying data information. Second, on the basis of the concepts proposed here, a new pattern recognition algorithm has been set up. At last, the algorithm set up here is applied to surveying data. The results of simulation application show that the recognition algorithm presented here is feasible and effective
WWW is a repository of information mainly oriented to human consumption. The lack of explicit and formal expression of data semantics makes the Web increasingly difficult to use and exploit. To remedy it, knowledge ma...
详细信息
WWW is a repository of information mainly oriented to human consumption. The lack of explicit and formal expression of data semantics makes the Web increasingly difficult to use and exploit. To remedy it, knowledge management sphere (KMSphere), taking advantages of semantic Web, Web services and virtual organizations, is proposed to explore important aspects of service-oriented and ontology-driven knowledge management on the grid. By building two kinds of mappings, ontologies construct a knowledge space on top of data repositories. KMSphere, based on OGSA, emphasizes how to organize, discover, utilize, and manage the knowledge resources in that space. This paper describes in detail the architecture of KMSphere.
The positive region in rough set framework and Shannon conditional entropy are two traditional uncertainty measurements, used usually as heuristic metrics in attribute reduction. In this paper first a new information ...
详细信息
The positive region in rough set framework and Shannon conditional entropy are two traditional uncertainty measurements, used usually as heuristic metrics in attribute reduction. In this paper first a new information entropy is systematically compared with Shannon entropy, which shows its competence of another new uncertainty measurement. Then given a decision system we theoretically analyze the variance of these three metrics under two reverse circumstances, Those are when condition (decision) granularities merge while decision (condition) granularities remain unchanged. The conditions that keep these measurements unchanged in the above different situations are also figured out. These results help us to give a new information view of attribute reduction and propose more clear understanding of the quantitative relations between these different views, defined by the above three uncertainty measurements. It shows that the requirement of reducing a condition attribute in new information view is more rigorous than the ones in the latter two views and these three views are equivalent in a consistent decision system.
Plenty of structured data existing on the grid need to be managed by databases, but there is little work available on grid-enabled databases. Two problems lie in current research: the first is the deficiency of a unif...
详细信息
ISBN:
(纸本)184000025
Plenty of structured data existing on the grid need to be managed by databases, but there is little work available on grid-enabled databases. Two problems lie in current research: the first is the deficiency of a uniform management and access method to various kinds of databases; the second is that query efficiency decreases rapidly with the increase of the amount of data records. Metadata plays a critical role in grid databases integration, so a layered metadata model is put forward which comprises information of data storage, data properties and relations between data objects. Through the metadata model, the distributed, heterogeneous data resources can be accessed uniformly and efficiently. At last an example of hospital information database system proves the validity and feasibility of our model.
Feature extraction or selection is one of the most important steps in pattern recognition or pattern classification, data mining, machine learning and so on. In this paper, we introduce the information theory, propose...
详细信息
Feature extraction or selection is one of the most important steps in pattern recognition or pattern classification, data mining, machine learning and so on. In this paper, we introduce the information theory, propose a new concept of probability information distance (PID) and prove that the PID satisfies four requests of axiomatization of the distance. So the PID is a kind of distance measure, which can be used to measure the degree of variation between two random variables. We make the PID be separability criterion of the classes for information feature extraction, and call it PID criterion (PIDC). Based on PIDC, we design a novel algorithm for information feature extraction. Compared with principal components analysis (PCA), correlation analysis etc., the algorithm put forward in this paper had regarded for the class information, and so it is a kind of supervised algorithm of feature extraction. The experimental results demonstrate that the algorithm is valid and reliable, and it provides a new research approach for feature extraction, data mining and pattern recognition.
Principal component analysis (PCA) is an important method in multivariate statistical analysis, and its main idea is compression of dimensionality including variables and samples. In this paper, based on the ideas con...
详细信息
Principal component analysis (PCA) is an important method in multivariate statistical analysis, and its main idea is compression of dimensionality including variables and samples. In this paper, based on the ideas concerned with information function and information entropy of Shannon information theory, consider the inherent characteristic of eigenvalues of matrix, two new concepts of possibility information function (PIF) and possibility information entropy (PIE) are proposed firstly. On the basis of these, the formulae of information rate (IR) and accumulated information rate (AIR) are set up, by which the degree of information compression is measured. In the end, we improve the PCA algorithm called improved principal component analysis (PCA). Through simulated application in practice, the results show that the IPCA proposed here is efficient and satisfactory. It provides a new research approach of information feature compression for pattern recognition.
A formal representation of ontologies is proposed, based on F-logic and O-logic; and the works in the building of ontologies in NKI. An ontology includes class frames, slot frames, class-slot frames, object frames and...
详细信息
A formal representation of ontologies is proposed, based on F-logic and O-logic; and the works in the building of ontologies in NKI. An ontology includes class frames, slot frames, class-slot frames, object frames and axioms. The value restrictions of slots are defined in slot frames. For each slot and each class, there is a class-slot frame representing the specific value restrictions of the slot when defining the class; and the relations between class-slot frames and slot frames are discussed. For a slot in a class frame, its values are inherited to its subclasses without blocking; and its default values are inherited to its subclasses taking overriding, revising and conflict resolution into account. After giving the formal representation of ontologies, the semantics of ontologies are discussed, and main results are presented.
The key issue of peer data management systems (PDMSs) is how to efficiently organize and manage distributed resources in P2P networks to accurately route queries from the peer initiating the query to appropriate peers...
详细信息
The key issue of peer data management systems (PDMSs) is how to efficiently organize and manage distributed resources in P2P networks to accurately route queries from the peer initiating the query to appropriate peers to avoid network flooding. This paper proposes a semantic-based PDMS model, called R-Chord, by deploying the resource space model above the Chord overlay for uniformly, normally and effectively organizing and managing resources distributed in P2P networks. Experiments show that, compared to the Chord model, the R-Chord model is more flexible to support semantic-based queries and can significantly decrease the average visiting number of and visiting times on peers for answering queries.
Gait is an identifying biometric feature. In recent years, Video-based gait recognition is becoming a new challenging problem in the field of computer vision. In this paper, wavelet reflective symmetry moments (WRSMs)...
详细信息
Gait is an identifying biometric feature. In recent years, Video-based gait recognition is becoming a new challenging problem in the field of computer vision. In this paper, wavelet reflective symmetry moments (WRSMs) have been proposed to describe and recognize gait automatically. WRSMs represent the appearance of people with merits of moments and wavelet analysis and reflect people's symmetrical walking habit. Moments have translation, scale and rotation invariant characteristics;while wavelet analysis is able to extract the multi-resolution features subtly and deal with noise. So combination of wavelet moments and reflective symmetry not only has characteristics of moments and wavelet analysis, but also is in accordance with one of the relative results in psychological researches which state that gait is a type of symmetrical model. Experiments based on USF's database have shown that the application of wavelet reflective symmetry moments in gait recognition leads to relatively high distinguishability of gait with effective noise handling.
暂无评论