| Naslov: | Multi-Objective K-Center Sum Clustering Problem |
|---|
| Avtorji: | ID Atta, Soumen, Department of Computer Science and Engineering University of Kalyani, Nadia, W.B. (Avtor)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering University of Kalyani, Nadia, W.B. (Avtor) |
|---|
| Datoteke: |
Gradivo nima datotek, ki so prostodostopne za javnost. Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u.  |
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano |
|---|
| Tipologija: | 1.08 - Objavljeni znanstveni prispevek na konferenci |
|---|
| Organizacija: | UNG - Univerza v Novi Gorici
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | k-center sum problem, Clustering problem, Multi-objective optimization, NSGA-II, Facility location problem |
|---|
| Status publikacije: | Objavljeno |
|---|
| Leto izida: | 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 |
|---|
| Datum objave v RUNG: | 05.06.2023 |
|---|
| Število ogledov: | 2147 |
|---|
| Število prenosov: | 0 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
