Sciweavers

2878 search results - page 311 / 576
» Learning the Common Structure of Data
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
16 years 18 days ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 6 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
IS
2008
15 years 6 months ago
DFL: A dataflow language based on Petri nets and nested relational calculus
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Je...
SEMWEB
2009
Springer
16 years 1 months ago
Using Hybrid Search and Query for E-discovery Identification
: © Using hybrid search and query for e-discovery identification Dave Grosvenor, Andy Seaborne HP Laboratories HPL-2009-155 SPARQL, e-discovery, identification, hybrid search and ...
Dave Grosvenor, Andy Seaborne
ICDM
2005
IEEE
137views Data Mining» more  ICDM 2005»
16 years 5 days ago
Leveraging Relational Autocorrelation with Latent Group Models
The presence of autocorrelation provides a strong motivation for using relational learning and inference techniques. Autocorrelation is a statistical dependence between the values...
Jennifer Neville, David Jensen