Ograniczanie wyników
Czasopisma help
Lata help
Autorzy help
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Znaleziono wyników: 202
first rewind previous Strona / 11 next fast forward last
Wyszukiwano:
w słowach kluczowych:  rough sets
help Sortuj według:

help Ogranicz wyniki do:
1
100%
Fundamenta Informaticae
EN The article analyses prevalent definitions of rough sets from the foundational and mathematical perspectives. In particular, the issue of language dependency in the definitions, and implications of the definitions on the issue of vagueness are discussed in detail.
2
100%
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
2002 Z.1 235-250
PL W pracy przedstawiono algorytm generowania reguł pierwszego rzędu, tzn. zależności, które w poprzedniku mają koniunkcję formuł atomowych bądź ich negacji a w następniku formułę atomową. Technikę zbiorów przybliżonych wykorzystano w procesie doboru literałów mogących wchodzić w skład przesłanki gener[...]
EN The aim of this paper is to introduce and investigate an algorithm for finding first order rules. Rough set theory is used in the process of selecting literals, which may be part of the rule. The criterion of selecting literals reads as follows: only those literals are selected, which adding to the [...]
3
100%
Fundamenta Informaticae
EN The paper aims to establish topological links between perception of objects (as it is defined in the framework of near sets) and classification of these objects (as it is defined in the framework of rough sets). In the near set approach, the discovery of near sets (i.e. sets containing objects with [...]
4
100%
Fundamenta Informaticae
EN We apply basic notions of the theory of rough sets, due to Pawlak], to explicate certain properties of unification-based learning algorithms for categorial grammars, introduced in and further developed in e.g]. The outcomes of these algorithms can be used to compute both the lower and the upper appr[...]
5
100%
Prace Instytutu Podstaw Informatyki Polskiej Akademii Nauk
1999 nr 887 3-136
PL Rozmair i licza dostępnych baz danych wzrasta bardzo szybko. W związku z tym istnieje duże zapotrzebowanie nie tylko na efektywne przechowywanie danych, ale również na automatyczne wydobywanie z danych istotnej, wcześniej nieznanej, a potencjalnie użytecznej wiedzy. Nagląca stała się potrzeba rozwoj[...]
EN The amount of electronic data avalaible is growing very fast and this explosive growth in databases has generated a need for new techniques and tools that can intelligently and automatically extract implicit, previously unknown, hidden and potentially useful information and knowledge from these data[...]
6
80%
Control and Cybernetics
EN This paper presents the merging of two sets of experiments in the continuing endeavor to mine epileptiform activity from Electroencephalograms (EEG). The goal is to develop robust classification rules for identifying epileptiform activity in the human brain. We present advancements using the author'[...]
7
80%
Postępy Nauki i Techniki
2010 nr 5 45-54
PL Artykuł zawiera analizę opisu podstaw matematycznych teorii zbiorów rozmytych opracowanych przez Z. Pawlaka. Praca zawiera znany w literaturze dowód Z. Pawlaka, stwierdzający, że idea zbiorów przybliżonych nie może być zredukowana do idei zbiorów rozmytych poprzez wprowadzenie przybliżonej funkcji p[...]
EN We describe our interpretation of rough sets mathematical foundations theory on basis Z. Pawlak works. We cite famous Z. Pawlak outcome, that the idea of rough set cannot be reduced to the idea of fuzzy set by introducing membership function expressing the grade of membership. There are some problem[...]
8
80%
Fundamenta Informaticae
EN Cluster analysis is a technique that divides a given data set into a set of clusters in such a way that two objects from the same cluster are as similar as possible and the objects from different clusters are as dissimilar as possible. In this background, different rough-fuzzy clustering algorithms [...]
9
80%
Fundamenta Informaticae
EN The concept of the complement of a covering is introduced, and then the extended space of a covering approximation space is induced based on it. Generally, the extended space of a covering approximation space generates a bigger covering lower approximation or smaller covering upper approximation tha[...]
10
80%
Fundamenta Informaticae
EN The computer certification of rough sets (the translation in a way understandable by machines) seems to be far beyond the test phase. To assure the feasibility of the approach, we try to encode selected problems within rough set theory and as the testbed of already developed foundations – and in the[...]
11
80%
Fundamenta Informaticae
EN An important step prior to constructing a classifier for a very large data set is feature selection. With many problems it is possible to find a subset of attributes that have the same discriminative power as the full data set. There are many feature selection methods but in none of them are Rough S[...]
12
80%
Journal of Telecommunications and Information Technology
2003 nr 3 98-101
EN This paper concerns some relationship between Bayes' theorem and rough sets. It is revealed that any decision algorithm satisfies Bayes' theorem, without referring to either prior or posterior probabilities inherently associated with classical Bayesian methodology. This leads to a new simple form of[...]
13
80%
Fundamenta Informaticae
EN Rough sets are often induced by descriptions of objects based on the precise observations of an insufficient number of attributes. In this paper, we study generalizations of rough sets to incomplete information systems, involving imprecise observations of attributes. The precise role of covering-bas[...]
14
80%
Fundamenta Informaticae
EN The aim of this paper is to give the basic view on computing consistent extensions and restrictions of information systems noting some order properties of information system families. Information systems are understood in the Pawlak’s sense as the systems of knowledge representation. The extension a[...]
15
80%
Fundamenta Informaticae
EN Partial association rules can be used for representation of knowledge, for inference in expert systems, for construction of classifiers, and for filling missing values of attributes. This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It [...]
16
80%
Fundamenta Informaticae
EN We present a language for defining paraconsistent rough sets and reasoning about them. Our framework relates and brings together two major fields: rough sets [23] and paraconsistent logic programming [9]. To model inconsistent and incomplete information we use a four-valued logic. The language discu[...]
17
80%
Fundamenta Informaticae
EN Since its foundation in the early 1980's, Formal Concept Analysis (FCA) has been used in many applications in data analysis, information retrieval, and knowledge discovery. In this paper, we suggest to exploit the framework of relational database model (RDM) and rough relational database model (RRDM[...]
18
80%
Fundamenta Informaticae
EN Rough relation algebras arise from Pawlak's information systems by considering as object ordered pairs on a fixed set X. Thus, the subsets to be approximated are binary relations over X, and hence, we have at our disposal not only the set theoretic operations, but also the relational operators ;, ˇ [...]
19
80%
Computer Methods in Materials Science
PL Koncepcja przybliżonego systemu informacyjnego została zastosowana do strukturalizacji wiedzy o wadach odlewów i ich przyczynach, którymi są najczęściej błędy lub niedokładności popełniane w trakcie procesu technologicznego. System załadowany jest informacjami pochodzącymi z polskich, francuskich i [...]
EN The rough information system is applied in order to structuralize knowledge about casting defects and their reasons, which follow faults or lacks of precision in the course of technological processes. The system is fed up with information extracting from Polish, French and Czech standards. The query[...]
20
80%
Fundamenta Informaticae
EN This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough set-based approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals and[...]
first rewind previous Strona / 11 next fast forward last