A training algorithm for optimal margin classifiers
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Deformable Markov model templates for time-series pattern matching
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Learning with non-positive kernels
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Rotation invariant indexing of shapes and line drawings
Proceedings of the 14th ACM international conference on Information and knowledge management
Optimal assignment kernels for attributed molecular graphs
ICML '05 Proceedings of the 22nd international conference on Machine learning
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Generalized Bradley-Terry Models and Multi-Class Probability Estimates
The Journal of Machine Learning Research
Large Scale Multiple Kernel Learning
The Journal of Machine Learning Research
Learning from interpretations: a rooted kernel for ordered hypergraphs
Proceedings of the 24th international conference on Machine learning
A theory of learning with similarity functions
Machine Learning
A reproducing kernel Hilbert space framework for pairwise time series distances
Proceedings of the 25th international conference on Machine learning
A generalization of Haussler's convolution kernel: mapping kernel
Proceedings of the 25th international conference on Machine learning
A multiscale representation method for nonrigid shapes with a single closed contour
IEEE Transactions on Circuits and Systems for Video Technology
Shift-invariant grouped multi-task learning for Gaussian processes
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Strengthening learning algorithms by feature discovery
Information Sciences: an International Journal
Hi-index | 0.00 |
We present a method for applying machine learning algorithms to the automatic classification of astronomy star surveys using time series of star brightness. Currently such classification requires a large amount of domain expert time. We show that a combination of phase invariant similarity and explicit features extracted from the time series provide domain expert level classification. To facilitate this application, we investigate the cross-correlation as a general phase invariant similarity function for time series. We establish several theoretical properties of cross-correlation showing that it is intuitively appealing and algorithmically tractable, but not positive semidefinite, and therefore not generally applicable with kernel methods. As a solution we introduce a positive semidefinite similarity function with the same intuitive appeal as cross-correlation. An experimental evaluation in the astronomy domain as well as several other data sets demonstrates the performance of the kernel and related similarity functions.