Sciweavers

2111 search results - page 42 / 423
» Understanding the Yarowsky Algorithm
Sort
View
ICARIS
2005
Springer
14 years 4 months ago
A Markov Chain Model of the B-Cell Algorithm
An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent abso...
Edward Clark, Andrew Hone, Jon Timmis
BMCBI
2008
131views more  BMCBI 2008»
13 years 11 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
ECML
2004
Springer
14 years 4 months ago
An Analysis of Stopping and Filtering Criteria for Rule Learning
Abstract. In this paper, we investigate the properties of commonly used prepruning heuristics for rule learning by visualizing them in PN-space. PN-space is a variant of ROC-space,...
Johannes Fürnkranz, Peter A. Flach
JAR
2002
83views more  JAR 2002»
13 years 10 months ago
Mathematical Programming Embeddings of Logic
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter
TCAD
2002
145views more  TCAD 2002»
13 years 10 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil