New Trends in Massive Data Clustering

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information Processes".

Deadline for manuscript submissions: closed (31 January 2021) | Viewed by 7032

Special Issue Editor


E-Mail Website
Guest Editor
Department of Architecture, University of Naples Federico II | UNINA, Napoli, Italy
Interests: fuzzy relations and fuzzy transform in image and data analysis; fuzzy intelligent systems in data and spatial data analysis; fuzzy clustering in spatial analysis and hot spot analysis fuzzy; fuzzy clustering in image segmentation; GIS; fuzzy reasoning in GIS environments
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The exponential growth of web technologies and data management tools has led to the possibility of accessing a large amount of data and the increasingly growing need to have data analysis and data mining methods suitable for dealing with massive data.

In order to explore large and very large datasets, it is necessary to experiment with innovative methods that guarantee an optimal performance while being unable to analyze the entire dataset as in traditional cases. Some variations of existing clustering algorithms based on data and dimension reduction techniques are proposed in the recent literature in order to deal with massive datasets.

Of considerable importance is designing efficient clustering algorithms to treat massive data for the fundamental role of cluster analysis in data and text mining and its applicability in many disciplines, such as image analysis, market analysis, spatial analysis, sentiment analysis, and bioinformatics.

This Special Issue on new trends in massive data clustering is aimed at industrial and academic researchers applying nontraditional clustering methods for handling massive data. The key areas of this Special Issue include but are not limited to:

  • Kmeans and Fuzzy Cmeans variations for massive data;
  • Fuzzy clustering for high dimensional data;
  • Density-based and hybrid metaheuristic clustering algorithms;
  • Big data clustering;
  • Network modularity clustering;
  • Cluster techniques for massive social media data streams;
  • Cluster techniques for segmenting high resolution images.

Dr. Ferdinando Di Martino
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Information is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • massive datasets
  • cluster algorithms
  • fuzzy clustering form massive data
  • big data clustering
  • metaheuristic cluster algorithms for massive data
  • cluster techniques for massive social media streams
  • cluster techniques for high resolution image segmentation

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

15 pages, 1256 KiB  
Article
A Fast Algorithm to Initialize Cluster Centroids in Fuzzy Clustering Applications
by Zeynel Cebeci and Cagatay Cebeci
Information 2020, 11(9), 446; https://doi.org/10.3390/info11090446 - 15 Sep 2020
Cited by 2 | Viewed by 3345
Abstract
The goal of partitioning clustering analysis is to divide a dataset into a predetermined number of homogeneous clusters. The quality of final clusters from a prototype-based partitioning algorithm is highly affected by the initially chosen centroids. In this paper, we propose the InoFrep, [...] Read more.
The goal of partitioning clustering analysis is to divide a dataset into a predetermined number of homogeneous clusters. The quality of final clusters from a prototype-based partitioning algorithm is highly affected by the initially chosen centroids. In this paper, we propose the InoFrep, a novel data-dependent initialization algorithm for improving computational efficiency and robustness in prototype-based hard and fuzzy clustering. The InoFrep is a single-pass algorithm using the frequency polygon data of the feature with the highest peaks count in a dataset. By using the Fuzzy C-means (FCM) clustering algorithm, we empirically compare the performance of the InoFrep on one synthetic and six real datasets to those of two common initialization methods: Random sampling of data points and K-means++. Our results show that the InoFrep algorithm significantly reduces the number of iterations and the computing time required by the FCM algorithm. Additionally, it can be applied to multidimensional large datasets because of its shorter initialization time and independence from dimensionality due to working with only one feature with the highest number of peaks. Full article
(This article belongs to the Special Issue New Trends in Massive Data Clustering)
Show Figures

Figure 1

18 pages, 10881 KiB  
Article
Bit Reduced FCM with Block Fuzzy Transforms for Massive Image Segmentation
by Barbara Cardone and Ferdinando Di Martino
Information 2020, 11(7), 351; https://doi.org/10.3390/info11070351 - 5 Jul 2020
Cited by 2 | Viewed by 2853
Abstract
A novel bit reduced fuzzy clustering method applied to segment high resolution massive images is proposed. The image is decomposed in blocks and compressed by using the fuzzy transform method, then adjoint pixels with same gray level are binned and the fuzzy c-means [...] Read more.
A novel bit reduced fuzzy clustering method applied to segment high resolution massive images is proposed. The image is decomposed in blocks and compressed by using the fuzzy transform method, then adjoint pixels with same gray level are binned and the fuzzy c-means algorithm is applied on the bins to segment the image. This method has the advantage to be applied to massive images as the compressed image can be stored in memory and the runtime to segment the image are reduced. Comparison tests are performed with respect to the fuzzy c-means algorithm to segment high resolution images; the results shown that for not very high compression the results are comparable with the ones obtained applying to the fuzzy c-means algorithm on the source image and the runtimes are reduced by about an eighth with respect to the runtimes of fuzzy c-means. Full article
(This article belongs to the Special Issue New Trends in Massive Data Clustering)
Show Figures

Figure 1

Back to TopTop