Catálogo de publicaciones - libros
Finite-State Methods and Natural Language Processing: 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005. Revised Papers
James F. Peters ; Andrzej Skowron (eds.)
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Artificial Intelligence (incl. Robotics); Data Mining and Knowledge Discovery; Theory of Computation; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Database Management
Disponibilidad
Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
---|---|---|---|---|
No detectada | 2006 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-35467-3
ISBN electrónico
978-3-540-39382-5
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2006
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2006
Tabla de contenidos
doi: 10.1007/11847465_11
Multimodal Classification: Case Studies
Andrzej Skowron; Hui Wang; Arkadiusz Wojna; Jan Bazan
Data models that are induced in classifier construction often consist of multiple parts, each of which explains part of the data. Classification methods for such multi-part models are called multimodal classification methods. The model parts may overlap or have insufficient coverage. How to deal best with the problems of overlapping and insufficient coverage? In this paper we propose a hierarchical or layered approach to this problem. Rather than seeking a single model, we consider a series of models under gradually relaxing conditions, which form a hierarchical structure. To demonstrate the effectiveness of this approach we consider two classifiers that construct multi-part models – one based on the so-called lattice machine and the other one based on rough set rule induction, and we design hierarchical versions of the two classifiers. The two hierarchical classifiers are compared through experiments with their non-hierarchical counterparts, and also with a method that combines k-nearest neighbors classifier with rough set rule induction as a benchmark. The results of the experiments show that this hierarchical approach leads to improved multimodal classifiers.
- Regular Papers | Pp. 224-239
doi: 10.1007/11847465_12
Arrow Decision Logic for Relational Information Systems
Tuan-Fang Fan; Duen-Ren Liu; Gwo-Hshiung Tzeng
In this paper, we propose an arrow decision logic (ADL) for relational information systems (RIS). The logic combines the main features of decision logic (DL) and arrow logic (AL). DL represents and reasons about knowledge extracted from decision tables based on rough set theory, whereas AL is the basic modal logic of arrows. The semantic models of DL are functional information systems (FIS). ADL formulas, on the other hand, are interpreted in RIS. RIS , which not only specifies the properties of objects, but also the relationships between objects. We present a complete axiomatization of ADL and discuss its application to knowledge representation in multicriteria decision analysis.
- Regular Papers | Pp. 240-262
doi: 10.1007/11847465_13
On Generalized Rough Fuzzy Approximation Operators
Wei-Zhi Wu; Yee Leung; Wen-Xiu Zhang
This paper presents a general framework for the study of rough fuzzy sets in which fuzzy sets are approximated in a crisp approximation space. By the constructive approach, a pair of lower and upper generalized rough fuzzy approximation operators is first defined. The rough fuzzy approximation operators are represented by a class of generalized crisp approximation operators. Properties of rough fuzzy approximation operators are then discussed. The relationships between crisp relations and rough fuzzy approximation operators are further established. By the axiomatic approach, various classes of rough fuzzy approximation operators are characterized by different sets of axioms. The axiom sets of rough fuzzy approximation operators guarantee the existence of certain types of crisp relations producing the same operators. The relationship between a fuzzy topological space and rough fuzzy approximation operators is further established. The connections between rough fuzzy sets and Dempster-Shafer theory of evidence are also examined. Finally multi-step rough fuzzy approximations within the framework of neighborhood systems are analyzed.
- Regular Papers | Pp. 263-284
doi: 10.1007/11847465_14
Rough Set Approximations in Formal Concept Analysis
Yiyu Yao; Yaohua Chen
A basic notion shared by rough set analysis and formal concept analysis is the definability of a set of objects based on a set of properties. The two theories can be compared, combined and applied to each other based on definability. In this paper, the notion of rough set approximations is introduced into formal concept analysis. Rough set approximations are defined by using a system of definable sets. The similar idea can be used in formal concept analysis. The families of the sets of objects and the sets of properties established in formal concept analysis are viewed as two systems of definable sets. The approximation operators are then formulated with respect to the systems. Two types of approximation operators, with respect to lattice-theoretic and set-theoretic interpretations, are studied. The results provide a better understanding of data analysis using rough set analysis and formal concept analysis.
- Regular Papers | Pp. 285-305
doi: 10.1007/11847465_15
Motion-Information-Based Video Retrieval System Using Rough Pre-classification
Zhe Yuan; Yu Wu; Guoyin Wang; Jianbo Li
Motion information is the basic element for analyzing video. It represents the change of video on the time-axis and plays an important role in describing the video content. In this paper, a robust motion-based, video retrieval system is proposed. At first, shot boundary detection is achieved by analyzing luminance information, and motion information of video is abstracted and analyzed. Then rough set theory is introduced to classify the shots into two classes, global motions and local motions. Finally, shots of these two types are respectively retrieved according to the motion types of submitted shots. Experiments show that it’s effective to distinguish shots with global motions from those with local motions in various types of video, and in this situation motion-information-based video retrieval are more accurate.
- Regular Papers | Pp. 306-333
doi: 10.1007/11847465_16
Approximate Boolean Reasoning: Foundations and Applications in Data Mining
Hung Son Nguyen
Since its introduction by George Boole during the mid-1800s, Boolean algebra has become an important part of the of mathematics, science, engineering, and research in artificial intelligence, machine learning and data mining. The Boolean reasoning approach has manifestly become a powerful tool for designing effective and accurate solutions for many problems in decision-making and approximate reasoning optimization. In recent years, Boolean reasoning has become a recognized technique for developing many interesting concept approximation methods in rough set theory. The problem considered in this paper is the creation of a general framework for concept approximation. The need for such a general framework arises in machine learning and data mining. This paper presents a solution to this problem by introducing a general framework for concept approximation which combines rough set theory, Boolean reasoning methodology and data mining. This general framework for approximate reasoning is called (RSABR). The contribution of this paper is the presentation of the theoretical foundation of RSABR as well as its application in solving many data mining problems and knowledge discovery in databases (KDD) such as feature selection, feature extraction, data preprocessing, classification of decision rules and decision trees, association analysis.
- Dissertations and Monographs | Pp. 334-506