Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A split-merge evolutionary clustering algorithm
Technical University Sofia Branch Plovdiv, BUL.
Sirris, Brussels, BEL.
2019 (English)In: ICAART 2019 - Proceedings of the 11th International Conference on Agents and Artificial Intelligence, SciTePress , 2019, Vol. 2, p. 337-346Conference paper, Published paper (Refereed)
Abstract [en]

In this article we propose a bipartite correlation clustering technique that can be used to adapt the existing clustering solution to a clustering of newly collected data elements. The proposed technique is supposed to provide the flexibility to compute clusters on a new portion of data collected over a defined time period and to update the existing clustering solution by the computed new one. Such an updating clustering should better reflect the current characteristics of the data by being able to examine clusters occurring in the considered time period and eventually capture interesting trends in the area. For example, some clusters will be updated by merging with ones from newly constructed clustering while others will be transformed by splitting their elements among several new clusters. The proposed clustering algorithm, entitled Split-Merge Evolutionary Clustering, is evaluated and compared to another bipartite correlation clustering technique (PivotBiCluster) on two different case studies: expertise retrieval and patient profiling in healthcare. Copyright © 2019 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved

Place, publisher, year, edition, pages
SciTePress , 2019. Vol. 2, p. 337-346
Keywords [en]
Bipartite Clustering, Data Mining, Evolutionary Clustering, PubMed Data, Unsupervised Learning, Artificial intelligence, Cluster analysis, Evolutionary algorithms, Bipartite correlation clustering, Case-studies, Clustering solutions, Current characteristic, Data elements, Clustering algorithms
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:bth-17896Scopus ID: 2-s2.0-85064827857ISBN: 9789897583506 (print)OAI: oai:DiVA.org:bth-17896DiVA, id: diva2:1316776
Conference
11th International Conference on Agents and Artificial Intelligence, ICAART; Prague, 19 February 2019 through 21 February 2019
Available from: 2019-05-21 Created: 2019-05-21 Last updated: 2019-05-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Scopus

Authority records BETA

Boeva, Veselka

Search in DiVA

By author/editor
Boeva, Veselka
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 186 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf