<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/13091" mdate="2009-07-29 00:00:00"> <author>Sunita Jahirabadkar and Parag Kulkarni</author> <title>ISC&amp;ndash;Intelligent Subspace Clustering, A Density Based Clustering Approach for High Dimensional Dataset</title> <pages>1682 - 1686</pages> <year>2009</year> <volume>3</volume> <number>7</number> <journal>International Journal of Computer and Information Engineering</journal> <ee>https://publications.waset.org/pdf/13091</ee> <url>https://publications.waset.org/vol/31</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>Many realworld data sets consist of a very high dimensional feature space. Most clustering techniques use the distance or similarity between objects as a measure to build clusters. But in high dimensional spaces, distances between points become relatively uniform. In such cases, density based approaches may give better results. Subspace Clustering algorithms automatically identify lower dimensional subspaces of the higher dimensional feature space in which clusters exist. In this paper, we propose a new clustering algorithm, ISC &amp;amp;ndash; Intelligent Subspace Clustering, which tries to overcome three major limitations of the existing stateofart techniques. ISC determines the input parameter such as &amp;amp;ndash; distance at various levels of Subspace Clustering which helps in finding meaningful clusters. The uniform parameters approach is not suitable for different kind of databases. ISC implements dynamic and adaptive determination of Meaningful clustering parameters based on hierarchical filtering approach. Third and most important feature of ISC is the ability of incremental learning and dynamic inclusion and exclusions of subspaces which lead to better cluster formation. </abstract> <index>Open Science Index 31, 2009</index> </article>