An improved rough clustering using discernibility based initial seed computation

Djoko Budiyanto Setyohadi, Azuraliza Abu Bakar, Zulaiha Ali Othman

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

2 Citations (Scopus)

Abstract

In this paper, we present the discernibility approach for an initial seed computation of Rough K-Means (RKM). We propose the use of the discernibility initial seed computation (ISC) for RKM. Our proposed algorithm aims to improve the performance and to avoid the problem of an empty cluster which affects the numerical stability since there are data constellations where

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages161-168
Number of pages8
Volume6440 LNAI
EditionPART 1
DOIs
Publication statusPublished - 2010
Event6th International Conference on Advanced Data Mining and Applications, ADMA 2010 - Chongqing
Duration: 19 Nov 201021 Nov 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6440 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Conference on Advanced Data Mining and Applications, ADMA 2010
CityChongqing
Period19/11/1021/11/10

Fingerprint

K-means
Rough
Clustering
Convergence of numerical methods
Numerical Stability

Keywords

  • Discernibility
  • Initial Seed Computation
  • Rough K-Means

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Setyohadi, D. B., Abu Bakar, A., & Ali Othman, Z. (2010). An improved rough clustering using discernibility based initial seed computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 1 ed., Vol. 6440 LNAI, pp. 161-168). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6440 LNAI, No. PART 1). https://doi.org/10.1007/978-3-642-17316-5_15

An improved rough clustering using discernibility based initial seed computation. / Setyohadi, Djoko Budiyanto; Abu Bakar, Azuraliza; Ali Othman, Zulaiha.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6440 LNAI PART 1. ed. 2010. p. 161-168 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6440 LNAI, No. PART 1).

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

Setyohadi, DB, Abu Bakar, A & Ali Othman, Z 2010, An improved rough clustering using discernibility based initial seed computation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 edn, vol. 6440 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6440 LNAI, pp. 161-168, 6th International Conference on Advanced Data Mining and Applications, ADMA 2010, Chongqing, 19/11/10. https://doi.org/10.1007/978-3-642-17316-5_15
Setyohadi DB, Abu Bakar A, Ali Othman Z. An improved rough clustering using discernibility based initial seed computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 ed. Vol. 6440 LNAI. 2010. p. 161-168. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-17316-5_15
Setyohadi, Djoko Budiyanto ; Abu Bakar, Azuraliza ; Ali Othman, Zulaiha. / An improved rough clustering using discernibility based initial seed computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6440 LNAI PART 1. ed. 2010. pp. 161-168 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{5455d741f56e4e15802aff818682d8ca,
title = "An improved rough clustering using discernibility based initial seed computation",
abstract = "In this paper, we present the discernibility approach for an initial seed computation of Rough K-Means (RKM). We propose the use of the discernibility initial seed computation (ISC) for RKM. Our proposed algorithm aims to improve the performance and to avoid the problem of an empty cluster which affects the numerical stability since there are data constellations where",
keywords = "Discernibility, Initial Seed Computation, Rough K-Means",
author = "Setyohadi, {Djoko Budiyanto} and {Abu Bakar}, Azuraliza and {Ali Othman}, Zulaiha",
year = "2010",
doi = "10.1007/978-3-642-17316-5_15",
language = "English",
isbn = "3642173152",
volume = "6440 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "161--168",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 1",

}

TY - GEN

T1 - An improved rough clustering using discernibility based initial seed computation

AU - Setyohadi, Djoko Budiyanto

AU - Abu Bakar, Azuraliza

AU - Ali Othman, Zulaiha

PY - 2010

Y1 - 2010

N2 - In this paper, we present the discernibility approach for an initial seed computation of Rough K-Means (RKM). We propose the use of the discernibility initial seed computation (ISC) for RKM. Our proposed algorithm aims to improve the performance and to avoid the problem of an empty cluster which affects the numerical stability since there are data constellations where

AB - In this paper, we present the discernibility approach for an initial seed computation of Rough K-Means (RKM). We propose the use of the discernibility initial seed computation (ISC) for RKM. Our proposed algorithm aims to improve the performance and to avoid the problem of an empty cluster which affects the numerical stability since there are data constellations where

KW - Discernibility

KW - Initial Seed Computation

KW - Rough K-Means

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

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

U2 - 10.1007/978-3-642-17316-5_15

DO - 10.1007/978-3-642-17316-5_15

M3 - Conference contribution

SN - 3642173152

SN - 9783642173158

VL - 6440 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 161

EP - 168

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -