Utilize este identificador para referenciar este registo: http://hdl.handle.net/10071/8074
Autoria: De Angelis, L.
Dias, J. G.
Data: 2014
Título próprio: Mining categorical sequences from data using a hybrid clustering method
Volume: 234
Número: 3
Paginação: 720 - 730
ISSN: 0377-2217
DOI (Digital Object Identifier): 10.1016/j.ejor.2013.11.002
Palavras-chave: Data mining
Sequential data
Hidden Markov models
Clustering
Categorical data
Resumo: The identification of different dynamics in sequential data has become an every day need in scientific fields such as marketing, bioinformatics, finance, or social sciences. Contrary to cross-sectional or static data, this type of observations (also known as stream data, temporal data, longitudinal data or repeated measures) are more challenging as one has to incorporate data dependency in the clustering process. In this research we focus on clustering categorical sequences. The method proposed here combines model-based and heuristic clustering. In the first step, the categorical sequences are transformed by an extension of the hidden Markov model into a probabilistic space, where a symmetric Kullback-Leibler distance can operate. Then, in the second step, using hierarchical clustering on the matrix of distances, the sequences can be clustered. This paper illustrates the enormous potential of this type of hybrid approach using a synthetic data set as well as the well-known Microsoft dataset with website users search patterns and a survey on job career dynamics.
Arbitragem científica: yes
Acesso: Acesso Embargado
Aparece nas coleções:BRU-RI - Artigos em revistas científicas internacionais com arbitragem científica

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
Dias2014EJOR.pdf
  Restricted Access
Versão Editora780,03 kBAdobe PDFVer/Abrir Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.