Sciweavers

19 search results - page 1 / 4
» Discovering knowledge from noisy databases using genetic pro...
Sort
View
JASIS
2000
143views more  JASIS 2000»
13 years 4 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
BMCBI
2008
90views more  BMCBI 2008»
13 years 5 months ago
Function2Gene: A gene selection tool to increase the power of genetic association studies by utilizing public databases and expe
Background: Many common disorders have multiple genetic components which convey increased susceptibility. SNPs have been used to identify genetic components which are associated w...
Don L. Armstrong, Chaim O. Jacob, Raphael Zidovetz...
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
13 years 10 months ago
A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programming
This paper describes a novel data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches ...
Man Leung Wong, Shing Yan Lee, Kwong-Sak Leung
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
13 years 10 months ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 5 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng