Sciweavers

3245 search results - page 276 / 649
» Mining Transformed Data Sets
Sort
View
BMCBI
2008
139views more  BMCBI 2008»
15 years 6 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
IADIS
2008
15 years 8 months ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 7 months ago
Semi-supervised time series classification
The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data...
Li Wei, Eamonn J. Keogh
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
AUSDM
2007
Springer
102views Data Mining» more  AUSDM 2007»
15 years 10 months ago
A Two-Step Classification Approach to Unsupervised Record Linkage
Linking or matching databases is becoming increasingly important in many data mining projects, as linked data can contain information that is not available otherwise, or that woul...
Peter Christen