Sciweavers

4911 search results - page 538 / 983
» Tree dependence analysis
Sort
View
KDD
1995
ACM
104views Data Mining» more  KDD 1995»
15 years 8 months ago
Using Rough Sets as Tools for Knowledge Discovery
An attribute-oriented rough set method for knowledgediscovery in databases is described. Themethodis based on information generalization, whichexaminesthe data at various levels o...
Ning Shan, Wojciech Ziarko, Howard J. Hamilton, Ni...
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 8 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
ACIIDS
2010
IEEE
171views Database» more  ACIIDS 2010»
15 years 7 months ago
Evolving Concurrent Petri Net Models of Epistasis
Abstract. A genetic algorithm is used to learn a non-deterministic Petri netbased model of non-linear gene interactions, or statistical epistasis. Petri nets are computational mode...
Michael Mayo, Lorenzo Beretta
GLVLSI
2010
IEEE
154views VLSI» more  GLVLSI 2010»
15 years 7 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
Jin-Tai Yan, Zhi-Wei Chen
COLT
2008
Springer
15 years 6 months ago
The True Sample Complexity of Active Learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...