Sciweavers

312 search results - page 22 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
IJBRA
2007
57views more  IJBRA 2007»
13 years 7 months ago
Decoding algorithms in pooling designs with inhibitors and error-tolerance
: Pooling designs are used in DNA library screening to efficiently distinguish positive from negative clones, which is fundamental for studying gene functions and many other biolog...
My T. Thai, David MacCallum, Ping Deng, Weili Wu
SIGIR
2003
ACM
14 years 22 days ago
A maximal figure-of-merit learning approach to text categorization
A novel maximal figure-of-merit (MFoM) learning approach to text categorization is proposed. Different from the conventional techniques, the proposed MFoM method attempts to integ...
Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
CEC
2008
IEEE
14 years 2 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
IPPS
2003
IEEE
14 years 23 days ago
Design and Evaluation of a Parallel HOP Clustering Algorithm for Cosmological Simulation
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
Ying Liu, Wei-keng Liao, Alok N. Choudhary