Sciweavers

748 search results - page 78 / 150
» Structural Discovery of E-lessons
Sort
View
CIKM
1998
Springer
15 years 2 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
NIPS
2000
14 years 11 months ago
Temporally Dependent Plasticity: An Information Theoretic Account
The paradigm of Hebbian learning has recently received a novel interpretation with the discovery of synaptic plasticity that depends on the relative timing of pre and post synapti...
Gal Chechik, Naftali Tishby
AEI
2007
119views more  AEI 2007»
14 years 10 months ago
Exploring the CSCW spectrum using process mining
Process mining techniques allow for extracting information from event logs. For example, the audit trails of a workflow management system or the transaction logs of an enterprise ...
Wil M. P. van der Aalst
SYNTHESE
2008
112views more  SYNTHESE 2008»
14 years 9 months ago
A sufficient condition for pooling data
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
Frederick Eberhardt
TSE
2002
71views more  TSE 2002»
14 years 9 months ago
Visualizing Software Changes
A key problem in software engineering is changing the code. We present a sequence of visualizations and visual metaphors designed to help engineers understand and manage the softw...
Stephen G. Eick, Todd L. Graves, Alan F. Karr, Aud...