Sciweavers

1060 search results - page 49 / 212
» On the Discovery of Random Trees
Sort
View
KDD
1995
ACM
104views Data Mining» more  KDD 1995»
15 years 1 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...
COLING
2010
14 years 5 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 13 hour ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
SPIN
2007
Springer
15 years 4 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
CEC
2007
IEEE
14 years 11 months ago
Random search can outperform mutation
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
Cameron Skinner, Patricia J. Riddle