Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Rough sets" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-10 z 68
Tytuł:
Relative Sets and Rough Sets
Autorzy:
Mousavi, A.
Jabedar-Maralani, P.
Powiązania:
https://bibliotekanauki.pl/articles/908368.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
teoria mnogości
analiza danych
przedstawienie wiedzy
rough sets
set theory
data analysis
multi-valued logic
interval sets
knowledge representation
Opis:
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable sets, an integrated approach to relative sets and rough sets is obtained. With this definition, we are able to define an approximation of a rough set in an approximation space, and so we can obtain sequential approximations of a set, which is a good model of communication among agents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 637-653
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rough sets based on Galois connections
Autorzy:
Madrid, Nicolás
Medina, Jesús
Ramírez-Poussa, Eloísa
Powiązania:
https://bibliotekanauki.pl/articles/330499.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rough sets
Galois connection
approximation operator
zbiór przybliżony
połączenie Galois
operator aproksymacji
Opis:
Rough set theory is an important tool to extract knowledge from relational databases. The original definitions of approximation operators are based on an indiscernibility relation, which is an equivalence one. Lately, different papers have motivated the possibility of considering arbitrary relations. Nevertheless, when those are taken into account, the original definitions given by Pawlak may lose fundamental properties. This paper proposes a possible solution to the arising problems by presenting an alternative definition of approximation operators based on the closure and interior operators obtained from an isotone Galois connection. We prove that the proposed definition satisfies interesting properties and that it also improves object classification tasks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 299-313
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Credibility Coefficients for Objects of Rough Sets
Autorzy:
Podraza, R.
Dominik, A.
Powiązania:
https://bibliotekanauki.pl/articles/92812.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
data reliability
credibility coefficient
information system
decision table
rough sets
artificial intelligence
Opis:
In this paper focus is set on data reliability. We propose a few methods, which calculate credibility coefficients for objects stored in decision tables. Credibility coefficient of object is a measure of its similarity with respect to the rest of the objects in the considered decision table. It can be very useful in detecting either corrupted data or abnormal and distinctive situations. It is assumed that the proper data appear in majority and can be separated from improper data by exploring mutual resemblance. The proposed methods take advantage of well known and widely used data mining technique - rough sets.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 93-104
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rough Sets Methods in Feature Reduction and Classification
Autorzy:
Świniarski, R. W.
Powiązania:
https://bibliotekanauki.pl/articles/908366.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rozpoznawanie obrazów
redukcja danych
rough sets
feature selection
classification
Opis:
The paper presents an application of rough sets and statistical methods to feature reduction and pattern recognition. The presented description of rough sets theory emphasizes the role of rough sets reducts in feature selection and data reduction in pattern recognition. The overview of methods of feature selection emphasizes feature selection criteria, including rough set-based methods. The paper also contains a description of the algorithm for feature selection and reduction based on the rough sets method proposed jointly with Principal Component Analysis. Finally, the paper presents numerical results of face recognition experiments using the learning vector quantization neural network, with feature selection based on the proposed principal components analysis and rough sets methods.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 565-582
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza koncepcji zbiorów przybliżonych
Analysis of rough sets concepts
Autorzy:
Charlak, M.
Jakubowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/395419.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
teoria zbiorów rozmytych
analiza koncepcji
rough sets
concepts analysis
Opis:
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 przynależności. Istnieją więc zagadnienia, które są możliwe do rozwiązanie z zastosowaniem zbiorów przybliżonych a nie znajdują rozwiązania w zbiorach rozmytych. Na podstawie analizy i interpretacji przykładów określone zostały przyczyny trudności z zastosowaniem teorii zbiorów przybliżonych.
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 problems which could be solved only in rough sets but not in fuzzy sets. Finally we describe the problem with application rough sets theory based on Z. Pawlak works.
Źródło:
Postępy Nauki i Techniki; 2010, 5; 45-54
2080-4075
Pojawia się w:
Postępy Nauki i Techniki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concept Approximations Based on Rough Sets and Similarity Measures
Autorzy:
Saquer, J.
Deogun, J. S.
Powiązania:
https://bibliotekanauki.pl/articles/908365.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
mierzenie podobieństwa
pojęcie aproksymacji
formal concept analysis
similarity measures
rough sets
concept approximation
Opis:
The formal concept analysis gives a mathematical definition of a formal concept. However, in many real-life applications, the problem under investigation cannot be described by formal concepts. Such concepts are called the non-definable concepts (Saquer and Deogun, 2000b). The process of finding formal concepts that best describe non-definable concepts is called the concept approximation. In this paper, we present two different approaches to the concept approximation. The first approach is based on rough set theory while the other is based on a similarity measure. We present algorithms for the two approaches.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 655-674
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Identifying status of an ICT system using rough sets
Autorzy:
Stawowy, M.
Powiązania:
https://bibliotekanauki.pl/articles/393307.pdf
Data publikacji:
2014
Wydawca:
Polskie Stowarzyszenie Telematyki Transportu
Tematy:
operation
identifying status
rough sets
information and communications
eksploatacja
identyfikacja statusu
zbiory przybliżone
informacja
komunikacja
Opis:
The article presents a method to identify operational state of an data communications (ICT) system. Supporting the management or operation of the simulation process. Method which was used is based on rough set theory.
Źródło:
Archives of Transport System Telematics; 2014, 7, 1; 50-53
1899-8208
Pojawia się w:
Archives of Transport System Telematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combining Rough Sets and Neural Network Approaches in Pattern Recognition
Autorzy:
Cyran, K.
Powiązania:
https://bibliotekanauki.pl/articles/92799.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
pattern recognition
neural networks
rough sets
hybrid methods
evolutionary optimization
holographic ring-wedge detector
Opis:
The paper focuses on problems which arise when two different types of AI methods are combined in one design. The first type is rule based, rough set methodology operating is highly discretized attribute space. The discretization is a consequence of the granular nature of knowledge representation in the theory of rough sets. The second type is neural network working in continuous space. Problems of combining these different types of knowledge processing are illustrated in a system used for recognition of diffraction patterns. The feature extraction is performed with the use of holographic ring wedge detector, generating the continuous feature space. No doubt, this is a feature space natural for application of the neural network. However, the criterion of optimization of the feature extractor uses rough set based knowledge representation. This latter, requires the discretization of conditional attributes generating the feature space. The novel enhanced method of optimization of holographic ring wedge detector is proposed, as a result of modification of indiscernibility relation in the theory of rough sets.
Źródło:
Studia Informatica : systems and information technology; 2005, 2(6); 7-20
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applications of rough sets in big data analysis: An overview
Autorzy:
Pięta, Piotr
Szmuc, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/2055175.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rough sets theory
big data analysis
deep learning
data mining
teoria zbiorów przybliżonych
duży zbiór danych
uczenie głębokie
eksploracja danych
Opis:
Big data, artificial intelligence and the Internet of things (IoT) are still very popular areas in current research and industrial applications. Processing massive amounts of data generated by the IoT and stored in distributed space is not a straightforward task and may cause many problems. During the last few decades, scientists have proposed many interesting approaches to extract information and discover knowledge from data collected in database systems or other sources. We observe a permanent development of machine learning algorithms that support each phase of the data mining process, ensuring achievement of better results than before. Rough set theory (RST) delivers a formal insight into information, knowledge, data reduction, uncertainty, and missing values. This formalism, formulated in the 1980s and developed by several researches, can serve as a theoretical basis and practical background for dealing with ambiguities, data reduction, building ontologies, etc. Moreover, as a mature theory, it has evolved into numerous extensions and has been transformed through various incarnations, which have enriched expressiveness and applicability of the related tools. The main aim of this article is to present an overview of selected applications of RST in big data analysis and processing. Thousands of publications on rough sets have been contributed; therefore, we focus on papers published in the last few years. The applications of RST are considered from two main perspectives: direct use of the RST concepts and tools, and jointly with other approaches, i.e., fuzzy sets, probabilistic concepts, and deep learning. The latter hybrid idea seems to be very promising for developing new methods and related tools as well as extensions of the application area.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 4; 659--683
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On connections between information systems, rough sets and algebraic logic
Autorzy:
Comer, Stephen
Powiązania:
https://bibliotekanauki.pl/articles/1361083.pdf
Data publikacji:
1993
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Opis:
In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and [10]) and algebras related to the study of algebraic logic - namely, cylindric algebras, relation algebras, and Stone algebras. The paper consists of three separate observations. The first deals with the family of approximation spaces induced by the indiscernability relation for different sets of attributes of an information system. In [3] the family of closure operators defining these approximation spaces is abstractly characterized as a certain type of Boolean algebra with operators. An alternate formulation in terms of a general class of diagonal-free cylindric algebras is given in 1.6. The second observation concerns the lattice theoretic approach to the study of rough sets suggested by Iwiński [6] and the result by J. Pomykała and J. A. Pomykała [11] that the collection of rough sets of an approximation space forms a Stone algebra. Namely, in 2.4 it is shown that every regular double Stone algebra is embeddable into the algebra of all rough subsets of an approximation space. Finally, a notion of rough relation algebra is formulated in Section 3 and a few connections with the study of ordinary relation algebras are established.
Źródło:
Banach Center Publications; 1993, 28, 1; 117-124
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-10 z 68

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies