Home > Research > Publications & Outputs > Online clustering of processes
View graph of relations

Online clustering of processes

Research output: Contribution to Journal/MagazineConference articlepeer-review

Published

Standard

Online clustering of processes. / Khaleghi, Azadeh; Ryabko, Daniil; Mary, Jérémie et al.
In: Proceedings of Machine Learning Research, Vol. 22, 01.01.2012, p. 601-609.

Research output: Contribution to Journal/MagazineConference articlepeer-review

Harvard

Khaleghi, A, Ryabko, D, Mary, J & Preux, P 2012, 'Online clustering of processes', Proceedings of Machine Learning Research, vol. 22, pp. 601-609. <http://proceedings.mlr.press/v22/khaleghi12.html>

APA

Khaleghi, A., Ryabko, D., Mary, J., & Preux, P. (2012). Online clustering of processes. Proceedings of Machine Learning Research, 22, 601-609. http://proceedings.mlr.press/v22/khaleghi12.html

Vancouver

Khaleghi A, Ryabko D, Mary J, Preux P. Online clustering of processes. Proceedings of Machine Learning Research. 2012 Jan 1;22:601-609.

Author

Khaleghi, Azadeh ; Ryabko, Daniil ; Mary, Jérémie et al. / Online clustering of processes. In: Proceedings of Machine Learning Research. 2012 ; Vol. 22. pp. 601-609.

Bibtex

@article{79b1f6782c1544e6a2baa7a24eaae9d8,
title = "Online clustering of processes",
abstract = "The problem of online clustering is considered in the case where each data point is a sequence generated by a stationary ergodic process. Data arrive in an online fashion so that the sample received at every timestep is either a continuation of some previously received sequence or a new sequence. The dependence between the sequences can be arbitrary. No parametric or independence assumptions are made; the only assumption is that the marginal distribution of each sequence is stationary and ergodic. A novel, computationally efficient algorithm is proposed and is shown to be asymptotically consistent (under a natural notion of consistency). The performance of the proposed algorithm is evaluated on simulated data, as well as on real datasets (motion classification).",
author = "Azadeh Khaleghi and Daniil Ryabko and J{\'e}r{\'e}mie Mary and Philippe Preux",
year = "2012",
month = jan,
day = "1",
language = "English",
volume = "22",
pages = "601--609",
journal = "Proceedings of Machine Learning Research",
issn = "1938-7228",
note = "15th International Conference on Artificial Intelligence and Statistics, AISTATS 2012 ; Conference date: 21-04-2012 Through 23-04-2012",

}

RIS

TY - JOUR

T1 - Online clustering of processes

AU - Khaleghi, Azadeh

AU - Ryabko, Daniil

AU - Mary, Jérémie

AU - Preux, Philippe

PY - 2012/1/1

Y1 - 2012/1/1

N2 - The problem of online clustering is considered in the case where each data point is a sequence generated by a stationary ergodic process. Data arrive in an online fashion so that the sample received at every timestep is either a continuation of some previously received sequence or a new sequence. The dependence between the sequences can be arbitrary. No parametric or independence assumptions are made; the only assumption is that the marginal distribution of each sequence is stationary and ergodic. A novel, computationally efficient algorithm is proposed and is shown to be asymptotically consistent (under a natural notion of consistency). The performance of the proposed algorithm is evaluated on simulated data, as well as on real datasets (motion classification).

AB - The problem of online clustering is considered in the case where each data point is a sequence generated by a stationary ergodic process. Data arrive in an online fashion so that the sample received at every timestep is either a continuation of some previously received sequence or a new sequence. The dependence between the sequences can be arbitrary. No parametric or independence assumptions are made; the only assumption is that the marginal distribution of each sequence is stationary and ergodic. A novel, computationally efficient algorithm is proposed and is shown to be asymptotically consistent (under a natural notion of consistency). The performance of the proposed algorithm is evaluated on simulated data, as well as on real datasets (motion classification).

M3 - Conference article

AN - SCOPUS:84877745287

VL - 22

SP - 601

EP - 609

JO - Proceedings of Machine Learning Research

JF - Proceedings of Machine Learning Research

SN - 1938-7228

T2 - 15th International Conference on Artificial Intelligence and Statistics, AISTATS 2012

Y2 - 21 April 2012 through 23 April 2012

ER -