|
|
|
(18.222.117.247)
|
|
Users online: 7796
|
|
|
|
|
|
|
Ijournet
|
|
|
|
|
|
|
Scaling-up High Dimensional Data by Rough Boolean Reasoning Anitha K. Department of Mathematics, S. A. Engineering College, Chennai, TamilNadu, India Online published on 15 September, 2016. Abstract The amount of available electronic data is in exponential growth and it needs new technical tools that can be intelligently and automatically extract the implicit, hidden patterns and knowledge from the data. Scaling up high dimensional data without information loss is essentially needed in the current scenario. Soft computing techniques have developed many methods for handling high dimensional data. Out of these several methods the concepts of Rough sets have been analyzed in this paper since Rough set finds the pattern only hidden in the data and it does not require additional information. Rough set handles the data through equivalence and similarity relation. It identifies equivalence and similarity relation between the data. This paper exhibits the reduction of big data through Rough discernibility matrix and the results are examined for real data. Top Keywords Rough Approximations, Reduct, Discernibility Matrix. Top | |
|
|
|
|
║ Site map
║
Privacy Policy ║ Copyright ║ Terms & Conditions ║
|
|
|
749,863,813 visitor(s) since 30th May, 2005.
|
|
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
|
|
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.
|