TITLE

MULTI-DENSITY DBSCAN USING REPRESENTATIVES: MDBSCAN-UR

AUTHOR(S)
Ahmed, Rwand; El-Zaza, Eman; Ashour, Wesam
PUB. DATE
October 2011
SOURCE
Computing & Information Systems;Oct2011, Vol. 15 Issue 2, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
DBSCAN is one of the most popular algorithms for cluster analysis. It can discover clusters with arbitrary shape and separate noises. But this algorithm cannot choose its parameter according to distributing of dataset. It simply uses the global uses minimum number of points (MinPts) parameter, so that the clustering result of multi-density database is inaccurate. In addition, when it is used to cluster large databases, it will cost too much time. For these problems, we propose MDBSCAN-UR algorithm which is based on spatial index and grid technique witch make the clustering using representatives points that capture the shape and extent of the cell that they chosen in and that in order to enhance the time complexity. In this paper, we apply an unsupervised machine learning approach based on DBSCAN algorithm. We use local MinPts for every cell in the grid to overcome the problem of undetermined the clusters in multi-density data set with DBSCAN correctly, as we show that the experimental evaluation of our algorithm MDBSCAN-UR is effective and efficient.
ACCESSION #
67435666

 

Related Articles

  • Distributed Data Clustering Using Expectation Maximization Algorithm. Safarinejadian, B.; Menhaj, M. B.; Karrari, M. // Journal of Applied Sciences;2009, Vol. 9 Issue 5, p854 

    In this study, a distributed expectation maximization (DEM) algorithm is first introduced in a general form for estimating parameters of a finite mixture of components. This algorithm is used for density estimation and clustering of the data distributed over the nodes of a network. Then, a...

  • QUALITY EVALUATION OF CLUSTERING ALGORITHMS. Sambyalov, Z. G.; Bilgaeva, L. P. // Bulletin of the East Siberian State University of Technology / V;Nov/Dec2013, Vol. 45 Issue 6, p54 

    This article describes the most well-known and widely used clustering algorithms designed to handle numerical and categorical data. Algorithms were tested on artificial and real data. According to test results clustering quality assessment and scenario of clustering algorithms with a view of...

  • An effective web document clustering algorithm based on bisection and merge. Ingyu Lee; Byung-Won On // Artificial Intelligence Review;Jun2011, Vol. 36 Issue 1, p69 

    To cluster web documents, all of which have the same name entities, we attempted to use existing clustering algorithms such as K-means and spectral clustering. Unexpectedly, it turned out that these algorithms are not effective to cluster web documents. According to our intensive investigation,...

  • HYBRID ANT-BASED CLUSTERING ALGORITHM WITH CLUSTER ANALYSIS TECHNIQUES. Omar, Wafa'a; Badr, Amr; El-Fattah Hegazy, Abd // Journal of Computer Science;Jun2013, Vol. 9 Issue 6, p780 

    Cluster analysis is a data mining technology designed to derive a good understanding of data to solve clustering problems by extracting useful information from a large volume of mixed data elements. Recently, researchers have aimed to derive clustering algorithms from nature's swarm behaviors....

  • AVOIDING NOISE AND OUTLIERS IN K-MEANS. Jnena, Rami; Timraz, Mohammed; Ashour, Wesam // Computing & Information Systems;Oct2011, Vol. 15 Issue 2, p1 

    Applying k-means algorithm on the datasets that include large number of noise and outlier objects, gives unclear clusters results. In this paper we proposed a new technique for avoiding these noise and outliers by applying some preprocessing and post processing steps for the dataset that have to...

  • K-Means for Spherical Clusters with Large Variance in Sizes. Fahim, A. M.; Saake, G.; Salem, A. M.; Torkey, F. A.; Ramadan, M. A. // International Journal of Computer Science;2009, Vol. 4 Issue 3, p145 

    Data clustering is an important data exploration technique with many applications in data mining. The k-means algorithm is well known for its efficiency in clustering large data sets. However, this algorithm is suitable for spherical shaped clusters of similar sizes and densities. The quality of...

  • DERIVING CLUSTER KNOWLEDGE USING ROUGH SET THEORY. Upadhyaya, Shuchita; Arora, Alka; Jain, Rajni // Journal of Theoretical & Applied Information Technology;2008, Vol. 4 Issue 8, p688 

    Clustering algorithms gives general description of the clusters listing number of clusters and member entities in those clusters. It lacks in generating cluster description in the form of pattern. Deriving pattern from clusters along with grouping of data into clusters is important from data...

  • Avoiding Objects with few Neighbors in the K-Means Process and Adding ROCK Links to Its Distance. Alnabriss, Hadi A.; Ashour, Wesam // International Journal of Computer Applications;Aug2011, Vol. 28, p12 

    K-means is considered as one of the most common and powerful algorithms in data clustering, in this paper we're going to present new techniques to solve two problems in the K-means traditional clustering algorithm, the 1st problem is its sensitivity for outliers, in this part we are going to...

  • Semantic based Document Clustering: A Detailed Review. Shah, Neepa; Mahajan, Sunita // International Journal of Computer Applications;8/15/2012, Vol. 52, p42 

    Document clustering, one of the traditional data mining techniques, is an unsupervised learning paradigm where clustering methods try to identify inherent groupings of the text documents, so that a set of clusters is produced in which clusters exhibit high intra-cluster similarity and low...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics