Sciweavers

2878 search results - page 439 / 576
» Learning the Common Structure of Data
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 12 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
MSR
2006
ACM
16 years 9 days ago
Predicting defect densities in source code files with decision tree learners
With the advent of open source software repositories the data available for defect prediction in source files increased tremendously. Although traditional statistics turned out t...
Patrick Knab, Martin Pinzger, Abraham Bernstein
BMCBI
2006
124views more  BMCBI 2006»
15 years 6 months ago
Detection of divergent genes in microbial aCGH experiments
Background: Array-based comparative genome hybridization (aCGH) is a tool for rapid comparison of genomes from different bacterial strains. The purpose of such analysis is to dete...
Lars Snipen, Dirk Repsilber, Ludvig Nyquist, &Arin...
SAC
2009
ACM
16 years 1 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad