Mykola Pechenizkiy

Mykola Pechenizkiy

Auto-generated profile, based on publicly available information

Mykola Pechenizkiy

Eindhoven University of Technology, Eindhoven, Netherlands

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2014 in ACM Computing Surveys
Verified
Journal Article
Open access
João GamaJoão Gama
João Gama
IŽIndrė Žliobaitė
Indrė Žliobaitė
Albert BifetAlbert Bifet
Albert Bifet
MPMykola Pechenizkiy
Mykola Pechenizkiy
HBHamid Bouchachia
Hamid Bouchachia
Concept drift primarily refers to an online supervised learning scenario when the relation between the input data and the target variable changes over time. Assuming a general knowledge of supervised learning in this article, we characterize adaptive learning processes; categorize existing strategies for handling concept drift; overview the most representative, distinct, and popular techniques and algorithms; discuss evaluation methodology of adaptive algorithms; and present a set of illustrative applications. The survey covers the different facets of concept drift in an integrated way to reflect on the existing scattered state of the art. Thus, it aims at providing a comprehensive introduction to the concept drift adaptation for researchers, industry analysts, and practitioners.

1 December 2009
Verified
Conference Paper
Closed access
TCToon Calders
Toon Calders
FKFaisal Kamiran
Faisal Kamiran
MPMykola Pechenizkiy
Mykola Pechenizkiy
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise for example when the training data is collected from different sources with different labeling criteria or when the data is generated by a biased decision process. When a classifier is trained directly on such data, these undesirable dependencies will carry over to the classifier's predictions. In order to tackle this problem, we study the classification with independency constraints problem: find an accurate model for which the predictions are independent from a given binary attribute. We propose two solutions for this problem and present an empirical validation.

17 December 2015
Verified
Book Chapter
Closed access
PDF file
IŽIndrė Žliobaitė
Indrė Žliobaitė
MPMykola Pechenizkiy
Mykola Pechenizkiy
João GamaJoão Gama
João Gama

1 March 2005 in Information Fusion
Verified
Journal Article
Closed access
ATAlexey Tsymbal
Alexey Tsymbal
MPMykola Pechenizkiy
Mykola Pechenizkiy
PCPádraig Cunningham
Pádraig Cunningham

1 December 2010
Verified
Conference Paper
Closed access
FKFaisal Kamiran
Faisal Kamiran
TCToon Calders
Toon Calders
MPMykola Pechenizkiy
Mykola Pechenizkiy
Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute B, find a classifier with high predictive accuracy that at the same time does not discriminate on the basis of the given attribute B. This problem is motivated by the fact that often available historic data is biased due to discrimination, e.g., when B denotes ethnicity. Using the standard learners on this data may lead to wrongfully biased classifiers, even if the attribute B is removed from training data. Existing solutions for this problem consist in “cleaning away” the discrimination from the dataset before a classifier is learned. In this paper we study an alternative approach in which the non-discrimination constraint is pushed deeply into a decision tree learner by changing its splitting criterion and pruning strategy. Experimental evaluation shows that the proposed approach advances the state-of-the-art in the sense that the learned decision trees have a lower discrimination than models provided by previous methods, with little loss in accuracy.

1 December 2011
Verified
Conference Paper
Closed access
JBJorn Bakker
Jorn Bakker
MPMykola Pechenizkiy
Mykola Pechenizkiy
NSNatalia Sidorova
Natalia Sidorova
The problem of job stress is generally recognized as one of the major factors leading to a spectrum of health problems. People with certain professions, like intensive care specialists or call-center operators, and people in certain phases of their lives, like working parents with young children, are at increased risk of getting overstressed. Stress management should start far before the stress start causing illnesses. The current state of sensor technology allows to develop systems measuring physical symptoms reflecting the stress level. In this paper we (1) formulate the problem of stress identification and categorization from the sensor data stream mining perspective, (2) consider a reductionist approach for arousal identification as a drift detection task, (3) highlight the major problems of dealing with GSR data, collected from a watch-style stress measurement device in normal (i.e. in non-lab) settings, and propose simple approaches how to deal with them, and (4) discuss the lessons learnt from the conducted experimental study on real GSR data collected during the recent field study.