|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 5 van 6 gevonden artikelen
| Titel: |
Fast rule extraction with binary-coded relations |
| Auteur: |
Roman Pindur Robert Susmaga |
| Verschenen in: |
Intelligent data analysis |
| Paginering: | Jaargang 7 (2003) nr. 1 pagina's 27-42 |
| Jaar: |
2003-03-27 |
| Inhoud: |
The induction of rules is one of the key issues of the Rough Sets Theory (RST). Generally, this problem is equivalent to finding prime implicants of a Boolean function, which is an NP-hard combinatorial problem. In practice, the NP-hardness makes solving medium-sized and large real-life problems difficult. To counteract this we propose a new algorithm, in which representation of relations between objects are represented in the form of binary vectors. The relations considered are: indiscernibility and dominance. It is an important enhancement of the classic RST approach, in which only indiscernibility was taken into account. Evaluation of the proposed algorithm in experiments with numerous real-life data sets produced satisfactory results. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 5 van 6 gevonden artikelen
| << vorige | volgende >> |