| Title: | Multi-Objective K-Center Sum Clustering Problem |
|---|
| Authors: | ID Atta, Soumen, Department of Computer Science and Engineering University of Kalyani, Nadia, W.B. (Author)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering University of Kalyani, Nadia, W.B. (Author) |
|---|
| Files: |
This document has no files that are freely available to the public. This document may have a physical copy in the library of the organization, check the status via COBISS.  |
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.08 - Published Scientific Conference Contribution |
|---|
| Organization: | UNG - University of Nova Gorica
|
|---|
| Abstract: | Given a set P of n objects in two dimensional plane and a positive integer k (≤ n), we have considered the problem of partitioning P into k clusters of circular shape so as to minimize the following two objectives: (i) the sum of radii of these k circular clusters and (ii) the number of points of P covered by more than one circular cluster. The NSGA-II based multi-objective genetic algorithm (MOGA) has been proposed to solve this problem. |
|---|
| Keywords: | k-center sum problem, Clustering problem, Multi-objective optimization, NSGA-II, Facility location problem |
|---|
| Publication status: | Published |
|---|
| Year of publishing: | 2015 |
|---|
| PID: | 20.500.12556/RUNG-8239 |
|---|
| COBISS.SI-ID: | 154428163 |
|---|
| DOI: | https://doi.org/10.1007/978-3-319-13728-5_47 |
|---|
| NUK URN: | URN:SI:UNG:REP:AUU0B7HZ |
|---|
| Publication date in RUNG: | 05.06.2023 |
|---|
| Views: | 2141 |
|---|
| Downloads: | 0 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
