Sciweavers

4128 search results - page 241 / 826
» Learning and using relational theories
Sort
View
MFCS
2004
Springer
15 years 12 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
AIRWEB
2007
Springer
16 years 24 days ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 8 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
JAIR
2010
131views more  JAIR 2010»
15 years 5 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
SIGADA
2005
Springer
16 years 3 days ago
Experiences using SPARK in an undergraduate CS course
This paper describes experiences garnered while teaching a course on high integrity software using SPARK to a mix of junior and senior level undergraduates. The paper describes th...
Anthony S. Ruocco