Sciweavers

236 search results - page 21 / 48
» Learning Teleoreactive Logic Programs from Problem Solving
Sort
View
FSKD
2006
Springer
147views Fuzzy Logic» more  FSKD 2006»
13 years 11 months ago
Adaptive Nearest Neighbor Classifier Based on Supervised Ellipsoid Clustering
Nearest neighbor classifier is a widely-used effective method for multi-class problems. However, it suffers from the problem of the curse of dimensionality in high dimensional spac...
Guo-Jun Zhang, Ji-Xiang Du, De-Shuang Huang, Tat-M...
IUI
2009
ACM
14 years 4 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock
ILP
2004
Springer
14 years 22 days ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
WWW
2009
ACM
14 years 8 months ago
Discovering the staring people from social networks
In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable i...
Dewei Chen, Jie Tang, Juanzi Li, Lizhu Zhou
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 1 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean