Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Archetypal Analysis++: Rethinking the Initialization Strategy
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Artificial Intelligence.ORCID iD: 0000-0003-2949-8781
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Artificial Intelligence.ORCID iD: 0000-0002-9099-3522
2024 (English)In: Transactions on Machine Learning Research, E-ISSN 2835-8856Article in journal (Refereed) Published
Abstract [en]

Archetypal analysis is a matrix factorization method with convexity constraints. Due to local minima, a good initialization is essential, but frequently used initialization methods yield either sub-optimal starting points or are prone to get stuck in poor local minima. In this paper, we propose archetypal analysis++ (AA++), a probabilistic initialization strategy for archetypal analysis that sequentially samples points based on their influence on the objective function, similar to k-means++. In fact, we argue that k-means++ already approximates the proposed initialization method. Furthermore, we suggest to adapt an efficient Monte Carlo approximation of k-means++ to AA++. In an extensive empirical evaluation of 15 real-world data sets of varying sizes and dimensionalities and considering two pre-processing strategies, we show that AA++ almost always outperforms all baselines, including the most frequently used ones.

Place, publisher, year, edition, pages
Transactions on Machine Learning Research , 2024.
National Category
Computer graphics and computer vision
Identifiers
URN: urn:nbn:se:uu:diva-538566Scopus ID: 2-s2.0-85210954163OAI: oai:DiVA.org:uu-538566DiVA, id: diva2:1898608
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2024-09-17 Created: 2024-09-17 Last updated: 2026-02-17Bibliographically approved

Open Access in DiVA

fulltext(3494 kB)614 downloads
File information
File name FULLTEXT01.pdfFile size 3494 kBChecksum SHA-512
5edd80cd7eefb3c6083dd9c31d603b80a9a945b6e5e273e30d3d9d66efbe85d49e68baf74cca91e56a335ae2211ce729c6ed0d27ab7ef76739a241083b528929
Type fulltextMimetype application/pdf

Other links

ScopusArticle in full-textPre-print in arXiv

Search in DiVA

By author/editor
Mair, SebastianSjölund, Jens
By organisation
Division of Systems and ControlArtificial Intelligence
In the same journal
Transactions on Machine Learning Research
Computer graphics and computer vision

Search outside of DiVA

GoogleGoogle Scholar
Total: 615 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 142 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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