Sciweavers

357 search results - page 59 / 72
» New Insights into Learning Algorithms and Datasets
Sort
View
JMLR
2002
102views more  JMLR 2002»
14 years 9 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
WWW
2011
ACM
14 years 4 months ago
From actors, politicians, to CEOs: domain adaptation of relational extractors using a latent relational mapping
We propose a method to adapt an existing relation extraction system to extract new relation types with minimum supervision. Our proposed method comprises two stages: learning a lo...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
JCIT
2010
148views more  JCIT 2010»
14 years 4 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 1 months ago
Controlling overfitting with multi-objective support vector machines
Recently, evolutionary computation has been successfully integrated into statistical learning methods. A Support Vector Machine (SVM) using evolution strategies for its optimizati...
Ingo Mierswa
BMCBI
2006
153views more  BMCBI 2006»
14 years 9 months ago
Intensity-based hierarchical Bayes method improves testing for differentially expressed genes in microarray experiments
Background: The small sample sizes often used for microarray experiments result in poor estimates of variance if each gene is considered independently. Yet accurately estimating v...
Maureen A. Sartor, Craig R. Tomlinson, Scott C. We...