Sciweavers

1060 search results - page 45 / 212
» On the Discovery of Random Trees
Sort
View
JBI
2006
14 years 10 months ago
Support versus corroboration
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
Mary G. Egan
ICMLA
2008
14 years 11 months ago
Calibrating Random Forests
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...
Henrik Boström
ICPR
2010
IEEE
15 years 3 months ago
Motif Discovery and Feature Selection for CRF-Based Activity Recognition
Abstract—Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular ...
Liyue Zhao, Xi Wang, Gita Sukthankar
PVLDB
2010
107views more  PVLDB 2010»
14 years 8 months ago
On Multi-Column Foreign Key Discovery
A foreign/primary key relationship between relational tables is one of the most important constraints in a database. From a data analysis perspective, discovering foreign keys is ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 1 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...