Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: rough set

Sortuj według:

Ogranicz wyniki do:

Binary Relations-based Rough Sets – an Automated Approach

100%

Grabowski A.

Formalized Mathematics

2016

tom 24

nr 2

143-155

Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomplete or partially unknown information. In this article, which is essentially the continuation of [8], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library [11]). Here we drop the classical equivalence- and tolerance-based models of rough sets trying to formalize some parts of [18]. The main aim of this Mizar article is to provide a formal counterpart for the rest of the paper of William Zhu [18]. In order to do this, we recall also Theorem 3 from Y.Y. Yao’s paper [17]. The first part of our formalization (covering first seven pages) is contained in [8]. Now we start from page 5003, sec. 3.4. [18]. We formalized almost all numbered items (definitions, propositions, theorems, and corollaries), with the exception of Proposition 7, where we stated our theorem only in terms of singletons. We provided more thorough discussion of the property positive alliance and its connection with seriality and reflexivity (and also transitivity). Examples were not covered as a rule as we tried to construct a more general mechanism of finding appropriate models for approximation spaces in Mizar providing more automatization than it is now [10]. Of course, we can see some more general applications of some registrations of clusters, essentially not dealing with the notion of an approximation: the notions of an alliance binary relation were not defined in the Mizar Mathematical Library before, and we should think about other properties which are also absent but needed in the context of rough approximations [9], [5]. Via theory merging, using mechanisms described in [6] and [7], such elementary constructions can be extended to other frameworks.

ReSySTER: A hybrid recommender system for Scrum team roles based on fuzzy and rough sets

88%

Colomo-Palacios R., González-Carrasco I., López-Cuadrado J., García-Crespo Á.

International Journal of Applied Mathematics and Computer Science

2012

tom 22

nr 4

801-816

Agile development is a crucial issue within software engineering because one of the goals of any project leader is to increase the speed and flexibility in the development of new commercial products. In this sense, project managers must find the best resource configuration for each of the work packages necessary for the management of software development processes in order to keep the team motivated and committed to the project and to improve productivity and quality. This paper presents ReSySTER, a hybrid recommender system based on fuzzy logic, rough set theory and semantic technologies, aimed at helping project leaders to manage software development projects. The proposed system provides a powerful tool for project managers supporting the development process in Scrum environments and helping to form the most suitable team for different work packages. The system has been evaluated in a real scenario of development with the Scrum framework obtaining promising results.

Ograniczanie wyników

1 Formalized Mathematics

1 International Journal of Applied Mathematics and Computer Science

1 Colomo-Palacios R.

1 García-Crespo Á.

1 González-Carrasco I.

1 Grabowski A.

1 López-Cuadrado J.

1 2016

1 2012

Wyniki wyszukiwania

Binary Relations-based Rough Sets – an Automated Approach

ReSySTER: A hybrid recommender system for Scrum team roles based on fuzzy and rough sets