A new incremental algorithm for overlapped clustering

Airel Pérez Suárez, José Fco Martínez Trinidad, Jesús A. Carrasco Ochoa, José E. Medina Pagola

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

5 Citations (Scopus)

Abstract

In this paper, a new algorithm for incremental overlapped clustering, called Incremental Clustering by Strength Decision (ICSD), is introduced. ICSD obtains a set of dense and overlapped clusters using a new graph cover heuristic while reduces the amount of computation by maintaining incrementally the cluster structure. The experimental results show that our proposal outperforms other graph-based clustering algorithms considering quality measures and also show that ICSD achieves a better time performance than other incremental graph-based algorithms. © 2009 Springer-Verlag Berlin Heidelberg.
Original languageAmerican English
Title of host publicationA new incremental algorithm for overlapped clustering
Pages497-504
Number of pages446
ISBN (Electronic)3642102670, 9783642102677
DOIs
StatePublished - 1 Dec 2009
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2014 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5856 LNCS
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/14 → …

Fingerprint

Incremental Algorithm
Clustering
Clustering algorithms
Graph in graph theory
Quality Measures
Clustering Algorithm
Heuristics
Cover
Experimental Results

Cite this

Pérez Suárez, A., Martínez Trinidad, J. F., Carrasco Ochoa, J. A., & Medina Pagola, J. E. (2009). A new incremental algorithm for overlapped clustering. In A new incremental algorithm for overlapped clustering (pp. 497-504). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5856 LNCS). https://doi.org/10.1007/978-3-642-10268-4_58
Pérez Suárez, Airel ; Martínez Trinidad, José Fco ; Carrasco Ochoa, Jesús A. ; Medina Pagola, José E. / A new incremental algorithm for overlapped clustering. A new incremental algorithm for overlapped clustering. 2009. pp. 497-504 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{433eb5e38dff4c19a18a3c798b9d3498,
title = "A new incremental algorithm for overlapped clustering",
abstract = "In this paper, a new algorithm for incremental overlapped clustering, called Incremental Clustering by Strength Decision (ICSD), is introduced. ICSD obtains a set of dense and overlapped clusters using a new graph cover heuristic while reduces the amount of computation by maintaining incrementally the cluster structure. The experimental results show that our proposal outperforms other graph-based clustering algorithms considering quality measures and also show that ICSD achieves a better time performance than other incremental graph-based algorithms. {\circledC} 2009 Springer-Verlag Berlin Heidelberg.",
author = "{P{\'e}rez Su{\'a}rez}, Airel and {Mart{\'i}nez Trinidad}, {Jos{\'e} Fco} and {Carrasco Ochoa}, {Jes{\'u}s A.} and {Medina Pagola}, {Jos{\'e} E.}",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-10268-4_58",
language = "American English",
isbn = "3642102670",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "497--504",
booktitle = "A new incremental algorithm for overlapped clustering",

}

Pérez Suárez, A, Martínez Trinidad, JF, Carrasco Ochoa, JA & Medina Pagola, JE 2009, A new incremental algorithm for overlapped clustering. in A new incremental algorithm for overlapped clustering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5856 LNCS, pp. 497-504, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1/01/14. https://doi.org/10.1007/978-3-642-10268-4_58

A new incremental algorithm for overlapped clustering. / Pérez Suárez, Airel; Martínez Trinidad, José Fco; Carrasco Ochoa, Jesús A.; Medina Pagola, José E.

A new incremental algorithm for overlapped clustering. 2009. p. 497-504 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5856 LNCS).

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

TY - GEN

T1 - A new incremental algorithm for overlapped clustering

AU - Pérez Suárez, Airel

AU - Martínez Trinidad, José Fco

AU - Carrasco Ochoa, Jesús A.

AU - Medina Pagola, José E.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this paper, a new algorithm for incremental overlapped clustering, called Incremental Clustering by Strength Decision (ICSD), is introduced. ICSD obtains a set of dense and overlapped clusters using a new graph cover heuristic while reduces the amount of computation by maintaining incrementally the cluster structure. The experimental results show that our proposal outperforms other graph-based clustering algorithms considering quality measures and also show that ICSD achieves a better time performance than other incremental graph-based algorithms. © 2009 Springer-Verlag Berlin Heidelberg.

AB - In this paper, a new algorithm for incremental overlapped clustering, called Incremental Clustering by Strength Decision (ICSD), is introduced. ICSD obtains a set of dense and overlapped clusters using a new graph cover heuristic while reduces the amount of computation by maintaining incrementally the cluster structure. The experimental results show that our proposal outperforms other graph-based clustering algorithms considering quality measures and also show that ICSD achieves a better time performance than other incremental graph-based algorithms. © 2009 Springer-Verlag Berlin Heidelberg.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78649941512&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=78649941512&origin=inward

U2 - 10.1007/978-3-642-10268-4_58

DO - 10.1007/978-3-642-10268-4_58

M3 - Conference contribution

SN - 3642102670

SN - 9783642102677

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

SP - 497

EP - 504

BT - A new incremental algorithm for overlapped clustering

ER -

Pérez Suárez A, Martínez Trinidad JF, Carrasco Ochoa JA, Medina Pagola JE. A new incremental algorithm for overlapped clustering. In A new incremental algorithm for overlapped clustering. 2009. p. 497-504. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10268-4_58