Soft Computing

, Volume 8, Issue 2, pp 109–117

Learning temporal concepts from heterogeneous data sequences

Authors

    • Faculty of InformaticsUniversity of Ulster
  • B. W. Scotney
    • Faculty of InformaticsUniversity of Ulster
  • F. L. Palmer
    • Faculty of InformaticsUniversity of Ulster
Article

DOI: 10.1007/s00500-002-0251-1

Cite this article as:
McClean, S., Scotney, B. & Palmer, F. Soft Computing (2003) 8: 109. doi:10.1007/s00500-002-0251-1

Abstract

We are concerned with sequences that comprise heterogeneous symbolic data that have an underlying similar temporal pattern. The data are heterogeneous with respect to classification schemes where the class values differ between sequences. However, because the sequences relate to the same underlying concept, the mappings between values, which are not known ab initio, may be learned. Such mappings relate local ontologies, in the form of classification schemes, to a global ontology (the underlying pattern). On the basis of these mappings we use maximum likelihood techniques to learn the probabilistic description of local probabilistic concepts represented by individual temporal instances of the expression sequences. This stage is followed by one in which we learn the temporal probabilistic concept that describes the underlying pattern. Such an approach has a number of advantages: (1) it provides an intuitive way of describing the underlying temporal pattern; (2) it provides a way of mapping heterogeneous sequences; (3) it allows us to take account of natural variability in the process, via probabilistic semantics; (4) it allows us to characterise the sequences in terms of a temporal probabilistic concept model. This concept may then be matched with known genetic processes and pathways.

Keywords

ClusteringSequence processingSchema mapping

Copyright information

© Springer-Verlag Berlin Heidelberg 2003