Patra Anupam Sourav

Work place: School of Computing Science and Engineering VIT University, Vellore-632014 Tamil Nadu, India



Research Interests: Computer systems and computational processes, Computational Learning Theory, Data Mining, Data Structures and Algorithms


Patra Anupam Sourav, is a student, School Of Computer Science and Engineering, VIT University, Vellore. He is a regular competitive programmer and has experience in algorithm design and solving complex problems. His areas of interest are data mining, machine learning and big data analytic.

Author Articles
MMeMeR: An Algorithm for Clustering Heterogeneous Data using Rough Set Theory

By B.K. Tripathy Akarsh Goyal Rahul Chowdhury Patra Anupam Sourav

DOI:, Pub. Date: 8 Aug. 2017

In recent times enumerable number of clustering algorithms have been developed whose main function is to make sets of objects having almost the same features. But due to the presence of categorical data values, these algorithms face a challenge in their implementation. Also some algorithms which are able to take care of categorical data are not able to process uncertainty in the values and so have stability issues. Thus handling categorical data along with uncertainty has been made necessary owing to such difficulties. So, in 2007 MMR algorithm was developed which was based on basic rough set theory. MMeR was proposed in 2009 which surpassed the results of MMR in taking care of categorical data and it could also handle heterogeneous values as well. SDR and SSDR were postulated in 2011 which were able to handle hybrid data. These two showed more accuracy when compared to MMR and MMeR. In this paper, we further make improvements and conceptualize an algorithm, which we call MMeMeR or Min-Mean-Mean-Roughness. It takes care of uncertainty and also handles heterogeneous data. Standard data sets have been used to gauge its effectiveness over the other methods.

[...] Read more.
Other Articles