Clustering algorithms help to understand the hidden information present in datasets. A dataset may contain intrinsic and nested clusters, the detection of which is of utmost importance. This paper presents a Distributed Grid-based Density Clustering algorithm capable of identifying arbitrary shaped embedded clusters as well as multi-density clusters over large spatial datasets. For handling mas...

Based on the observation that most of the orphan clusters are generated from boundary nodes, we propose a Boundary-First Cluster-Minimized (BFCM) clustering algorithm to minimize the number of generated orphan cluster by boundary node. The proposed algorithm is compared to the well known IDbased and Degree-based algorithms. The simulation results show that with the same message and time complex...

Clustering is the process of grouping similar data into clusters and dissimilar data into different clusters. Density-based clustering is a useful clustering approach such as DBSCAN and OPTICS. The increasing volume of data and varying size of data sets lead the clustering process challenging. So that we propose a parallel framework of clustering with advanced approach called MapReduce. We deve...

We previously showed that potential prenatal exposure to agricultural pesticides was associated with adverse neurodevelopmental outcomes in children, yet the effects of joint exposure to multiple pesticides is poorly understood. In this paper, we investigate associations between the joint distribution of agricultural use patterns of multiple pesticides (denoted as "pesticide profiles") applied ...

The weighted fuzzy c-mean clustering algorithm (WFCM) and weighted fuzzy c-mean-adaptive cluster number (WFCM-AC) are extension of traditional fuzzy c-mean algorithm to stream data clustering algorithm. Clusters in WFCM are generated by renewing the centers of weighted cluster by iteration. On the other hand, WFCM-AC generates clusters by applying WFCM on the data & selecting best K± initialize...

A new dynamic clustering approach (DCPSO), based on Particle Swarm Optimization, is proposed. This approach is applied to unsupervised image classification. The proposed approach automatically determines the "optimum" number of clusters and simultaneously clusters the data set with minimal user interference. The algorithm starts by partitioning the data set into a relatively large number of clu...

Cluster ensemble algorithms have been used in different field like data mining, bioinformatics and pattern recognition. Many of them use label correspondence as a step which can be performed with some accuracy if all the input partitions are generated with same k. Thus these algorithms produce good results if this k is close to the actual number of clusters in the dataset. This puts great restr...

Events and stories can be characterized by a set of descriptive, collocated keywords. Intuitively, documents describing the same event will contain similar sets of keywords, and the graph of keywords for a document collection will contain clusters individual events. In this paper we build a network of keywords based on their co-occurrence in documents. We propose and develop a new event detecti...

We examine the rhetorical strategy of architects in widely available architectural texts, to identify what words are available for use in the cultural register. Our results show that these cultural register texts use distinct but related rhetorics; vocabularies of competency that are revealed through clusters of keywords and which capture institutional logics of business, profession and state. ...