@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}
}
@article {1422,
	title = {A new feature-based time series classification method by using scale-space extrema},
	journal = {Engineering Science and Technology, an International Journal},
	year = {2021},
	abstract = {<p>Time series data mining has received significant attention over the past decade, and many approaches have focused on classification tasks where the goal is to define the label of a test time series, given labeled training data. Time series classification approaches can be broadly grouped into two categories as instance-based and feature-based methods. Instance-based approaches utilize similarity information in a nearest-neighbor setting to classify time series data. Although approaches from this category provide accurate results, their performance degrades with long and noisy time series. On the other hand, feature-based approaches extract features to deal with the limitations of instance-based approaches; however, these approaches work with predefined features and may not be successful in certain classification problems. This study proposes a time series classification approach that benefits from both scale-space theory and bag-of-features technique. The method starts with finding the scale-space extrema points (i.e. key points) of each time series according to the SiZer (SIgnificant ZERo crossings of the derivatives) method, and then proceeds to create the local features set around these points. After extraction of the local features from each key point, a bag-of-features representation for each time series is constructed as the summary of the key point characteristics. We evaluate the success of the proposed representation on time series classification problems from various domains. Our experimental results show that our proposal provides competitive results compared to widely used approaches in the literature.</p>},
	keywords = {Bag-of-Features Technique, Feature-based Classification, Scale-Space Theory, SiZer, time series classification},
	issn = {2215-0986},
	doi = {https://doi.org/10.1016/j.jestch.2021.03.017},
	url = {https://www.sciencedirect.com/science/article/pii/S2215098621000823},
	author = {Tayip Altay and Mustafa Gokce Baydogan}
}
