Javascript must be enabled to continue!
Extended Jaccard Indexive Buffalo Optimized Clustering on Geo-social Networks with Big Data
View through CrossRef
Clustering is a general task of data mining where partitioning a large dataset into dissimilar groups is done. The enormous growth of Geo-Social Networks (GeoSNs) includes users, who create millions of heterogeneous data with a variety of information. Analyzing such volume of data is a challenging task. The clustering of large volume of data is used to identify the frequently visited location information of the users in Geo-Social Networks. In order to improve the clustering of a large volume of data, a novel technique called Extended Jaccard Indexive Buffalo Optimized Data Clustering (EJIBODC) is introduced for grouping the data with high accuracy and less time consumption. The main aim of EJIBODC technique is to partition the big dataset into different groups. In this technique, many clusters with centroids are initialized to group the data. After that, Extended Jaccard Indexive Buffalo Optimization technique is applied to find the fittest cluster for grouping the data. The Extended Jaccard Index is applied in the Buffalo Optimization to measure the fitness between the data and the centroid. Based on the similarity value, using a gradient ascent function, the data finds the fittest cluster centroid for grouping. After that, the fitness value of cluster is updated and all the data gets grouped into a suitable cluster with high accuracy and minimum error rate. An experimental procedure is involved with big geo-social dataset and testing of different clustering algorithms. The series discussion is carried out on factors such as clustering accuracy, error rate, clustering time and space complexity with respect to a number of data. Experimental outcomes demonstrate that the proposed EJIBODC technique achieves improved performance in terms of higher clustering accuracy, less error rate, time consumption and space complexity when compared to previous related clustering techniques.
Title: Extended Jaccard Indexive Buffalo Optimized Clustering on Geo-social Networks with Big Data
Description:
Clustering is a general task of data mining where partitioning a large dataset into dissimilar groups is done.
The enormous growth of Geo-Social Networks (GeoSNs) includes users, who create millions of heterogeneous data with a variety of information.
Analyzing such volume of data is a challenging task.
The clustering of large volume of data is used to identify the frequently visited location information of the users in Geo-Social Networks.
In order to improve the clustering of a large volume of data, a novel technique called Extended Jaccard Indexive Buffalo Optimized Data Clustering (EJIBODC) is introduced for grouping the data with high accuracy and less time consumption.
The main aim of EJIBODC technique is to partition the big dataset into different groups.
In this technique, many clusters with centroids are initialized to group the data.
After that, Extended Jaccard Indexive Buffalo Optimization technique is applied to find the fittest cluster for grouping the data.
The Extended Jaccard Index is applied in the Buffalo Optimization to measure the fitness between the data and the centroid.
Based on the similarity value, using a gradient ascent function, the data finds the fittest cluster centroid for grouping.
After that, the fitness value of cluster is updated and all the data gets grouped into a suitable cluster with high accuracy and minimum error rate.
An experimental procedure is involved with big geo-social dataset and testing of different clustering algorithms.
The series discussion is carried out on factors such as clustering accuracy, error rate, clustering time and space complexity with respect to a number of data.
Experimental outcomes demonstrate that the proposed EJIBODC technique achieves improved performance in terms of higher clustering accuracy, less error rate, time consumption and space complexity when compared to previous related clustering techniques.
Related Results
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Multi-OMICS and Molecular Biology Perspective in Buffalo Genome
Multi-OMICS and Molecular Biology Perspective in Buffalo Genome
The bovine species buffalo was domesticated from its wild strain Bubalus arnee and is widely used livestock in southern Asia. There are two distinct types of Buffalo- the swamp buf...
Production of Wild Buffalo (Bubalus arnee) Embryos by Interspecies Somatic Cell Nuclear Transfer Using Domestic Buffalo (Bubalus bubalis) Oocytes
Production of Wild Buffalo (Bubalus arnee) Embryos by Interspecies Somatic Cell Nuclear Transfer Using Domestic Buffalo (Bubalus bubalis) Oocytes
ContentsThe objective of this study was to explore the possibility of producing wild buffalo embryos by interspecies somatic cell nuclear transfer (iSCNT) through handmade cloning ...
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
Clustering is the process of arranging comparable data elements into groups. One of the most frequent data mining analytical techniques is clustering analysis; the clustering algor...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the non‐linear manifold. Recently, linear discriminant analysis (LDA) based vario...
Bentuk Kepala Kerbau Sebagai Ide Dalam Penciptaan Kriya Seni Ukir Kayu
Bentuk Kepala Kerbau Sebagai Ide Dalam Penciptaan Kriya Seni Ukir Kayu
The creation of this final work aims to realize a rich inspired by the shape of the buffalo head which is made as a decorative lamp, and to make a work that characterizes minangkab...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
Geological and geomorphological objects of the Ukrainian Carpathians’ Beskid Mountains and their tourist attractiveness
Geological and geomorphological objects of the Ukrainian Carpathians’ Beskid Mountains and their tourist attractiveness
The article explores the geological and geomorphological objects of the Beskidy Ukrainian Carpathians for the further creation of geo-tourist routes. Geo-tourist areas combining se...

