2014 22nd International Conference on Pattern Recognition 2014
DOI: 10.1109/icpr.2014.274
|View full text |Cite
|
Sign up to set email alerts
|

Kernel Archetypal Analysis for Clustering Web Search Frequency Time Series

Abstract: We analyze time series which indicate how collective attention to social media services or Web-based businesses evolves over time. Data was gathered from Goolge Trends and consists of discrete time series of varying duration. Following the related literature, we fit Weibull distributions to the data. Given the two parameters of its fitted model, we embed each time series in a lowdimensional space and apply kernel archetypal analysis based on the Kullback-Leibler divergence for clustering. Our results reveal st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 26 publications
0
8
0
Order By: Relevance
“…section of this paper and by previous studies (Mørup and Hansen 2012;Bauckhage 2014). Other pattern recognition types discussed here are non-negative matrix factorization (Cichocki et al 2009;Gillis 2020;Mairal 2014Mairal , 2017, clustering, and optimisation on manifold (Boumal et al 2014;Hannachi and Trendafilov 2017;Hannachi 2021;Trendafilov and Gallo 2021).…”
Section: Introductionmentioning
confidence: 84%
“…section of this paper and by previous studies (Mørup and Hansen 2012;Bauckhage 2014). Other pattern recognition types discussed here are non-negative matrix factorization (Cichocki et al 2009;Gillis 2020;Mairal 2014Mairal , 2017, clustering, and optimisation on manifold (Boumal et al 2014;Hannachi and Trendafilov 2017;Hannachi 2021;Trendafilov and Gallo 2021).…”
Section: Introductionmentioning
confidence: 84%
“…Model selection is the topic of Prabhakaran et al (2012), where the authors are concerned with the optimal number of archetypes needed to characterize a given data set. An extension of the original Archetypal Analysis model to non-linear kernel Archetypal Analysis is proposed by Bauckhage and Manshaei (2014); Mørup and Hansen (2012). In Kaufmann et al (2015), the authors use a copula based approach to make AA independent of strictly monotone transformations of the input data.…”
Section: Related Workmentioning
confidence: 99%
“…Archetypal Analysis proposes a matrix factorization algorithm based on the data points lying on the convex hull of the dataset which are the closest concepts to peripheral vertices of a graph. [17] and [18] propose an efficient version of Archetypal Analysis and a kernelized version of this algorithm respectively.…”
Section: A Previous Workmentioning
confidence: 99%