@article {1536,
	title = {nTreeClus: A tree-based sequence encoder for clustering categorical series},
	journal = {Neurocomputing},
	volume = {494},
	year = {2022},
	pages = {224-241},
	abstract = {<p>The overwhelming presence of categorical/sequential data in diverse domains emphasizes the importance of sequence mining. The challenging nature of sequences proves the need for continuing research to find a more accurate and faster approach providing a better understanding of their (dis) similarities. This paper proposes a new Model-based approach for clustering sequence data, namely nTreeClus. The proposed method deploys Tree-based Learners, k-mers, and autoregressive models for categorical time series, culminating with a novel numerical representation of the categorical sequences. Adopting this new representation, we cluster sequences, considering the inherent patterns in categorical time series. Accordingly, the model showed robustness to its parameter. Under different simulated scenarios, nTreeClus improved the baseline methods for various internal and external cluster validation metrics for up to 10.7\% and 2.7\%, respectively. The empirical evaluation using synthetic and real datasets, protein sequences, and categorical time series showed that nTreeClus is competitive or superior to most state-of-the-art algorithms.</p>},
	keywords = {Categorical time series, Model-based clustering, Pattern recognition, Sequence mining, Tree-based learning},
	issn = {0925-2312},
	doi = {https://doi.org/10.1016/j.neucom.2022.04.076},
	url = {https://www.sciencedirect.com/science/article/pii/S0925231222004611},
	author = {Hadi Jahanshahi and Mustafa Gokce Baydogan}
}
@conference {Leydold;Janka;Hoermann:2002a,
	title = {Variants of Transformed Density Rejection and Correlation Induction},
	booktitle = {Monte Carlo and Quasi-Monte Carlo Methods 2000},
	year = {2002},
	pages = {345{\textendash}356},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Heidelberg},
	author = {Leydold, Josef and Janka, Erich and Wolfgang H{\"o}rmann}
}
