Savitha Sam Abraham
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Savitha Sam Abraham has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Deepak Padmanabhan
Queen’s University Belfast, Belfast, UK
2 shared publications - Sowmya S Sundaram
Queen's University Belfast UK
1 shared publication Sowmya S. Sundaram
Indian Institute of Technology Madras
1 shared publication- Sowmya S. Sundaram
Stanford Center for Biomedical Informatics Research, Stanford University , 3180 Porter Drive, California 94304
1 shared publication
Latest Publications
- Open Access
Fair Outlier Detection
An outlier detection method may be considered fair over specified sensitive attributes if the results of outlier detection are not skewed towards particular groups defined on such sensitive attributes. In this task, we consider, for the first time to our best knowledge, the task of fair outlier detection. In this work, we consider the task of fair outlier detection over multiple multi-valued sensitive attributes (e.g., gender, race, religion, nationality, marital status etc.). We propose a fair outlier detection method, FairLOF, that is inspired by the popular LOF formulation for neighborhood-based outlier detection. We outline ways in which unfairness could be induced within LOF and develop three heuristic principles to enhance fairness, which form the basis of the FairLOF method. Being a novel task, we develop an evaluation framework for fair outlier detection, and use that to benchmark FairLOF on quality and fairness of results. Through an extensive empirical evaluation over real-world datasets, we illustrate that FairLOF is able to achieve significant improvements in fairness at sometimes marginal degradations on result quality as measured against the fairness-agnostic LOF method.
Open AccessFair Outlier Detection
An outlier detection method may be considered fair over specified sensitive attributes if the results of outlier detection are not skewed towards particular groups defined on such sensitive attributes. In this task, we consider, for the first time to our best knowledge, the task of fair outlier detection. In this work, we consider the task of fair outlier detection over multiple multi-valued sensitive attributes (e.g., gender, race, religion, nationality, marital status etc.). We propose a fair outlier detection method, FairLOF, that is inspired by the popular LOF formulation for neighborhood-based outlier detection. We outline ways in which unfairness could be induced within LOF and develop three heuristic principles to enhance fairness, which form the basis of the FairLOF method. Being a novel task, we develop an evaluation framework for fair outlier detection, and use that to benchmark FairLOF on quality and fairness of results. Through an extensive empirical evaluation over real-world datasets, we illustrate that FairLOF is able to achieve significant improvements in fairness at sometimes marginal degradations on result quality as measured against the fairness-agnostic LOF method.
- Open Access
Fairness in Clustering with Multiple Sensitive Attributes
A clustering may be considered as fair on pre-specified sensitive attributes if the proportions of sensitive attribute groups in each cluster reflect that in the dataset. In this paper, we consider the task of fair clustering for scenarios involving multiple multi-valued or numeric sensitive attributes. We propose a fair clustering method, \textit{FairKM} (Fair K-Means), that is inspired by the popular K-Means clustering formulation. We outline a computational notion of fairness which is used along with a cluster coherence objective, to yield the FairKM clustering method. We empirically evaluate our approach, wherein we quantify both the quality and fairness of clusters, over real-world datasets. Our experimental evaluation illustrates that the clusters generated by FairKM fare significantly better on both clustering quality and fair representation of sensitive attribute groups compared to the clusters from a state-of-the-art baseline fair clustering method.
Open AccessFairness in Clustering with Multiple Sensitive Attributes
A clustering may be considered as fair on pre-specified sensitive attributes if the proportions of sensitive attribute groups in each cluster reflect that in the dataset. In this paper, we consider the task of fair clustering for scenarios involving multiple multi-valued or numeric sensitive attributes. We propose a fair clustering method, \textit{FairKM} (Fair K-Means), that is inspired by the popular K-Means clustering formulation. We outline a computational notion of fairness which is used along with a cluster coherence objective, to yield the FairKM clustering method. We empirically evaluate our approach, wherein we quantify both the quality and fairness of clusters, over real-world datasets. Our experimental evaluation illustrates that the clusters generated by FairKM fare significantly better on both clustering quality and fair representation of sensitive attribute groups compared to the clusters from a state-of-the-art baseline fair clustering method.
- 5 September 2019
- Published by Springer Nature in New Generation Computing
- Vol. 37 (4) , 429-452
Semantic Representation for Age Word Problems with Schemas
- 5 September 2019
- Published by Springer Nature in New Generation Computing
- Vol. 37 (4) , 429-452
Semantic Representation for Age Word Problems with Schemas
- 3 September 2019
- Published by Springer Nature in New Generation Computing
- Vol. 37 (4) , 551-584
An Ontology-Based Kinematics Problem Solver Using Qualitative and Quantitative Knowledge
- 3 September 2019
- Published by Springer Nature in New Generation Computing
- Vol. 37 (4) , 551-584
An Ontology-Based Kinematics Problem Solver Using Qualitative and Quantitative Knowledge