<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<article xlink="http://www.w3.org/1999/xlink" dtd-version="1.0" article-type="technology" lang="en"><front><journal-meta><journal-id journal-id-type="publisher">IJCRR</journal-id><journal-id journal-id-type="nlm-ta">I Journ Cur Res Re</journal-id><journal-title-group><journal-title>International Journal of Current Research and Review</journal-title><abbrev-journal-title abbrev-type="pubmed">I Journ Cur Res Re</abbrev-journal-title></journal-title-group><issn pub-type="ppub">2231-2196</issn><issn pub-type="opub">0975-5241</issn><publisher><publisher-name>Radiance Research Academy</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">2213</article-id><article-id pub-id-type="doi"/><article-id pub-id-type="doi-url"/><article-categories><subj-group subj-group-type="heading"><subject>Technology</subject></subj-group></article-categories><title-group><article-title>CLUSTERING OF DATA AFTER MINIMIZING DATA SIZE USING ROUGH SET THEORY&#13;
</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Das</surname><given-names>Sunanda</given-names></name></contrib><contrib contrib-type="author"><name><surname>Das</surname><given-names>Asit Kumar</given-names></name></contrib></contrib-group><volume>)</volume><issue/><fpage>9</fpage><lpage>15</lpage><permissions><copyright-statement>This article is copyright of Popeye Publishing, 2009</copyright-statement><copyright-year>2009</copyright-year><license license-type="open-access" href="http://creativecommons.org/licenses/by/4.0/"><license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution (CC BY 4.0) Licence. You may share and adapt the material, but must give appropriate credit to the source, provide a link to the licence, and indicate if changes were made.</license-p></license></permissions><abstract><p>Objective: Our approach is to reduce the large data size to a small data size which&#13;
represents same features of the total large data set, so that computational complexity&#13;
becomes shorter.&#13;
Method: In this paper we present a new approach to minimize the data size and then to&#13;
cluster that reduced data. The volume of data being generated nowadays to cluster is&#13;
increasingly large. How to extract useful information from such data collections is an&#13;
important issue. A promising technique is the Rough set theory, a new mathematical&#13;
approach to data analysis based on objects of interest into similarity classes which are&#13;
indiscernible with respect to some features.&#13;
Result and conclusion: This theory offers two fundamental concepts: reduct and core.&#13;
In this paper, some basic ideas of rough set theory are first presented. Some experiment&#13;
results are also given.&#13;
&#13;
&#13;
</p></abstract><kwd-group><kwd>Rough set theory</kwd><kwd> Data mining</kwd><kwd> correlation</kwd></kwd-group></article-meta></front></article>
