Sebastian Widz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sebastian Widz has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Dominik Ślęzak
3 shared publicationsKenneth Revett
University of Westminster
3 shared publicationsDominik ŚlȩzAk
University of Warsaw
2 shared publicationsSebastian Stawicki
2 shared publicationsAndrzej Janusz
1 shared publicationD. Slezak
Dept. of Robotics & Multi-Agent Syst., Polish-Japanese Inst. of Inf., Warsaw, Poland
1 shared publication
Latest Publications
- 1 May 2017
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 84, 75-109
Decision bireducts and decision reducts – a comparison
- 1 May 2017
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 84, 75-109
Decision bireducts and decision reducts – a comparison
- 2 October 2016
- Published by Polish Information Processing Society PTI
- Vol. 8, 165-174
Generalized Majority Decision Reducts
- 2 October 2016
- Published by Polish Information Processing Society PTI
- Vol. 8, 165-174
Generalized Majority Decision Reducts
- 1 January 2014
- Published by Springer Nature
- p. 99-110
Attribute Subset Quality Functions over a Universe of Weighted Objects
- 1 January 2014
- Published by Springer Nature
- p. 99-110
Attribute Subset Quality Functions over a Universe of Weighted Objects
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 47-52
Granular Attribute Selection: A Case Study of Rough Set Approach to MRI Segmentation
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 47-52
Granular Attribute Selection: A Case Study of Rough Set Approach to MRI Segmentation
- 1 January 2012
- Published by Springer Nature
- p. 95-112
Rough Set Based Decision Support—Models Easy to Interpret
- 1 January 2012
- Published by Springer Nature
- p. 95-112
Rough Set Based Decision Support—Models Easy to Interpret
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 81-88
Rough-Set-Inspired Feature Subset Selection, Classifier Construction, and Rule Aggregation
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 81-88
Rough-Set-Inspired Feature Subset Selection, Classifier Construction, and Rule Aggregation
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 437-442
Evolutionary inspired optimization of feature subset ensembles
We propose a framework for searching for the sets of feature subsets that can serve as the bases for learning local classifiers within a classifier ensemble. We follow the methodology based on evaluation of random feature permutations that produce locally optimal feature subsets. We investigate various heuristics for selection of feature subsets (permutations) into the ensembles, as well as for evaluation of those ensembles with respect to their predicted classification accuracy and their ability to clearly represent dependencies in data. The obtained framework is verified on four representative benchmark data sets. Further research directions are identified.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 437-442
Evolutionary inspired optimization of feature subset ensembles
We propose a framework for searching for the sets of feature subsets that can serve as the bases for learning local classifiers within a classifier ensemble. We follow the methodology based on evaluation of random feature permutations that produce locally optimal feature subsets. We investigate various heuristics for selection of feature subsets (permutations) into the ensembles, as well as for evaluation of those ensembles with respect to their predicted classification accuracy and their ability to clearly represent dependencies in data. The obtained framework is verified on four representative benchmark data sets. Further research directions are identified.
- 1 January 2010
- Published by Springer Nature
- p. 187-196
Is It Important Which Rough-Set-Based Classifier Extraction and Voting Criteria Are Applied Together?
- 1 January 2010
- Published by Springer Nature
- p. 187-196
Is It Important Which Rough-Set-Based Classifier Extraction and Voting Criteria Are Applied Together?
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 431-436
Approximation Degrees in Decision Reduct-Based MRI Segmentation
Segmentation of magnetic resonance images (MRI) is a process of assigning the tissue class labels to voxels. One of the main sources of segmentation error is the partial volume effect (PVE), which occurs most often with low resolution images. Indeed, for large voxels, the probability of a voxel containing multiple tissue classes increases. We have utilized a classification approach based on the attribute reduction, derived from the data mining paradigm of the theory of rough sets. An approximate reduct is an irreducible subset of features, which enables to classify decision concepts with a satisfactory degree of accuracy in the training data. The ensembles of the best found reducts trained for appropriate approximation degrees are applied to segmentation of previously unseen (parts of) images. One of the challenges is to adjust the approximation level during the training phase to obtain the best classification results for new cases. In this paper, it is proved experimentally that the choice of approximation level, consequently related to generality of classification rules induced by reducts, should correspond to expected quality of images. We show that when dealing with noisy images, or images with high PVE level, better results are obtained with higher degrees of approximation.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 431-436
Approximation Degrees in Decision Reduct-Based MRI Segmentation
Segmentation of magnetic resonance images (MRI) is a process of assigning the tissue class labels to voxels. One of the main sources of segmentation error is the partial volume effect (PVE), which occurs most often with low resolution images. Indeed, for large voxels, the probability of a voxel containing multiple tissue classes increases. We have utilized a classification approach based on the attribute reduction, derived from the data mining paradigm of the theory of rough sets. An approximate reduct is an irreducible subset of features, which enables to classify decision concepts with a satisfactory degree of accuracy in the training data. The ensembles of the best found reducts trained for appropriate approximation degrees are applied to segmentation of previously unseen (parts of) images. One of the challenges is to adjust the approximation level during the training phase to obtain the best classification results for new cases. In this paper, it is proved experimentally that the choice of approximation level, consequently related to generality of classification rules induced by reducts, should correspond to expected quality of images. We show that when dealing with noisy images, or images with high PVE level, better results are obtained with higher degrees of approximation.