IDEAS home Printed from https://ideas.repec.org/a/igg/jfsa00/v8y2019i4p84-100.html
   My bibliography  Save this article

Clustering Hybrid Data Using a Neighborhood Rough Set Based Algorithm and Expounding its Application

Author

Listed:
  • Akarsh Goyal

    (Department of Computer Science, Viterbi School of Engineering, University of Southern California, Los Angeles, USA)

  • Rahul Chowdhury

    (VIT University, Vellore, India)

Abstract

In recent times, an enumerable number of clustering algorithms have been developed whose main function is to make sets of objects have 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 therefore have stability issues. Thus, handling categorical data along with uncertainty has been made necessary owing to such difficulties. So, in 2007 an 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 but cannot be used robustly for hybrid data. In this article, the authors generalize the MMeR algorithm with neighborhood relations and make it a neighborhood rough set model which this article calls MMeNR (Min Mean Neighborhood Roughness). It takes care of the heterogeneous data. Also, the authors have extended the MMeNR method to make it suitable for various applications like geospatial data analysis and epidemiology.

Suggested Citation

  • Akarsh Goyal & Rahul Chowdhury, 2019. "Clustering Hybrid Data Using a Neighborhood Rough Set Based Algorithm and Expounding its Application," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 8(4), pages 84-100, October.
    • Handle: RePEc:igg:jfsa00:v:8:y:2019:i:4:p:84-100
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJFSA.2019100105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jfsa00:v:8:y:2019:i:4:p:84-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.