Data clustering using big bang-big crunch algorithm

Abdolreza Hatamlou, Salwani Abdullah, Masumeh Hatamlou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Citations (Scopus)

Abstract

The Big Bang-Big Crunch (BB-BC) algorithm is a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. According to this method, in the Big Bang phase some candidate solutions to the optimization problem are randomly generated and spread all over the search space. In the Big Crunch phase, randomly distributed candidate solutions are drawn into a single representative point via a center of population or minimal cost approach. This paper presents BB-BC based novel approach for data clustering. The simulation results indicate the applicability and potential of this algorithm on data clustering.

Original languageEnglish
Title of host publicationCommunications in Computer and Information Science
Pages383-388
Number of pages6
Volume241 CCIS
DOIs
Publication statusPublished - 2011
Event1st International Conference on Innovative Computing Technology, INCT 2011 - Tehran
Duration: 13 Dec 201115 Dec 2011

Publication series

NameCommunications in Computer and Information Science
Volume241 CCIS
ISSN (Print)18650929

Other

Other1st International Conference on Innovative Computing Technology, INCT 2011
CityTehran
Period13/12/1115/12/11

Fingerprint

Costs

Keywords

  • Big Bang-Big Crunch algorithm
  • Cluster analysis

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Hatamlou, A., Abdullah, S., & Hatamlou, M. (2011). Data clustering using big bang-big crunch algorithm. In Communications in Computer and Information Science (Vol. 241 CCIS, pp. 383-388). (Communications in Computer and Information Science; Vol. 241 CCIS). https://doi.org/10.1007/978-3-642-27337-7_36

Data clustering using big bang-big crunch algorithm. / Hatamlou, Abdolreza; Abdullah, Salwani; Hatamlou, Masumeh.

Communications in Computer and Information Science. Vol. 241 CCIS 2011. p. 383-388 (Communications in Computer and Information Science; Vol. 241 CCIS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hatamlou, A, Abdullah, S & Hatamlou, M 2011, Data clustering using big bang-big crunch algorithm. in Communications in Computer and Information Science. vol. 241 CCIS, Communications in Computer and Information Science, vol. 241 CCIS, pp. 383-388, 1st International Conference on Innovative Computing Technology, INCT 2011, Tehran, 13/12/11. https://doi.org/10.1007/978-3-642-27337-7_36
Hatamlou A, Abdullah S, Hatamlou M. Data clustering using big bang-big crunch algorithm. In Communications in Computer and Information Science. Vol. 241 CCIS. 2011. p. 383-388. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-27337-7_36
Hatamlou, Abdolreza ; Abdullah, Salwani ; Hatamlou, Masumeh. / Data clustering using big bang-big crunch algorithm. Communications in Computer and Information Science. Vol. 241 CCIS 2011. pp. 383-388 (Communications in Computer and Information Science).
@inproceedings{86d7e7ee4f81420ba871b85f3dc20d66,
title = "Data clustering using big bang-big crunch algorithm",
abstract = "The Big Bang-Big Crunch (BB-BC) algorithm is a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. According to this method, in the Big Bang phase some candidate solutions to the optimization problem are randomly generated and spread all over the search space. In the Big Crunch phase, randomly distributed candidate solutions are drawn into a single representative point via a center of population or minimal cost approach. This paper presents BB-BC based novel approach for data clustering. The simulation results indicate the applicability and potential of this algorithm on data clustering.",
keywords = "Big Bang-Big Crunch algorithm, Cluster analysis",
author = "Abdolreza Hatamlou and Salwani Abdullah and Masumeh Hatamlou",
year = "2011",
doi = "10.1007/978-3-642-27337-7_36",
language = "English",
isbn = "9783642273360",
volume = "241 CCIS",
series = "Communications in Computer and Information Science",
pages = "383--388",
booktitle = "Communications in Computer and Information Science",

}

TY - GEN

T1 - Data clustering using big bang-big crunch algorithm

AU - Hatamlou, Abdolreza

AU - Abdullah, Salwani

AU - Hatamlou, Masumeh

PY - 2011

Y1 - 2011

N2 - The Big Bang-Big Crunch (BB-BC) algorithm is a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. According to this method, in the Big Bang phase some candidate solutions to the optimization problem are randomly generated and spread all over the search space. In the Big Crunch phase, randomly distributed candidate solutions are drawn into a single representative point via a center of population or minimal cost approach. This paper presents BB-BC based novel approach for data clustering. The simulation results indicate the applicability and potential of this algorithm on data clustering.

AB - The Big Bang-Big Crunch (BB-BC) algorithm is a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. According to this method, in the Big Bang phase some candidate solutions to the optimization problem are randomly generated and spread all over the search space. In the Big Crunch phase, randomly distributed candidate solutions are drawn into a single representative point via a center of population or minimal cost approach. This paper presents BB-BC based novel approach for data clustering. The simulation results indicate the applicability and potential of this algorithm on data clustering.

KW - Big Bang-Big Crunch algorithm

KW - Cluster analysis

UR - http://www.scopus.com/inward/record.url?scp=83755162323&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755162323&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-27337-7_36

DO - 10.1007/978-3-642-27337-7_36

M3 - Conference contribution

AN - SCOPUS:83755162323

SN - 9783642273360

VL - 241 CCIS

T3 - Communications in Computer and Information Science

SP - 383

EP - 388

BT - Communications in Computer and Information Science

ER -