Sciweavers

361 search results - page 38 / 73
» Distributed multi-relational data mining based on genetic al...
Sort
View
BMCBI
2011
12 years 11 months ago
Genotype calling in tetraploid species from bi-allelic marker data using mixture models
Background: Automated genotype calling in tetraploid species was until recently not possible, which hampered genetic analysis. Modern genotyping assays often produce two signals, ...
Roeland E. Voorrips, Gerrit Gort, Ben Vosman
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 8 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
KDD
2010
ACM
253views Data Mining» more  KDD 2010»
13 years 11 months ago
Mining periodic behaviors for moving objects
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could b...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, P...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli