Sciweavers

807 search results - page 102 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
137
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 4 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
128
Voted
NN
2006
Springer
114views Neural Networks» more  NN 2006»
15 years 3 months ago
Modular learning models in forecasting natural phenomena
Modular model is a particular type of committee machine and is comprised of a set of specialized (local) models each of which is responsible for a particular region of the input s...
Dimitri P. Solomatine, Michael Baskara L. A. Siek
162
Voted
DEBS
2008
ACM
15 years 5 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
IPPS
2002
IEEE
15 years 8 months ago
Parallel Out-of-Core Algorithm for Genome-Scale Enumeration of Metabolic Systemic Pathways
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
Nagiza F. Samatova, Al Geist, George Ostrouchov, A...
134
Voted
ICMLA
2007
15 years 5 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira