KMi Publications

Tech Reports

Tech Report kmi-00-05 Abstract


Sequence Learning via Bayesian Clustering by Dynamics
Techreport ID: kmi-00-05
Date: 2000
Author(s): Paola Sebastiani, Marco Ramoni and Paul Cohen
Download PDF

This chapter introduces a Bayesian method for clustering dynamic processes. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to discover the most probable set of clusters capturing different dynamics. To increase efficiency, the algorithm uses an entropy-based heuristic search strategy. When applied to clustering sensor data from mobile robots, the algorithm produces clusters that are meaningful in the domains of application. 1. Department of Mathematics, Imperial College of Science, Technology and Medicine 2. Knowledge Media Institute, The Open University 3. Department of Computer Science, University of Massachusetts at Amherst

Publication(s):

Also in Sequence Learning: Paradigms, Algorithms, and Applications, L. Giles and R. Sun, editors, Springer, New York, NY, 2000.
 
KMi Publications Event | SSSW 2013, The 10th Summer School on Ontology Engineering and the Semantic Web Journal | 25 years of knowledge acquisition
 

Narrative Hypermedia is...


Narrative Hypermedia
Narrative is concerned fundamentally with coherence, for instance, whether that be a fiction, an historical account or an argument, none of which 'make sense' unless they are put together in a coherent manner.

Hypermedia is the combination of hypertext for linking and structuring multimedia information.

Narrative Hypermedia is therefore concerned with how all of the above narrative forms, plus the many other diverse forms of discourse possible on the Web, can be effectively designed to communicate coherent conceptual structures, drawing inspiration from theories in narratology, semiotics, psycholinguistics and film.