Clustering mixed data using neighbourhood rough sets Online publication date: Sat, 14-Dec-2019
by Sharmila Banu Kather; B.K. Tripathy
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 15, No. 1, 2020
Abstract: Data in varied nature and huge quantities are being generated every day. They range from tabulated, structured and semi-structured as well as numerical or categorical in terms of attributes. Data pre-processing presents data in a favourable format to apply analytics algorithm and derive knowledge therein. Data analytics has revolutionised millennial mankind unwinding the knowledge and patterns mined from data. Clustering is an unsupervised learning pattern which has popular algorithms based on distance, density, dimensions and other functions. These algorithms are operational on numerical attributes and special algorithms for data involving categorical features are also reported. In this paper we propose a straight forward way of clustering data involving both numerical and categorical features based on neighbourhood rough sets. It does not include calculation of any extra parameters like entropy, saliency, dependency or call for discretisation of data. Hence its complexity is lesser than algorithms proposed for categorical or mixed data and offers better efficiency.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook