Granular Mining and Big Data Analytics: Rough Models and Challenges

Article Type

Research Article

Publication Title

Proceedings of the National Academy of Sciences India Section A - Physical Sciences

Abstract

Data analytics in granular computing framework is considered for several mining applications, such as in video analysis, bioinformatics and online social networks which have all the characteristics of Big data. The role of granulation, lower approximation and r–f information measure is exhibited. While the lower approximation over a video sequence signifies the object model for unsupervised tracking, it characterizes the probability (relative frequency) of definite regions in ranking miRNAs for normal and cancer classification. For neural learning, the information on definite region is used as the initial knowledge for encoding while generating the networks through evolution. Granules considered are of different sizes and dimensions with fuzzy and crisp boundaries. The tracking method is effective in handling different ambiguous situations, e.g., overlapping objects, newly appeared object(s), multiple objects in different directions and speeds, in unsupervised mode. The ranking algorithm could find only 1% miRNAs to result in significantly higher F-score than the entire set. Fuzzy–rough communities detected over the granular model of social networks are suitable in dealing with overlapping virtual communities in Big data. The knowledge encoding based on fuzzy–rough set provides superior performance than that of rough set. Future directions of research and challenges including the significance of z-numbers in precisiation of granules are stated. The article includes some of the results published elsewhere.

First Page

193

Last Page

208

DOI

10.1007/s40010-018-0578-3

Publication Date

6-1-2020

Link to Full Text

Share

COinS