Indrajit Ray

Prof. Indrajit Ray

Institute of Economics, Cardiff University, Cardiff, UK
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
29 March 2012 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
RDRinku Dewri
Rinku Dewri
IRIndrajit Ray
Indrajit Ray
NPNayot Poolsappasit
Nayot Poolsappasit
DWDarrell Whitley
Darrell Whitley

27 March 2015 in Software Quality Journal
Verified
Journal Article
Closed access
PDF file
AYAwad Younis
Awad Younis
YMYashwant K. Malaiya
Yashwant K. Malaiya
IRIndrajit Ray
Indrajit Ray

29 January 2008 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
IRIndrakshi Ray
Indrakshi Ray
IRIndrajit Ray
Indrajit Ray
Sudip ChakrabortySudip Chakraborty
Sudip Chakraborty

5 April 2015
Verified
Book Chapter
Closed access
PDF file
SWSachini Weerawardhana
Sachini Weerawardhana
SMSubhojeet Mukherjee
Subhojeet Mukherjee
IRIndrajit Ray
Indrajit Ray
AHAdele Howe
Adele Howe

1 April 2008
Verified
Conference Paper
Closed access
RDRinku Dewri
Rinku Dewri
IRIndrajit Ray
Indrajit Ray
IRIndrakshi Ray
Indrakshi Ray
DWDarrell Whitley
Darrell Whitley
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancing individual privacy is k-anonymity, where an individual data record is rendered similar to k - 1 other records in the data set by using generalization and/or suppression operations on the data attributes. The drawback of this model is that such transformations result in considerable loss of information that is proportional to the choice of k. Studies in this context have so far focused on minimizing the information loss for some given value of k. However, owing to the presence of outliers, a specified k value may or may not be obtainable. Further, an exhaustive analysis is required to determine a k value that fits the loss constraint specified by a data publisher. In this paper, we formulate a multi-objective optimization problem to illustrate that the decision on k can be much more informed than being a choice solely based on the privacy requirement. The optimization problem is intended to resolve the issue of data privacy when data suppression is not allowed in order to obtain a particular value of k. An evolutionary algorithm is employed here to provide this insight.

1 August 2013
Verified
Book Chapter
Closed access
PDF file
IRIndrajit Ray
Indrajit Ray
IRIndrakshi Ray
Indrakshi Ray