Mining hepatitis data with temporal abstraction
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Constructing a Decision Tree for Graph-Structured Data and its Applications
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Exploiting temporal relations in mining hepatitis data
New Generation Computing
Robust Singular Spectrum Transform
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
A data mining framework for time series estimation
Journal of Biomedical Informatics
Evaluating accuracies of a trading rule mining method based on temporal pattern extraction
MCD'07 Proceedings of the 3rd ECML/PKDD international conference on Mining complex data
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
Empirical comparison of clustering methods for long time-series databases
AM'03 Proceedings of the Second international conference on Active Mining
CPMD: a matlab toolbox for change point and constrained motif discovery
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Constructing a Decision Tree for Graph-Structured Data and its Applications
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Mining effective multi-segment sliding window for pathogen incidence rate prediction
Data & Knowledge Engineering
Hi-index | 0.00 |
Data mining in time-series medical databases has beenreceiving considerable attention since it provides a way ofrevealing useful information hidden in the database; forexample relationships between temporal course of examinationresults and onset time of diseases. This paperpresents a new method for finding similar patterns in temporalsequences. The method is a hybridization of phase-constraintmultiscale matching and rough clustering. Multiscalematching enables us cross-scale comparison of thesequences, namely, it enable us to compare temporal patternsby partially changing observation scales. Rough clusteringenable us to construct interpretable clusters of thesequences even if their similarities are given as relativesimilarities. We combine these methods and cluster the sequencesaccording to multiscale similarity of patterns. Experimentalresults on the chronic hepatitis dataset showedthat clusters demonstrating interesting temporal patternswere successfully discovered.