A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data

Noha Yousri, Mohamed S. Kamel, Mohamed A. Ismail

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

1 Citation (Scopus)

Abstract

Apart from the interesting problem of finding arbitrary shaped clusters of different densities, some applications further introduce the challenge of finding overlapping clusters in the presence of outliers. Fuzzy and possibilistic clustering approaches have therefore been developed to handle such problem, where possibilistic clustering is able to handle the presence of outliers compared to its fuzzy counterpart. However, current known fuzzy and possibilistic algorithms are still inefficient to use for finding the natural cluster structure. In this work, a novel possibilistic density based clustering approach is introduced, to identify the degrees of typicality of patterns to clusters of arbitrary shapes and densities. Experimental results illustrate the efficiency of the proposed approach compared to related algorithms.

Original languageEnglish
Title of host publicationNeural Information Processing - 19th International Conference, ICONIP 2012, Proceedings
Pages577-584
Number of pages8
EditionPART 3
DOIs
Publication statusPublished - 19 Nov 2012
Event19th International Conference on Neural Information Processing, ICONIP 2012 - Doha, Qatar
Duration: 12 Nov 201215 Nov 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume7665 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference on Neural Information Processing, ICONIP 2012
CountryQatar
CityDoha
Period12/11/1215/11/12

Fingerprint

High-dimensional Data
Clustering
Arbitrary
Outlier
Overlapping
Experimental Results

Keywords

  • Arbitrary densities
  • Arbitrary Shapes
  • Possibilistic Clustering

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yousri, N., Kamel, M. S., & Ismail, M. A. (2012). A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data. In Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings (PART 3 ed., pp. 577-584). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7665 LNCS, No. PART 3). https://doi.org/10.1007/978-3-642-34487-9_70

A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data. / Yousri, Noha; Kamel, Mohamed S.; Ismail, Mohamed A.

Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings. PART 3. ed. 2012. p. 577-584 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7665 LNCS, No. PART 3).

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

Yousri, N, Kamel, MS & Ismail, MA 2012, A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data. in Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings. PART 3 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 7665 LNCS, pp. 577-584, 19th International Conference on Neural Information Processing, ICONIP 2012, Doha, Qatar, 12/11/12. https://doi.org/10.1007/978-3-642-34487-9_70
Yousri N, Kamel MS, Ismail MA. A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data. In Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings. PART 3 ed. 2012. p. 577-584. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). https://doi.org/10.1007/978-3-642-34487-9_70
Yousri, Noha ; Kamel, Mohamed S. ; Ismail, Mohamed A. / A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data. Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings. PART 3. ed. 2012. pp. 577-584 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).
@inproceedings{7ce34af89efd48cab567d76cd2782035,
title = "A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data",
abstract = "Apart from the interesting problem of finding arbitrary shaped clusters of different densities, some applications further introduce the challenge of finding overlapping clusters in the presence of outliers. Fuzzy and possibilistic clustering approaches have therefore been developed to handle such problem, where possibilistic clustering is able to handle the presence of outliers compared to its fuzzy counterpart. However, current known fuzzy and possibilistic algorithms are still inefficient to use for finding the natural cluster structure. In this work, a novel possibilistic density based clustering approach is introduced, to identify the degrees of typicality of patterns to clusters of arbitrary shapes and densities. Experimental results illustrate the efficiency of the proposed approach compared to related algorithms.",
keywords = "Arbitrary densities, Arbitrary Shapes, Possibilistic Clustering",
author = "Noha Yousri and Kamel, {Mohamed S.} and Ismail, {Mohamed A.}",
year = "2012",
month = "11",
day = "19",
doi = "10.1007/978-3-642-34487-9_70",
language = "English",
isbn = "9783642344862",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 3",
pages = "577--584",
booktitle = "Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings",
edition = "PART 3",

}

TY - GEN

T1 - A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data

AU - Yousri, Noha

AU - Kamel, Mohamed S.

AU - Ismail, Mohamed A.

PY - 2012/11/19

Y1 - 2012/11/19

N2 - Apart from the interesting problem of finding arbitrary shaped clusters of different densities, some applications further introduce the challenge of finding overlapping clusters in the presence of outliers. Fuzzy and possibilistic clustering approaches have therefore been developed to handle such problem, where possibilistic clustering is able to handle the presence of outliers compared to its fuzzy counterpart. However, current known fuzzy and possibilistic algorithms are still inefficient to use for finding the natural cluster structure. In this work, a novel possibilistic density based clustering approach is introduced, to identify the degrees of typicality of patterns to clusters of arbitrary shapes and densities. Experimental results illustrate the efficiency of the proposed approach compared to related algorithms.

AB - Apart from the interesting problem of finding arbitrary shaped clusters of different densities, some applications further introduce the challenge of finding overlapping clusters in the presence of outliers. Fuzzy and possibilistic clustering approaches have therefore been developed to handle such problem, where possibilistic clustering is able to handle the presence of outliers compared to its fuzzy counterpart. However, current known fuzzy and possibilistic algorithms are still inefficient to use for finding the natural cluster structure. In this work, a novel possibilistic density based clustering approach is introduced, to identify the degrees of typicality of patterns to clusters of arbitrary shapes and densities. Experimental results illustrate the efficiency of the proposed approach compared to related algorithms.

KW - Arbitrary densities

KW - Arbitrary Shapes

KW - Possibilistic Clustering

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

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

U2 - 10.1007/978-3-642-34487-9_70

DO - 10.1007/978-3-642-34487-9_70

M3 - Conference contribution

SN - 9783642344862

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

SP - 577

EP - 584

BT - Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings

ER -